An extension of hill-climbing with learning applied to a symbolic regression of boolean functions.
Vladimir KvasnickaLadislav ClementisJiri PospichalPublished in: GECCO (Companion) (2013)
Keyphrases
- boolean functions
- hill climbing
- read once formulas
- learning algorithm
- reinforcement learning
- active learning
- learning problems
- search space
- computational complexity
- linear threshold
- supervised learning
- computational intelligence
- simulated annealing
- genetic programming
- cross validation
- evolutionary computation
- learning tasks
- uniform distribution
- search algorithm