Episodic Contextual Bandits with Knapsacks under Conversion Models
Fuente:
arXiv
Saved in:
| Main Authors: | Cheung, Wang Chi, Li, Zitian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
by: Li, Zitian, et al.
Published: (2026)
by: Li, Zitian, et al.
Published: (2026)
Near Optimal Non-asymptotic Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2025)
by: Li, Zitian, et al.
Published: (2025)
Best Arm Identification with Resource Constraints
by: Li, Zitian, et al.
Published: (2024)
by: Li, Zitian, et al.
Published: (2024)
Closing the Gap on the Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2026)
by: Li, Zitian, et al.
Published: (2026)
Learning with a Budget: Identifying the Best Arm with Resource Constraints
by: Li, Zitian, et al.
Published: (2026)
by: Li, Zitian, et al.
Published: (2026)
Bandits with Anytime Knapsacks
by: Elumar, Eray Can, et al.
Published: (2025)
by: Elumar, Eray Can, et al.
Published: (2025)
Online Bandits with (Biased) Offline Data: Adaptive Learning under Distribution Mismatch
by: Cheung, Wang Chi, et al.
Published: (2024)
by: Cheung, Wang Chi, et al.
Published: (2024)
High-dimensional Linear Bandits with Knapsacks
by: Ma, Wanteng, et al.
Published: (2023)
by: Ma, Wanteng, et al.
Published: (2023)
Contextual Decision-Making with Knapsacks Beyond the Worst Case
by: Chen, Zhaohua, et al.
Published: (2022)
by: Chen, Zhaohua, et al.
Published: (2022)
Leveraging the Power of Conversations: Optimal Key Term Selection in Conversational Contextual Bandits
by: Liu, Maoli, et al.
Published: (2025)
by: Liu, Maoli, et al.
Published: (2025)
Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
by: Simchi-Levi, David, et al.
Published: (2019)
by: Simchi-Levi, David, et al.
Published: (2019)
MNL-Bandit with Knapsacks: a near-optimal algorithm
by: Aznag, Abdellah, et al.
Published: (2021)
by: Aznag, Abdellah, et al.
Published: (2021)
Contextual Bandits for Unbounded Context Distributions
by: Zhao, Puning, et al.
Published: (2024)
by: Zhao, Puning, et al.
Published: (2024)
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond
by: Liu, Xutong, et al.
Published: (2024)
by: Liu, Xutong, 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)
Diffusion Models Meet Contextual Bandits
by: Aouali, Imad
Published: (2024)
by: Aouali, Imad
Published: (2024)
Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)
by: Flynn, Hamish, et al.
Published: (2025)
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025)
by: Su, Yuexin, et al.
Published: (2025)
Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
by: Sharma, Nihal, et al.
Published: (2021)
by: Sharma, Nihal, et al.
Published: (2021)
Federated Linear Contextual Bandits with Heterogeneous Clients
by: Blaser, Ethan, et al.
Published: (2024)
by: Blaser, Ethan, et al.
Published: (2024)
PAC Off-Policy Prediction of Contextual Bandits
by: Wan, Yilong, et al.
Published: (2025)
by: Wan, Yilong, et al.
Published: (2025)
Active Learning for Stochastic Contextual Linear Bandits
by: Brunskill, Emma, et al.
Published: (2026)
by: Brunskill, Emma, et al.
Published: (2026)
Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)
by: Goyal, Tanmay, et al.
Published: (2025)
Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
by: Huang, Xinmeng, et al.
Published: (2023)
by: Huang, Xinmeng, et al.
Published: (2023)
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)
Distributionally Robust Policy Evaluation under General Covariate Shift in Contextual Bandits
by: Guo, Yihong, et al.
Published: (2024)
by: Guo, Yihong, et al.
Published: (2024)
Linear Contextual Bandits with Interference
by: Xu, Yang, et al.
Published: (2024)
by: Xu, Yang, et al.
Published: (2024)
Generalized Low-Rank Matrix Contextual Bandits with Graph Information
by: Wang, Yao, et al.
Published: (2025)
by: Wang, Yao, et al.
Published: (2025)
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)
by: Ito, Shinji, et al.
Published: (2025)
Group-Sensitive Offline Contextual Bandits
by: Guo, Yihong, et al.
Published: (2025)
by: Guo, Yihong, et al.
Published: (2025)
Multiplayer Information Asymmetric Contextual Bandits
by: Chang, William, et al.
Published: (2025)
by: Chang, William, et al.
Published: (2025)
Differentially Private Kernelized Contextual Bandits
by: Pavlovic, Nikola, et al.
Published: (2025)
by: Pavlovic, Nikola, et al.
Published: (2025)
Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)
by: Ban, Yikun, et al.
Published: (2023)
Uncertainty of Joint Neural Contextual Bandit
by: Guo, Hongbo, et al.
Published: (2024)
by: Guo, Hongbo, et al.
Published: (2024)
Contextual Bandits with Stage-wise Constraints
by: Pacchiano, Aldo, et al.
Published: (2024)
by: Pacchiano, Aldo, et al.
Published: (2024)
Constrained Contextual Bandits with Adversarial Contexts
by: Sarkar, Dhruv, et al.
Published: (2026)
by: Sarkar, Dhruv, et al.
Published: (2026)
Designing an Interpretable Interface for Contextual Bandits
by: Maher, Andrew, et al.
Published: (2024)
by: Maher, Andrew, et al.
Published: (2024)
Pessimistic Risk-Aware Policy Learning in Contextual Bandits
by: Wan, Yilong, et al.
Published: (2026)
by: Wan, Yilong, 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)
Conversational Dueling Bandits in Generalized Linear Models
by: Yang, Shuhua, et al.
Published: (2024)
by: Yang, Shuhua, et al.
Published: (2024)
Similar Items
-
Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
by: Li, Zitian, et al.
Published: (2026) -
Near Optimal Non-asymptotic Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2025) -
Best Arm Identification with Resource Constraints
by: Li, Zitian, et al.
Published: (2024) -
Closing the Gap on the Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2026) -
Learning with a Budget: Identifying the Best Arm with Resource Constraints
by: Li, Zitian, et al.
Published: (2026)