A memory-based RASH optimizer

AAAI Workshop - Technical Report

Volumn WS-06-08, Issue , 2006, Pages 45-51

  Brunato, Mauro ^a   Battiti, Roberte ^a   Pasupuleti, Srinivas ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; OPTIMIZATION; REGRESSION ANALYSIS; SEARCH ENGINES;

COMPUTATIONAL COSTS; CONTINUOUS VARIABLES; MULTIVARIATE FUNCTIONS; REACTIVE AFFINE SHAKER HEURISTIC (RASH);

HEURISTIC METHODS;

EID: 33846000326     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Atkeson, C. G.; Schaal, S. A.; and Moore, A. 1997. Locally weighted learning. AI Review 11:11-73.
2. Atkeson, C. G. 1990. Using local models to control movement. In Advances in neural information processing systems 2, 316-323. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
3. Battiti, R., and Brunato, M. 2006. Reactive search: Machine learning for memory-based heuristics. Teofilo F. Gonzalez. (Ed.), Approximation Algorithms and Metaheuristics, Taylor & Francis Books (CRC Press), to appear.
4. Battiti, R., and Protasi, M. 1997. Reactive search, a history-sensitive heuristic for max-sat. ACM Journal of Experimental Algorithmics 2:2. http://doi.acm.org/10.1145/264216.264220.
5. Battiti, R. 2002. Partially persistent dynamic sets for history-sensitive heuristics. In Johnson, D. S.; Goldwasser, M. H.; and McGeoch, C., eds., Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Challenges, volume 59 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society. 1-21.
6. Boyan, J., and Moore, A. W. 2001. Learning evaluation functions to improve optimization by local search. Journal of Machine Learning Research 1:77-112.
7. Brunato, M., and Battiti, R. 2006. The reactive affine shaker: a building block for minimizing functions of continuous variables. Technical Report DIT-06-012, Università di Trento.
8. Buche, D.; Koumoutsakos, P.; and Schraudolph, N. 2005. Accelerating evolutionary algorithms with Gaussian process fitness function models. IEEE Transactions on Systems, Man and Cybernetics 35:183-194.
9. Cleveland, W. S., and Devlin, S. J. 1988. Locally-weighted regression: An approach to regression analysis by local fitting. Journal of the American Statistical Association 83:596-610.
10. Cohn, D. A.; Ghahramani, Z.; and Jordan, M. I. 1996. Active learning with statistical models. Journal of Artificial Intelligence Research 4:129-145.
11. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
12. Donald R. Jones, M. S., and Welch, W. J. 1998. Efficient global optimization of expensive black-box functions. Journal of Global Optimization 13:455-492.
13. Dubrawski, A., and Schneider, J. 1997. Memory based stochastic optimization for validation and tuning of function approximators. Conference on AI and Statistics. http://citeseer.ist.psu.edu/30334.html.
14. Hoos, H. H., and Stuetzle, T. 2005. Stochastic local search: Foundations and applications. Morgan Kaufmann. Jacquet, W.; Truyen, B.; de Groen, P.; Lemahieu, L.; and Cornelis, J. 2005. Global optimization in inverse problems: A comparison of Kriging and radial basis functions. http://arxiv.org/abs/math/0506440.
15. Korf, R. E., and Feiner, A. 2002. Disjoint pattern database heuristics. Artif. Intell. 134(1-2):9-22.
16. Liang, K.-H.; Yao, X.; and Newton, C. 2000. Evolutionary search of approximated n-dimensional landscapes. International Journal of Knowledge-Based Intelligent Engineering Systems 4(3): 172-183.
17. Moore, A., and Schneider, J. 1996. Memory-based stochastic optimization. In Touretzky, D.; Mozer, M.; and Hasselm, M., eds., Neural Information Processing Systems 8, volume 8, 1066-1072. MIT Press.
18. Moore, A.; Schneider, J.; and Deng, K. 1997. Efficient locally weighted polynomial regression predictions. In Fisher, D., ed., Proceedings of the Fourteenth International Conference on Machine Learning, 236-244. 340 Pine Street, 6th Fl., San Francisco, CA 94104: Morgan Kaufmann.
19. Moore, A. 1992. Fast, robust adaptive control by learning only forward models. In Moody, J. E.; Hanson, S. J.; and L, R. P., eds., Advances in Neural Information Processing Systems. Morgan Kaufmann.
20. Solls, F. J., and Wets, R. J.-B. 1981. Minimization by random search techniques. Mathematics of Operations Research 6(1): 19-30.
21. Wolpert, D. H., and Macready, W. G. 1997. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation l(l):67-82.