Learning safely at every step
Many learning algorithms limit average risk. My work studies instantaneous hard constraints, where an unsafe action or transition cannot be offset by safer behavior later.
We develop near-optimal safe reinforcement learning and extend certification to non-convex decision spaces and coupled agents, with safety guarantees that hold with high probability under the models’ stated assumptions.
ICML 2023 & 2025 · NeurIPS 2026 accepted
Near-optimal safe RL · ICML 2023 →Non-convex safety · ICML 2025 →Coupled-agent safety · NeurIPS 2026 →