Demo Data from EDBT 2026 / reviewers in the wild / expert
Sarah Rathnam
dblp:301/9841
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Reinforcement learning · 75% Deep learning architectures and training · 13% Trustworthy machine learning · 12% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › regularization for reinforcement learning
discount regularization |
1.4 | 2 | 2024 | Rethinking Discount Regularization: New Interpretations, Unintended Consequences, and Solutions for Regularization in Reinforcement Learning · J. Mach. Learn. Res. 2024 The Unintended Consequences of Discount Regularization: Improving Regularization in Certainty Equivalence Reinforcement Learning · ICML 2023 |
Machine learning › Reinforcement learning
model-based reinforcement learning |
0.8 | 1 | 2024 | Rethinking Discount Regularization: New Interpretations, Unintended Consequences, and Solutions for Regularization in Reinforcement Learning · J. Mach. Learn. Res. 2024 |
Machine learning › Reinforcement learning
model-free reinforcement learning |
0.8 | 1 | 2024 | Rethinking Discount Regularization: New Interpretations, Unintended Consequences, and Solutions for Regularization in Reinforcement Learning · J. Mach. Learn. Res. 2024 |
Machine learning › Deep learning architectures and training
regularization |
0.8 | 1 | 2024 | Rethinking Discount Regularization: New Interpretations, Unintended Consequences, and Solutions for Regularization in Reinforcement Learning · J. Mach. Learn. Res. 2024 |
Machine learning › Reinforcement learning › model-based reinforcement learning
certainty equivalence |
0.7 | 1 | 2023 | The Unintended Consequences of Discount Regularization: Improving Regularization in Certainty Equivalence Reinforcement Learning · ICML 2023 |
Machine learning › Reinforcement learning
markov decision process |
0.7 | 1 | 2023 | The Unintended Consequences of Discount Regularization: Improving Regularization in Certainty Equivalence Reinforcement Learning · ICML 2023 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
transition matrix estimation |
0.7 | 1 | 2023 | The Unintended Consequences of Discount Regularization: Improving Regularization in Certainty Equivalence Reinforcement Learning · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
equivalence theorems · 0.8empirical evaluation · 0.8regularization · 0.7bayesian prior · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Rethinking Discount Regularization: New Interpretations, Unintended Consequences, and Solutions for Regularization in Reinforcement LearningabstractDiscount regularization, using a shorter planning horizon when calculating the optimal policy, is a popular choice to avoid overfitting when faced with sparse or noisy data. It is commonly interpreted as de-emphasizing or ignoring delayed effects. In this paper, we prove two alternative views of discount regularization that expose unintended consequences and motivate novel regularization methods. In model-based RL, planning under a lower discount factor acts like a prior with stronger regularization on state-action pairs with more transition data. This leads to poor performance when the transition matrix is estimated from data sets with uneven amounts of data across state-action pairs. In model-free RL, discount regularization equates to planning using a weighted average Bellman update, where the agent plans as if the values of all state-action pairs are closer than implied by the data. Our equivalence theorems motivate simple methods that generalize discount regularization by setting parameters locally for individual state-action pairs rather than globally. We demonstrate the failures of discount regularization and how we remedy them using our state-action-specific methods across empirical examples with both tabular and continuous state spaces. Sarah Rathnam, Sonali Parbhoo, Siddharth Swaroop, Susan A. Murphy, Finale Doshi-Velez |
J. Mach. Learn. Res. | 1 |
| 2023 | The Unintended Consequences of Discount Regularization: Improving Regularization in Certainty Equivalence Reinforcement LearningabstractDiscount regularization, using a shorter planning horizon when calculating the optimal policy, is a popular choice to restrict planning to a less complex set of policies when estimating an MDP from sparse or noisy data (Jiang et al., 2015). It is commonly understood that discount regularization functions by de-emphasizing or ignoring delayed effects. In this paper, we reveal an alternate view of discount regularization that exposes unintended consequences. We demonstrate that planning under a lower discount factor produces an identical optimal policy to planning using any prior on the transition matrix that has the same distribution for all states and actions. In fact, it functions like a prior with stronger regularization on state-action pairs with more transition data. This leads to poor performance when the transition matrix is estimated from data sets with uneven amounts of data across state-action pairs. Our equivalence theorem leads to an explicit formula to set regularization parameters locally for individual state-action pairs rather than globally. We demonstrate the failures of discount regularization and how we remedy them using our state-action-specific method across simple empirical examples as well as a medical cancer simulator. Sarah Rathnam, Sonali Parbhoo, Susan A. Murphy, Finale Doshi-Velez |
ICML | 1 |