conftrace_

exploration-exploitation trade-off

31 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) exploration exploitation (76) reinforcement learning (4352) upper confidence bound (197) exploration strategy (96) contextual bandit (381) bayesian optimization (624) exploration-exploitation (9) markov decision process (790)

Papers

FROST: Factual Reasoning via Optimized Stochastic Trajectories in Large Language Models during Inference ACL 2026
Taming Extreme Tokens: Covariance-Aware GRPO with Gaussian-Kernel Advantage Reweighting ACL 2026
Towards Effective Code-Integrated Reasoning AAAI 2026
Active Geospatial Search for Efficient Tenant Eviction Outreach AAAI 2025
Asymptotic Extinction in Large Coordination Games AAAI 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits AAAI 2025
Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits AAAI 2024
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment JMLR 2024
OPT-GAN: A Broad-Spectrum Global Optimizer for Black-Box Problems by Learning Distribution AAAI 2023
LESSON: Learning to Integrate Exploration Strategies for Reinforcement Learning via an Option Framework ICML 2023
Efficient Failure Pattern Identification of Predictive Algorithms UAI 2023
Regret Minimization via Saddle Point Optimization NIPS 2023
Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms NIPS 2022
Deciding What to Learn: A Rate-Distortion Approach ICML 2021
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits AISTATS 2021
Meta-Learning Effective Exploration Strategies for Contextual Bandits AAAI 2021
A Provably Efficient Sample Collection Strategy for Reinforcement Learning NIPS 2021
Epsilon-BMC: A Bayesian Ensemble Approach to Epsilon-Greedy Exploration in Model-Free Reinforcement Learning UAI 2019
AdaLinUCB: Opportunistic Learning for Contextual Bandits IJCAI 2019
Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs NIPS 2019
Thompson Sampling with Information Relaxation Penalties NIPS 2019
Monte Carlo Tree Search for Policy Optimization IJCAI 2019
Adaptive Learning with Unknown Information Flows NIPS 2018
Weight Uncertainty in Neural Network ICML 2015