Learning noisy functions via interval models

被引:4
作者
Calafiore, Giuseppe Carlo [1 ]
机构
[1] Politecn Torino, Dipartimento Automat & Informat, I-10129 Turin, Italy
关键词
Set-valued models; Interval approximation; Convex optimization; Identification; Statistical learning; RANDOMIZED SOLUTIONS; IDENTIFICATION;
D O I
10.1016/j.sysconle.2010.05.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the problem of identification of an interval model for an unknown static function using a finite batch of stochastic input-output data {u((i)), y((i))}, i = 1,..., N. The criterion used for identification is that the width of the interval output of the model should be minimized, while containing a given fraction of the observed outputs y((i)). We show that, for suitable finite N. the resulting model will be reliable, that is it will explain any other unseen output, up to a given and arbitrary high probability. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:404 / 413
页数:10
相关论文
共 26 条
  • [1] [Anonymous], 2001, APPL INTERVAL ANAL
  • [2] [Anonymous], 1999, SYSTEM IDENTIFICATIO
  • [3] Aubin J.P., 1990, SET VALUED ANAL, DOI 10.1007/978-0-8176-4848-0
  • [4] Aubin J.P., 1984, DIFFERENTIAL INCLUSI
  • [5] Impulse differential inclusions: A viability approach to hybrid systems
    Aubin, JP
    Lygeros, J
    Quincampoix, M
    Sastry, S
    Seube, N
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (01) : 2 - 20
  • [6] Uncertain convex programs: randomized solutions and confidence levels
    Calafiore, G
    Campi, MC
    [J]. MATHEMATICAL PROGRAMMING, 2005, 102 (01) : 25 - 46
  • [7] Calafiore G., 2010, IEEE MULT SYST CONTR
  • [8] CALAFIORE G, 2002, 15 IFAC WORLD C BARC
  • [9] The scenario approach to robust control design
    Calafiore, Giuseppe C.
    Campi, Marco C.
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (05) : 742 - 753
  • [10] THE EXACT FEASIBILITY OF RANDOMIZED SOLUTIONS OF UNCERTAIN CONVEX PROGRAMS
    Campi, M. C.
    Garatti, S.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (03) : 1211 - 1230