Demo Data from VLDB 2026 / reviewers in the wild / expert
Logan M. Bhamidipaty
dblp:369/6007
· 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 · 77% Robot manipulation · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
exploration |
0.8 | 1 | 2024 | Learning to Explore in POMDPs with Informational Rewards · ICML 2024 |
Machine learning › Reinforcement learning
partially observable reinforcement learning |
0.8 | 1 | 2024 | Learning to Explore in POMDPs with Informational Rewards · ICML 2024 |
Machine learning › Reinforcement learning › reinforcement learning environment
benchmark environments |
0.7 | 1 | 2023 | DynaDojo: An Extensible Platform for Benchmarking Scaling in Dynamical System Identification · NeurIPS 2023 |
Robotics › Robot manipulation › parameter identification
dynamics identification |
0.7 | 1 | 2023 | DynaDojo: An Extensible Platform for Benchmarking Scaling in Dynamical System Identification · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
off-policy algorithms · 0.8meta-exploration · 0.8exploration bonus · 0.8out-of-distribution generalization · 0.7active learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Learning to Explore in POMDPs with Informational RewardsabstractStandard exploration methods typically rely on random coverage of the state space or coverage-promoting exploration bonuses. However, in partially observed settings, the biggest exploration challenge is often posed by the need to discover information-gathering strategies—e.g., an agent that has to navigate to a location in traffic might learn to first check traffic conditions and then choose a route. In this work, we design a POMDP agent that gathers information about the hidden state, using ideas from the meta-exploration literature. Our approach provides an exploration bonus that rewards the agent for gathering information about the state that is relevant for completing the task. While this requires the agent to know what this information is during training, it can obtained in several ways: in the most general case, off-policy algorithms can leverage knowledge about the entire trajectory to determine such information in hindsight, but the user can also provide prior knowledge (e.g., privileged information) to help inform the training process. Through experiments in several partially-observed environments, we find that our approach is competitive with prior methods when minimal exploration is needed, but substantially outperforms them when more complex strategies are required. Our algorithm also shows the ability to learn without any privileged information, by reasoning about the entire trajectory in hindsight and and effectively using any information it reveals about the hidden state. Annie Xie, Logan M. Bhamidipaty, Evan Zheran Liu, Joey Hong, Sergey Levine, Chelsea Finn |
ICML | 2 |
| 2023 | DynaDojo: An Extensible Platform for Benchmarking Scaling in Dynamical System IdentificationabstractModeling complex dynamical systems poses significant challenges, with traditional methods struggling to work on a variety of systems and scale to high-dimensional dynamics. In response, we present DynaDojo, a novel benchmarking platform designed for data-driven dynamical system identification. DynaDojo provides diagnostics on three ways an algorithm’s performance scales: across the number of training samples, the complexity of a dynamical system, and a target error to achieve. Furthermore, DynaDojo enables studying out-of-distribution generalization (by providing unique test conditions for each system) and active learning (by supporting closed-loop control). Through its user-friendly and easily extensible API, DynaDojo accommodates a wide range of user-defined \texttt{Algorithms}, \texttt{Systems}, and \texttt{Challenges} (evaluation metrics). The platform also prioritizes resource-efficient training with parallel processing strategies for running on a cluster. To showcase its utility, in DynaDojo 0.9, we include implementations of 7 baseline algorithms and 20 dynamical systems, along with several demos exhibiting insights researchers can glean using our platform. This work aspires to make DynaDojo a unifying benchmarking platform for system identification, paralleling the role of OpenAI’s Gym in reinforcement learning. Logan M. Bhamidipaty, Tommy Bruzzese, Caryn Tran, Rami Ratl Mrad, Maxinder S. Kanwal |
NeurIPS | 1 |