Cover Image

Risk Estimation in a Markov Cost Process: Lower and Upper Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Thoppe, Gugan, Prashanth, L. A., Bhat, Sanjay
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reinforcement Learning for Exponential Utility: Algorithms and Convergence in Discounted MDPs
by: Thoppe, Gugan, et al.
Published: (2026)

Parameter-Free Federated TD Learning with Markov Noise in Heterogeneous Environments
by: Naskar, Ankur, et al.
Published: (2025)

Parameter-free Optimal Rates for Nonlinear Semi-Norm Contractions with Applications to $Q$-Learning
by: Naskar, Ankur, et al.
Published: (2025)

Does DQN Learn?
by: Gopalan, Aditya, et al.
Published: (2022)

Reinforcement Learning with Quasi-Hyperbolic Discounting
by: Eshwar, S. R., et al.
Published: (2024)

Global Convergence Guarantees for Federated Policy Gradient Methods with Adversaries
by: Ganesh, Swetha, et al.
Published: (2024)

Concentration Bounds for Optimized Certainty Equivalent Risk Estimation
by: Ghosh, Ayon, et al.
Published: (2024)

Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements
by: Roy, Nibedita, et al.
Published: (2026)

Policy Gradient with Tree Expansion
by: Dalal, Gal, et al.
Published: (2023)

Optimization of utility-based shortfall risk: A non-asymptotic viewpoint
by: Gupte, Sumedh, et al.
Published: (2023)

Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates
by: Paul, Anik Kumar, et al.
Published: (2026)

Risk-sensitive reinforcement learning using expectiles, shortfall risk and optimized certainty equivalent risk
by: Gupte, Sumedh, et al.
Published: (2026)

What Can Be Recovered Under Sparse Adversarial Corruption? Assumption-Free Theory for Linear Measurements
by: Halder, Vishal, et al.
Published: (2025)

An Upper Bound for the Distribution Overlap Index and Its Applications
by: Fu, Hao, et al.
Published: (2022)

Reliable Policy Iteration: Performance Robustness Across Architecture and Environment Perturbations
by: Eshwar, S. R., et al.
Published: (2025)

Markov Chain Variance Estimation: A Stochastic Approximation Approach
by: Agrawal, Shubhada, et al.
Published: (2024)

Information Theoretic Lower Bounds for Information Theoretic Upper Bounds
by: Livni, Roi
Published: (2023)

Monotone and Conservative Policy Iteration Beyond the Tabular Case
by: Eshwar, S. R., et al.
Published: (2025)

Lower Bounds on the Size of Markov Equivalence Classes
by: Jahn, Erik, et al.
Published: (2025)

Approximation Error Upper and Lower Bounds for Hölder Class with Transformers
by: He, Xin, et al.
Published: (2026)

Policy Gradient Methods for Distortion Risk Measures
by: Vijayan, Nithia, et al.
Published: (2021)

Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds
by: Edelman, Ezra, et al.
Published: (2026)

An Actor-Critic Algorithm with Function Approximation for Risk Sensitive Cost Markov Decision Processes
by: Guin, Soumyajit, et al.
Published: (2025)

Optimizing Shortfall Risk Metric for Learning Regression Models
by: Ramaswamy, Harish G., et al.
Published: (2025)

Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
by: Iwazaki, Shogo
Published: (2025)

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
by: Takeno, Shion, et al.
Published: (2024)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
by: Agrawal, Shubhada, et al.
Published: (2025)

Performance Improvement Bounds for Lipschitz Configurable Markov Decision Processes
by: Metelli, Alberto Maria
Published: (2024)

A Markov Decision Process for Variable Selection in Branch & Bound
by: Strang, Paul, et al.
Published: (2025)

On the Convergence of Modified Policy Iteration in Risk Sensitive Exponential Cost Markov Decision Processes
by: Murthy, Yashaswini, et al.
Published: (2023)

The Shadow knows: Empirical Distributions of Minimum Spanning Acycles and Persistence Diagrams of Random Complexes
by: Fraiman, Nicolas, et al.
Published: (2020)

An Upper Confidence Bound Approach to Estimating the Maximum Mean
by: Kun, Zhang, et al.
Published: (2024)

Data-Driven Estimation of Capacity Upper Bounds
by: Häger, Christian, et al.
Published: (2022)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
by: Iwazaki, Shogo
Published: (2025)

Trade-off Functions for DP-SGD with Subsampling based on Random Shuffling: Tight Upper and Lower Bounds
by: van Dijk, Marten, et al.
Published: (2026)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes
by: Grünewälder, Steffen, et al.
Published: (2024)