Demo Data from EDBT 2026 / reviewers in the wild / expert
Blake M. Elias
dblp:400/4236
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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 · 50% Efficient and distributed learning · 50% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
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
decoding |
0.9 | 1 | 2025 | Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous Decoding · ICML 2025 |
Machine learning › Efficient and distributed learning
inference acceleration |
0.9 | 1 | 2025 | Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous Decoding · ICML 2025 |
Programming languages and type systems › specification language
annotation language |
0.3 | 1 | 2025 | Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous Decoding · ICML 2025 |
Programming languages and type systems
domain-specific languages |
0.3 | 1 | 2025 | Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous Decoding · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
interpreter · 1.7instruction fine-tuning · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Learning to Keep a Promise: Scaling Language Model Decoding Parallelism with Learned Asynchronous DecodingabstractDecoding with autoregressive language models traditionally occurs sequentially, generating one token after another. Recent attempts to introduce parallelism require a pre-determined structure in the generated content to implement parallel generation, such as by pattern-matching on bullet points. In this work, we present a new technique to automate parallel generation by dynamically exploiting the semantic independence of generation outputs to implement asynchronous decoding. We introduce an annotation language Pasta-Lang for language models to initiate asynchronous decoding at inference time. We also develop an accompanying Pasta-Lang interpreter that performs on-the-fly asynchronous decoding, effectively implementing parallel generation and speeding up inference. We present an instruction-finetuning dataset with Pasta-Lang-annotated responses for teaching LLMs to annotate semantic independence with Pasta-Lang as well as the methodology for creating the dataset. Our evaluation shows using the interpreter with a Pasta-Lang-equipped model achieves significant speedup while maintaining the same generation quality. Ellie Y. Cheng, Zachary Ankner, Nikunj Saunshi, Blake M. Elias, Amir Yazdanbakhsh, Jonathan Ragan-Kelley, Suvinay Subramanian, Michael Carbin |
ICML | 5 |