| Paper: | MLSP-P2.1 | ||
| Session: | Learning Theory and Modeling | ||
| Time: | Tuesday, May 16, 16:30 - 18:30 | ||
| Presentation: | Poster | ||
| Topic: | Machine Learning for Signal Processing: Learning Theory and Modeling | ||
| Title: | System Identification with Unbounded Loss Functions under Algorithmic Deficiency | ||
| Authors: | Majid Fozunbal, Mat Hans, Ronald Schafer, Hewlett-Packard Company, United States | ||
| Abstract: | We describe and analyze a comprehensive learning model to address issues such as consistency, convergence rate, and sample complexity in the general context of system identification. The learning model is based on unbounded loss functions, and it incorporates a measure of algorithmic deficiency. We define and use a novel formulation of algorithmic solution that is an extension of the empirical risk minimization method in the sense that it uses a generic notion of side information as opposed to the commonly used input/output observation of a system. Sufficient conditions for consistency as well as closed form expressions for exponential convergence rate and sample complexity of the identification algorithm are derived. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012