Cover Image

Weighted mesh algorithms for general Markov decision processes: Convergence and tractability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Belomestny, Denis, Schoenmakers, John
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C40, 65C05, 62G08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Forward Reverse Kernel Regression for the Schrödinger bridge problem
by: Belomestny, Denis, et al.
Published: (2025)

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

Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients
by: Müller, Johannes, et al.
Published: (2024)

PFN-TS: Thompson Sampling for Contextual Bandits via Prior-Data Fitted Networks
by: Tan, Yan Shuo, et al.
Published: (2026)

Linear programming for finite-horizon vector-valued Markov decision processes
by: Mifrani, Anas, et al.
Published: (2025)

Mixed Newton Method for Optimization in Complex Spaces
by: Yudin, Nikita, et al.
Published: (2024)

Theoretical guarantees for neural control variates in MCMC
by: Belomestny, Denis, et al.
Published: (2023)

A Robbins--Monro Sequence That Can Exploit Prior Information For Faster Convergence
by: Liu, Siwei, et al.
Published: (2024)

Accelerated Regularized Wasserstein Proximal Sampling Algorithms
by: Tan, Hong Ye, et al.
Published: (2026)

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

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
by: Harris, Elizabeth, et al.
Published: (2024)

Average-reward reinforcement learning in semi-Markov decision processes via relative value iteration
by: Yu, Huizhen, et al.
Published: (2025)

Variance-Reduced Manifold Sampling via Polynomial-Maximization Density Estimation
by: Zabolotnii, Serhii
Published: (2026)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
by: Rada, Miroslav, et al.
Published: (2017)

Preconditioned Regularized Wasserstein Proximal Sampling
by: Tan, Hong Ye, et al.
Published: (2025)

IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

Unbalanced Kantorovich-Rubinstein distance, plan, and barycenter on finite spaces: A statistical perspective
by: Hundrieser, Shayan, et al.
Published: (2022)

Multi-Iteration Stochastic Optimizers
by: Carlon, Andre, et al.
Published: (2020)

On the Computational Efficiency of Bayesian Additive Regression Trees: An Asymptotic Analysis
by: Tan, Yan Shuo, et al.
Published: (2024)

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

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

A Langevin sampling algorithm inspired by the Adam optimizer
by: Leimkuhler, Benedict, et al.
Published: (2025)

A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces
by: Kerimkulov, Bekzhan, et al.
Published: (2023)

Range of optimal values in absolute value linear programming with interval data
by: Hladík, Milan
Published: (2025)

Tracking the Median of Gradients with a Stochastic Proximal Point Method
by: Schaipp, Fabian, et al.
Published: (2024)

BISTRO -- A Bi-Fidelity Stochastic Gradient Framework using Trust-Regions for Optimization Under Uncertainty
by: Dixon, Thomas O., et al.
Published: (2025)

Sinkhorn algorithms for entropic vector quantile regression
by: Kato, Kengo, et al.
Published: (2026)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
by: Habibi, Soodeh, et al.
Published: (2024)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
by: Shabani, Shima, et al.
Published: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Maintenance optimization of a two-component system with mixed observability
by: Zhang, Nan, et al.
Published: (2026)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
by: De Santis, Marianna, et al.
Published: (2026)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)