:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhang, Haochen, Zheng, Zhong, Xue, Lingzhou
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2506.04626
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
by: Zheng, Zhong, et al.
Published: (2024)

Q-Learning with Fine-Grained Gap-Dependent Regret
by: Zhang, Haochen, et al.
Published: (2025)

Federated Q-Learning: Linear Regret Speedup with Low Communication Cost
by: Zheng, Zhong, et al.
Published: (2023)

Gap-Dependent Bounds for Federated $Q$-learning
by: Zhang, Haochen, et al.
Published: (2025)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
by: Zhang, Haochen, et al.
Published: (2026)

Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
by: Zheng, Zhong, et al.
Published: (2024)

Smoothed Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)

A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2023)

A Copula Graphical Model for Multi-Attribute Data using Optimal Transport
by: Zhang, Qi, et al.
Published: (2024)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
by: Tuynman, Adrienne, et al.
Published: (2022)

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

Distributed Networked Multi-task Learning
by: Hong, Lingzhou, et al.
Published: (2024)

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
by: Zhong, Han, et al.
Published: (2023)

Understanding the Statistical Accuracy-Communication Trade-off in Personalized Federated Learning with Minimax Guarantees
by: Yu, Xin, et al.
Published: (2024)

AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projections
by: Yu, Xin, et al.
Published: (2025)

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

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)

ProFL: Performative Robust Optimal Federated Learning
by: Zheng, Xue, et al.
Published: (2024)

Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning
by: Pan, Jingduo, et al.
Published: (2026)

Logarithmic Regret for Online KL-Regularized Reinforcement Learning
by: Zhao, Heyang, et al.
Published: (2025)

Low-Regret and Low-Complexity Learning for Hierarchical Inference
by: Chattopadhyay, Sameep, et al.
Published: (2025)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2026)

Stagewise Reinforcement Learning and the Geometry of the Regret Landscape
by: Elliott, Chris, et al.
Published: (2026)

Statistical Convergence Rates of Optimal Transport Map Estimation between General Distributions
by: Ding, Yizhe, et al.
Published: (2024)

No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)

Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
by: Labbi, Safwan, et al.
Published: (2024)

Test-Time Regret Minimization in Meta Reinforcement Learning
by: Mutti, Mirco, et al.
Published: (2024)

Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
by: Provodin, Danil, et al.
Published: (2024)

Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)

Regret-Free Reinforcement Learning for LTL Specifications
by: Majumdar, Rupak, et al.
Published: (2024)

Regret-Based Defense in Adversarial Reinforcement Learning
by: Belaire, Roman, et al.
Published: (2023)

Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)

PrunedLoRA: Robust Gradient-Based structured pruning for Low-rank Adaptation in Fine-tuning
by: Yu, Xin, et al.
Published: (2025)

EXACT: Explicit Attribute-Guided Decoding-Time Personalization
by: Yu, Xin, et al.
Published: (2026)

Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing
by: Yang, Xuwei, et al.
Published: (2023)