Cover Image

Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Raymond, Hadiji, Hédi, Combes, Richard
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Statistical Inference under Adaptive Sampling with LinUCB
by: Fan, Wei, et al.
Published: (2025)

Scalable LinUCB: Low-Rank Design Matrix Updates for Recommenders with Large Action Spaces
by: Shustova, Evgenia, et al.
Published: (2025)

Tracking solutions of time-varying variational inequalities
by: Hadiji, Hédi, et al.
Published: (2024)

Diversity-Preserving K-Armed Bandits, Revisited
by: Hadiji, Hédi, et al.
Published: (2020)

An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
by: Sachs, Sarah, et al.
Published: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
by: Zhang, Raymond, et al.
Published: (2024)

On the Suboptimality of GP-UCB under Polynomial Effective Optimism
by: Wang, Wenjia, et al.
Published: (2023)

Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)

An extension of McDiarmid's inequality
by: Combes, Richard
Published: (2015)

Efficient Implementation of LinearUCB through Algorithmic Improvements and Vector Computing Acceleration for Embedded Learning Systems
by: Angioli, Marco, et al.
Published: (2025)

A characterization of sample adaptivity in UCB data
by: Chen, Yilun, et al.
Published: (2025)

UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity
by: Li, Zaile, et al.
Published: (2025)

Clus-UCB: A Near-Optimal Algorithm for Clustered Bandits
by: Gore, Aakash, et al.
Published: (2025)

UCB Exploration for Fixed-Budget Bayesian Best Arm Identification
by: Zhu, Rong J. B., et al.
Published: (2024)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Ellipsoid fitting with the Cayley transform
by: Melikechi, Omar, et al.
Published: (2023)

Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)

Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
by: Sarkar, Dhruv, et al.
Published: (2025)

UCB-driven Utility Function Search for Multi-objective Reinforcement Learning
by: Shi, Yucheng, et al.
Published: (2024)

DAK-UCB: Diversity-Aware Prompt Routing for LLMs and Generative Models
by: Jafari, Donya, et al.
Published: (2026)

Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits
by: Bui, Ha Manh, et al.
Published: (2024)

Provably Efficient UCB-type Algorithms For Learning Predictive State Representations
by: Huang, Ruiquan, et al.
Published: (2023)

UCB-type Algorithm for Budget-Constrained Expert Learning
by: Latypov, Ilgam, et al.
Published: (2025)

Precise Asymptotics and Refined Regret of Variance-Aware UCB
by: Fan, Yingying, et al.
Published: (2024)

Ellipsoidal Time Series Forecasting
by: Wang, Qilin
Published: (2025)

Persistent Homology via Ellipsoids
by: Canova, Niklas, et al.
Published: (2024)

Finding Manifolds With Bilinear Autoencoders
by: Dooms, Thomas, et al.
Published: (2025)

Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret
by: Hu, Bingshan, et al.
Published: (2025)

Restructuring Tractable Probabilistic Circuits
by: Zhang, Honghua, et al.
Published: (2024)

A Spatially Informed Gaussian Process UCB Method for Decentralized Coverage Control
by: Guidone, Gennaro, et al.
Published: (2025)

Extended UCB Policies for Multi-armed Bandit Problems
by: Liu, Keqin, et al.
Published: (2011)

Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
by: Cömer, Can, et al.
Published: (2025)

Reward-Based Online LLM Routing via NeuralUCB
by: Tsai, Ming-Hua, et al.
Published: (2026)

On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs
by: Dong, Zixuan, et al.
Published: (2022)

Bilinear autoencoders find interpretable manifolds
by: Dooms, Thomas, et al.
Published: (2026)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)

Contrastive UCB: Provably Efficient Contrastive Self-Supervised Learning in Online Reinforcement Learning
by: Qiu, Shuang, et al.
Published: (2022)