Simulated annealing for VLSI design
Simulated annealing for VLSI design
Synthesis of high-performance analog cells in ASTRX/OBLX
Synthesis of high-performance analog cells in ASTRX/OBLX
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
An efficient lower bound algorithm for channel routing
Integration, the VLSI Journal
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Combining Simulated Annealing with Local Search Heuristics
Combining Simulated Annealing with Local Search Heuristics
Reinforcement learning for job shop scheduling
Reinforcement learning for job shop scheduling
Learning evaluation functions for global optimization
Learning evaluation functions for global optimization
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Learning Bayesian networks with local structure
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Sample complexity of model-based search
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Compute-intensive methods in artificial intelligence
Annals of Mathematics and Artificial Intelligence
Technical Update: Least-Squares Temporal Difference Learning
Machine Learning
Learning While Exploring: Bridging the Gaps in the Eligibility Traces
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Different Local Search Algorithms in STAGE for Solving Bin Packing Problem
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Imitation and Reinforcement Learning in Agents with Heterogeneous Actions
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Meta-Heuristics for a Class of Demand-Responsive Transit Systems
INFORMS Journal on Computing
Discrete Applied Mathematics
Learning While Optimizing an Unknown Fitness Surface
Learning and Intelligent Optimization
Tuning Local Search by Average-Reward Reinforcement Learning
Learning and Intelligent Optimization
Incomplete tree search using adaptive probing
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reinforcement learning in distributed domains: beyond team games
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Using Bayesian networks to direct stochastic search in inductive logic programming
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Practical performance models of algorithms in evolutionary program induction and other domains
Artificial Intelligence
| Hi-index | 0.00 |
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems. STAGE learns an evaluation function which predicts the outcome of a local search algorithm, such as hillclimbing or WALKSAT, as a function of state features along its search trajectories. The learned evaluation function is used to bias future search trajectories toward better optima. We present positive results on six large-scale optimization domains.