Cover Image

Replicable Bandits with UCB based Exploration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deb, Rohan, Ghai, Udaya, Singh, Karan, Banerjee, Arindam
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sample-Optimal Agnostic Boosting with Unlabeled Data
by: Ghai, Udaya, et al.
Published: (2025)

Sample-Efficient Agnostic Boosting
by: Ghai, Udaya, et al.
Published: (2024)

Conservative Contextual Bandits: Beyond Linear Representations
by: Deb, Rohan, et al.
Published: (2024)

Plan Before You Trade: Inference-Time Optimization for RL Trading Agents
by: Go, Eun, et al.
Published: (2026)

Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)

Inference Time Policy Optimization for Offline RL with Differentiable World Models
by: Deb, Rohan, et al.
Published: (2026)

Beyond Johnson-Lindenstrauss: Uniform Bounds for Sketched Bilinear Forms
by: Deb, Rohan, et al.
Published: (2025)

The Bicameral Model: Bidirectional Hidden-State Coupling Between Parallel Language Models
by: Flamant, Cedric, et al.
Published: (2026)

Outbound Modeling for Inventory Management
by: Savorgnan, Riccardo, et al.
Published: (2025)

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

Clus-UCB: A Near-Optimal Algorithm for Clustered Bandits
by: Gore, Aakash, et al.
Published: (2025)

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

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

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

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

UCB Exploration for Fixed-Budget Bayesian Best Arm Identification
by: Zhu, Rong J. B., et al.
Published: (2024)

UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity
by: Li, Zaile, et al.
Published: (2025)

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

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

When Exploration Comes for Free with Mixture-Greedy: Do we need UCB in Diversity-Aware Multi-Armed Bandits?
by: Nia, Bahar Dibaei, et al.
Published: (2026)

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

Learning Adaptive LLM Decoding
by: Su, Chloe H., et al.
Published: (2026)

Loss Gradient Gaussian Width based Generalization and Optimization Guarantees
by: Banerjee, Arindam, et al.
Published: (2024)

Mind the Gap: Examining the Self-Improvement Capabilities of Large Language Models
by: Song, Yuda, et al.
Published: (2024)

Neural Coordination and Capacity Control for Inventory Management
by: Eisenach, Carson, et al.
Published: (2024)

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

Replicability is Asymptotically Free in Multi-armed Bandits
by: Komiyama, Junpei, et al.
Published: (2024)

Gradual Fine-Tuning for Flow Matching Models
by: Thorkelsdottir, Gudrun, et al.
Published: (2026)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)

Pure Exploration in Asynchronous Federated Bandits
by: Wang, Zichen, et al.
Published: (2023)

The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)

Sketched Adaptive Federated Deep Learning: A Sharp Convergence Analysis
by: Chen, Zhijie, et al.
Published: (2024)

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

On the Suboptimality of GP-UCB under Polynomial Effective Optimism
by: Wang, Wenjia, et al.
Published: (2023)

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

TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation
by: Princis, Henrijs, et al.
Published: (2025)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

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

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