Cover Image

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Güçlü, Arda, Bose, Subhonmesh
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Detection Augmented Bandit Procedures for Piecewise Stationary MABs: A Modular Approach
by: Huang, Yu-Han, et al.
Published: (2025)

Any-Time Regret-Guaranteed Algorithm for Control of Linear Quadratic Systems
by: Chekan, Jafar Abbaszadeh, et al.
Published: (2024)

Nonparametric Sparse Online Learning of the Koopman Operator
by: Hou, Boya, et al.
Published: (2025)

Worst-Case Regret Bounds for Exploration via Randomized Value Functions
by: Russo, Daniel
Published: (2019)

Pricing Problems in Adoption of New Technologies
by: Wang, Yijin, et al.
Published: (2025)

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
by: Manupriya, Piyushi, et al.
Published: (2025)

Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards
by: Adams, Katherine B., et al.
Published: (2025)

Learning Decentralized Linear Quadratic Regulators with $\sqrt{T}$ Regret
by: Ye, Lintao, et al.
Published: (2022)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem
by: Krishnamurthy, Vikram
Published: (2025)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

Nonasymptotic Regret Analysis of Adaptive Linear Quadratic Control with Model Misspecification
by: Lee, Bruce D., et al.
Published: (2023)

Multi-Agent Stage-wise Conservative Linear Bandits
by: Afsharrad, Amirhossein, et al.
Published: (2025)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)

Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control
by: Lee, Bruce D., et al.
Published: (2024)

Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
by: Kim, Yeoneung, et al.
Published: (2024)

Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: $\sqrt{T}$-Regret
by: Schiffer, Benjamin, et al.
Published: (2025)

An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2025)

Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2021)

Restless Bandit Problem with Rewards Generated by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2024)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

MESS+: Energy-Optimal Inferencing in Language Model Zoos with Service Level Guarantees
by: Zhang, Ryan, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Regret Analysis: a control perspective
by: Gibson, Travis E., et al.
Published: (2025)

Sublinear Regret for a Class of Continuous-Time Linear-Quadratic Reinforcement Learning Problems
by: Huang, Yilie, et al.
Published: (2024)

CLT-Optimal Parameter Error Bounds for Linear System Identification
by: Zhou, Yichen, et al.
Published: (2026)

Harnessing Information in Incentive Design
by: Velicheti, Raj Kiriti, et al.
Published: (2025)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)

Online Linear Quadratic Tracking with Regret Guarantees
by: Karapetyan, Aren, et al.
Published: (2023)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)

Bandit Algorithms for Deep Brain Stimulation
by: Gupta, Arkaprava, et al.
Published: (2026)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
by: Haque, Shaan Ul, et al.
Published: (2023)

Logarithmic Regret and Polynomial Scaling in Online Multi-step-ahead Prediction
by: Qian, Jiachen, et al.
Published: (2025)

$O(1/k)$ Finite-Time Bound for Non-Linear Two-Time-Scale Stochastic Approximation
by: Chandak, Siddharth
Published: (2025)

Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets
by: Taha, Feras Al, et al.
Published: (2025)

Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares
by: Pai, Chih-Fan, et al.
Published: (2026)

Faster Q-Learning Algorithms for Restless Bandits
by: Kakarapalli, Parvish, et al.
Published: (2024)