:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wang, He, Xu, Xingyu, Chi, Yuejie
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2506.24005
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstruction
by: Xu, Xingyu, et al.
Published: (2024)

The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)

Agentic Transformers Provably Learn to Search via Reinforcement Learning
by: Yang, Tong, et al.
Published: (2026)

Communication-Efficient Federated Optimization over Semi-Decentralized Networks
by: Wang, He, et al.
Published: (2023)

Transformers Provably Learn Chain-of-Thought Reasoning with Length Generalization
by: Huang, Yu, et al.
Published: (2025)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
by: Yang, Tong, et al.
Published: (2025)

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
by: Yang, Tong, et al.
Published: (2025)

Polynomial Convergence of Riemannian Diffusion Models
by: Xu, Xingyu, et al.
Published: (2026)

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

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
by: Wang, He, et al.
Published: (2024)

Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
by: Shi, Laixi, et al.
Published: (2024)

Accelerating Convergence of Score-Based Diffusion Models, Provably
by: Li, Gen, et al.
Published: (2024)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

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

Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation
by: Dong, Harry, et al.
Published: (2024)

Provably Efficient Exploration in Policy Optimization
by: Cai, Qi, et al.
Published: (2019)

Vertical Federated Learning with Missing Features During Training and Inference
by: Valdeira, Pedro, et al.
Published: (2024)

Statistical and Algorithmic Foundations of Reinforcement Learning
by: Chi, Yuejie, et al.
Published: (2025)

Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL
by: Yang, Tong, et al.
Published: (2025)

A Theoretical Analysis of Self-Supervised Learning for Vision Transformers
by: Huang, Yu, et al.
Published: (2024)

Federated Offline Reinforcement Learning: Collaborative Single-Policy Coverage Suffices
by: Woo, Jiin, et al.
Published: (2024)

Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference
by: Dong, Harry, et al.
Published: (2024)

In-Context Learning with Representations: Contextual Generalization of Trained Transformers
by: Yang, Tong, et al.
Published: (2024)

Federated Natural Policy Gradient and Actor Critic Methods for Multi-task Reinforcement Learning
by: Yang, Tong, et al.
Published: (2023)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
by: Li, Gen, et al.
Published: (2020)

Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation
by: Xu, Tian, et al.
Published: (2024)

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization
by: Salgia, Sudeep, et al.
Published: (2025)

Provable Learning of Random Hierarchy Models and Hierarchical Shallow-to-Deep Chaining
by: Ren, Yunwei, et al.
Published: (2026)

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

Eidetic Learning: an Efficient and Provable Solution to Catastrophic Forgetting
by: Dronen, Nicholas, et al.
Published: (2025)

Provably Efficient Interactive-Grounded Learning with Personalized Reward
by: Zhang, Mengxiao, et al.
Published: (2024)

Communication-efficient Vertical Federated Learning via Compressed Error Feedback
by: Valdeira, Pedro, et al.
Published: (2024)

A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
by: Valdeira, Pedro, et al.
Published: (2023)

Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
by: Ishfaq, Haque, et al.
Published: (2023)

Diverse Randomized Value Functions: A Provably Pessimistic Approach for Offline Reinforcement Learning
by: Yu, Xudong, et al.
Published: (2024)

Scalable LLM Reasoning Acceleration with Low-rank Distillation
by: Dong, Harry, et al.
Published: (2025)

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
by: Li, Gen, et al.
Published: (2023)

Preconditioning Benefits of Spectral Orthogonalization in Muon
by: Ma, Jianhao, et al.
Published: (2026)