Demo Data from EDBT 2026 / reviewers in the wild / expert
Quinn McIntyre
dblp:359/6228
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 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 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.
| Artificial intelligence
1 paper |
Deep learning architectures and training · 50% Efficient and distributed learning · 50% | |
| Software engineering, system software, and programming languages
1 paper |
Services computing and microservices · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Human-AI interaction · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Services computing and microservices › workflow management
workflow automation |
0.8 | 1 | 2024 | Automating the Enterprise with Foundation Models · Proc. VLDB Endow. 2024 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions · NeurIPS 2023 |
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
model distillation |
0.7 | 1 | 2023 | Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions · NeurIPS 2023 |
Machine learning › Deep learning architectures and training
sequence modeling |
0.7 | 1 | 2023 | Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions · NeurIPS 2023 |
Machine learning › Deep learning architectures and training
state space model |
0.7 | 1 | 2023 | Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions · NeurIPS 2023 |
Human-AI interaction
human-AI collaboration |
0.2 | 1 | 2024 | Automating the Enterprise with Foundation Models · Proc. VLDB Endow. 2024 |
Methods — techniques the papers use, named apart from their topics
process mining · 1.5multimodal foundation models · 0.8multimodal foundation model · 0.8weight tying · 0.7rational interpolation · 0.7model order reduction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Automating the Enterprise with Foundation ModelsabstractAutomating enterprise workflows could unlock $4 trillion/year in productivity gains. Despite being of interest to the data management community for decades, the ultimate vision of end-to-end workflow automation has remained elusive. Current solutions rely on process mining and robotic process automation (RPA), in which a bot is hard-coded to follow a set of predefined rules for completing a workflow. Through case studies of a hospital and large B2B enterprise, we find that the adoption of RPA has been inhibited by high set-up costs (12--18 months), unreliable execution (60% initial accuracy), and burdensome maintenance (requiring multiple FTEs). Multimodal foundation models (FMs) such as GPT-4 offer a promising new approach for end-to-end workflow automation given their generalized reasoning and planning abilities. To study these capabilities we propose ECLAIR, a system to automate enterprise workflows with minimal human supervision. We conduct initial experiments showing that multimodal FMs can address the limitations of traditional RPA with (1) near-human-level understanding of workflows (93% accuracy on a workflow understanding task) and (2) instant set-up with minimal technical barrier (based solely on a natural language description of a workflow, ECLAIR achieves end-to-end completion rates of 40%). We identify human-AI collaboration, validation, and self-improvement as open challenges, and suggest ways they can be solved with data management techniques. Michael Wornow, Avanika Narayan, Krista Opsahl-Ong, Quinn McIntyre, Nigam H. Shah, Christopher Ré |
Proc. VLDB Endow. | 4 |
| 2023 | Laughing Hyena Distillery: Extracting Compact Recurrences From ConvolutionsabstractRecent advances in attention-free sequence models rely on convolutions as alternatives to the attention operator at the core of Transformers. In particular, long convolution sequence models have achieved state-of-the-art performance in many domains, but incur a significant cost during auto-regressive inference workloads -- naively requiring a full pass (or caching of activations) over the input sequence for each generated token -- similarly to attention-based models. In this paper, we seek to enable $\mathcal O(1)$ compute and memory cost per token in any pre-trained long convolution architecture to reduce memory footprint and increase throughput during generation. Concretely, our methods consist in extracting low-dimensional linear state-space models from each convolution layer, building upon rational interpolation and model-order reduction techniques. We further introduce architectural improvements to convolution-based layers such as Hyena: by weight-tying the filters across channels into heads, we achieve higher pre-training quality and reduce the number of filters to be distilled. The resulting model achieves 10x higher throughput than Transformers and 1.5x higher than Hyena at 1.3B parameters, without any loss in quality after distillation. Stefano Massaroli, Michael Poli, Daniel Y. Fu, Hermann Kumbong, Rom N. Parnichkun, David W. Romero, Aman Timalsina, Quinn McIntyre, Beidi Chen, Atri Rudra, Ce Zhang 0001, Christopher Ré, Stefano Ermon, Yoshua Bengio |
NeurIPS | 8 |