Demo Data from SIGIR 2026 / reviewers in the wild / expert
Sean Gillen
dblp:281/8594
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 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
1 paper |
Reinforcement learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › reinforcement learning theory
policy analysis |
0.5 | 1 | 2021 | Mesh Based Analysis of Low Fractal Dimension Reinforcement Learning Policies · ICRA 2021 |
Machine learning › Reinforcement learning › reward design
reward shaping |
0.5 | 1 | 2021 | Mesh Based Analysis of Low Fractal Dimension Reinforcement Learning Policies · ICRA 2021 |
Methods — techniques the papers use, named apart from their topics
mesh-based reachability analysis · 0.5markov chain synthesis · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Mesh Based Analysis of Low Fractal Dimension Reinforcement Learning PoliciesabstractIn previous work, using a process we call meshing, the reachable state spaces for various continuous and hybrid systems were approximated as a discrete set of states which can then be synthesized into a Markov chain. One of the applications for this approach has been to analyze locomotion policies obtained by reinforcement learning, in a step towards making empirical guarantees about the stability properties of the resulting system. In a separate line of research, we introduced a modified reward function for on-policy reinforcement learning algorithms that utilizes a "fractal dimension" of rollout trajectories. This reward was shown to encourage policies that induce individual trajectories which can be more compactly represented as a discrete mesh. In this work, we combine these two threads of research by building meshes of the reachable state space of a system subject to disturbances and controlled by policies obtained with the modified reward. Our analysis shows that the modified policies do produce much smaller reachable meshes. This shows that agents trained with the fractal dimension reward transfer their desirable quality of having a more compact state space to a setting with external disturbances. The results also suggest that the previous work using mesh based tools to analyze RL policies may be extended to higher dimensional systems or to higher resolution meshes than would have otherwise been possible. Sean Gillen, Katie Byl |
ICRA | 1 |