:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wang, Leo Muxing, Yang, Pengkun, Su, Lili
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2603.02426
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Collaborative Yet Personalized Policy Training: Single-Timescale Federated Actor-Critic
by: Wang, Leo Muxing, et al.
Published: (2026)

On the Convergence Rates of Federated Q-Learning across Heterogeneous Environments
by: Wang, Leo Muxing, et al.
Published: (2024)

On the Power of Source Screening for Learning Shared Feature Extractors
by: Wang, Leo Muxing, et al.
Published: (2026)

Learning with Shared Representations: Statistical Rates and Efficient Algorithms
by: Niu, Xiaochun, et al.
Published: (2024)

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
by: Hong, Kihyuk, et al.
Published: (2024)

Federated Learning in the Presence of Adversarial Client Unavailability
by: Su, Lili, et al.
Published: (2023)

A Finite Sample Analysis of Distributional TD Learning with Linear Function Approximation
by: Peng, Yang, et al.
Published: (2025)

Analysis of Off-Policy Multi-Step TD-Learning with Linear Function Approximation
by: Lee, Donghwan
Published: (2024)

Gaussian Approximation and Multiplier Bootstrap for Polyak-Ruppert Averaged Linear Stochastic Approximation with Applications to TD Learning
by: Samsonov, Sergey, et al.
Published: (2024)

SCAFFLSA: Taming Heterogeneity in Federated Linear Stochastic Approximation and TD Learning
by: Mangold, Paul, et al.
Published: (2024)

Bridging the Gap Between Average and Discounted TD Learning
by: Tian, Haoxing, et al.
Published: (2026)

Analysis of Off-Policy $n$-Step TD-Learning with Linear Function Approximation
by: Lim, Han-Dong, et al.
Published: (2025)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

Personalized Federated Learning via Feature Distribution Adaptation
by: Mclaughlin, Connor J., et al.
Published: (2024)

A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation
by: Mitra, Aritra
Published: (2024)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
by: Lee, Wei-Cheng, et al.
Published: (2025)

Two-Timescale Critic-Actor for Average Reward MDPs with Function Approximation
by: Panda, Prashansa, et al.
Published: (2024)

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span
by: Chae, Woojin, et al.
Published: (2024)

Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
by: Vakili, Sattar, et al.
Published: (2024)

Hierarchical Average-Reward Linearly-solvable Markov Decision Processes
by: Infante, Guillermo, et al.
Published: (2024)

TD-MPC-Opt: Distilling Model-Based Multi-Task Reinforcement Learning Agents
by: Kuzmenko, Dmytro, et al.
Published: (2025)

Asynchronous Stochastic Approximation with Applications to Average-Reward Reinforcement Learning
by: Yu, Huizhen, et al.
Published: (2024)

Provably Sample-Efficient Robust Reinforcement Learning with Average Reward
by: Roch, Zachary, et al.
Published: (2025)

Adaptive TD-Lambda for Cooperative Multi-agent Reinforcement Learning
by: Deng, Yue, et al.
Published: (2026)

A Concentration Bound for TD(0) with Function Approximation
by: Chandak, Siddharth, et al.
Published: (2023)

Implicit Updates for Average-Reward Temporal Difference Learning
by: Kim, Hwanwoo, et al.
Published: (2025)

Adaptive Personalized Federated Learning via Multi-task Averaging of Kernel Mean Embeddings
by: Fermanian, Jean-Baptiste, et al.
Published: (2026)

Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

One-Shot Averaging for Distributed TD($λ$) Under Markov Sampling
by: Tian, Haoxing, et al.
Published: (2024)

Convergence of TD(0) under Polynomial Mixing with Nonlinear Function Approximation
by: Sridhar, Anupama, et al.
Published: (2025)

Fast and Multiphase Rates for Nearest Neighbor Classifiers
by: Yang, Pengkun, et al.
Published: (2023)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs
by: Hong, Kihyuk, et al.
Published: (2025)

Closing the Gap between TD Learning and Supervised Learning with $Q$-Conditioned Maximization
by: Lei, Xing, et al.
Published: (2025)

On Feasible Rewards in Multi-Agent Inverse Reinforcement Learning
by: Freihaut, Till, et al.
Published: (2024)

Bandit Simulation for Average Reward Inference
by: Praharaj, Samya, et al.
Published: (2026)

Efficient $Q$-Learning and Actor-Critic Methods for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

Multi-State TD Target for Model-Free Reinforcement Learning
by: Wang, Wuhao, et al.
Published: (2024)

Federated Multi-Agent Deep Reinforcement Learning Approach via Physics-Informed Reward for Multi-Microgrid Energy Management
by: Li, Yuanzheng, et al.
Published: (2022)

Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation
by: Gonzales, Jake, et al.
Published: (2026)