Demo Data from SIGIR 2026 / reviewers in the wild / expert
Samuel Neumann
dblp:293/6943
· DBLP profile ↗
2ranked-venue papers
1as 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 · 1 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 · 76% Optimization for machine learning · 24% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
actor-critic methods |
0.7 | 1 | 2023 | Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement · ICLR 2023 |
Machine learning › Optimization for machine learning › evolutionary computation
cross-entropy method |
0.7 | 1 | 2023 | Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement · ICLR 2023 |
Machine learning › Reinforcement learning › policy optimization
policy improvement |
0.7 | 1 | 2023 | Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement · ICLR 2023 |
Methods — techniques the papers use, named apart from their topics
hypothesis testing · 0.8hyperparameter tuning · 0.8conditional cross-entropy method · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Empirical Design in Reinforcement LearningabstractEmpirical design in reinforcement learning is no small task. Running good experiments requires attention to detail and at times significant computational resources. While compute resources available per dollar have continued to grow rapidly, so have the scale of typical experiments in reinforcement learning. It is now common to benchmark agents with millions of parameters against dozens of tasks, each using the equivalent of 30 days of experience. The scale of these experiments often conflict with the need for statistical evidence, especially when comparing algorithms. Recent studies have highlighted how popular algorithms are sensitive to hyperparameter settings and implementation details, and that common empirical practice leads to weak statistical evidence (Machado et al., 2018; Henderson et al., 2018). This manuscript represents both a call to action, and a comprehensive resource for how to do good experiments in reinforcement learning. In particular, we cover: the statistical assumptions underlying common performance measures, how to properly characterize performance variation and stability, hypothesis testing, special considerations for comparing multiple agents, baseline and illustrative example construction, and how to deal with hyperparameters and experimenter bias. Throughout we highlight common mistakes found in the literature and the statistical consequences of those in example experiments. The objective of this document is to provide answers on how we can use our unprecedented compute to do good science in reinforcement learning, as well as stay alert to potential pitfalls in our empirical design. Andrew Patterson, Samuel Neumann, Martha White, Adam White 0001 |
J. Mach. Learn. Res. | 2 |
| 2023 | Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement
Samuel Neumann, Sungsu Lim, Ajin Joseph 0001, Yangchen Pan, Adam White 0001, Martha White |
ICLR | 1 |