Demo Data from VLDB 2026 / reviewers in the wild / expert
Junseok Seo
dblp:348/6211
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Language models and text generation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data models and query languages · 77% Database theory · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
hallucination detection |
0.8 | 1 | 2024 | ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models · NeurIPS 2024 |
Natural language and speech › Language models and text generation
large language model evaluation |
0.8 | 1 | 2024 | ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models · NeurIPS 2024 |
Data models and query languages
entity-relationship model |
0.8 | 1 | 2024 | ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models · NeurIPS 2024 |
Database theory
integrity constraints |
0.2 | 1 | 2024 | ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
prompt engineering · 1.5foreign key constraints · 1.5functional dependency · 0.8functional dependencies · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language ModelsabstractLarge language models (LLMs) have achieved unprecedented performances in various applications, yet evaluating them is still challenging. Existing benchmarks are either manually constructed or are automatic, but lack the ability to evaluate the thought process of LLMs with arbitrary complexity. We contend that utilizing existing relational databases based on the entity-relationship (ER) model is a promising approach for constructing benchmarks as they contain structured knowledge that can be used to question LLMs. Unlike knowledge graphs, which are also used to evaluate LLMs, relational databases have integrity constraints that can be used to better construct complex in-depth questions and verify answers: (1) functional dependencies can be used to pinpoint critical keywords that an LLM must know to properly answer a given question containing certain attribute values; and (2) foreign key constraints can be used to join relations and construct multi-hop questions, which can be arbitrarily long and used to debug intermediate answers. We thus propose ERBench, which uses these integrity constraints to convert any database into an LLM benchmark. ERBench supports continuous evaluation as databases change, multimodal questions, and various prompt engineering techniques. In our experiments, we construct LLM benchmarks using databases of multiple domains and make an extensive comparison of contemporary LLMs. We show how ERBench can properly evaluate any LLM by not only checking for answer correctness, but also effectively verifying the rationales by looking for the right keywords. Jio Oh, Soyeon Kim 0001, Junseok Seo, Jindong Wang 0001, Ruochen Xu, Xing Xie 0001, Steven Euijong Whang |
NeurIPS | 3 |