Demo Data from EDBT 2026 / reviewers in the wild / expert
Benjamin Kleiner
dblp:339/2748
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Learning paradigms · 50% Knowledge representation and reasoning · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Data models and query languages · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › multi-task learning › multi-task transfer learning
multi-task pretraining |
0.7 | 1 | 2023 | Multitask Pretraining with Structured Knowledge for Text-to-SQL Generation · ACL (1) 2023 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
structured knowledge |
0.7 | 1 | 2023 | Multitask Pretraining with Structured Knowledge for Text-to-SQL Generation · ACL (1) 2023 |
Methods — techniques the papers use, named apart from their topics
pre-training · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Multitask Pretraining with Structured Knowledge for Text-to-SQL GenerationabstractRobert Giaquinto, Dejiao Zhang, Benjamin Kleiner, Yang Li, Ming Tan, Parminder Bhatia, Ramesh Nallapati, Xiaofei Ma. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023. Robert Giaquinto, Dejiao Zhang, Benjamin Kleiner, Parminder Bhatia, Ramesh Nallapati, Xiaofei Ma 0001 |
ACL (1) | 3 |
| 2022 | Mixture of Domain Experts for Language Understanding: an Analysis of Modularity, Task Performance, and Memory TradeoffsabstractOne of the limitations of large-scale machine learning models is that they are difficult to adjust after deployment without significant re-training costs. In this paper, we focus on NLU and the needs of virtual assistant systems to continually update themselves through time to support new functionality. Specifically, we consider the tasks of intent classification (IC) and slot filling (SF), which are fundamental to processing user interaction with virtual assistants. We studied six different architectures with varying degrees of modularity in order to gain insights into the performance implications of designing models for flexible updates through time. Our experiments on the SLURP dataset, modified to simulate the real-world experience of adding new intents over time, show that a single dense model yields 2.5 — 3.5 points of average improvement versus individual domain models, but suffers a median degradation of 0.4 — 1.1 points as the new intents are incorporated. We present a mixture-of-experts based hybrid system that performs within 2.1 points of the dense model in exact match accuracy while either improving median performance for untouched domains through time or only degrading by 0.1 points at worst. Benjamin Kleiner, Jack G. M. Fitzgerald, Haidar Khan, Gohkan Tur |
SLT | 1 |