UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity
Fuente:
arXiv
Saved in:
| Main Authors: | Li, Zaile, Fan, Weiwei, Hong, L. Jeff |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient Budget Allocation for Large-Scale LLM-Enabled Virtual Screening
by: Li, Zaile, et al.
Published: (2024)
by: Li, Zaile, et al.
Published: (2024)
The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection
by: Li, Zaile, et al.
Published: (2023)
by: Li, Zaile, et al.
Published: (2023)
Additive Distributionally Robust Ranking and Selection
by: Li, Zaile, et al.
Published: (2025)
by: Li, Zaile, et al.
Published: (2025)
New Additive OCBA Procedures for Robust Ranking and Selection
by: Wan, Yuchen, et al.
Published: (2024)
by: Wan, Yuchen, et al.
Published: (2024)
Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)
by: Deb, Rohan, et al.
Published: (2026)
UCB Exploration for Fixed-Budget Bayesian Best Arm Identification
by: Zhu, Rong J. B., et al.
Published: (2024)
by: Zhu, Rong J. B., et al.
Published: (2024)
Pure Exploration Beyond Reward Feedback: The Role of Post-Action Context
by: Shahverdikondori, Mohammad, et al.
Published: (2025)
by: Shahverdikondori, Mohammad, et al.
Published: (2025)
A Spatially Informed Gaussian Process UCB Method for Decentralized Coverage Control
by: Guidone, Gennaro, et al.
Published: (2025)
by: Guidone, Gennaro, et al.
Published: (2025)
Pure Exploration in Asynchronous Federated Bandits
by: Wang, Zichen, et al.
Published: (2023)
by: Wang, Zichen, et al.
Published: (2023)
Pure Exploration with Feedback Graphs
by: Russo, Alessio, et al.
Published: (2025)
by: Russo, Alessio, et al.
Published: (2025)
Pure Exploration with Infinite Answers
by: Poiani, Riccardo, et al.
Published: (2025)
by: Poiani, Riccardo, et al.
Published: (2025)
Preference-based Pure Exploration
by: Shukla, Apurv, et al.
Published: (2024)
by: Shukla, Apurv, et al.
Published: (2024)
Statistical Inference under Adaptive Sampling with LinUCB
by: Fan, Wei, et al.
Published: (2025)
by: Fan, Wei, et al.
Published: (2025)
Precise Asymptotics and Refined Regret of Variance-Aware UCB
by: Fan, Yingying, et al.
Published: (2024)
by: Fan, Yingying, et al.
Published: (2024)
The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)
by: Tuynman, Adrienne, et al.
Published: (2025)
Pure Exploration under Mediators' Feedback
by: Poiani, Riccardo, et al.
Published: (2023)
by: Poiani, Riccardo, et al.
Published: (2023)
Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)
by: Carlsson, Emil, et al.
Published: (2023)
In-Context Learning for Pure Exploration
by: Russo, Alessio, et al.
Published: (2025)
by: Russo, Alessio, et al.
Published: (2025)
Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)
A characterization of sample adaptivity in UCB data
by: Chen, Yilun, et al.
Published: (2025)
by: Chen, Yilun, et al.
Published: (2025)
On the Suboptimality of GP-UCB under Polynomial Effective Optimism
by: Wang, Wenjia, et al.
Published: (2023)
by: Wang, Wenjia, et al.
Published: (2023)
Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
by: Li, Zitian, et al.
Published: (2026)
by: Li, Zitian, et al.
Published: (2026)
Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization
by: Fan, Zheyi, et al.
Published: (2024)
by: Fan, Zheyi, et al.
Published: (2024)
Dual-Directed Algorithm Design for Efficient Pure Exploration
by: Qin, Chao, et al.
Published: (2023)
by: Qin, Chao, et al.
Published: (2023)
Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)
by: Song, Yanglei, et al.
Published: (2022)
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
by: Zhang, Raymond, et al.
Published: (2025)
by: Zhang, Raymond, et al.
Published: (2025)
Clus-UCB: A Near-Optimal Algorithm for Clustered Bandits
by: Gore, Aakash, et al.
Published: (2025)
by: Gore, Aakash, et al.
Published: (2025)
Cost-Aware Optimal Pairwise Pure Exploration
by: Wu, Di, et al.
Published: (2025)
by: Wu, Di, et al.
Published: (2025)
In-Context Learning for Pure Exploration in Continuous Spaces
by: Russo, Alessio, et al.
Published: (2026)
by: Russo, Alessio, et al.
Published: (2026)
The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enough
by: Zamboni, Riccardo, et al.
Published: (2024)
by: Zamboni, Riccardo, et al.
Published: (2024)
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)
by: Paschalidis, Phevos, et al.
Published: (2024)
Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
by: Sarkar, Dhruv, et al.
Published: (2025)
by: Sarkar, Dhruv, et al.
Published: (2025)
UCB-driven Utility Function Search for Multi-objective Reinforcement Learning
by: Shi, Yucheng, et al.
Published: (2024)
by: Shi, Yucheng, et al.
Published: (2024)
DAK-UCB: Diversity-Aware Prompt Routing for LLMs and Generative Models
by: Jafari, Donya, et al.
Published: (2026)
by: Jafari, Donya, et al.
Published: (2026)
Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits
by: Bui, Ha Manh, et al.
Published: (2024)
by: Bui, Ha Manh, et al.
Published: (2024)
Provably Efficient UCB-type Algorithms For Learning Predictive State Representations
by: Huang, Ruiquan, et al.
Published: (2023)
by: Huang, Ruiquan, et al.
Published: (2023)
UCB-type Algorithm for Budget-Constrained Expert Learning
by: Latypov, Ilgam, et al.
Published: (2025)
by: Latypov, Ilgam, et al.
Published: (2025)
Extended UCB Policies for Multi-armed Bandit Problems
by: Liu, Keqin, et al.
Published: (2011)
by: Liu, Keqin, et al.
Published: (2011)
Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
by: Cömer, Can, et al.
Published: (2025)
by: Cömer, Can, et al.
Published: (2025)
Reward-Based Online LLM Routing via NeuralUCB
by: Tsai, Ming-Hua, et al.
Published: (2026)
by: Tsai, Ming-Hua, et al.
Published: (2026)
Similar Items
-
Efficient Budget Allocation for Large-Scale LLM-Enabled Virtual Screening
by: Li, Zaile, et al.
Published: (2024) -
The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection
by: Li, Zaile, et al.
Published: (2023) -
Additive Distributionally Robust Ranking and Selection
by: Li, Zaile, et al.
Published: (2025) -
New Additive OCBA Procedures for Robust Ranking and Selection
by: Wan, Yuchen, et al.
Published: (2024) -
Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)