:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gore, Aakash, Chaporkar, Prasanna
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2508.02909
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
by: Varude, Chanakya, et al.
Published: (2025)

Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
by: Sarkar, Dhruv, et al.
Published: (2025)

Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)

A UCB Bandit Algorithm for General ML-Based Estimators
by: Liu, Yajing, et al.
Published: (2026)

Be More Diverse than the Most Diverse: Optimal Mixtures of Generative Models via Mixture-UCB Bandit Algorithms
by: Rezaei, Parham, et al.
Published: (2024)

Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

Extended UCB Policies for Multi-armed Bandit Problems
by: Liu, Keqin, et al.
Published: (2011)

InfoClus: Informative Clustering of High-dimensional Data Embeddings
by: Lai, Fuyin, et al.
Published: (2025)

Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits
by: Bui, Ha Manh, et al.
Published: (2024)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
by: Di, Qiwei, et al.
Published: (2024)

Uncertainty-Aware Dual-Student Knowledge Distillation for Efficient Image Classification
by: Gore, Aakash, et al.
Published: (2025)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

UCB-type Algorithm for Budget-Constrained Expert Learning
by: Latypov, Ilgam, et al.
Published: (2025)

PAK-UCB Contextual Bandit: An Online Learning Approach to Prompt-Aware Selection of Generative Models and LLMs
by: Hu, Xiaoyan, et al.
Published: (2024)

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
by: Tajdini, Artin, et al.
Published: (2023)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Provably Efficient UCB-type Algorithms For Learning Predictive State Representations
by: Huang, Ruiquan, et al.
Published: (2023)

Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
by: Zhang, Raymond, et al.
Published: (2025)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
by: Zuo, Shiliang
Published: (2020)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

A characterization of sample adaptivity in UCB data
by: Chen, Yilun, et al.
Published: (2025)

Batched Nonparametric Bandits via k-Nearest Neighbor UCB
by: Arya, Sakshi
Published: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Near-Optimality of Contrastive Divergence Algorithms
by: Glaser, Pierre, et al.
Published: (2025)

Empirical Comparison of Forgetting Mechanisms for UCB-based Algorithms on a Data-Driven Simulation Platform
by: Chen, Minxin
Published: (2025)

Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge
by: Guo, Longkun, et al.
Published: (2024)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2025)