Cover Image

A safe exploration approach to constrained Markov decision processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ni, Tingting, Kamgarpour, Maryam
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A learning-based approach to stochastic optimal control under reach-avoid constraint
by: Ni, Tingting, et al.
Published: (2024)

Data-driven robust Markov decision processes on Borel spaces: performance guarantees via an axiomatic approach
by: Ramani, Sivaramakrishnan
Published: (2026)

Stochastic first-order methods for average-reward Markov decision processes
by: Li, Tianjiao, et al.
Published: (2022)

Logarithmic regret bounds for continuous-time average-reward Markov decision processes
by: Gao, Xuefeng, et al.
Published: (2022)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

A dynamical neural network approach for distributionally robust chance constrained Markov decision process
by: Xia, Tian, et al.
Published: (2023)

A constrained optimization approach to improve robustness of neural networks
by: Zhao, Shudian, et al.
Published: (2024)

Convergence Rate of Learning a Strongly Variationally Stable Equilibrium
by: Tatarenko, Tatiana, et al.
Published: (2023)

Convergence Rate of Generalized Nash Equilibrium Learning in Strongly Monotone Games with Linear Constraints
by: Tatarenko, Tatiana, et al.
Published: (2025)

Convergence Rate of Payoff-based Generalized Nash Equilibrium Learning
by: Tatarenko, Tatiana, et al.
Published: (2024)

Bayesian Quality-Diversity approaches for constrained optimization problems with mixed continuous, discrete and categorical variables
by: Brevault, Loic, et al.
Published: (2023)

Towards safe Bayesian optimization with Wiener kernel regression
by: Molodchyk, Oleksii, et al.
Published: (2024)

PACSBO: Probably approximately correct safe Bayesian optimization
by: Tokmak, Abdullah, et al.
Published: (2024)

Manifold constrained steepest descent
by: Yang, Kaiwei, et al.
Published: (2026)

Towards safe control parameter tuning in distributed multi-agent systems
by: Tokmak, Abdullah, et al.
Published: (2025)

One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
by: Tran, Thu-Le, et al.
Published: (2023)

Distributed Thompson sampling under constrained communication
by: Zerefa, Saba, et al.
Published: (2024)

Alignment of large language models with constrained learning
by: Zhang, Botong, et al.
Published: (2025)

No-Rank Tensor Decomposition Using Metric Learning
by: Bagherian, Maryam
Published: (2025)

Learning based convex approximation for constrained parametric optimization
by: Liu, Kang, et al.
Published: (2025)

Constrained Meta Reinforcement Learning with Provable Test-Time Safety
by: Ni, Tingting, et al.
Published: (2026)

Safe exploration in reproducing kernel Hilbert spaces
by: Tokmak, Abdullah, et al.
Published: (2025)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

Group-blind optimal transport to group parity and its constrained variants
by: Zhou, Quan, et al.
Published: (2023)

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
by: Li, Yuchen, et al.
Published: (2023)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
by: Lyu, Hanbaek, et al.
Published: (2020)

Soft decision trees for survival analysis
by: Consolo, Antonio, et al.
Published: (2025)

Localized exploration in contextual dynamic pricing achieves dimension-free regret
by: Chai, Jinhang, et al.
Published: (2024)

Randomized multi-class classification under system constraints: a unified approach via post-processing
by: Chzhen, Evgenii, et al.
Published: (2025)

Towards safe and tractable Gaussian process-based MPC: Efficient sampling within a sequential quadratic programming framework
by: Prajapat, Manish, et al.
Published: (2024)

Learning solutions to some toy constrained optimization problems in infinite dimensional Hilbert spaces
by: Mandal, Pinak
Published: (2024)

Weakly Time-Coupled Approximation of Markov Decision Processes
by: Soheili, Negar, et al.
Published: (2026)

Online Markov Decision Processes with Terminal Law Constraints
by: Moreno, Bianca Marin, et al.
Published: (2026)

Reinforcement Learning with Function Approximation for Non-Markov Processes
by: Kara, Ali Devran
Published: (2026)

Adaptive decision-making for stochastic service network design
by: Durán-Micco, Javier, et al.
Published: (2026)

Towards a connection between the capacitated vehicle routing problem and the constrained centroid-based clustering
by: Abdellaoui, Abdelhakim, et al.
Published: (2024)

Optimal Sample Complexity for Average Reward Markov Decision Processes
by: Wang, Shengbo, et al.
Published: (2023)

Flipping-based Policy for Chance-Constrained Markov Decision Processes
by: Shen, Xun, et al.
Published: (2024)

Beyond IID: data-driven decision-making in heterogeneous environments
by: Besbes, Omar, et al.
Published: (2022)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
by: Jiang, Jiashuo, et al.
Published: (2024)