Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
Publication:5271983
DOI10.1109/TIT.2011.2182178zbMath1365.94132arXiv1009.0571WikidataQ105584794 ScholiaQ105584794MaRDI QIDQ5271983
Alekh Agarwal, Bartlett, Peter L., Pradeep Ravikumar, Martin J. Wainwright
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.0571
Asymptotic properties of nonparametric inference (62G20) Computational learning theory (68Q32) Nonparametric estimation (62G05) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Measures of information, entropy (94A17)
Related Items (48)
This page was built for publication: Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization