Imagen de Portada

Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Croissant, Lorenzo
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Thresholding Linear Bandit
por: Rivera, Eduardo Ochoa, et al.
Publicado: (2024)

Optimal Batched Linear Bandits
por: Ren, Xuanfei, et al.
Publicado: (2024)

Optimal and Practical Batched Linear Bandit Algorithm
por: Yu, Sanghoon, et al.
Publicado: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
por: Zhang, Raymond, et al.
Publicado: (2025)

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
por: Cao, Junyu, et al.
Publicado: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
por: Huang, Ziyi, et al.
Publicado: (2024)

Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals
por: Liu, Ziyi, et al.
Publicado: (2024)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
por: Cassel, Asaf, et al.
Publicado: (2024)

On Transportability for Structural Causal Bandits
por: Park, Min Woo, et al.
Publicado: (2025)

On the Optimal Regret of Locally Private Linear Contextual Bandit
por: Li, Jiachun, et al.
Publicado: (2024)

Restless Linear Bandits
por: Khaleghi, Azadeh
Publicado: (2024)

Infrequent Exploration in Linear Bandits
por: Lee, Harin, et al.
Publicado: (2025)

Federated Linear Dueling Bandits
por: Huang, Xuhan, et al.
Publicado: (2025)

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
por: Kang, Yue, et al.
Publicado: (2025)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
por: Zhang, Yu-Jie, et al.
Publicado: (2025)

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
por: Yu, Sanghoon, et al.
Publicado: (2026)

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
por: Liu, Haolin, et al.
Publicado: (2024)

Linear Contextual Bandits with Interference
por: Xu, Yang, et al.
Publicado: (2024)

Linear Bandits with Partially Observable Features
por: Kim, Wonyoung, et al.
Publicado: (2025)

Contextual Linear Bandits with Delay as Payoff
por: Zhang, Mengxiao, et al.
Publicado: (2025)

Self-Concordant Perturbations for Linear Bandits
por: Lévy, Lucas, et al.
Publicado: (2025)

Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
por: Huang, Xinmeng, et al.
Publicado: (2023)

Generalized Linear Bandits with Limited Adaptivity
por: Sawarni, Ayush, et al.
Publicado: (2024)

Symmetric Linear Bandits with Hidden Symmetry
por: Tran, Nam Phuong, et al.
Publicado: (2024)

Pure Exploration in Bandits with Linear Constraints
por: Carlsson, Emil, et al.
Publicado: (2023)

Directional Optimism for Safe Linear Bandits
por: Hutchinson, Spencer, et al.
Publicado: (2023)

Sparse Linear Bandits with Blocking Constraints
por: Jain, Adit, et al.
Publicado: (2024)

Robust Causal Bandits for Linear Models
por: Yan, Zirui, et al.
Publicado: (2023)

On Pareto Optimality for Parametric Choice Bandits
por: Zuo, Jierui, et al.
Publicado: (2025)

Optimal Regret for Single Index Bandits
por: Dey, Devdan, et al.
Publicado: (2026)

Optimal Clustering with Bandit Feedback
por: Yang, Junwen, et al.
Publicado: (2022)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
por: Liu, Jingyu, et al.
Publicado: (2025)

Improved Algorithms for Nash Welfare in Linear Bandits
por: Sarkar, Dhruv, et al.
Publicado: (2026)

Distributed Linear Bandits under Communication Constraints
por: Salgia, Sudeep, et al.
Publicado: (2022)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
por: Jin, Tianyuan, et al.
Publicado: (2024)

Active Learning for Stochastic Contextual Linear Bandits
por: Brunskill, Emma, et al.
Publicado: (2026)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
por: Zhu, Yifan, et al.
Publicado: (2026)

A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)

Safe Linear Bandits over Unknown Polytopes
por: Gangrade, Aditya, et al.
Publicado: (2022)

Partially Observable Contextual Bandits with Linear Payoffs
por: Zeng, Sihan, et al.
Publicado: (2024)