Demo Data from EDBT 2026 / reviewers in the wild / expert
Raphael Thesmar
dblp:320/8366
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-1463-8229ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 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.
| Theoretical computer science
1 paper |
Coding theory · 87% Information theory · 13% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Language models and text generation · 77% Trustworthy machine learning · 23% |
Topics — the 7 heaviest of 7, 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 |
Coding theory › channel coding
feedback communication |
0.9 | 1 | 2025 | Code at the Receiver, Decode at the Sender: Feedback Communication With GRAND-CE · IEEE Trans. Commun. 2025 |
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
guessing random additive noise decoding |
0.9 | 1 | 2025 | Code at the Receiver, Decode at the Sender: Feedback Communication With GRAND-CE · IEEE Trans. Commun. 2025 |
Machine learning › Trustworthy machine learning
data leakage |
0.3 | 1 | 2025 | PhantomWiki: On-Demand Datasets for Reasoning and Retrieval Evaluation · ICML 2025 |
Information theory
channel capacity |
0.3 | 1 | 2025 | Code at the Receiver, Decode at the Sender: Feedback Communication With GRAND-CE · IEEE Trans. Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
question-answer pair generation · 1.7document corpus generation · 1.7compressed error framework · 0.9GRAND · 0.9
| 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 | 5 |
| 2025 | Code at the Receiver, Decode at the Sender: Feedback Communication With GRAND-CEabstractWe present a communication scheme using guessing random additive noise decoding (GRAND) to improve flexibility and reliability of the existing compressed error (CE) framework. The CE framework uses information feedback to construct follow-up transmissions by compressing previous noise realizations, offering high reliability at a code rate close to the forward channel capacity. The channel decoding algorithm GRAND allows us to efficiently maintain this performance in noisy feedback settings by shifting redundancy for forward message protection to the feedback channel. Our scheme, GRAND-CE, is therefore appropriate for cases where forward and feedback channel usage costs are asymmetric, e.g. uplink communications. GRAND-CE offers super-exponential error rate performance as channel use increases, with finite usage of a noisy feedback channel. Unlike the traditional forward error correction model, the receiver performs error correction encoding and the sender handles decoding. We also propose a technique for pipelining sequential transmissions to maintain fixed forward transmission length and good feedback channel coding performance. Joseph Griffin 0002, Peihong Yuan, Raphael Thesmar, Petar Popovski, Ken R. Duffy, Muriel Médard |
IEEE Trans. Commun. | 3 |