Co-occurring keywords · papers mentioning both
Papers
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
NeurIPS 2024
An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints
NeurIPS 2024
An Adaptive Implicit Hitting Set Algorithm for MAP and MPE Inference
PGM 2024
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
NeurIPS 2024
A Survey on Multi-player Bandits
JMLR 2024
A Unified Framework for Discovering Discrete Symmetries
AISTATS 2024
AutoRAG-HP: Automatic Online Hyper-Parameter Tuning for Retrieval-Augmented Generation
EMNLP 2024
Autoregressive Bandits
AISTATS 2024
Bandit Pareto Set Identification: the Fixed Budget Setting
AISTATS 2024
BanditQ:Fair Bandits with Guaranteed Rewards
UAI 2024
Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation
ICLR 2024
Bandits with Abstention under Expert Advice
NeurIPS 2024
Bandits with Concave Aggregated Reward
IJCAI 2024
Bandits with Ranking Feedback
NeurIPS 2024
Best Arm Identification with Resource Constraints
AISTATS 2024
Best Arm Identification with Retroactively Increased Sampling Budget for More Resource-Efficient HPO
IJCAI 2024
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
NeurIPS 2024
Building Higher-Order Abstractions from the Components of Recommender Systems
AAAI 2024
Can large language models explore in-context?
NeurIPS 2024
Can Probabilistic Feedback Drive User Impacts in Online Platforms?
AISTATS 2024
CapEEN: Image Captioning with Early Exits and Knowledge Distillation
EMNLP 2024
Causally Abstracted Multi-armed Bandits
UAI 2024
Code Repair with LLMs gives an Exploration-Exploitation Tradeoff
NeurIPS 2024
Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback
ICLR 2024
Combinatorial Stochastic-Greedy Bandit
AAAI 2024