High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
Fuente:
arXiv
Guardado en:
| Autores principales: | Huang, Ruiyuan, Huang, Zengfeng |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback
por: Huang, Ruiyuan, et al.
Publicado: (2025)
por: Huang, Ruiyuan, et al.
Publicado: (2025)
Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits
por: Huang, Ruiyuan, et al.
Publicado: (2026)
por: Huang, Ruiyuan, et al.
Publicado: (2026)
Contextual Bandits for Unbounded Context Distributions
por: Zhao, Puning, et al.
Publicado: (2024)
por: Zhao, Puning, et al.
Publicado: (2024)
Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
por: Kang, Yue, et al.
Publicado: (2025)
por: Kang, Yue, et al.
Publicado: (2025)
Learning Peer Influence Probabilities with Linear Contextual Bandits
por: Faruk, Ahmed Sayeed, et al.
Publicado: (2025)
por: Faruk, Ahmed Sayeed, et al.
Publicado: (2025)
Constrained Contextual Bandits with Adversarial Contexts
por: Sarkar, Dhruv, et al.
Publicado: (2026)
por: Sarkar, Dhruv, et al.
Publicado: (2026)
Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation
por: Yan, Hao, et al.
Publicado: (2025)
por: Yan, Hao, et al.
Publicado: (2025)
Causal Contextual Bandits with Adaptive Context
por: Madhavan, Rahul, et al.
Publicado: (2024)
por: Madhavan, Rahul, et al.
Publicado: (2024)
Load--Reserve Wasserstein Propagation for Isotropic Diffusion Samplers
por: Lyu, Zicheng, et al.
Publicado: (2026)
por: Lyu, Zicheng, et al.
Publicado: (2026)
Queue Length Regret Bounds for Contextual Queueing Bandits
por: Bae, Seoungbin, et al.
Publicado: (2026)
por: Bae, Seoungbin, et al.
Publicado: (2026)
Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits
por: Chandak, Kushagra, et al.
Publicado: (2025)
por: Chandak, Kushagra, et al.
Publicado: (2025)
Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Bandits
por: Shen, Yi, et al.
Publicado: (2023)
por: Shen, Yi, et al.
Publicado: (2023)
Learning-Based User Association for MmWave Vehicular Networks With Kernelized Contextual Bandits
por: He, Xiaoyang, et al.
Publicado: (2025)
por: He, Xiaoyang, et al.
Publicado: (2025)
Second Order Bounds for Contextual Bandits with Function Approximation
por: Pacchiano, Aldo
Publicado: (2024)
por: Pacchiano, Aldo
Publicado: (2024)
Variance-Dependent Regret Lower Bounds for Contextual Bandits
por: He, Jiafan, et al.
Publicado: (2025)
por: He, Jiafan, et al.
Publicado: (2025)
Active Context Selection Improves Simple Regret in Contextual Bandits
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)
Causal Bandit Over Unknown Graphs: Upper Confidence Bounds With Backdoor Adjustment
por: Zhao, Yijia, et al.
Publicado: (2025)
por: Zhao, Yijia, et al.
Publicado: (2025)
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
por: Di, Qiwei, et al.
Publicado: (2023)
por: Di, Qiwei, et al.
Publicado: (2023)
In-Context Learning as Nonparametric Conditional Probability Estimation: Risk Bounds and Optimality
por: Liu, Chenrui, et al.
Publicado: (2025)
por: Liu, Chenrui, et al.
Publicado: (2025)
High-dimensional Nonparametric Contextual Bandit Problem
por: Iwazaki, Shogo, et al.
Publicado: (2025)
por: Iwazaki, Shogo, et al.
Publicado: (2025)
Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
por: Levy, Orin, et al.
Publicado: (2025)
por: Levy, Orin, et al.
Publicado: (2025)
Your Graph Recommender is Provably a Single-view Graph Contrastive Learning
por: Yang, Wenjie, et al.
Publicado: (2024)
por: Yang, Wenjie, et al.
Publicado: (2024)
Active Learning for Stochastic Contextual Linear Bandits
por: Brunskill, Emma, et al.
Publicado: (2026)
por: Brunskill, Emma, et al.
Publicado: (2026)
High-dimensional Contextual Bandit Problem without Sparsity
por: Komiyama, Junpei, et al.
Publicado: (2023)
por: Komiyama, Junpei, et al.
Publicado: (2023)
Learning When to Trust in Contextual Bandits
por: Ghasemi, Majid, et al.
Publicado: (2026)
por: Ghasemi, Majid, et al.
Publicado: (2026)
Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
por: Ryu, J. Jon, et al.
Publicado: (2025)
por: Ryu, J. Jon, et al.
Publicado: (2025)
Optimizing Warfarin Dosing Using Contextual Bandit: An Offline Policy Learning and Evaluation Method
por: Huang, Yong, et al.
Publicado: (2024)
por: Huang, Yong, et al.
Publicado: (2024)
Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood
por: Liu, Ziyi, et al.
Publicado: (2024)
por: Liu, Ziyi, et al.
Publicado: (2024)
Quantum-Enhanced Neural Contextual Bandit Algorithms
por: Huang, Yuqi, et al.
Publicado: (2026)
por: Huang, Yuqi, et al.
Publicado: (2026)
Sparse Nonparametric Contextual Bandits
por: Flynn, Hamish, et al.
Publicado: (2025)
por: Flynn, Hamish, et al.
Publicado: (2025)
Pessimistic Risk-Aware Policy Learning in Contextual Bandits
por: Wan, Yilong, et al.
Publicado: (2026)
por: Wan, Yilong, et al.
Publicado: (2026)
Robust Linear Dueling Bandits with Post-serving Context under Unknown Delays and Adversarial Corruptions
por: Oh, Youngmin
Publicado: (2026)
por: Oh, Youngmin
Publicado: (2026)
Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution
por: Poon, Manhin, et al.
Publicado: (2025)
por: Poon, Manhin, et al.
Publicado: (2025)
A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression
por: Sarkar, Dhruv, et al.
Publicado: (2026)
por: Sarkar, Dhruv, et al.
Publicado: (2026)
Contextual Bandits with Non-Stationary Correlated Rewards for User Association in MmWave Vehicular Networks
por: He, Xiaoyang, et al.
Publicado: (2024)
por: He, Xiaoyang, et al.
Publicado: (2024)
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
por: Xu, Yunbei, et al.
Publicado: (2020)
por: Xu, Yunbei, et al.
Publicado: (2020)
Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
por: Goyal, Tanmay, et al.
Publicado: (2025)
por: Goyal, Tanmay, et al.
Publicado: (2025)
Transfer Learning for Contextual Multi-armed Bandits
por: Cai, Changxiao, et al.
Publicado: (2022)
por: Cai, Changxiao, et al.
Publicado: (2022)
Safe Linear Bandits over Unknown Polytopes
por: Gangrade, Aditya, et al.
Publicado: (2022)
por: Gangrade, Aditya, et al.
Publicado: (2022)
Navigating Sparsities in High-Dimensional Linear Contextual Bandits
por: Zhao, Rui, et al.
Publicado: (2025)
por: Zhao, Rui, et al.
Publicado: (2025)
Ejemplares similares
-
Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback
por: Huang, Ruiyuan, et al.
Publicado: (2025) -
Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits
por: Huang, Ruiyuan, et al.
Publicado: (2026) -
Contextual Bandits for Unbounded Context Distributions
por: Zhao, Puning, et al.
Publicado: (2024) -
Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
por: Kang, Yue, et al.
Publicado: (2025) -
Learning Peer Influence Probabilities with Linear Contextual Bandits
por: Faruk, Ahmed Sayeed, et al.
Publicado: (2025)