Cover Image

Central Limit Theorems for Sample Average Approximations in Stochastic Optimal Control

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Milz, Johannes, Shapiro, Alexander
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Optimal Control with Side Information and Bayesian Learning
by: Milz, Johannes, et al.
Published: (2026)

Risk-averse formulations of Stochastic Optimal Control and Markov Decision Processes
by: Shapiro, Alexander, et al.
Published: (2025)

Sample Average Approximation for Distributionally Robust Optimization with $ϕ$-divergences
by: Li, Yan
Published: (2026)

Stochastic Optimization with Optimal Importance Sampling
by: Aolaritei, Liviu, et al.
Published: (2025)

Improved Central Limit Theorem and Bootstrap Approximations for Linear Stochastic Approximation
by: Butyrin, Bogdan, et al.
Published: (2025)

Sample-Based Consistency in Infinite-Dimensional Conic-Constrained Stochastic Optimization
by: Geiersbach, Caroline, et al.
Published: (2025)

The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize
by: Huo, Dongyan, et al.
Published: (2024)

Sample Average Approximation for Stochastic Programming with Equality Constraints
by: Lew, Thomas, et al.
Published: (2022)

Approximate D-optimal design and equilibrium measure
by: Henrion, Didier, et al.
Published: (2024)

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

On the Effectiveness of Classical Regression Methods for Optimal Switching Problems
by: Andersson, Martin, et al.
Published: (2025)

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

Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
by: Feng, Yasong, et al.
Published: (2025)

Asymptotic Consistency for Nonconvex Risk-Averse Stochastic Optimization with Infinite Dimensional Decision Spaces
by: Milz, Johannes, et al.
Published: (2022)

Multifractal Analysis of the Sinkhorn Algorithm: Unveiling the Intricate Structure of Optimal Transport Maps
by: Mena, Jose Rafael Espinosa
Published: (2024)

Function Gradient Approximation with Random Shallow ReLU Networks with Control Applications
by: Lamperski, Andrew, et al.
Published: (2024)

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

Optimal Experimental Design for Large-Scale Inverse Problems via Multi-PDE-constrained Optimization
by: Petrocchi, Andrea, 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)

Optimal transport and Wasserstein distances for causal models
by: Cheridito, Patrick, et al.
Published: (2023)

Central limit theorems for vector-valued composite functionals with smoothing and applications
by: Chen, Huihui, et al.
Published: (2024)

$K$-Nearest-Neighbor Resampling for Off-Policy Evaluation in Stochastic Control
by: Giegrich, Michael, et al.
Published: (2023)

Autocovariance and Optimal Design for Random Walk Metropolis-Hastings Algorithm
by: Zhang, Jingyi, et al.
Published: (2025)

Optimal distributions for randomized unbiased estimators with an infinite horizon and an adaptive algorithm
by: Zheng, Chao, et al.
Published: (2023)

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

On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning
by: Ruan, Feng
Published: (2024)

High-dimensional Limit of SGD for Diagonal Linear Networks
by: Malaxechebarría, Begoña García, et al.
Published: (2026)

Optimal Algorithms for Nonlinear Estimation with Convex Models
by: Foucart, Simon
Published: (2025)

Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences
by: Aolaritei, Liviu, et al.
Published: (2025)

Probabilistic Guarantees of Stochastic Recursive Gradient in Non-Convex Finite Sum Problems
by: Zhong, Yanjie, et al.
Published: (2024)

Failure of uniform laws of large numbers for subdifferentials and beyond
by: Tian, Lai, et al.
Published: (2025)

Markov Kernels, Distances and Optimal Control: A Parable of Linear Quadratic Non-Gaussian Distribution Steering
by: Teter, Alexis M. H., et al.
Published: (2025)

Error Analysis of Triangular Optimal Transport Maps for Filtering
by: Al-Jarrah, Mohammad, et al.
Published: (2025)

Learning an Optimal Assortment Policy under Observational Data
by: Han, Yuxuan, et al.
Published: (2025)

A New Perspective On Denoising Based On Optimal Transport
by: Trillos, Nicolas Garcia, et al.
Published: (2023)

Exactly or Approximately Wasserstein Distributionally Robust Estimation According to Wasserstein Radii Being Small or Large
by: Ding, Xiao, et al.
Published: (2025)

Hyperparameter tuning via trajectory predictions: Stochastic prox-linear methods in matrix sensing
by: Lou, Mengqi, et al.
Published: (2024)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

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

The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms
by: Collins-Woodfin, Elizabeth, et al.
Published: (2024)