Cover Image

High-probability sample complexities for policy evaluation with linear function approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Gen, Wu, Weichen, Chi, Yuejie, Ma, Cong, Rinaldo, Alessandro, Wei, Yuting
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Information Theory Optimization and Control Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
by: Li, Gen, et al.
Published: (2022)

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

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

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

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024)

Theory and applications of the Sum-Of-Squares technique
by: Bach, Francis, et al.
Published: (2023)

Uncertainty Quantification of Spectral Estimator and MLE for Orthogonal Group Synchronization
by: Zhong, Ziliang Samuel, et al.
Published: (2024)

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
by: Ling, Shuyang
Published: (2024)

Off-policy estimation with adaptively collected data: the power of online learning
by: Lee, Jeonghwan, et al.
Published: (2024)

To spike or not to spike: the whims of the Wonham filter in the strong noise regime
by: Bernardin, Cédric, et al.
Published: (2022)

Optimal transport natural gradient for statistical manifolds with continuous sample space
by: Chen, Yifan, et al.
Published: (2018)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Theory of Compression Channels for Postselected Quantum Metrology
by: Yang, Jing
Published: (2023)

Sample complexity of optimal transport barycenters with discrete support
by: Portales, Léo, et al.
Published: (2025)

A non-asymptotic distributional theory of approximate message passing for sparse and robust regression
by: Li, Gen, et al.
Published: (2024)

Optimal and instance-dependent guarantees for Markovian linear stochastic approximation
by: Mou, Wenlong, et al.
Published: (2021)

High-probability Convergence Bounds for Nonlinear Stochastic Gradient Descent Under Heavy-tailed Noise
by: Armacki, Aleksandar, et al.
Published: (2023)

The Local Landscape of Phase Retrieval Under Limited Samples
by: Liu, Kaizhao, et al.
Published: (2023)

Continuous-time reinforcement learning: ellipticity enables model-free value function approximation
by: Mou, Wenlong
Published: (2026)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
by: Ravela, Sai, et al.
Published: (2026)

Gradient descent inference in empirical risk minimization
by: Han, Qiyang, et al.
Published: (2024)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

A Christoffel-like function for high-dimensional support inference in graphical models
by: Lasserre, Jean-Bernard, et al.
Published: (2024)

Statistical guarantees for continuous-time policy evaluation: blessing of ellipticity and new tradeoffs
by: Mou, Wenlong
Published: (2025)

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

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

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
by: Agterberg, Joshua, et al.
Published: (2025)

Quickest Change Detection with Confusing Change
by: Chen, Yu-Zhen Janice, et al.
Published: (2024)

On the relationship between MESP and 0/1 D-Opt and their upper bounds
by: Ponte, Gabriel, et al.
Published: (2025)

Low-rank matrix recovery via nonconvex optimization methods with application to errors-in-variables matrix regression
by: Li, Xin, et al.
Published: (2024)

Beyond Smoothness and Convexity: Optimization via sampling
by: Seyoum, Nahom, et al.
Published: (2025)

Convex relaxation for the generalized maximum-entropy sampling problem
by: Ponte, Gabriel, et al.
Published: (2024)

The out-of-sample prediction error of the square-root-LASSO and related estimators
by: Olea, José Luis Montiel, et al.
Published: (2022)

Statistical Inference of Day-to-Day Traffic Dynamics
by: Wu, Minghui, et al.
Published: (2026)