{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:17Z","timestamp":1725750317219},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_24","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T01:14:50Z","timestamp":1380244490000},"page":"339-353","source":"Crossref","is-referenced-by-count":3,"title":["Algorithmic Connections between Active Learning and Stochastic Convex Optimization"],"prefix":"10.1007","author":[{"given":"Aaditya","family":"Ramdas","sequence":"first","affiliation":[]},{"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Raginsky, M., Rakhlin, A.: Information complexity of black-box convex optimization: A new look via feedback information theory. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009)","key":"24_CR1","DOI":"10.1109\/ALLERTON.2009.5394945"},{"unstructured":"Ramdas, A., Singh, A.: Optimal rates for stochastic convex optimization under tsybakov noise condition. In: Intl. Conference in Machine Learning, ICML (2013)","key":"24_CR2"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1214\/10-AOS843","volume":"39","author":"S. Hanneke","year":"2011","unstructured":"Hanneke, S.: Rates of convergence in active learning. The Annals of Statistics\u00a039(1), 333\u2013361 (2011)","journal-title":"The Annals of Statistics"},{"unstructured":"Nemirovski, A., Yudin, D.: Problem complexity and method efficiency in optimization. John Wiley & Sons (1983)","key":"24_CR4"},{"unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. Core Discussion Papers\u00a02, 2010 (2010)","key":"24_CR5"},{"unstructured":"Jamieson, K., Nowak, R., Recht, B.: Query complexity of derivative-free optimization. In: Advances in Neural Information Processing Systems, NIPS (2012)","key":"24_CR6"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1214\/aos\/1079120131","volume":"32","author":"A. Tsybakov","year":"2004","unstructured":"Tsybakov, A.: Optimal aggregation of classifiers in statistical learning. The Annals of Statistics\u00a032(1), 135\u2013166 (2004)","journal-title":"The Annals of Statistics"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1214\/009053606000001217","volume":"35","author":"J.Y. Audibert","year":"2007","unstructured":"Audibert, J.Y., Tsybakov, A.B.: Fast learning rates for plug-in classifiers. Annals of Statistics\u00a035(2), 608\u2013633 (2007)","journal-title":"Annals of Statistics"},{"key":"24_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-72927-3_3","volume-title":"Learning Theory","author":"R.M. Castro","year":"2007","unstructured":"Castro, R.M., Nowak, R.D.: Minimax bounds for active learning. In: Bshouty, N.H., Gentile, C. (eds.) COLT. LNCS (LNAI), vol.\u00a04539, pp. 5\u201319. Springer, Heidelberg (2007)"},{"unstructured":"Iouditski, A., Nesterov, Y.: Primal-dual subgradient methods for minimizing uniformly convex functions. Universit\u00e9 Joseph Fourier, Grenoble, France (2010)","key":"24_CR10"},{"issue":"3","key":"24_CR11","first-page":"51","volume":"10","author":"M. Burnashev","year":"1974","unstructured":"Burnashev, M., Zigangirov, K.: An interval estimation problem for controlled observations. Problemy Peredachi Informatsii\u00a010(3), 51\u201361 (1974)","journal-title":"Problemy Peredachi Informatsii"},{"doi-asserted-by":"crossref","unstructured":"Castro, R., Nowak, R.: Active sensing and learning. Foundations and Applications of Sensor Management, 177\u2013200 (2009)","key":"24_CR12","DOI":"10.1007\/978-0-387-49819-5_8"},{"doi-asserted-by":"crossref","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A probabilistic theory of pattern recognition, vol.\u00a031. Springer (1996)","key":"24_CR13","DOI":"10.1007\/978-1-4612-0711-5"},{"unstructured":"Hazan, E., Kale, S.: Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. In: Proceedings of the 23nd Annual Conference on Learning Theory (2011)","key":"24_CR14"},{"unstructured":"Bach, F., Moulines, E.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Advances in Neural Information Processing Systems, NIPS (2011)","key":"24_CR15"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:13:20Z","timestamp":1558091600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}