← Search

Simon Khan

3 accepted papers

2025

Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model

AISTATS 2025poster

In this work, we study the sample complexity problem of risk-sensitive Reinforcement Learning (RL) with a generative model, where we aim to maximize the Conditional Value at Risk (CVaR) with risk tolerance level $\tau$ at each step, named Iterated CVaR. We develop nearly matching upper and lower…

Cited by 0SourceScholar
2025

Revisiting Large-Scale Non-convex Distributionally Robust Optimization

ICLR 2025poster

Distributionally robust optimization (DRO) is a powerful technique to train robust machine learning models that perform well under distribution shifts. Compared with empirical risk minimization (ERM), DRO optimizes the expected loss under the worst-case distribution in an uncertainty set of distribu…

Cited by 0SourcePDFScholar
2025

Why the Agent Made that Decision: Contrastive Explanation Learning for Reinforcement Learning

IJCAI 2025

Reinforcement learning (RL) has demonstrated remarkable success in solving complex decision-making problems, yet its adoption in critical domains is hindered by the lack of interpretability in its decision-making processes. Existing explainable AI (xAI) approaches often fail to provide meaningful ex

Cited by 0SourcePDFScholar