2003, 2003(Special): 156-166. doi: 10.3934/proc.2003.2003.156

A learning theory approach to the construction of predictor models

1. 

Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24-10129, Italy

2. 

Dipartimento di Elettronica per l'Automazione, Università di Brescia, Via Branze 38-25123 Brescia, Italy

Received  September 2002 Revised  March 2003 Published  April 2003

This paper presents new results for the identification of predictive models for unknown dynamical systems. The three key elements of the proposed approach are: i) an unknown mechanism that generates the observed data; ii) a family of models, among which we select our predictor, on the basis of past observations; iii) an optimality criterion that we want to minimize. A major departure from standard identification theory is taken in that we consider interval models for prediction, that is models that return output intervals, as opposed to output values. Moreover, we introduce a consistency criterion (the model is required to be consistent with observations) which act as a constraint in the optimization procedure. In this framework, the model has not to be interpreted as a faithful description of reality, but rather as an instrument to perform prediction. To the optimal model, we attach a certificate of reliability, that is a statement of the probability that the computed model will actually be consistent with future unknown data.
Citation: G. Calafiore, M.C. Campi. A learning theory approach to the construction of predictor models. Conference Publications, 2003, 2003 (Special) : 156-166. doi: 10.3934/proc.2003.2003.156
[1]

Murat Adivar, Shu-Cherng Fang. Convex optimization on mixed domains. Journal of Industrial & Management Optimization, 2012, 8 (1) : 189-227. doi: 10.3934/jimo.2012.8.189

[2]

Roberto C. Alamino, Nestor Caticha. Bayesian online algorithms for learning in discrete hidden Markov models. Discrete & Continuous Dynamical Systems - B, 2008, 9 (1) : 1-10. doi: 10.3934/dcdsb.2008.9.1

[3]

Adil Bagirov, Sona Taheri, Soodabeh Asadi. A difference of convex optimization algorithm for piecewise linear regression. Journal of Industrial & Management Optimization, 2018, 13 (5) : 1-24. doi: 10.3934/jimo.2018077

[4]

Anulekha Dhara, Aparna Mehra. Conjugate duality for generalized convex optimization problems. Journal of Industrial & Management Optimization, 2007, 3 (3) : 415-427. doi: 10.3934/jimo.2007.3.415

[5]

Igor Griva, Roman A. Polyak. Proximal point nonlinear rescaling method for convex optimization. Numerical Algebra, Control & Optimization, 2011, 1 (2) : 283-299. doi: 10.3934/naco.2011.1.283

[6]

Nobuko Sagara, Masao Fukushima. trust region method for nonsmooth convex optimization. Journal of Industrial & Management Optimization, 2005, 1 (2) : 171-180. doi: 10.3934/jimo.2005.1.171

[7]

Yong Wang, Wanquan Liu, Guanglu Zhou. An efficient algorithm for non-convex sparse optimization. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-13. doi: 10.3934/jimo.2018134

[8]

Chen Li, Fajie Wei, Shenghan Zhou. Prediction method based on optimization theory and its application. Discrete & Continuous Dynamical Systems - S, 2015, 8 (6) : 1213-1221. doi: 10.3934/dcdss.2015.8.1213

[9]

David Yang Gao, Changzhi Wu. On the triality theory for a quartic polynomial optimization problem. Journal of Industrial & Management Optimization, 2012, 8 (1) : 229-242. doi: 10.3934/jimo.2012.8.229

[10]

D. Warren, K Najarian. Learning theory applied to Sigmoid network classification of protein biological function using primary protein structure. Conference Publications, 2003, 2003 (Special) : 898-904. doi: 10.3934/proc.2003.2003.898

[11]

Juan Carlos De los Reyes, Carola-Bibiane Schönlieb. Image denoising: Learning the noise model via nonsmooth PDE-constrained optimization. Inverse Problems & Imaging, 2013, 7 (4) : 1183-1214. doi: 10.3934/ipi.2013.7.1183

[12]

Salvatore A. Marano, Sunra Mosconi. Non-smooth critical point theory on closed convex sets. Communications on Pure & Applied Analysis, 2014, 13 (3) : 1187-1202. doi: 10.3934/cpaa.2014.13.1187

[13]

Lipu Zhang, Yinghong Xu, Zhengjing Jin. An efficient algorithm for convex quadratic semi-definite optimization. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 129-144. doi: 10.3934/naco.2012.2.129

[14]

Dan Li, Li-Ping Pang, Fang-Fang Guo, Zun-Quan Xia. An alternating linearization method with inexact data for bilevel nonsmooth convex optimization. Journal of Industrial & Management Optimization, 2014, 10 (3) : 859-869. doi: 10.3934/jimo.2014.10.859

[15]

Radu Ioan Boţ, Anca Grad, Gert Wanka. Sequential characterization of solutions in convex composite programming and applications to vector optimization. Journal of Industrial & Management Optimization, 2008, 4 (4) : 767-782. doi: 10.3934/jimo.2008.4.767

[16]

Foxiang Liu, Lingling Xu, Yuehong Sun, Deren Han. A proximal alternating direction method for multi-block coupled convex optimization. Journal of Industrial & Management Optimization, 2018, 13 (5) : 1-15. doi: 10.3934/jimo.2018067

[17]

Carlos M. Hernández-Suárez, Carlos Castillo-Chavez, Osval Montesinos López, Karla Hernández-Cuevas. An application of queuing theory to SIS and SEIS epidemic models. Mathematical Biosciences & Engineering, 2010, 7 (4) : 809-823. doi: 10.3934/mbe.2010.7.809

[18]

Yuri Yatsenko, Natali Hritonenko. Optimization of the lifetime of capital equipment using integral models. Journal of Industrial & Management Optimization, 2005, 1 (4) : 415-432. doi: 10.3934/jimo.2005.1.415

[19]

Rinaldo M. Colombo, Mauro Garavello. Stability and optimization in structured population models on graphs. Mathematical Biosciences & Engineering, 2015, 12 (2) : 311-335. doi: 10.3934/mbe.2015.12.311

[20]

Xueting Cui, Xiaoling Sun, Dan Sha. An empirical study on discrete optimization models for portfolio selection. Journal of Industrial & Management Optimization, 2009, 5 (1) : 33-46. doi: 10.3934/jimo.2009.5.33

 Impact Factor: 

Metrics

  • PDF downloads (5)
  • HTML views (0)
  • Cited by (0)

Other articles
by authors

[Back to Top]