Demo Data from EDBT 2026 / reviewers in the wild / expert
Austin Peters
dblp:355/3031
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 50% Data models and query languages · 50% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 77% Information extraction and text analysis · 23% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data models and query languages
natural language interface |
0.8 | 1 | 2024 | LEAP: LLM-powered End-to-end Automatic Library for Processing Social Science Queries on Unstructured Data · Proc. VLDB Endow. 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › normative reasoning
legal reasoning |
0.7 | 1 | 2023 | LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Models · NeurIPS 2023 |
Natural language and speech › Information extraction and text analysis › document understanding
legal text analysis |
0.2 | 1 | 2023 | LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Models · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
machine learning model selection · 1.5large language model · 1.5code generation · 1.5large language model evaluation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | LEAP: LLM-powered End-to-end Automatic Library for Processing Social Science Queries on Unstructured DataabstractSocial scientists are increasingly interested in analyzing the semantic information (e.g., emotion) of unstructured data (e.g., Tweets), where the semantic information is not natively present. Performing this analysis in a cost-efficient manner requires using machine learning (ML) models to extract the semantic information and subsequently analyze the now structured data. However, this process remains challenging for domain experts. To demonstrate the challenges in social science analytics, we collect a dataset, QUIET-ML, of 120 real-world social science queries in natural language and their ground truth answers. Existing systems struggle with these queries since (1) they require selecting and applying ML models, and (2) more than a quarter of these queries are vague, making standard tools like natural language to SQL systems unsuited. To address these issues, we develop LEAP, an end-to-end library that answers social science queries in natural language with ML. LEAP filters vague queries to ensure that the answers are deterministic and selects from internally supported and user-defined ML functions to extend the unstructured data to structured tables with necessary annotations. LEAP further generates and executes code to respond to these natural language queries. LEAP achieves a 100% pass @ 3 and 92% pass @ 1 on QUIET-ML, with a $1.06 average end-to-end cost, of which code generation costs $0.02. Chuxuan Hu, Austin Peters, Daniel Kang 0001 |
Proc. VLDB Endow. | 2 |
| 2023 | LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language ModelsabstractThe advent of large language models (LLMs) and their adoption by the legal community has given rise to the question: what types of legal reasoning can LLMs perform? To enable greater study of this question, we present LegalBench: a collaboratively constructed legal reasoning benchmark consisting of 162 tasks covering six different types of legal reasoning. LegalBench was built through an interdisciplinary process, in which we collected tasks designed and hand-crafted by legal professionals. Because these subject matter experts took a leading role in construction, tasks either measure legal reasoning capabilities that are practically useful, or measure reasoning skills that lawyers find interesting. To enable cross-disciplinary conversations about LLMs in the law, we additionally show how popular legal frameworks for describing legal reasoning—which distinguish between its many forms—correspond to LegalBench tasks, thus giving lawyers and LLM developers a common vocabulary. This paper describes LegalBench, presents an empirical evaluation of 20 open-source and commercial LLMs, and illustrates the types of research explorations LegalBench enables. Neel Guha, Julian Nyarko, Daniel E. Ho, Christopher Ré, Adam Chilton, Aditya Kuppa, Alex Chohlas-Wood, Austin Peters, Brandon Waldon, Daniel N. Rockmore, Diego Zambrano, Dmitry Talisman, Enam Hoque, Faiz Surani, Frank Fagan, Galit Sarfaty, Gregory M. Dickinson, Haggai Porat, Jason Hegland, Jessica Wu, Joe Nudell, Joel Niklaus, John J. Nay, Jonathan H. Choi, Kevin Tobia, Margaret Hagan, Megan Ma, Michael A. Livermore, Nikon Rasumov-Rahe, Nils Holzenberger, Noam Kolt, Peter Henderson 0002, Sean Rehaag, Sharad Goel, Spencer Williams, Sunny Gandhi, Tom Zur, Varun Iyer, Zehua Li 0001 |
NeurIPS | 8 |