← Authors

Dileep Kalathil

19 papers · 2021–2025 · 7 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (10) 🧭 Keyword Pioneer 🌍 Conference Polyglot (7) 🐝 Cross-Pollinator (12) 🌈 Renaissance Researcher (6) πŸ† Grand Slam πŸ† Keyword Champion (4) πŸ”₯ Unstoppable (5) πŸ—ƒοΈ Keyword Collector (80) ⚑ Prolific Year (5) πŸ’Ž Century Club (19)

Conferences

NIPS (8) AISTATS (4) AAAI (3) ICLR (1) ICML (1) IJCAI (1) L4DC (1)

Top co-authors

Srinivas Shakkottai (9) Desik Rengarajan (4) Kishan Panaganti (4) Ruida Zhou (3) Aria HasanzadeZonuzy (3) Zaiyan Xu (3) Chao Tian (3) Tao Liu (3) Sapana Chaudhary (3) Jean-Francois Chamberland (2)

Keywords

sample complexity (4) constrained markov decision process (4) robust reinforcement learning (4) uncertainty set (4) safety constraint (4) policy learning (4) reinforcement learning (3) markov decision process (3) safe reinforcement learning (3) offline reinforcement learning (2) generative model (2) model-based reinforcement learning (2) regret bound (2) pac learning (1) natural policy gradient (1) constrained reinforcement learning (1) robot navigation (1) model robustness (1) function approximation (1) robust optimization (1)

Papers

Transformers are Provably Optimal In-context Estimators for Wireless Communications AISTATS 2025
Bridging Distributionally Robust Learning and Offline RL: An Approach to Mitigate Distribution Shift and Partial Data Coverage L4DC 2025
Meta-Learning-Based Adaptive Stability Certificates for Dynamical Systems AAAI 2024
Risk-Averse Fine-tuning of Large Language Models NIPS 2024
Federated Ensemble-Directed Offline Reinforcement Learning NIPS 2024
Natural Actor-Critic for Robust Reinforcement Learning with Function Approximation NIPS 2023
Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning AISTATS 2023
Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022
DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning NIPS 2022
Enhanced Meta Reinforcement Learning via Demonstrations in Sparse Reward Environments NIPS 2022
Anchor-Changing Regularized Natural Policy Gradient for Multi-Objective Reinforcement Learning NIPS 2022
Robust Reinforcement Learning using Offline Data NIPS 2022
Sample Complexity of Robust Reinforcement Learning with a Generative Model AISTATS 2022
Reinforcement Learning with Sparse Rewards using Guidance from Offline Demonstration ICLR 2022
Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPs NIPS 2021
Learning with Safety Constraints: Sample Complexity of Reinforcement Learning for Constrained MDPs AAAI 2021
Robust Reinforcement Learning using Least Squares Policy Iteration with Provable Performance Guarantees ICML 2021
Model-Based Reinforcement Learning for Infinite-Horizon Discounted Constrained Markov Decision Processes IJCAI 2021
Reinforcement Learning for Mean Field Games with Strategic Complementarities AISTATS 2021