{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:18:28Z","timestamp":1740140308961,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T00:00:00Z","timestamp":1706486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T00:00:00Z","timestamp":1706486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10287-023-00500-z","type":"journal-article","created":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T09:02:21Z","timestamp":1706518941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed bandits"],"prefix":"10.1007","volume":"21","author":[{"given":"Yuriy","family":"Dorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikita","family":"Kornilov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay","family":"Kutuzov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Nazin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard","family":"Gorbunov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,29]]},"reference":[{"issue":"1","key":"500_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (2002) The nonstochastic multiarmed bandit problem. SIAM J Comput 32(1):48\u201377","journal-title":"SIAM J Comput"},{"key":"500_CR3","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 (2002) Finite-time analysis of the multiarmed bandit problem. Mach Learn 47:235\u2013256","journal-title":"Mach Learn"},{"issue":"5439","key":"500_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"500_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia"},{"issue":"71\u201387","key":"500_CR6","first-page":"7","volume":"5","author":"DA Berry","year":"1985","unstructured":"Berry DA, Fristedt B (1985) Bandit problems: sequential allocation of experiments (monographs on statistics and applied probability). London 5(71\u201387):7\u20137","journal-title":"London"},{"issue":"1","key":"500_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck S, Cesa-Bianchi N et al (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found Trends Mach Learn 5(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"issue":"11","key":"500_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 Trans Inf Theory 59(11):7711\u20137717","journal-title":"IEEE Trans Inf Theory"},{"key":"500_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games. Cambridge University Press, New York"},{"issue":"3","key":"500_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi N, Freund Y, Haussler D, Helmbold DP, Schapire RE, Warmuth MK (1997) How to use expert advice. J ACM (JACM) 44(3):427\u2013485","journal-title":"J ACM (JACM)"},{"issue":"1","key":"500_CR11","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1038\/s41598-019-57272-3","volume":"10","author":"D Choi","year":"2020","unstructured":"Choi D, Chun S, Oh H, Han J, Kwon T (2020) Rumor propagation is amplified by echo chambers in social media. Sci Rep 10(1):310","journal-title":"Sci Rep"},{"key":"500_CR12","first-page":"4883","volume":"34","author":"A Cutkosky","year":"2021","unstructured":"Cutkosky A, Mehta H (2021) High-probability bounds for non-convex stochastic optimization with heavy tails. Adv Neural Inf Process Syst 34:4883\u20134895","journal-title":"Adv Neural Inf Process Syst"},{"key":"500_CR13","unstructured":"Dann C, Wei C-Y, Zimmert J (2023) A blackbox approach to best of both worlds in bandits and beyond. arXiv preprint arXiv:2302.09739"},{"key":"500_CR14","doi-asserted-by":"crossref","unstructured":"Dhara S, Hofstad R, Leeuwaarden JS, Sen S (2020) Heavy-tailed configuration models at criticality","DOI":"10.1214\/19-AIHP980"},{"key":"500_CR15","unstructured":"Flaxman AD, Kalai AT, McMahan HB (2004) Online convex optimization in the bandit setting: gradient descent without a gradient. arXiv preprint arXiv:cs\/0408007"},{"issue":"1","key":"500_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1):119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"500_CR17","unstructured":"Gasnikov A, Novitskii A, Novitskii V, Abdukhakimov F, Kamzolov D, Beznosikov A, Tak\u00e1\u010d M, Dvurechensky P, Gu B (2022) The power of first-order smooth optimization for black-box non-smooth problems. arXiv preprint arXiv:2201.12289"},{"key":"500_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins J, Glazebrook K, Weber R (2011) Multi-armed Bandit Allocation Indices. John Wiley & Sons, Chichester"},{"key":"500_CR19","doi-asserted-by":"crossref","unstructured":"Gorbunov E, Vorontsova EA, Gasnikov AV (2019) On the upper bound for the expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere. Mathematical Notes 106","DOI":"10.4213\/mzm12041"},{"issue":"3\u20134","key":"500_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan E et al (2016) Introduction to online convex optimization. Found Trends Optim 2(3\u20134):157\u2013325","journal-title":"Found Trends Optim"},{"key":"500_CR21","unstructured":"Huang J, Dai Y, Huang L (2022) Adaptive best-of-both-worlds algorithm for heavy-tailed multi-armed bandits. In: international conference on machine learning, pp. 9173\u20139200. PMLR"},{"key":"500_CR22","doi-asserted-by":"crossref","unstructured":"Kornilov N, Gasnikov A, Dvurechensky P, Dvinskikh D (2023) Gradient free methods for non-smooth convex optimization with heavy tails on convex compact. arXiv preprint arXiv:2304.02442","DOI":"10.1007\/s10287-023-00470-2"},{"key":"500_CR23","first-page":"8452","volume":"33","author":"K Lee","year":"2020","unstructured":"Lee K, Yang H, Lim S, Oh S (2020) Optimal algorithms for stochastic multi-armed bandits with heavy tailed rewards. Adv Neural Inf Process Syst 33:8452\u20138462","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"500_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N Littlestone","year":"1994","unstructured":"Littlestone N, Warmuth MK (1994) The weighted majority algorithm. Inf Comput 108(2):212\u2013261","journal-title":"Inf Comput"},{"key":"500_CR25","unstructured":"Lu S, Wang G, Hu Y, Zhang L (2019) Optimal algorithms for lipschitz bandits with heavy-tailed rewards. In: international conference on machine learning, pp. 4154\u20134163. PMLR"},{"key":"500_CR26","unstructured":"Medina AM, Yang S (2016) No-regret algorithms for heavy-tailed linear bandits. In: international conference on machine learning, pp. 1642\u20131650. PMLR"},{"key":"500_CR27","volume-title":"Adaptive choice of variants","author":"A Nazin","year":"1986","unstructured":"Nazin A, Poznyak A (1986) Adaptive choice of variants. Nauka, Moscow"},{"key":"500_CR28","unstructured":"Nemirovskij AS, Yudin DB (1983) Problem complexity and method efficiency in optimization"},{"issue":"4","key":"500_CR29","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J Optim 19(4):1574\u20131609","journal-title":"SIAM J Optim"},{"key":"500_CR30","unstructured":"Orabona F (2019) A modern introduction to online learning. arXiv preprint arXiv:1912.13213"},{"key":"500_CR31","doi-asserted-by":"crossref","unstructured":"Robbins H (1952) Some aspects of the sequential design of experiments","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"500_CR1","unstructured":"RST (2003) (ed.), Handbook of Heavy Tailed Distributions in Finance: Handbooks in Finance, Book, Elsevier, North Holland"},{"key":"500_CR32","unstructured":"Sadiev A, Danilova M, Gorbunov E, Horv\u00e1th S, Gidel G, Dvurechensky P, Gasnikov A, Richt\u00e1rik P (2023) High-probability bounds for stochastic optimization and variational inequalities: the case of unbounded variance. arXiv preprint arXiv:2302.00999"},{"issue":"1","key":"500_CR33","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir O (2017) An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J Mach Learn Res 18(1):1703\u20131713","journal-title":"J Mach Learn Res"},{"key":"500_CR34","unstructured":"Shao H, Yu X, King I, Lyu MR (2018) Almost optimal algorithms for linear stochastic bandits with heavy-tailed payoffs. Advances in Neural Information Processing Systems 31"},{"issue":"1\u20132","key":"500_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins A et al (2019) Introduction to multi-armed bandits. Found Trends Mach Learn 12(1\u20132):1\u2013286","journal-title":"Found Trends Mach Learn"},{"key":"500_CR36","volume-title":"Reinforcement Learning - an Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement Learning - an Introduction. Adaptive Computation and Machine Learning, MIT press, Cambridge, MA"},{"issue":"3\u20134","key":"500_CR37","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson WR (1933) On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\u20134):285\u2013294","journal-title":"Biometrika"},{"key":"500_CR38","unstructured":"Tsetlin M (1969) Issledovaniya po teorii avtomatov i modelirovaniyu biologicheskikh sistem (Studies in the Theory of Finite State Machines and Simulation of Biological Systems). Nauka Moscow"},{"key":"500_CR39","volume-title":"Automaton Theory and Modeling of Biological Systems","author":"M Tsetlin","year":"1973","unstructured":"Tsetlin M (1973) Automaton Theory and Modeling of Biological Systems. Academic Press, New York"},{"key":"500_CR40","volume-title":"Kollektivnoe Povedenie Avtomatov","author":"VI Var\u0161avskij","year":"1973","unstructured":"Var\u0161avskij VI (1973) Kollektivnoe Povedenie Avtomatov. Nauka, Moscow"},{"key":"500_CR41","unstructured":"Vural NM, Yu L, Balasubramanian K, Volgushev S, Erdogdu MA (2022) Mirror descent strikes again: Optimal stochastic convex optimization under infinite noise variance. In: Conference on Learning Theory, pp. 65\u2013102. PMLR"},{"key":"500_CR42","doi-asserted-by":"crossref","unstructured":"Wang P, Xu H, Jin X, Wang T (2019) Flash: efficient dynamic routing for offchain networks. In: Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, pp. 370\u2013381","DOI":"10.1145\/3359989.3365411"},{"key":"500_CR43","unstructured":"Zhang J, Cutkosky A (2022) Parameter-free regret in high probability with heavy tails. arXiv preprint arXiv:2210.14355"},{"key":"500_CR44","first-page":"15383","volume":"33","author":"J Zhang","year":"2020","unstructured":"Zhang J, Karimireddy SP, Veit A, Kim S, Reddi SJ, Kumar S, Sra S (2020) Why are adaptive methods good for attention models? Adv Neural Inf Process Syst 33:15383\u201315393","journal-title":"Adv Neural Inf Process Syst"},{"key":"500_CR45","first-page":"15710","volume":"34","author":"H Zhong","year":"2021","unstructured":"Zhong H, Huang J, Yang L, Wang L (2021) Breaking the moments condition barrier: no-regret algorithm for bandits with super heavy-tailed payoffs. Adv Neural Inf Process Syst 34:15710\u201315720","journal-title":"Adv Neural Inf Process Syst"},{"key":"500_CR46","unstructured":"Zimmert J, Seldin Y (2019) An optimal algorithm for stochastic and adversarial bandits. In: The 22nd international conference on artificial intelligence and statistics, pp. 467\u2013475. PMLR"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00500-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T12:12:39Z","timestamp":1719058359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00500-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,29]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["500"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00500-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2024,1,29]]},"assertion":[{"value":"19 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}