Copertina

Online Markov Decision Processes with Terminal Law Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Moreno, Bianca Marin, Brégère, Margaux, Gaillard, Pierre, Oudjane, Nadia
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Online Episodic Convex Reinforcement Learning
di: Moreno, Bianca Marin, et al.
Pubblicazione: (2025)

MetaCURL: Non-stationary Concave Utility Reinforcement Learning
di: Moreno, Bianca Marin, et al.
Pubblicazione: (2024)

A Bandit Approach with Evolutionary Operators for Model Selection
di: Brégère, Margaux, et al.
Pubblicazione: (2024)

Online Reinforcement Learning in Markov Decision Process Using Linear Programming
di: Leon, Vincent, et al.
Pubblicazione: (2023)

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
di: Zhang, Weitong, et al.
Pubblicazione: (2021)

Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes
di: Zeng, Sihan, et al.
Pubblicazione: (2021)

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

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

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

Efficient Algorithms for Robust Markov Decision Processes with $s$-Rectangular Ambiguity Sets
di: Ho, Chin Pang, et al.
Pubblicazione: (2026)

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

Non-stationary and Varying-discounting Markov Decision Processes for Reinforcement Learning
di: Chen, Zhizuo, et al.
Pubblicazione: (2025)

Safe Reinforcement Learning for Constrained Markov Decision Processes with Stochastic Stopping Time
di: Mazumdar, Abhijit, et al.
Pubblicazione: (2024)

On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes
di: Wan, Yi, et al.
Pubblicazione: (2024)

Risk-sensitive Markov Decision Process and Learning under General Utility Functions
di: Wu, Zhengqi, et al.
Pubblicazione: (2023)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
di: Wang, Shengbo, et al.
Pubblicazione: (2025)

Learning Sequential Decisions from Multiple Sources via Group-Robust Markov Decision Processes
di: Xu, Mingyuan, et al.
Pubblicazione: (2026)

Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form
di: Kitamura, Toshinori, et al.
Pubblicazione: (2024)

Bayesian Ambiguity Contraction-based Adaptive Robust Markov Decision Processes for Adversarial Surveillance Missions
di: Choi, Jimin, et al.
Pubblicazione: (2025)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
di: Zhou, Julien, et al.
Pubblicazione: (2024)

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

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2025)

Decision-Focused Federated Learning Under Heterogeneous Objectives and Constraints
di: Ziliaskopoulos, Konstantinos, et al.
Pubblicazione: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
di: Pan, Zhaoye, et al.
Pubblicazione: (2026)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
di: Lekeufack, Jordan, et al.
Pubblicazione: (2024)

Learning to Cover: Online Learning and Optimization with Irreversible Decisions
di: Jacquillat, Alexandre, et al.
Pubblicazione: (2024)

Approximate Linear Programming for Decentralized Policy Iteration in Cooperative Multi-agent Markov Decision Processes
di: Mandal, Lakshmi, et al.
Pubblicazione: (2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints
di: Garber, Dan, et al.
Pubblicazione: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
di: Hutchinson, Spencer, et al.
Pubblicazione: (2024)

Robust $Q$-learning Algorithm for Markov Decision Processes under Wasserstein Uncertainty
di: Neufeld, Ariel, et al.
Pubblicazione: (2022)

An entropy penalized approach for stochastic control problems. Complete version
di: Bourdais, Thibaut, et al.
Pubblicazione: (2023)

An entropy penalized approach for stochastic optimization with marginal law constraints. Complete version
di: Bourdais, Thibaut, et al.
Pubblicazione: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

Online Non-convex Optimization with Long-term Non-convex Constraints
di: Pan, Shijie, et al.
Pubblicazione: (2023)

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints
di: Sid-Ali, Ahmed, et al.
Pubblicazione: (2023)

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data
di: Li, Wenye, et al.
Pubblicazione: (2025)

Gaussian Process Regression with Soft Inequality and Monotonicity Constraints
di: Kochan, Didem, et al.
Pubblicazione: (2024)

Wait-Less Offline Tuning and Re-solving for Online Decision Making
di: Sun, Jingruo, et al.
Pubblicazione: (2024)