{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:10:01Z","timestamp":1780495801055,"version":"3.54.1"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.patcog.2026.113523","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T15:51:20Z","timestamp":1774108280000},"page":"113523","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Fast online learning algorithm based on modified hierarchical Unimodal Thompson Sampling"],"prefix":"10.1016","volume":"179","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5196-039X","authenticated-orcid":false,"given":"Tianchi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8607-0429","authenticated-orcid":false,"given":"He","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9654-4536","authenticated-orcid":false,"given":"Jing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2571-7628","authenticated-orcid":false,"given":"Yanchao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2919-9004","authenticated-orcid":false,"given":"Hongyin","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6850-9335","authenticated-orcid":false,"given":"Guangzhe","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7971-9161","authenticated-orcid":false,"given":"Jinliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3\u20134","key":"10.1016\/j.patcog.2026.113523_bib0001","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","article-title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples","volume":"25","author":"Thompson","year":"1933","journal-title":"Biometrika"},{"key":"10.1016\/j.patcog.2026.113523_bib0002","series-title":"2018\u202fIEEE Conference on Communications and Network Security (CNS)","first-page":"1","article-title":"Truth-aware optimal decision-making framework with driver preferences for V2V communications","author":"Sun","year":"2018"},{"key":"10.1016\/j.patcog.2026.113523_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.108490","article-title":"TradeBot: bandit learning for hyper-parameters optimization of high frequency trading strategy","volume":"124","author":"Zhang","year":"2022","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113523_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.109872","article-title":"Online portfolio selection with predictive instantaneous risk assessment","volume":"144","author":"Xi","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113523_bib0005","series-title":"Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management","first-page":"1959","article-title":"Dynamic clustering of contextual multi-armed bandits","author":"Nguyen","year":"2014"},{"key":"10.1016\/j.patcog.2026.113523_bib0006","article-title":"Categorized bandits","volume":"32","author":"Jedor","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113523_bib0007","doi-asserted-by":"crossref","unstructured":"D. Bouneffouf, S. Parthasarathy, H. Samulowitz, M. Wistub, Optimal exploitation of clustering and history information in multi-armed bandit, arXiv preprint arXiv: 1906.03979(2019).","DOI":"10.24963\/ijcai.2019\/279"},{"key":"10.1016\/j.patcog.2026.113523_bib0008","series-title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)","first-page":"2212","article-title":"Thompson sampling for bandits with clustered arms","author":"Carlsson","year":"2021"},{"key":"10.1016\/j.patcog.2026.113523_bib0009","series-title":"Proceedings of the 24th International Conference on Machine Learning","first-page":"721","article-title":"Multi-armed bandit problems with dependent arms","author":"Pandey","year":"2007"},{"key":"10.1016\/j.patcog.2026.113523_bib0010","series-title":"ICC 2019-2019 IEEE International Conference on Communications (ICC)","first-page":"1","article-title":"Fast reconfigurable antenna state selection with hierarchical thompson sampling","author":"Zhao","year":"2019"},{"key":"10.1016\/j.patcog.2026.113523_bib0011","first-page":"1","article-title":"Optimal clustering with bandit feedback","volume":"25","author":"Yang","year":"2024","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.patcog.2026.113523_bib0012","series-title":"Proceedings of the 2019\u202fIEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","first-page":"145","article-title":"Hierarchical multi-armed bandits for discovering hidden populations","author":"Kumar","year":"2019"},{"key":"10.1016\/j.patcog.2026.113523_bib0013","series-title":"2020 International Joint Conference on Neural Networks (IJCNN)","first-page":"1","article-title":"Regret analysis of stochastic multi-armed bandit problem with clustered information feedback","author":"Zhao","year":"2020"},{"issue":"1","key":"10.1016\/j.patcog.2026.113523_bib0014","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10994-023-06457-z","article-title":"Multi-armed bandits with dependent arms","volume":"113","author":"Singh","year":"2024","journal-title":"Mach. Learn."},{"key":"10.1016\/j.patcog.2026.113523_bib0015","series-title":"International Conference on Machine Learning","first-page":"9422","article-title":"Top-k extreme contextual bandits with arm hierarchy","author":"Rajat","year":"2021"},{"key":"10.1016\/j.patcog.2026.113523_bib0016","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"7724","article-title":"Hierarchical Bayesian bandits","author":"Hong","year":"2022"},{"key":"10.1016\/j.patcog.2026.113523_bib0017","unstructured":"J.Y. Yu, S. Mannor, Unimodal bandits in: Proceedings of the 28th International Conference on International Conference on Machine Learning, ICML, 2011, pp. 41\u201348."},{"key":"10.1016\/j.patcog.2026.113523_bib0018","series-title":"International Conference on Machine Learning","first-page":"521","article-title":"Unimodal bandits: regret lower bounds and optimal algorithms","author":"Combes","year":"2014"},{"key":"10.1016\/j.patcog.2026.113523_bib0019","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","article-title":"Unimodal thompson sampling for graph-structured arms","volume":"31","author":"Paladino","year":"2017"},{"key":"10.1016\/j.patcog.2026.113523_bib0020","series-title":"Algorithmic Learning Theory","first-page":"862","article-title":"Solving bernoulli rank-one bandits with unimodal thompson sampling","author":"Trinh","year":"2020"},{"key":"10.1016\/j.patcog.2026.113523_bib0021","series-title":"Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","first-page":"151","article-title":"MmWave codebook selection in rapidly-varying channels via multinomial thompson sampling","author":"Zhang","year":"2021"},{"key":"10.1016\/j.patcog.2026.113523_bib0022","series-title":"IEEE INFOCOM 2018","first-page":"2393","article-title":"Efficient beam alignment in millimeter wave systems using contextual bandits","author":"Hashemi","year":"2018"},{"key":"10.1016\/j.patcog.2026.113523_bib0023","first-page":"38475","article-title":"Finite-time regret of thompson sampling algorithms for exponential family multi-armed bandits","volume":"35","author":"Jin","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113523_bib0024","series-title":"International Conference on Machine Learning","first-page":"15239","article-title":"Thompson sampling with less exploration is fast and optimal","author":"Jin","year":"2023"},{"key":"10.1016\/j.patcog.2026.113523_bib0025","series-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"269","article-title":"Hierarchical unimodal bandits","author":"Zhao","year":"2022"},{"key":"10.1016\/j.patcog.2026.113523_bib0026","series-title":"Artificial Intelligence and Statistics","first-page":"99","article-title":"Further optimal regret bounds for Thompson sampling","author":"Agrawal","year":"2013"},{"issue":"2","key":"10.1016\/j.patcog.2026.113523_bib0027","doi-asserted-by":"crossref","first-page":"121","DOI":"10.3233\/RDA-160118","article-title":"Limit order trading with a mean reverting reference price","volume":"6","author":"Ahuja","year":"2017","journal-title":"Risk Decis. Anal."},{"issue":"1","key":"10.1016\/j.patcog.2026.113523_bib0028","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000070","article-title":"A tutorial on Thompson sampling","volume":"11","author":"Russo","year":"2018","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"10.1016\/j.patcog.2026.113523_bib0029","unstructured":"H. Bijl, T.B. Sch\u00f6n, J.-W. van Wingerden, M. Verhaegen, A sequential Monte Carlo approach to Thompson sampling for Bayesian optimization, arXiv preprint arXiv: 1604.00169(2016)."},{"key":"10.1016\/j.patcog.2026.113523_bib0030","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"133","article-title":"Parallelised Bayesian optimisation via Thompson sampling","author":"Kandasamy","year":"2018"},{"key":"10.1016\/j.patcog.2026.113523_bib0031","doi-asserted-by":"crossref","first-page":"32383","DOI":"10.52202\/068431-2346","article-title":"On efficient online imitation learning via classification","volume":"35","author":"Li","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113523_bib0032","series-title":"2019 International Conference on Computing, Networking and Communications (ICNC)","first-page":"888","article-title":"Online reconfigurable antenna state selection based on thompson sampling","author":"Zhao","year":"2019"},{"key":"10.1016\/j.patcog.2026.113523_bib0033","series-title":"NIPS","first-page":"2249","article-title":"An empirical evaluation of Thompson sampling","author":"Chapelle","year":"2011"},{"key":"10.1016\/j.patcog.2026.113523_bib0034","series-title":"Conference on Learning Theory","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","author":"Agrawal","year":"2012"},{"key":"10.1016\/j.patcog.2026.113523_bib0035","series-title":"IEEE INFOCOM 2018","first-page":"540","article-title":"Low-complexity, low-regret link rate selection in rapidly-varying wireless channels","author":"Gupta","year":"2018"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326004899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326004899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:10:01Z","timestamp":1780492201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326004899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":35,"alternative-id":["S0031320326004899"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113523","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast online learning algorithm based on modified hierarchical Unimodal Thompson Sampling","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113523","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"113523"}}