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]

Torsten Trimborn, Lorenzo Pareschi, Martin Frank. Portfolio optimization and model predictive control: A kinetic approach. Discrete & Continuous Dynamical Systems - B, 2019, 24 (11) : 6209-6238. doi: 10.3934/dcdsb.2019136

[2]

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

[3]

Dmitry Pozharskiy, Noah J. Wichrowski, Andrew B. Duncan, Grigorios A. Pavliotis, Ioannis G. Kevrekidis. Manifold learning for accelerating coarse-grained optimization. Journal of Computational Dynamics, 2020, 7 (2) : 511-536. doi: 10.3934/jcd.2020021

[4]

Wawan Hafid Syaifudin, Endah R. M. Putri. The application of model predictive control on stock portfolio optimization with prediction based on Geometric Brownian Motion-Kalman Filter. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021119

[5]

Baohuai Sheng, Huanxiang Liu, Huimin Wang. Learning rates for the kernel regularized regression with a differentiable strongly convex loss. Communications on Pure & Applied Analysis, 2020, 19 (8) : 3973-4005. doi: 10.3934/cpaa.2020176

[6]

Janosch Rieger. A learning-enhanced projection method for solving convex feasibility problems. Discrete & Continuous Dynamical Systems - B, 2021  doi: 10.3934/dcdsb.2021054

[7]

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

[8]

Adil Bagirov, Sona Taheri, Soodabeh Asadi. A difference of convex optimization algorithm for piecewise linear regression. Journal of Industrial & Management Optimization, 2019, 15 (2) : 909-932. doi: 10.3934/jimo.2018077

[9]

Zhongliang Deng, Enwen Hu. Error minimization with global optimization for difference of convex functions. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1027-1033. doi: 10.3934/dcdss.2019070

[10]

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

[11]

Yong Wang, Wanquan Liu, Guanglu Zhou. An efficient algorithm for non-convex sparse optimization. Journal of Industrial & Management Optimization, 2019, 15 (4) : 2009-2021. doi: 10.3934/jimo.2018134

[12]

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

[13]

Yan Gu, Nobuo Yamashita. A proximal ADMM with the Broyden family for convex optimization problems. Journal of Industrial & Management Optimization, 2021, 17 (5) : 2715-2732. doi: 10.3934/jimo.2020091

[14]

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

[15]

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

[16]

Martin Benning, Elena Celledoni, Matthias J. Ehrhardt, Brynjulf Owren, Carola-Bibiane Schönlieb. Deep learning as optimal control problems: Models and numerical methods. Journal of Computational Dynamics, 2019, 6 (2) : 171-198. doi: 10.3934/jcd.2019009

[17]

Yifan Xia, Yongchao Hou, Xin He, Shaogao Lv. Learning rates for partially linear functional models with high dimensional scalar covariates. Communications on Pure & Applied Analysis, 2020, 19 (8) : 3917-3932. doi: 10.3934/cpaa.2020172

[18]

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

[19]

Miria Feng, Wenying Feng. Evaluation of parallel and sequential deep learning models for music subgenre classification. Mathematical Foundations of Computing, 2021, 4 (2) : 131-143. doi: 10.3934/mfc.2021008

[20]

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

 Impact Factor: 

Metrics

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

Other articles
by authors

[Back to Top]