Saved in:
| Main Authors: | Brunskill, Emma, Karmarkar, Ishani, Li, Zhaoqi |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.24803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsampling
by: Anand, Emile, et al.
Published: (2026)
by: Anand, Emile, et al.
Published: (2026)
Accelerating data-driven algorithm selection for combinatorial partitioning problems
by: Chatziafratis, Vaggos, et al.
Published: (2024)
by: Chatziafratis, Vaggos, et al.
Published: (2024)
Mean-Field Sampling for Cooperative Multi-Agent Reinforcement Learning
by: Anand, Emile, et al.
Published: (2024)
by: Anand, Emile, et al.
Published: (2024)
Truncated Variance Reduced Value Iteration
by: Jin, Yujia, et al.
Published: (2024)
by: Jin, Yujia, et al.
Published: (2024)
Subsampling Graphs with GNN Performance Guarantees
by: Jain, Mika Sarkin, et al.
Published: (2025)
by: Jain, Mika Sarkin, et al.
Published: (2025)
Linear Contextual Bandits with Interference
by: Xu, Yang, et al.
Published: (2024)
by: Xu, Yang, et al.
Published: (2024)
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
by: Jin, Yujia, et al.
Published: (2024)
by: Jin, Yujia, et al.
Published: (2024)
Contextual Linear Bandits with Delay as Payoff
by: Zhang, Mengxiao, et al.
Published: (2025)
by: Zhang, Mengxiao, et al.
Published: (2025)
Federated Linear Contextual Bandits with Heterogeneous Clients
by: Blaser, Ethan, et al.
Published: (2024)
by: Blaser, Ethan, et al.
Published: (2024)
When are LLMs Sufficient Policy Optimizers for Sequential RL Tasks?
by: Hatgis-Kessell, Stephane, et al.
Published: (2026)
by: Hatgis-Kessell, Stephane, et al.
Published: (2026)
Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)
by: Buening, Thomas Kleine, et al.
Published: (2024)
Direction-Aware Offline-to-Online Learning in Linear Contextual Bandits
by: Han, Zean, et al.
Published: (2026)
by: Han, Zean, et al.
Published: (2026)
Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation
by: Yan, Hao, et al.
Published: (2025)
by: Yan, Hao, et al.
Published: (2025)
Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
by: Kang, Yue, et al.
Published: (2025)
by: Kang, Yue, et al.
Published: (2025)
Partially Observable Contextual Bandits with Linear Payoffs
by: Zeng, Sihan, et al.
Published: (2024)
by: Zeng, Sihan, et al.
Published: (2024)
Learning Peer Influence Probabilities with Linear Contextual Bandits
by: Faruk, Ahmed Sayeed, et al.
Published: (2025)
by: Faruk, Ahmed Sayeed, et al.
Published: (2025)
Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)
by: Wang, Zhengmiao, et al.
Published: (2026)
On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)
by: Li, Jiachun, et al.
Published: (2024)
Scaling Federated Linear Contextual Bandits via Sketching
by: Yang, Hantao, et al.
Published: (2026)
by: Yang, Hantao, et al.
Published: (2026)
A Reduction Algorithm for Markovian Contextual Linear Bandits
by: Buyukkalayci, Kaan, et al.
Published: (2026)
by: Buyukkalayci, Kaan, et al.
Published: (2026)
Conservative Contextual Bandits: Beyond Linear Representations
by: Deb, Rohan, et al.
Published: (2024)
by: Deb, Rohan, et al.
Published: (2024)
Linear Contextual Bandits with Hybrid Payoff: Revisited
by: Das, Nirjhar, et al.
Published: (2024)
by: Das, Nirjhar, et al.
Published: (2024)
Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)
by: Park, Somangchan, et al.
Published: (2025)
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)
by: Kuroki, Yuko, et al.
Published: (2023)
Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
by: Lin, Jiabin, et al.
Published: (2024)
by: Lin, Jiabin, et al.
Published: (2024)
Short-Long Policy Evaluation with Novel Actions
by: Nam, Hyunji Alex, et al.
Published: (2024)
by: Nam, Hyunji Alex, et al.
Published: (2024)
Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)
by: Huang, Ziyi, et al.
Published: (2024)
Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent
by: Chang, Xiangyu, et al.
Published: (2022)
by: Chang, Xiangyu, et al.
Published: (2022)
Active Context Selection Improves Simple Regret in Contextual Bandits
by: Shahverdikondori, Mohammad, et al.
Published: (2026)
by: Shahverdikondori, Mohammad, et al.
Published: (2026)
Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)
by: Hwang, Taehyun, et al.
Published: (2026)
Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits
by: Sarmasarkar, Sahasrajit
Published: (2026)
by: Sarmasarkar, Sahasrajit
Published: (2026)
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits
by: Kang, Yue, et al.
Published: (2023)
by: Kang, Yue, et al.
Published: (2023)
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)
by: van Erven, Tim, et al.
Published: (2025)
Leveraging Offline Data in Linear Latent Contextual Bandits
by: Kausik, Chinmaya, et al.
Published: (2024)
by: Kausik, Chinmaya, et al.
Published: (2024)
Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)
by: Zhao, Rui, et al.
Published: (2025)
Experiment Planning with Function Approximation
by: Pacchiano, Aldo, et al.
Published: (2024)
by: Pacchiano, Aldo, et al.
Published: (2024)
Attack-Resistant Uniform Fairness for Linear and Smooth Contextual Bandits
by: Zhang, Qingwen, et al.
Published: (2026)
by: Zhang, Qingwen, et al.
Published: (2026)
Active Human Feedback Collection via Neural Contextual Dueling Bandits
by: Verma, Arun, et al.
Published: (2025)
by: Verma, Arun, et al.
Published: (2025)
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)
by: Di, Qiwei, et al.
Published: (2023)
Pessimistic Risk-Aware Policy Learning in Contextual Bandits
by: Wan, Yilong, et al.
Published: (2026)
by: Wan, Yilong, et al.
Published: (2026)
Similar Items
-
Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsampling
by: Anand, Emile, et al.
Published: (2026) -
Accelerating data-driven algorithm selection for combinatorial partitioning problems
by: Chatziafratis, Vaggos, et al.
Published: (2024) -
Mean-Field Sampling for Cooperative Multi-Agent Reinforcement Learning
by: Anand, Emile, et al.
Published: (2024) -
Truncated Variance Reduced Value Iteration
by: Jin, Yujia, et al.
Published: (2024) -
Subsampling Graphs with GNN Performance Guarantees
by: Jain, Mika Sarkin, et al.
Published: (2025)