Cover Image

Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meunier, Matthieu, Reisinger, Christoph, Zhang, Yufei
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control Probability 65C05, 90C40 (Primary) 90C39, 60J20, 68Q32 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Learning Decision-Sufficient Representations for Linear Optimization
by: Ye, Yuhan, et al.
Published: (2026)

Stochastic dynamic programming with non-linear discounting
by: Bäuerle, Nicole, et al.
Published: (2020)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
by: Azizian, Waïss, et al.
Published: (2024)

On the Curvature of the Central Path of Linear Programming Theory
by: Dedieu, Jean-Pierre, et al.
Published: (2003)

Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality
by: Jentzen, Arnulf, et al.
Published: (2025)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
by: Azizian, Waïss, et al.
Published: (2025)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

Epi-Consistent Approximation of Stochastic Dynamic Programs
by: Keehan, Dominic S. T., et al.
Published: (2025)

On the Out-of-Sample Performance of Stochastic Dynamic Programming and Model Predictive Control
by: Keehan, Dominic S. T., et al.
Published: (2025)

On the Wasserstein alignment problem
by: Pal, Soumik, et al.
Published: (2025)

High-degree cubature on Wiener space through unshuffle expansions
by: Ferrucci, Emilio, et al.
Published: (2024)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

Constrained Consensus-Based Optimization and Numerical Heuristics for the Few Particle Regime
by: Beddrich, Jonas, et al.
Published: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

Explicit Recursive Construction of Super-Replication Prices under Proportional Transaction Costs
by: Lepinette, Emmanuel, et al.
Published: (2025)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

Subpath-Based Column Generation for Electric Vehicle Routing Problems
by: Jacquillat, Alexandre, et al.
Published: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
by: Yoon, TaeHo, et al.
Published: (2026)

Optimal Rates of Convergence for Entropy Regularization in Discounted Markov Decision Processes
by: Müller, Johannes, et al.
Published: (2024)

Continuity of Filters for Discrete-Time Control Problems Defined by Explicit Equations
by: Feinberg, Eugene A., et al.
Published: (2023)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
by: Roith, Tim, et al.
Published: (2025)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

Blackwell optimality and policy stability for long-run risk sensitive stochastic control
by: Bäuerle, Nicole, et al.
Published: (2024)

Policy stability and ultimate stationarity in discounted risk-sensitive stochastic control
by: Bäuerle, Nicole, et al.
Published: (2026)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
by: Azizian, Waïss, et al.
Published: (2022)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Optimization with Trained Machine Learning Models Embedded
by: Schweidtmann, Artur M., et al.
Published: (2022)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

Recovery of Integer Images from Minimal DFT Measurements: Uniqueness and Inversion Algorithms
by: Levinson, Howard W, et al.
Published: (2025)

Kinetic description and convergence analysis of genetic algorithms for global optimization
by: Borghi, Giacomo, et al.
Published: (2023)