{"total":23,"rows":[{"id":"2208.05129","title":"Robust Reinforcement Learning using Offline Data","created":"2022-08-10","cited_by_count":96,"area":null},{"id":"2205.05138","title":"Efficient Risk-Averse Reinforcement Learning","created":"2022-05-10","cited_by_count":43,"area":null},{"id":"2302.03201","title":"Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR","created":"2023-02-07","cited_by_count":32,"area":null},{"id":"2210.05650","title":"Regret Bounds for Risk-Sensitive Reinforcement Learning","created":"2022-10-11","cited_by_count":26,"area":null},{"id":"2206.02678","title":"Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst Path","created":"2022-06-06","cited_by_count":22,"area":null},{"id":"2306.11626","title":"Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity","created":"2023-06-20","cited_by_count":17,"area":null},{"id":"2203.03684","title":"Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets","created":"2022-03-07","cited_by_count":16,"area":null},{"id":"2210.14051","title":"Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds","created":"2022-10-25","cited_by_count":16,"area":null},{"id":"2212.09010","title":"Risk-Sensitive Reinforcement Learning with Exponential Criteria","created":"2022-12-18","cited_by_count":15,"area":null},{"id":"2301.12601","title":"Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents","created":"2023-01-30","cited_by_count":15,"area":null},{"id":"2306.02399","title":"Regret Bounds for Risk-sensitive Reinforcement Learning with Lipschitz Dynamic Risk Measures","created":"2023-06-04","cited_by_count":8,"area":null},{"id":"2311.13589","title":"Risk-sensitive Markov Decision Process and Learning under General Utility Functions","created":"2023-11-22","cited_by_count":7,"area":null},{"id":"2208.09106","title":"A Risk-Sensitive Approach to Policy Optimization","created":"2022-08-19","cited_by_count":6,"area":null},{"id":"2211.10815","title":"Non-stationary Risk-sensitive Reinforcement Learning: Near-optimal Dynamic Regret, Adaptive Detection, and Separation Design","created":"2022-11-19","cited_by_count":4,"area":null},{"id":"2408.17286","title":"Risk-averse Total-reward MDPs with ERM and EVaR","created":"2024-08-30","cited_by_count":4,"area":null},{"id":"2301.13236","title":"Policy Gradient with Tree Expansion","created":"2023-01-30","cited_by_count":3,"area":null},{"id":"2203.03110","title":"Cascaded Gaps: Towards Gap-Dependent Regret for Risk-Sensitive Reinforcement Learning","created":"2022-03-07","cited_by_count":2,"area":null},{"id":"2207.14443","title":"A Survey of Learning on Small Data: Generalization, Optimization, and Challenge","created":"2022-07-29","cited_by_count":1,"area":null},{"id":"2303.09027","title":"Learning Rewards to Optimize Global Performance Metrics in Deep Reinforcement Learning","created":"2023-03-16","cited_by_count":1,"area":null},{"id":"2402.05906","title":"Risk-Sensitive Multi-Agent Reinforcement Learning in Network Aggregative Markov Games","created":"2024-02-08","cited_by_count":1,"area":null},{"id":"2509.24047","title":"Optimism as Risk-Seeking in Multi-Agent Reinforcement Learning","created":"2025-09-28","cited_by_count":1,"area":null},{"id":"2405.02724","title":"Taming Equilibrium Bias in Risk-Sensitive Multi-Agent Reinforcement Learning","created":"2024-05-04","cited_by_count":0,"area":null},{"id":"2601.15915","title":"Progressive Power Homotopy for Non-convex Optimization","created":"2026-01-22","cited_by_count":0,"area":null}],"next_cursor":null}