conftrace_

exploration-exploitation tradeoff

55 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) reinforcement learning (4352) online learning (1777) upper confidence bound (197) contextual bandit (381) exploration exploitation (76) thompson sampling (237) deep reinforcement learning (903) gaussian process (1200)

Papers

Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract) AAAI 2026
MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity COLING 2025
𝜙-Decoding: Adaptive Foresight Sampling for Balanced Inference-Time Exploration and Exploitation ACL 2025
Code Repair with LLMs gives an Exploration-Exploitation Tradeoff NIPS 2024
Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit NIPS 2024
Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates NIPS 2024
Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal NIPS 2024
Unveiling User Satisfaction and Creator Productivity Trade-Offs in Recommendation Platforms NIPS 2024
Nonstationary Bandit Learning via Predictive Sampling AISTATS 2023
Reward-Biased Maximum Likelihood Estimation for Neural Contextual Bandits: A Distributional Learning Perspective AAAI 2023
Bandits with costly reward observations UAI 2023
Exploring the Sensitivity of LLMs’ Decision-Making Capabilities: Insights from Prompt Variations and Hyperparameters EMNLP 2023
Learning While Scheduling in Multi-Server Systems With Unknown Statistics: MaxWeight with Discounted UCB AISTATS 2023
A Survey of Risk-Aware Multi-Armed Bandits IJCAI 2022
Bayesian Reinforcement Learning for Single-Episode Missions in Partially Unknown Environments CORL 2022
Pareto Optimal Model Selection in Linear Bandits AISTATS 2022
Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021
Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021
Convex Regularization in Monte-Carlo Tree Search ICML 2021
SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learning ICML 2021
Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021
Kernel-Based Reinforcement Learning: A Finite-Time Analysis ICML 2021
Incentivized Bandit Learning with Self-Reinforcing User Preferences ICML 2021
Bayesian model predictive control: Efficient model exploration and regret bounds using posterior sampling L4DC 2020
Generative Exploration and Exploitation AAAI 2020