메뉴 건너뛰기




Volumn 18, Issue 3-4, 2008, Pages 421-430

A learning theory approach to system identification and stochastic adaptive control

Author keywords

Statistical learning theory; Stochastic adaptive control; System identification

Indexed keywords

COMPUTATIONAL COMPLEXITY; IDENTIFICATION (CONTROL SYSTEMS); PROBLEM SOLVING; ROBUST CONTROL; STATISTICAL METHODS;

EID: 40849089395     PISSN: 09591524     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jprocont.2007.10.009     Document Type: Article
Times cited : (36)

References (20)
  • 1
    • 40849142858 scopus 로고    scopus 로고
    • E. Weyer, R.C. Williamson, I. Mareels, Sample complexity of least squares identification of FIR models, in: Proceedings of the 13th World Congress of IFAC, San Francisco, CA, July 1996, pp. 239-244.
    • E. Weyer, R.C. Williamson, I. Mareels, Sample complexity of least squares identification of FIR models, in: Proceedings of the 13th World Congress of IFAC, San Francisco, CA, July 1996, pp. 239-244.
  • 2
    • 0032689410 scopus 로고    scopus 로고
    • Finite sample properties of linear model identification
    • Weyer E., Williamson R.C., and Mareels I. Finite sample properties of linear model identification. IEEE Trans. Automat. Contr. 44 7 (1999) 1370-1383
    • (1999) IEEE Trans. Automat. Contr. , vol.44 , Issue.7 , pp. 1370-1383
    • Weyer, E.1    Williamson, R.C.2    Mareels, I.3
  • 3
    • 0034268735 scopus 로고    scopus 로고
    • Finite sample properties of system identification of ARX models under mixing conditions
    • Weyer E. Finite sample properties of system identification of ARX models under mixing conditions. Automatica 36 9 (2000) 1291-1299
    • (2000) Automatica , vol.36 , Issue.9 , pp. 1291-1299
    • Weyer, E.1
  • 4
    • 0018021189 scopus 로고
    • Convergence analysis of parametric identification methods
    • Ljung L. Convergence analysis of parametric identification methods. IEEE Trans. Automat. Contr. AC-23 5 (1978) 770-783
    • (1978) IEEE Trans. Automat. Contr. , vol.AC-23 , Issue.5 , pp. 770-783
    • Ljung, L.1
  • 5
    • 0016990031 scopus 로고
    • Prediction error identification methods for stationary stochastic processes
    • Caines P.E. Prediction error identification methods for stationary stochastic processes. IEEE Trans. Automat. Contr. AC-21 4 (1976) 500-505
    • (1976) IEEE Trans. Automat. Contr. , vol.AC-21 , Issue.4 , pp. 500-505
    • Caines, P.E.1
  • 6
    • 0018005866 scopus 로고
    • Stationary linear and nonlinear system identification and predictor set completeness
    • Caines P.E. Stationary linear and nonlinear system identification and predictor set completeness. IEEE Trans. Automat. Contr. AC-23 4 (1978) 583-594
    • (1978) IEEE Trans. Automat. Contr. , vol.AC-23 , Issue.4 , pp. 583-594
    • Caines, P.E.1
  • 7
    • 85174220248 scopus 로고    scopus 로고
    • G. Zames, A.K. El-Sakkary, Unstable systems and feedback: The gap metric, in: Proceedings of the Allerton Conference, 1980, pp. 380-385.
    • G. Zames, A.K. El-Sakkary, Unstable systems and feedback: The gap metric, in: Proceedings of the Allerton Conference, 1980, pp. 380-385.
  • 8
  • 9
    • 0021421786 scopus 로고
    • The graph metric for unstable plants and robustness estimates for feedback stability
    • Vidyasagar M. The graph metric for unstable plants and robustness estimates for feedback stability. IEEE Trans. Automat. Contr. AC-29 5 (1984) 403-418
    • (1984) IEEE Trans. Automat. Contr. , vol.AC-29 , Issue.5 , pp. 403-418
    • Vidyasagar, M.1
  • 10
    • 0036721741 scopus 로고    scopus 로고
    • Non-asymptotic confidence ellipsoids for the least squares error estimate
    • Weyer E., and Campi M.C. Non-asymptotic confidence ellipsoids for the least squares error estimate. Automatica 38 (2002) 1529-1547
    • (2002) Automatica , vol.38 , pp. 1529-1547
    • Weyer, E.1    Campi, M.C.2
  • 11
    • 0036687173 scopus 로고    scopus 로고
    • Finite sample properties of system identification methods
    • Campi M.C., and Weyer E. Finite sample properties of system identification methods. IEEE Trans. Automat. Contr. 47 (2002) 1329-1334
    • (2002) IEEE Trans. Automat. Contr. , vol.47 , pp. 1329-1334
    • Campi, M.C.1    Weyer, E.2
  • 12
    • 0036639881 scopus 로고    scopus 로고
    • Rates of uniform convergence of empirical means with mixing processes
    • Karandikar R.L., and Vidyasagar M. Rates of uniform convergence of empirical means with mixing processes. Stat. Probabil. Lett. 58 (2002) 297-307
    • (2002) Stat. Probabil. Lett. , vol.58 , pp. 297-307
    • Karandikar, R.L.1    Vidyasagar, M.2
  • 13
    • 0001954668 scopus 로고
    • Necessary and sufficient conditions for the uniform convergence of means to their expectations
    • Vapnik V.N., and Chervonenkis A.Ya. Necessary and sufficient conditions for the uniform convergence of means to their expectations. Theory Probab. Appl. 26 3 (1981) 532-553
    • (1981) Theory Probab. Appl. , vol.26 , Issue.3 , pp. 532-553
    • Vapnik, V.N.1    Chervonenkis, A.Ya.2
  • 14
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies to their probabilities
    • Vapnik V.N., and Chervonenkis A.Ya. On the uniform convergence of relative frequencies to their probabilities. Theory Probab. Appl. 16 2 (1971) 264-280
    • (1971) Theory Probab. Appl. , vol.16 , Issue.2 , pp. 264-280
    • Vapnik, V.N.1    Chervonenkis, A.Ya.2
  • 16
    • 0030241029 scopus 로고    scopus 로고
    • Sample complexity for learning recurrent perceptron mappings
    • Dasgupta B., and Sontag E.D. Sample complexity for learning recurrent perceptron mappings. IEEE Trans. Inform. Theory 42 (1996) 1479-1487
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1479-1487
    • Dasgupta, B.1    Sontag, E.D.2
  • 17
    • 40849143288 scopus 로고    scopus 로고
    • M. Karpinski, A.J. Macintyre, Polynomial bounds for VC dimension of sigmoidal neural networks, in: Proc. 27th ACM Symp. Theory Comput., 1995, pp. 200-208.
    • M. Karpinski, A.J. Macintyre, Polynomial bounds for VC dimension of sigmoidal neural networks, in: Proc. 27th ACM Symp. Theory Comput., 1995, pp. 200-208.
  • 18
    • 0031077292 scopus 로고    scopus 로고
    • Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
    • Karpinski M., and Macintyre A.J. Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks. J. Comput. Syst. Sci. 54 (1997) 169-176
    • (1997) J. Comput. Syst. Sci. , vol.54 , pp. 169-176
    • Karpinski, M.1    Macintyre, A.J.2
  • 19
    • 0027205881 scopus 로고    scopus 로고
    • A.J. Macintyre, E.D. Sontag, Finiteness results for sigmoidal neural networks, in: Proc. 25th ACM Symp. Theory of Comput., 1993, pp. 325-334.
    • A.J. Macintyre, E.D. Sontag, Finiteness results for sigmoidal neural networks, in: Proc. 25th ACM Symp. Theory of Comput., 1993, pp. 325-334.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.