1 Matching Annotations
  1. Oct 2020
  2. reisub0.github.io reisub0.github.io
    Fractal Learning
    1
    1. jessems 11 Oct 2020
      Most people seem to follow one of two strategies - and these strategies come under the umbrella of tree-traversal algorithms in computer science.

      Deciding whether you want to go deep into one topic, or explore more topics, can be seen as a choice between two types of tree-traversal algorithms: depth-first and breadth-first.

      This also reminds me of the Explore-Exploit problem in machine learning, which I believe is related to the Multi-Armed Bandit Problem.

      Explore vs. Exploit Depth-first search Breadth-first search Multi-armed bandit problem Fractal Learning
    Visit annotations in context

    Tags

    Annotators

    URL

    reisub0.github.io/fractal-learning.html