EDBT 2026 Demo / reviewers in the wild / expert
Anmol Kabra
dblp:245/6092
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author
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
3 papers |
Language models and text generation · 28% Reinforcement learning · 19% Probabilistic and Bayesian machine learning · 19% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 9 heaviest of 9, 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 evaluation |
0.9 | 1 | 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval Evaluation · ICML 2025 |
Information retrieval › evaluation › benchmark
benchmark construction |
0.9 | 1 | 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval Evaluation · ICML 2025 |
Information retrieval
retrieval evaluation |
0.9 | 1 | 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval Evaluation · ICML 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
exponential family |
0.6 | 1 | 2022 | Exponential Family Model-Based Reinforcement Learning via Score Matching · NeurIPS 2022 |
Machine learning › Reinforcement learning
model-based reinforcement learning |
0.6 | 1 | 2022 | Exponential Family Model-Based Reinforcement Learning via Score Matching · NeurIPS 2022 |
Machine learning › Deep learning architectures and training
loss landscape |
0.5 | 1 | 2021 | Characterizing the Loss Landscape in Non-Negative Matrix Factorization · AAAI 2021 |
Machine learning › Trustworthy machine learning
data leakage |
0.3 | 1 | 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval Evaluation · ICML 2025 |
Machine learning › Representation and self-supervised learning
matrix factorization |
0.1 | 1 | 2021 | Characterizing the Loss Landscape in Non-Negative Matrix Factorization · AAAI 2021 |
Machine learning › Representation and self-supervised learning › matrix factorization
nonnegative matrix factorization |
0.1 | 1 | 2021 | Characterizing the Loss Landscape in Non-Negative Matrix Factorization · AAAI 2021 |
Methods — techniques the papers use, named apart from their topics
question-answer pair generation · 1.7document corpus generation · 1.7score matching · 0.6ridge regression · 0.6optimism · 0.6loss landscape analysis · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval EvaluationabstractHigh-quality benchmarks are essential for evaluating reasoning and retrieval capabilities of large language models (LLMs). However, curating datasets for this purpose is not a permanent solution as they are prone to data leakage and inflated performance results.
To address these challenges, we propose PhantomWiki: a pipeline to generate unique, factually consistent document corpora with diverse question-answer pairs. Unlike prior work, PhantomWiki is neither a fixed dataset, nor is it based on any existing data. Instead, a new PhantomWiki instance is generated on demand for each evaluation. We vary the question difficulty and corpus size to disentangle reasoning and retrieval capabilities, respectively, and find that PhantomWiki datasets are surprisingly challenging for frontier LLMs. Thus, we contribute a scalable and data leakage-resistant framework for disentangled evaluation of reasoning, retrieval, and tool-use abilities. Albert Gong, Kamile Stankeviciute, Chao Wan, Anmol Kabra, Raphael Thesmar, Johann Lee, Julius Klenke, Carla P. Gomes, Kilian Q. Weinberger |
ICML | 4 |
| 2022 | Exponential Family Model-Based Reinforcement Learning via Score MatchingabstractWe propose an optimistic model-based algorithm, dubbed SMRL, for finite-horizon episodic reinforcement learning (RL) when the transition model is specified by exponential family distributions with $d$ parameters and the reward is bounded and known. SMRL uses score matching, an unnormalized density estimation technique that enables efficient estimation of the model parameter by ridge regression. Under standard regularity assumptions, SMRL achieves $\tilde O(d\sqrt{H^3T})$ online regret, where $H$ is the length of each episode and $T$ is the total number of interactions (ignoring polynomial dependence on structural scale parameters). Gene Li, Junbo Li 0003, Anmol Kabra, Nathan Srebro, Zhaoran Wang 0001, Zhuoran Yang |
NeurIPS | 3 |
| 2021 | Characterizing the Loss Landscape in Non-Negative Matrix Factorization
Johan Bjorck, Anmol Kabra, Kilian Q. Weinberger, Carla P. Gomes |
AAAI | 2 |
| 2019 | CPU-accelerated principal-agent game for scalable citizen science
Anmol Kabra, Yexiang Xue, Carla P. Gomes |
COMPASS | 1 |