:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Fan, Junyi, Han, Yuxuan, Zeng, Jialin, Cai, Jian-Feng, Wang, Yang, Xiang, Yang, Zhang, Jiheng
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2403.11544
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
by: Feng, Songtao, et al.
Published: (2023)

Distributionally Robust Online Markov Game with Linear Function Approximation
by: Zheng, Zewu, et al.
Published: (2025)

Improved Generalization Bounds for Transductive Learning by Transductive Local Complexity and Its Applications
by: Yang, Yingzhen
Published: (2023)

Efficient Transfer Learning via Causal Bounds
by: Gong, Xueping, et al.
Published: (2023)

Independent and Decentralized Learning in Markov Potential Games
by: Maheshwari, Chinmay, et al.
Published: (2022)

Independent Learning in Constrained Markov Potential Games
by: Jordan, Philip, et al.
Published: (2024)

Independent Learning in Performative Markov Potential Games
by: Sahitaj, Rilind, et al.
Published: (2025)

Improved Amenability Bounds for Local Coordination Games
by: Peretz, Ron, et al.
Published: (2026)

On the Existence of Sum‐Of‐Squares Lyapunov Functions for Polynomial Parameter‐Varying Systems With Locally Exponential Stability
by: Jialin Chen, et al.
Published: (2025)

An Evolutionary Game With the Game Transitions Based on the Markov Process
by: Feng, Minyu, et al.
Published: (2025)

Approximation of Functions: Optimal Sampling and Complexity
by: Krieg, David, et al.
Published: (2026)

Approximate State Abstraction for Markov Games
by: Ishibashi, Hiroki, et al.
Published: (2024)

Finite-Sample Analysis of Nonlinear Independent Component Analysis:Sample Complexity and Identifiability Bounds
by: Jiang, Yuwen
Published: (2026)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency
by: Cai, Qi, et al.
Published: (2022)

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

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

Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation
by: He, Jianliang, et al.
Published: (2024)

Value Function Decomposition in Markov Recommendation Process
by: Wang, Xiaobei, et al.
Published: (2025)

Improved Sample Complexity Bounds for Diffusion Model Training
by: Gupta, Shivam, et al.
Published: (2023)

Space-Bounded Communication Complexity of Unitaries
by: Li, Longcheng, et al.
Published: (2025)

Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
by: Buckley, Max, et al.
Published: (2025)

Backward-Friendly Optimization: Training Large Language Models with Approximate Gradients under Memory Constraints
by: Yang, Jing, et al.
Published: (2025)

New and Improved Bounds for Markov Paging
by: Pabbaraju, Chirag, et al.
Published: (2025)

Practical Global and Local Bounds in Gaussian Process Regression via Chaining
by: Liu, Junyi, et al.
Published: (2025)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
by: Liu, Hongcheng, et al.
Published: (2024)

Misspecified $Q$-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error
by: Du, Ally Yalei, et al.
Published: (2024)

Achieving Optimal Sample Complexity for a Broader Class of Signals in Sparse Phase Retrieval
by: Xu, Mengchu, et al.
Published: (2025)

VI-CuRL: Stabilizing Verifier-Independent RL Reasoning via Confidence-Guided Variance Reduction
by: Cai, Xin-Qiang, et al.
Published: (2026)

Improving Reinforcement Learning Sample-Efficiency using Local Approximation
by: Prashant, Mohit, et al.
Published: (2025)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
by: Cai, Yang, et al.
Published: (2024)

Design of a Linearity Improved Hybrid Asymmetric Load Modulated Balanced Amplifier
by: Benhao Jin, et al.
Published: (2026)

Sample Complexity Bounds for Estimating Probability Divergences under Invariances
by: Tahmasebi, Behrooz, et al.
Published: (2023)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation
by: Gai, Jingchu, et al.
Published: (2026)

FlowPortal: Residual-Corrected Flow for Training-Free Video Relighting and Background Replacement
by: Gao, Wenshuo, et al.
Published: (2025)

Thompson Sampling in Online RLHF with General Function Approximation
by: Feng, Songtao, et al.
Published: (2025)

Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
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)