:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Qin, Hao, Zhang, Chicheng
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	https://arxiv.org/abs/2602.09456
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
par: Qin, Hao, et autres
Publié: (2023)

Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications
par: Qin, Hao, et autres
Publié: (2025)

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
par: Jang, Kyoungseok, et autres
Publié: (2024)

Group-Sensitive Offline Contextual Bandits
par: Guo, Yihong, et autres
Publié: (2025)

Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits
par: Duong, Thang, et autres
Publié: (2025)

Bridging Lifelong and Multi-Task Representation Learning via Algorithm and Complexity Measure
par: Wang, Zhi, et autres
Publié: (2025)

Offline Contextual Bandits in the Presence of New Actions
par: Kishimoto, Ren, et autres
Publié: (2026)

Offline Contextual Bandit with Counterfactual Sample Identification
par: Gilotte, Alexandre, et autres
Publié: (2025)

Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff
par: Qian, Jian, et autres
Publié: (2024)

Learning with Incomplete Context: Linear Contextual Bandits with Pretrained Imputation
par: Yan, Hao, et autres
Publié: (2025)

Direction-Aware Offline-to-Online Learning in Linear Contextual Bandits
par: Han, Zean, et autres
Publié: (2026)

Oracle-Efficient Combinatorial Semi-Bandits
par: Kim, Jung-hun, et autres
Publié: (2025)

Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach
par: Li, Yinan, et autres
Publié: (2023)

Contextual Bandits for Unbounded Context Distributions
par: Zhao, Puning, et autres
Publié: (2024)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
par: Qin, Hao, et autres
Publié: (2025)

Leveraging Offline Data in Linear Latent Contextual Bandits
par: Kausik, Chinmaya, et autres
Publié: (2024)

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
par: Kim, Jung-hun, et autres
Publié: (2017)

Constrained Contextual Bandits with Adversarial Contexts
par: Sarkar, Dhruv, et autres
Publié: (2026)

Causal Contextual Bandits with Adaptive Context
par: Madhavan, Rahul, et autres
Publié: (2024)

Efficient Contextual Bandits with Uninformed Feedback Graphs
par: Zhang, Mengxiao, et autres
Publié: (2024)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
par: Ryu, J. Jon, et autres
Publié: (2025)

Towards Fundamental Limits for Active Multi-distribution Learning
par: Zhang, Chicheng, et autres
Publié: (2025)

Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms
par: Li, Yichen, et autres
Publié: (2023)

Interactive and Hybrid Imitation Learning: Provably Beating Behavior Cloning
par: Li, Yichen, et autres
Publié: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
par: Goyal, Tanmay, et autres
Publié: (2025)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
par: Erez, Liad, et autres
Publié: (2026)

Active Context Selection Improves Simple Regret in Contextual Bandits
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

Optimizing Warfarin Dosing Using Contextual Bandit: An Offline Policy Learning and Evaluation Method
par: Huang, Yong, et autres
Publié: (2024)

Offline Constrained RLHF with Multiple Preference Oracles
par: Latham, Brenden, et autres
Publié: (2026)

Efficient Generalized Low-Rank Tensor Contextual Bandits
par: Yi, Qianxin, et autres
Publié: (2023)

Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits
par: Chandak, Kushagra, et autres
Publié: (2025)

Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits
par: Zhao, Qingyue, et autres
Publié: (2025)

Efficient Adversarial Attacks on High-dimensional Offline Bandits
par: Hosseini, Seyed Mohammad Hadi, et autres
Publié: (2026)

IBCB: Efficient Inverse Batched Contextual Bandit for Behavioral Evolution History
par: Xu, Yi, et autres
Publié: (2024)

Contextual Linear Bandits with Delay as Payoff
par: Zhang, Mengxiao, et autres
Publié: (2025)

Improving the Data-efficiency of Reinforcement Learning by Warm-starting with LLM
par: Duong, Thang, et autres
Publié: (2025)

High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions
par: Huang, Ruiyuan, et autres
Publié: (2024)

Recycling History: Efficient Recommendations from Contextual Dueling Bandits
par: Sankagiri, Suryanarayana, et autres
Publié: (2025)

Bayesian Regret Minimization in Offline Bandits
par: Petrik, Marek, et autres
Publié: (2023)

Sparse Nonparametric Contextual Bandits
par: Flynn, Hamish, et autres
Publié: (2025)