Cover Image

Provably Efficient Sample Complexity for Robust CMDP

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ganguly, Sourav, Ghosh, Arnob
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Policy Optimization in Robust Constrained MDPs with Iteration Complexity Guarantees
by: Ganguly, Sourav, et al.
Published: (2025)

Certifiable Safe RLHF: Fixed-Penalty Constraint Optimization for Safer Language Models
by: Pandit, Kartik, et al.
Published: (2025)

Provably Safe Generative Sampling with Constricting Barrier Functions
by: Gadginmath, Darshan, et al.
Published: (2026)

Imitation-regularized Optimal Transport on Networks: Provable Robustness and Application to Logistics Planning
by: Oishi, Koshi, et al.
Published: (2024)

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees
by: Ganguly, Sourav, et al.
Published: (2026)

Policy-based Primal-Dual Methods for Concave CMDP with Variance Reduction
by: Ying, Donghao, et al.
Published: (2022)

Embed to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency
by: Wang, Lingxiao, et al.
Published: (2022)

Sample-Efficient Diffusion-based Control of Complex Physics Systems
by: Chen, Hongyi, et al.
Published: (2025)

Neural-Rendezvous: Provably Robust Guidance and Control to Encounter Interstellar Objects
by: Tsukamoto, Hiroyasu, et al.
Published: (2022)

Sample Complexity of Linear Quadratic Regulator Without Initial Stability
by: Moghaddam, Amirreza Neshaei, et al.
Published: (2025)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
by: Boveiri, Mohammad, et al.
Published: (2024)

Provably-Stable Neural Network-Based Control of Nonlinear Systems
by: Li, Anran, et al.
Published: (2025)

Data-Driven Density Steering via the Gromov-Wasserstein Optimal Transport Distance
by: Nakashima, Haruto, et al.
Published: (2025)

On the Sample Complexity of Discounted Reinforcement Learning with Optimized Certainty Equivalents
by: Mortensen, Oliver, et al.
Published: (2026)

On the Sample Complexity of Imitation Learning for Smoothed Model Predictive Control
by: Pfrommer, Daniel, et al.
Published: (2023)

Local Updates in Distributed Optimization: Provable Acceleration and Topology Effects
by: Wang, Zuang, et al.
Published: (2026)

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
by: Muehlebach, Michael, et al.
Published: (2025)

Sample Complexity of the Linear Quadratic Regulator: A Reinforcement Learning Lens
by: Moghaddam, Amirreza Neshaei, et al.
Published: (2024)

Estimation Sample Complexity of a Class of Nonlinear Continuous-time Systems
by: Kuang, Simon, et al.
Published: (2023)

Improved Sample Complexity of Imitation Learning for Barrier Model Predictive Control
by: Pfrommer, Daniel, et al.
Published: (2024)

Formation Shape Control using the Gromov-Wasserstein Metric
by: Nakashima, Haruto, et al.
Published: (2025)

Provable Traffic Rule Compliance in Safe Reinforcement Learning on the Open Sea
by: Krasowski, Hanna, et al.
Published: (2024)

Provable Bounds on the Hessian of Neural Networks: Derivative-Preserving Reachability Analysis
by: Sharifi, Sina, et al.
Published: (2024)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs
by: Veedu, Mishfad Shaikh, et al.
Published: (2023)

Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)

Sample Efficient Certification of Discrete-Time Control Barrier Functions
by: Mulagaleti, Sampath Kumar, et al.
Published: (2025)

Provably Optimal Reinforcement Learning under Safety Filtering
by: Oh, Donggeon David, et al.
Published: (2025)

SPP-CNN: An Efficient Framework for Network Robustness Prediction
by: Wu, Chengpei, et al.
Published: (2023)

Provably Bounding Neural Network Preimages
by: Kotha, Suhas, et al.
Published: (2023)

Achieving $\widetilde{O}(1/ε)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises
by: Yi, Hongyu, et al.
Published: (2026)

An Efficient Reachability-Based Framework for Provably Safe Autonomous Navigation in Unknown Environments
by: Bajcsy, Andrea, et al.
Published: (2019)

ShieldNN: A Provably Safe NN Filter for Unsafe NN Controllers
by: Ferlez, James, et al.
Published: (2020)

Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data
by: Zhang, Thomas T. C. K., et al.
Published: (2023)

Efficient Sampling for Data-Driven Frequency Stability Constraint via Forward-Mode Automatic Differentiation
by: Xu, Wangkun, et al.
Published: (2024)

Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
by: He, Yang, et al.
Published: (2024)

Transfer Learning Assisted XgBoost For Adaptable Cyberattack Detection In Battery Packs
by: Ghosh, Sanchita, et al.
Published: (2025)

Beyond Freshness and Semantics: A Coupon-Collector Framework for Effective Status Updates
by: Ahmed, Youssef, et al.
Published: (2026)

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Sample Complexity of the Sign-Perturbed Sums Method
by: Szentpéteri, Szabolcs, et al.
Published: (2024)