@ARTICLE{kuusela_ocone_sontag04,
   AUTHOR       = {P. Kuusela and D. Ocone and E.D. Sontag},
   JOURNAL      = {SIAM J. Control Optim.},
   TITLE        = {Learning Complexity Dimensions for a Continuous-Time 
      Control System},
   YEAR         = {2004},
   OPTMONTH     = {},
   OPTNOTE      = {},
   NUMBER       = {3},
   PAGES        = {872--898},
   VOLUME       = {43},
   ADDRESS      = {Philadelphia, PA, USA},
   KEYWORDS     = {theory of computing and complexity, VC dimension},
   PUBLISHER    = {Society for Industrial and Applied Mathematics},
   PDF          = {../../FTPDIR/kuusela-ocone-sontag-as-published-SIAM04.pdf},
   ABSTRACT     = { This paper takes a computational learning theory 
      approach to a problem of linear systems identification. It is assumed 
      that input signals have only a finite number k of frequency 
      components, and systems to be identified have dimension no greater 
      than n. The main result establishes that the sample complexity needed 
      for identification scales polynomially with n and logarithmically 
      with k. },
   DOI          = {http://dx.doi.org/10.1137/S0363012901384302}
}

{"_id":"596Ge3XYNDgM2MEfG","bibbaseid":"kuusela-ocone-sontag-learningcomplexitydimensionsforacontinuoustimecontrolsystem-2004","downloads":0,"creationDate":"2018-10-18T05:07:06.227Z","title":"Learning Complexity Dimensions for a Continuous-Time Control System","author_short":["Kuusela, P.","Ocone, D.","Sontag, E."],"year":2004,"bibtype":"article","biburl":"http://www.sontaglab.org/PUBDIR/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["P."],"propositions":[],"lastnames":["Kuusela"],"suffixes":[]},{"firstnames":["D."],"propositions":[],"lastnames":["Ocone"],"suffixes":[]},{"firstnames":["E.D."],"propositions":[],"lastnames":["Sontag"],"suffixes":[]}],"journal":"SIAM J. Control Optim.","title":"Learning Complexity Dimensions for a Continuous-Time Control System","year":"2004","optmonth":"","optnote":"","number":"3","pages":"872–898","volume":"43","address":"Philadelphia, PA, USA","keywords":"theory of computing and complexity, VC dimension","publisher":"Society for Industrial and Applied Mathematics","pdf":"../../FTPDIR/kuusela-ocone-sontag-as-published-SIAM04.pdf","abstract":"This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that input signals have only a finite number k of frequency components, and systems to be identified have dimension no greater than n. The main result establishes that the sample complexity needed for identification scales polynomially with n and logarithmically with k. ","doi":"http://dx.doi.org/10.1137/S0363012901384302","bibtex":"@ARTICLE{kuusela_ocone_sontag04,\n AUTHOR = {P. Kuusela and D. Ocone and E.D. Sontag},\n JOURNAL = {SIAM J. Control Optim.},\n TITLE = {Learning Complexity Dimensions for a Continuous-Time \n Control System},\n YEAR = {2004},\n OPTMONTH = {},\n OPTNOTE = {},\n NUMBER = {3},\n PAGES = {872--898},\n VOLUME = {43},\n ADDRESS = {Philadelphia, PA, USA},\n KEYWORDS = {theory of computing and complexity, VC dimension},\n PUBLISHER = {Society for Industrial and Applied Mathematics},\n PDF = {../../FTPDIR/kuusela-ocone-sontag-as-published-SIAM04.pdf},\n ABSTRACT = { This paper takes a computational learning theory \n approach to a problem of linear systems identification. It is assumed \n that input signals have only a finite number k of frequency \n components, and systems to be identified have dimension no greater \n than n. The main result establishes that the sample complexity needed \n for identification scales polynomially with n and logarithmically \n with k. },\n DOI = {http://dx.doi.org/10.1137/S0363012901384302}\n}\n\n","author_short":["Kuusela, P.","Ocone, D.","Sontag, E."],"key":"kuusela_ocone_sontag04","id":"kuusela_ocone_sontag04","bibbaseid":"kuusela-ocone-sontag-learningcomplexitydimensionsforacontinuoustimecontrolsystem-2004","role":"author","urls":{},"keyword":["theory of computing and complexity","VC dimension"],"downloads":0,"html":""},"search_terms":["learning","complexity","dimensions","continuous","time","control","system","kuusela","ocone","sontag"],"keywords":["theory of computing and complexity","vc dimension"],"authorIDs":[],"dataSources":["DKqZbTmd7peqE4THw"]}