Local Minimax Learning of Functions With Best Finite Sample Estimation Error Bounds: Applications to Ridge and Lasso Regression, Boosting, Tree Learning, Kernel Machines, and Inverse Problems

DOI10.1109/TIT.2009.2027479MaRDI QIDQ4974107zbMATH OpenOpenAlexFDO

Authors Lee Kenneth Jones

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2009.2027479

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Learning and adaptive systems in artificial intelligence (68T05)

Cited in

(1)

• New duality in choices of feature spaces via kernel analysis

This page was built for publication: Local Minimax Learning of Functions With Best Finite Sample Estimation Error Bounds: Applications to Ridge and Lasso Regression, Boosting, Tree Learning, Kernel Machines, and Inverse Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974107)