Keyword

regret analysis

Description: A decision-analysis approach that evaluates choices by comparing their outcomes with those of alternatives that could have been selected.

Primary topic: Advanced Bandit Algorithms Research (48%)

OpenAlex ID: keywords/regret-analysis

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

2012 · Sébastien Bubeck · now publishers, Inc. eBooks · 1,410

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

2012 · Sébastien Bubeck, Nicolò Cesa-Bianchi · Foundations and Trends® in Machine Learning · 1,272

Using confidence bounds for exploitation-exploration trade-offs

2003 · Peter Auer · 1,189

Learning to Optimize via Posterior Sampling

2014 · Daniel Russo, Benjamin Van Roy · Mathematics of Operations Research · 494

Multi-Armed Bandit-Based Client Scheduling for Federated Learning

2020 · Wenchao Xia, Tony Q. S. Quek, et al. · IEEE Transactions on Wireless Communications · 315

PDF

Collaborative Filtering Bandits

2016 · Shuai Li, Alexandros Karatzoglou, et al. · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · 291

PDF

Kullback-leibler Upper Confidence Bounds for Optimal Sequential Allocation

2013 · Cappé, O. (Olivier), Garivier, A. (Aurélien), et al. · 274

Logarithmic Regret Algorithms for Online Convex Optimization

2006 · Elad Hazan, Adam Kalai, et al. · Lecture notes in computer science · 203

2018 · Peng Yang, Ning Zhang, et al. · IEEE Transactions on Multimedia · 199

PDF

Kullback–Leibler upper confidence bounds for optimal sequential allocation

2013 · Olivier Cappé, Aurélien Garivier, et al. · The Annals of Statistics · 181

PDF

Adaptive and self-confident on-line learning algorithms

2002 · Auer P, Cesa Bianchi N, et al. · IrInSubria (University of Insubria) · 181

Online Distributed Convex Optimization on Dynamic Networks

2016 · Saghar Hosseini, Airlie Chapman, et al. · IEEE Transactions on Automatic Control · 179

PDF

Popularity-driven content caching

2016 · Suoheng Li, Jie Xu, et al. · 166

Online Clustering of Bandits

2014 · Gentile, Claudio, Li, Shuai, et al. · arXiv (Cornell University) · 164

PDF

Multi-armed bandit problems with dependent arms

2007 · Sandeep Pandey, Deepayan Chakrabarti, et al. · International Conference on Machine Learning · 163

An Integrated Environmental Assessment of Green and Gray Infrastructure Strategies for Robust Decision Making

2015 · Arturo Casal-Campos, Guangtao Fu, et al. · Environmental Science & Technology · 155

Reliable Facility Location Design Under Uncertain Correlated Disruptions

2013 · Mengshi Lu, Lun Ran, et al. · Manufacturing & Service Operations Management · 150

Distributed Online Convex Optimization Over Jointly Connected Digraphs

2014 · David Mateos-Nunez, Jorge Cortes · IEEE Transactions on Network Science and Engineering · 149

Adapting to a Changing Environment: the Brownian Restless Bandits.

2008 · Aleksandrs Slivkins, Eli Upfal · 141

A theoretical analysis of Model-Based Interval Estimation

2005 · Alexander L. Strehl, Michael L. Littman · International Conference on Machine Learning · 135

Online distributed optimization via dual averaging

2013 · Saghar Hosseini, Airlie Chapman, et al. · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · 125

Multi-fidelity Bayesian Optimisation with Continuous Approximations

2017 · Kandasamy, Kirthevasan, Dasarathy, Gautam, et al. · arXiv (Cornell University) · 114

PDF

CMAB-Based Reverse Auction for Unknown Worker Recruitment in Mobile Crowdsensing

2021 · Mingjun Xiao, Baoyi An, et al. · IEEE Transactions on Mobile Computing · 109

Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays

2015 · Komiyama, Junpei, Honda, Junya, et al. · arXiv (Cornell University) · 104

PDF

Multiclass classification with bandit feedback using adaptive regularization

2012 · Koby Crammer, Claudio Gentile · Machine Learning · 104

PDF

Works count: 1,336

Citation count: 17,510