Co-occurring keywords · papers mentioning both
Papers
Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood
JMLR 2026
Bi-Level Contextual Bandits for Individualized Resource Allocation Under Delayed Feedback
AAAI 2026
Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract)
AAAI 2026
Exploiting Concavity Information in Contextual Bandit Optimization
UAI 2026
Fast Best-in-Class Regret for Contextual Bandits
UAI 2026
Federated Linear Dueling Bandits
AAAI 2026
Learning to Collaborate: An Orchestrated-Decentralized Framework for Peer-to-Peer LLM Federation
AAAI 2026
Multi-Armed Bandits Meet Large Language Models
AAAI 2026
Neural Exploitation and Exploration of Contextual Bandits
JMLR 2026
Online Multi-LLM Selection via Contextual Bandits Under Unstructured Context Evolution
AAAI 2026
Optimizing User Profiles via Contextual Bandits for Retrieval-Augmented LLM Personalization
ACL 2026
Should You Use Your Large Language Model to Explore or Exploit?
UAI 2026
Sparse Nonparametric Contextual Bandits
ALT 2026
Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits
COLT 2026
The Role of Contextual Information in Best Arm Identification
JMLR 2026
The Sample Complexity of Multiclass and Sparse Contextual Bandits
COLT 2026
AdaO2B: Adaptive Online to Batch Conversion for Out-of-Distribution Generalization
AAAI 2025
Adaptive LLM Routing under Budget Constraints
EMNLP 2025
Algorithmic Recourse for Long-Term Improvement
ICML 2025
A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
AISTATS 2025
BayesCNS: A Unified Bayesian Approach to Address Cold Start and Non-Stationarity in Search Systems at Scale
AAAI 2025
Contextual Bandits for Unbounded Context Distributions
ICML 2025
Contextual Bandits with Stage-wise Constraints
JMLR 2025
Cost-Aware Near-Optimal Policy Learning
AAAI 2025
Cross-Domain Off-Policy Evaluation and Learning for Contextual Bandits
ICLR 2025