Efficient kernel models for learning and approximate minimization problems

Neurocomputing

Volumn 97, Issue , 2012, Pages 74-85

  Cervellera, C ^a   Gaggero, M ^a   Maccio D ^a  

^a INSTITUTE OF INTELLIGENT SYSTEMS FOR AUTOMATION   (Italy)

Author keywords

Approximate minimization; Fast model evaluation; Kernel structures; Local learning

Indexed keywords

COMPUTATIONAL BURDEN; COMPUTATIONAL EFFORT; COST FUNCTIONALS; FAST MODEL; FUNCTION APPROXIMATION; KERNEL FUNCTION; KERNEL MODELS; KERNEL STRUCTURE; LOCAL LEARNING; MINIMIZATION PROBLEMS; MULTI-STAGE OPTIMIZATION; OPTIMAL CHOICE; TRAINING PROCEDURES;

COMPUTER APPLICATIONS; NEURAL NETWORKS;

FUNCTION EVALUATION;

ACCURACY; ALGORITHM; ARTICLE; FEASIBILITY STUDY; K NEAREST NEIGHBOR; KERNEL METHOD; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROCESS OPTIMIZATION; SIMULATION;

EID: 84865325212     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2012.04.023     Document Type: Article

References (19)

1. Hastie T., Tibshirani R., Friedman J. The Elements of Statistical Learning 2001, Springer-Verlag.
2. Terrel G.R., Scott D.W. Variable kernel density estimation. Ann. Stat. 1992, 20(3):1236-1265.
3. Devroye L., Györfi L., Lugosi G. A Probabilistic Theory of Pattern Recognition 1997, Springer-Verlag, New York.
4. Atkeson C., Moore A., Schaal S. Locally weighted learning. Artif. Intell. Rev. 1997, 11(1):11-73.
5. Cervellera C., Macciò D. A comparison of global and semi-local approximation in T-stage stochastic optimization. Eur. J. Oper. Res. 2011, 208(2):109-118.
6. Cervellera C., Macciò D., Muselli M. Functional optimization through semi-local approximate minimization. Oper. Res. 2010, 58(5):1491-1504.
7. Cervellera C., Macciò D., Muselli M. Efficient global maximum likelihood estimation through kernel methods. Neural Networks 2010, 23(7):917-925.
8. Bertsekas D., Tsitsiklis J. Neuro-Dynamic Programming 1996, Athena Scientific, Belmont.
9. Duda R.O., Hart P.E., Stork D.G. Pattern Classification 2001, John Wiley & Sons, New York. second ed.
10. Zoppoli R., Sanguineti M., Parisini T. Approximating networks and extended Ritz method for the solution of functional optimization problems. J. Optim. Theory Appl. 2002, 112:403-439.
11. Kurková V., Sanguineti M. Error estimates for approximate optimization by the extended Ritz method. SIAM J. Optim. 2005, 18:461-487.
12. Cover T., Hart P. Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 1967, 13(1):21-27.
13. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods 1992, SIAM, Philadelphia.
14. Fang K.T., Wang Y. Number-Theoretic Methods in Statistics 1994, Chapman & Hall.
15. Sobol' I.M. The distribution of points in a cube and the approximate evaluation of integrals. Zh. Vychisl. Mat. Mat. Fiz. 1967, 7:784-802.
16. Yakowitz S. Dynamic programming applications in water resources. Water Resour. Res. 1982, 18:673-696.
17. Baglietto M., Cervellera C., Sanguineti M., Zoppoli R. Management of water resources systems in the presence of uncertainties by nonlinear approximators and deterministic sampling techniques. Comput. Optim. Appl. 2010, 47(2):349-376.
18. D. Bertsekas, Dynamic Programming and Optimal Control, second ed., vol. I, Athena Scientific, Belmont, 2000.
19. Cervellera C., Wen A., Chen V. Neural network and regression spline value function approximations for stochastic dynamic programming. Comput. Oper. Res. 2007, 34(1):70-90.