Demo Data from VLDB 2026 / reviewers in the wild / expert
Daniel Bramblett
dblp:372/7368
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—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 |
Language models and text generation · 33% Planning, search and constraint satisfaction · 29% Motion planning and robot control · 29% | |
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model |
0.9 | 1 | 2025 | Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning Tasks · ICLR 2025 |
Logic in computer science › nonmonotonic reasoning
truth maintenance systems |
0.9 | 1 | 2025 | Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning Tasks · ICLR 2025 |
Robotics › Motion planning and robot control › motion planning › motion planning under uncertainty
belief space planning |
0.8 | 1 | 2024 | Belief-State Query Policies for User-Aligned POMDPs · NeurIPS 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.8 | 1 | 2024 | Belief-State Query Policies for User-Aligned POMDPs · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
randomized dataset generation · 1.7auto-generated benchmark · 1.7parameterized belief-state query policy · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Autonomous Evaluation of LLMs for Truth Maintenance and Reasoning TasksabstractThis paper presents AutoEval, a novel benchmark for scaling Large Language Model (LLM) assessment in formal tasks with clear notions of correctness, such as truth maintenance in translation and logical reasoning. AutoEval is the first benchmarking paradigm that offers several key advantages necessary for scaling objective evaluation of LLMs without human labeling: (a) ability to evaluate LLMs of increasing sophistication by auto-generating tasks at different levels of difficulty; (b) auto-generation of ground truth that eliminates dependence on expensive and time-consuming human annotation; (c) the use of automatically generated, randomized datasets that mitigate the ability of successive LLMs to overfit to static datasets used in many contemporary benchmarks. Empirical analysis shows that an LLM's performance on AutoEval is highly indicative of its performance on a diverse array of other benchmarks focusing on translation and reasoning tasks, making it a valuable autonomous evaluation paradigm in settings where hand-curated datasets can be hard to obtain and/or update. Rushang Karia, Daniel Bramblett, Daksh Dobhal, Siddharth Srivastava 0001 |
ICLR | 2 |
| 2024 | Belief-State Query Policies for User-Aligned POMDPsabstractPlanning in real-world settings often entails addressing partial observability while aligning with users' requirements. We present a novel framework for expressing users' constraints and preferences about agent behavior in a partially observable setting using parameterized belief-state query (BSQ) policies in the setting of goal-oriented partially observable Markov decision processes (gPOMDPs). We present the first formal analysis of such constraints and prove that while the expected cost function of a parameterized BSQ policy w.r.t its parameters is not convex, it is piecewise constant and yields an implicit discrete parameter search space that is finite for finite horizons. This theoretical result leads to novel algorithms that optimize gPOMDP agent behavior with guaranteed user alignment. Analysis proves that our algorithms converge to the optimal user-aligned behavior in the limit. Empirical results show that parameterized BSQ policies provide a computationally feasible approach for user-aligned planning in partially observable settings. Daniel Bramblett, Siddharth Srivastava 0001 |
NeurIPS | 1 |