AILEPHANT

Tag: heuristic

  • 15. Learning: Near Misses, Felicity Conditions

    —

    by

    Florian Bansac
    in

    One-shot learning Learning in human-like way, in one shot: learning something definite from each example. The evolving model Comparing an initial model example, a seed, with a near miss or another example, the evolving model understands an important characteristic for each new near miss or example compared. The evolving model develops a set of heuristics to…

  • 5. Search: Optimal, Branch and Bound, A*

    —

    by

    Florian Bansac
    in

    Optimal search trees Finding the best possible sequence of choices. Getting closer to the goal is generally considered good, but it may lead to dead ends or non-optimal choices. Oracle Knowing the minimum path length to the goal, the search algorithm records the length of path already extended and always extends the shortest path first until…

  • 4. Search: Depth-First, Hill Climbing, Beam

    —

    by

    Florian Bansac
    in

    Search trees Search trees represent all the possibilities to search for the quickest path without coming back to previous paths. They are particularly used for quickest paths on maps with nodes (intersections), but not exclusively. They are primarily about choices, and finding the best sequence of choices. British Museum Algorithm = complete expansion of all paths Depth…

  • 2. Reasoning: Goal Trees and Problem Solving

    —

    by

    Florian Bansac
    in

    Problem reduction Take a complicate problem and transform it into a simpler problem. Start with safe transformations, the ones you are sure will work in any case. Then apply heuristic transformations, the ones that could work. The problem simplification schema, may create “and node“, where the problem forks in several sub problems and “or node”…