{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:16:35Z","timestamp":1761293795001,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T00:00:00Z","timestamp":1535500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10994-018-5758-5","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:55:30Z","timestamp":1535590530000},"page":"687-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Corruption-tolerant bandit learning"],"prefix":"10.1007","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5695-280X","authenticated-orcid":false,"given":"Sayash","family":"Kapoor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6886-6826","authenticated-orcid":false,"given":"Kumar Kshitij","family":"Patel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2096-5267","authenticated-orcid":false,"given":"Purushottam","family":"Kar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"key":"5758_CR1","unstructured":"Abbasi-Yadkori, Y., Pal, D., & Szepesvari, C. (2011). Improved algorithms for linear stochastic bandits. In Proceedings of the 25th annual conference on neural information processing systems (NIPS)."},{"key":"5758_CR2","doi-asserted-by":"crossref","unstructured":"Audibert, J.-Y., Munos, R., & Szepesv\u00e1ri, C. (2007). Tuning bandit algorithms in stochastic environments. In Proceedings of the 18th international conference on algorithmic learning theory (ALT).","DOI":"10.1007\/978-3-540-75225-7_15"},{"issue":"19","key":"5758_CR3","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1016\/j.tcs.2009.01.016","volume":"410","author":"J-Y Audibert","year":"2009","unstructured":"Audibert, J.-Y., Munos, R., & Szepesv\u00e1ri, C. (2009). Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19), 1876\u20131902.","journal-title":"Theoretical Computer Science"},{"key":"5758_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235\u2013256.","journal-title":"Machine Learning"},{"issue":"1","key":"5758_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"31","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. (2002b). The nonstochastic multiarmed bandit problem. SIAM Journal of Computing, 31(1), 48\u201377.","journal-title":"SIAM Journal of Computing"},{"key":"5758_CR6","unstructured":"Bhatia, K., Jain, P., & Kar, P. (2015). Robust regression via hard thresholding. In Proceedings of the 29th annual conference on neural information processing systems (NIPS)."},{"key":"5758_CR7","unstructured":"Bubeck, S\u00e9bastian., & Slivkins, A. (2012). The best of both worlds: stochastic and adversarial bandits. In Proceedings of the 25th annual conference on learning theory (COLT)."},{"issue":"11","key":"5758_CR8","doi-asserted-by":"publisher","first-page":"7711","DOI":"10.1109\/TIT.2013.2277869","volume":"59","author":"S Bubeck","year":"2013","unstructured":"Bubeck, S., Cesa-Bianchi, N., & Lugosi, G. (2013). Bandits with heavy tail. IEEE Transaction on Information Theory, 59(11), 7711\u20137717.","journal-title":"IEEE Transaction on Information Theory"},{"issue":"1","key":"5758_CR9","first-page":"1","volume":"58","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E. J., Li, X., & Wright, J. (2009). Robust principal component analysis? Journal of the ACM, 58(1), 1\u201337.","journal-title":"Journal of the ACM"},{"key":"5758_CR10","unstructured":"Chakrabarti, D., Kumar, R., Radlinski, F., & Upfal, E. (2008). Mortal multi-armed bandits. In Proceedings of the 21st international conference on neural information processing systems (NIPS)."},{"key":"5758_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., Steinhardt, J., & Valiant, G. (2017). Learning from untrusted data. In Proceedings of the 49th annual ACM SIGACT symposium on theory of computing (STOC) (pp. 47\u201360).","DOI":"10.1145\/3055399.3055491"},{"key":"5758_CR12","unstructured":"Chen, Y., Caramanis, C., & Mannor, S. (2013). Robust sparse regression under adversarial corruption. In Proceedings of the 30th international conference on machine learning (ICML)."},{"key":"5758_CR13","unstructured":"Chu, W., Li, L., Reyzin, L., & Schapire, R. (2011). Contextual bandits with linear payoff functions. In Proceedings of the 14th international conference on artificial intelligence and statistics (AISTATS)."},{"key":"5758_CR14","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Kamath, G., Kane, D.\u00a0M., Li, J., Moitra, A., & Stewart, A. (2016). Robust estimators in high dimensions without the computational intractability. In Proceedings of the 57th IEEE annual symposium on foundations of computer science (FOCS).","DOI":"10.1109\/FOCS.2016.85"},{"key":"5758_CR15","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Kamath, G., Kane, D.\u00a0M., Li, J., Moitra, A., & Stewart, A. (2018). Robustly learning a gaussian: Getting optimal error, efficiently. In Proceedings of the twenty-ninth annual acm-siam symposium on discrete algorithms (SODA) (pp. 2683\u20132702).","DOI":"10.1137\/1.9781611975031.171"},{"key":"5758_CR16","unstructured":"Feng, J., Xu, H., Mannor, S., & Yan, S. (2014). Robust logistic regression and classification. In Proceedings of the 28th annual conference on neural information processing systems (NIPS)."},{"key":"5758_CR17","unstructured":"Gajane, P., Urvoy, T., & Kaufmann, E. (2018). Corrupt bandits for preserving local privacy. In Proceedings of the 29th international conference on algorithmic learning theory (ALT)."},{"key":"5758_CR18","unstructured":"Garivier, A., & Capp\u00e9, O. (2011). The KL-UCB algorithm for bounded stochastic bandits and beyond. In Proceedings of the 24th annual conference on learning theory (COLT)."},{"key":"5758_CR19","unstructured":"Gentile, C., Li, S., Kar, P., Karatzoglou, A., Zappella, G., & Etrue, E. (2017). On context-dependent clustering of bandits. In Proceedings of the 34th international conference on machine learning (ICML)."},{"key":"5758_CR20","unstructured":"Gentile, C., Li, S., & Zappella, G. (2014). Online clustering of bandits. In Proceedings of the 31st international conference on machine learning (ICML)."},{"issue":"1","key":"5758_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1214\/aoms\/1177703732","volume":"35","author":"PJ Huber","year":"1964","unstructured":"Huber, P. J. (1964). Robust estimation of a location parameter. The Annals of Mathematical Statistics, 35(1), 73\u2013101.","journal-title":"The Annals of Mathematical Statistics"},{"key":"5758_CR22","doi-asserted-by":"crossref","unstructured":"Lai, K.\u00a0A., Rao, A.\u00a0B., & Vempala, S. (2016). Agnostic estimation of mean and covariance. In Proceedings of the 57th IEEE annual symposium on foundations of computer science (FOCS).","DOI":"10.1109\/FOCS.2016.76"},{"key":"5758_CR23","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., & Schapire, R. (2010). A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international world wide web conference (WWW).","DOI":"10.1145\/1772690.1772758"},{"key":"5758_CR24","doi-asserted-by":"crossref","unstructured":"Lykouris, T., Mirrokni, V., & Leme, R.\u00a0P. (2018). Stochastic bandits robust to adversarial corruptions. In Proceedings of the 50th annual ACM SIGACT symposium on theory of computing (STOC) (pp. 114\u2013122).","DOI":"10.1145\/3188745.3188918"},{"key":"5758_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/0470010940","volume-title":"Robust statistics: Theory and methods","author":"RA Maronna","year":"2006","unstructured":"Maronna, R. A., Martin, R. D., & Yohai, V. J. (2006). Robust statistics: Theory and methods. New York: Wiley."},{"key":"5758_CR26","unstructured":"Medina, A.\u00a0M., & Yang, S. (2016). No-regret algorithms for heavy-tailed linear bandits. In Proceedings of the 33rd international conference on machine learning (ICML)."},{"issue":"4","key":"5758_CR27","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1109\/TIT.2013.2240435","volume":"59","author":"NH Nguyen","year":"2013","unstructured":"Nguyen, N. H., & Tran, T. D. (2013). Exact recoverability from dense corrupted observations via \n                    \n                      \n                    \n                    $$\\ell _1$$\n                    \n                      \n                        \n                          \u2113\n                          1\n                        \n                      \n                    \n                  -minimization. IEEE Transactions on Information Theory, 59(4), 2017\u20132035.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5758_CR28","doi-asserted-by":"crossref","unstructured":"Padmanabhan, D., Bhat, S., Garg, D., Shevade, S.\u00a0K., & Narahari, Y. (2016). A robust UCB scheme for active learning in regression from strategic crowds. In Proceedings of the international joint conference on neural networks (IJCNN).","DOI":"10.1109\/IJCNN.2016.7727473"},{"key":"5758_CR29","unstructured":"Seldin, Y., & Slivkins, A. (2014). One practical algorithm for both stochastic and adversarial bandits. In Proceedings of the 31st international conference on machine learning (ICML)."},{"key":"5758_CR30","doi-asserted-by":"crossref","unstructured":"Tang, L., Rosales, R., Singh, A.\u00a0P., & Agarwal, D. (2013). Automatic Ad format selection via contextual bandits. In Proceedings of the 22nd ACM international conference on information and knowledge management (CIKM).","DOI":"10.1145\/2505515.2514700"},{"key":"5758_CR31","first-page":"495","volume-title":"Mobile health, chapter From Ads to interventions: Contextual bandits in mobile health","author":"A Tewari","year":"2017","unstructured":"Tewari, A., & Murphy, S. A. (2017). Mobile health, chapter From Ads to interventions: Contextual bandits in mobile health (pp. 495\u2013517). New York: Springer."},{"key":"5758_CR32","unstructured":"The\u00a0Hindustan Times. #Appwapsi: Snapdeal gets blowback from Aamir Khan controversy, Nov 24, (2015). \n                    https:\/\/www.hindustantimes.com\/india\/appwapsi-snapdeal-gets-blowback-from-aamir-khan-controversy\/story-N3HwOObJ0WMe9vz7GjXFBO.html\n                    \n                  . Accessed July 15, 2018."},{"key":"5758_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/b13794","volume-title":"Introduction to nonparametric estimation","author":"AB Tsybakov","year":"2009","unstructured":"Tsybakov, A. B. (2009). Introduction to nonparametric estimation. New York: Springer."},{"key":"5758_CR34","first-page":"448","volume":"2","author":"JW Tukey","year":"1960","unstructured":"Tukey, J. W. (1960). A survey of sampling from contaminated distributions. Contributions to Probability and Statistics, 2, 448\u2013485.","journal-title":"Contributions to Probability and Statistics"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5758-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5758-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5758-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T06:09:34Z","timestamp":1567058974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5758-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,29]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["5758"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5758-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2018,8,29]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}