Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Artidoro Pagnoni

dblp:223/9977 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
8since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 4 first-author · 7 since 2021Databases, data management, data science and information retrieval · 2 · 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
5 papers
Language models and text generation · 47% Efficient and distributed learning · 34% Knowledge representation and reasoning · 12%
Databases, data mining, and information retrieval
2 papers
Machine learning and data management · 100%

Topics — the 15 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › language modeling
byte-level language model
0.912025
Byte Latent Transformer: Patches Scale Better Than Tokens · ACL (1) 2025
Natural language and speech › Language models and text generation › language modeling
language model architecture
0.912025
Byte Latent Transformer: Patches Scale Better Than Tokens · ACL (1) 2025
Natural language and speech › Language models and text generation
tokenization
0.912025
Byte Latent Transformer: Patches Scale Better Than Tokens · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression › quantization › low-bit quantization
4-bit quantization
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Natural language and speech › Language models and text generation › text summarization
controllable summarization
0.712023
Socratic Pretraining: Question-Driven Pretraining for Controllable Summarization · ACL (1) 2023
Natural language and speech › Language models and text generation
instruction tuning
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Machine learning › Efficient and distributed learning
model compression
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Machine learning › Representation and self-supervised learning
pre-training
0.712023
Socratic Pretraining: Question-Driven Pretraining for Controllable Summarization · ACL (1) 2023
Machine learning › Efficient and distributed learning › model compression
quantization
0.712023
QLoRA: Efficient Finetuning of Quantized LLMs · NeurIPS 2023
Natural language and speech › Language models and text generation
text summarization
0.712023
Socratic Pretraining: Question-Driven Pretraining for Controllable Summarization · ACL (1) 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › temporal reasoning
event reasoning
0.612022
EvEntS ReaLM: Event Reasoning of Entity States via Language Models · EMNLP 2022
Machine learning and data management
machine learning pipeline
0.512021
WindTunnel: Towards Differentiable ML Pipelines Beyond a Single Modele · Proc. VLDB Endow. 2021
Machine learning › Deep learning architectures and training
backpropagation
0.112021
WindTunnel: Towards Differentiable ML Pipelines Beyond a Single Modele · Proc. VLDB Endow. 2021

Methods — techniques the papers use, named apart from their topics

gradient boosting trees · 1.0backpropagation · 1.0latent transformer · 0.9unsupervised pre-training · 0.7question generation · 0.7paged optimizers · 0.7normalfloat · 0.7double quantization · 0.7prompting · 0.6large language model · 0.6
YearPublicationVenuePosition
2025 Byte Latent Transformer: Patches Scale Better Than Tokens
abstract
Artidoro Pagnoni, Ramakanth Pasunuru, Pedro Rodriguez, John Nguyen, Benjamin Muller, Margaret Li, Chunting Zhou, Lili Yu, Jason E Weston, Luke Zettlemoyer, Gargi Ghosh, Mike Lewis, Ari Holtzman, Srini Iyer. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Artidoro Pagnoni, Ramakanth Pasunuru, Pedro Rodríguez 0001, John Nguyen, Benjamin Muller, Margaret Li, Chunting Zhou, Lili Yu, Jason Weston, Luke Zettlemoyer, Gargi Ghosh, Mike Lewis, Ari Holtzman, Srinivasan Iyer 0001
ACL (1)1
2023 Socratic Pretraining: Question-Driven Pretraining for Controllable Summarization
abstract
In long document controllable summarization, where labeled data is scarce, pretrained models struggle to adapt to the task and effectively respond to user queries.In this paper, we introduce SOCRATIC pretraining, a question-driven, unsupervised pretraining objective specifically designed to improve controllability in summarization tasks.By training a model to generate and answer relevant questions in a given context, SOCRATIC pretraining enables the model to more effectively adhere to user-provided queries and identify relevant content to be summarized.We demonstrate the effectiveness of this approach through extensive experimentation on two summarization domains, short stories and dialogue, and multiple control strategies: keywords, questions, and factoid QA pairs.Our pretraining method relies only on unlabeled documents and a question generation system and outperforms pre-finetuning approaches that use additional supervised data.Furthermore, our results show that SOCRATIC pretraining cuts task-specific labeled data requirements in half, is more faithful to userprovided queries, and achieves state-of-the-art performance on QMSum and SQuALITY.Joseph L Fleiss.1971.Measuring nominal scale agreement among many raters.
Artidoro Pagnoni, Alexander R. Fabbri, Wojciech Kryscinski, Chien-Sheng Wu
ACL (1)1
2023 QLoRA: Efficient Finetuning of Quantized LLMs
abstract
We present QLoRA, an efficient finetuning approach that reduces memory usage enough to finetune a 65B parameter model on a single 48GB GPU while preserving full 16-bit finetuning task performance. QLoRA backpropagates gradients through a frozen, 4-bit quantized pretrained language model into Low Rank Adapters~(LoRA). Our best model family, which we name Guanaco, outperforms all previous openly released models on the Vicuna benchmark, reaching 99.3% of the performance level of ChatGPT while only requiring 24 hours of finetuning on a single GPU. QLoRA introduces a number of innovations to save memory without sacrificing performance: (a) 4-bit NormalFloat (NF4), a new data type that is information-theoretically optimal for normally distributed weights (b) Double Quantization to reduce the average memory footprint by quantizing the quantization constants, and (c) Paged Optimziers to manage memory spikes. We use QLoRA to finetune more than 1,000 models, providing a detailed analysis of instruction following and chatbot performance across 8 instruction datasets, multiple model types (LLaMA, T5), and model scales that would be infeasible to run with regular finetuning (e.g. 33B and 65B parameter models). Our results show that QLoRA finetuning on a small, high-quality dataset leads to state-of-the-art results, even when using smaller models than the previous SoTA. We provide a detailed analysis of chatbot performance based on both human and GPT-4 evaluations, showing that GPT-4 evaluations are a cheap and reasonable alternative to human evaluation. Furthermore, we find that current chatbot benchmarks are not trustworthy to accurately evaluate the performance levels of chatbots. A lemon-picked analysis demonstrates where Guanaco fails compared to ChatGPT. We release all of our models and code, including CUDA kernels for 4-bit training.
Tim Dettmers, Artidoro Pagnoni, Ari Holtzman, Luke Zettlemoyer
NeurIPS2
2022 Threat Scenarios and Best Practices to Detect Neural Fake News
abstract
In this work, we discuss different threat scenarios from neural fake news generated by state-of-the-art language models. Through our experiments, we assess the performance of generated text detection systems under these threat scenarios. For each scenario, we also identify the minimax strategy for the detector that minimizes its worst-case performance. This constitutes a set of best practices that practitioners can rely on. In our analysis, we find that detectors are prone to shortcut learning (lack of out-of-distribution generalization) and discuss approaches to mitigate this problem and improve detectors more broadly. Finally, we argue that strong detectors should be released along with new generators.
Artidoro Pagnoni, Martin Graciarena, Yulia Tsvetkov
COLING1
2022 EvEntS ReaLM: Event Reasoning of Entity States via Language Models
abstract
This paper investigates models of event implications.Specifically, how well models predict entity state-changes, by targeting their understanding of physical attributes.Nominally, Large Language models (LLM) have been exposed to procedural knowledge about how objects interact, yet our benchmarking shows they fail to reason about the world.Conversely, we also demonstrate that existing approaches often misrepresent the surprising abilities of LLMs via improper task encodings and that proper model prompting can dramatically improve performance of reported baseline results across multiple tasks.In particular, our results indicate that our prompting technique is especially useful for unseen attributes (out-of-domain) or when only limited data is available.1
Evangelia Spiliopoulou, Artidoro Pagnoni, Yonatan Bisk, Eduard H. Hovy
EMNLP2
2021 StructSum: Summarization via Structured Representations
abstract
Vidhisha Balachandran, Artidoro Pagnoni, Jay Yoon Lee, Dheeraj Rajagopal, Jaime Carbonell, Yulia Tsvetkov. Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume. 2021.
Vidhisha Balachandran, Artidoro Pagnoni, Jay-Yoon Lee, Dheeraj Rajagopal, Jaime G. Carbonell, Yulia Tsvetkov
EACL2
2021 Understanding Factuality in Abstractive Summarization with FRANK: A Benchmark for Factuality Metrics
abstract
Artidoro Pagnoni, Vidhisha Balachandran, Yulia Tsvetkov. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021.
Artidoro Pagnoni, Vidhisha Balachandran, Yulia Tsvetkov
NAACL-HLT1
2021 WindTunnel: Towards Differentiable ML Pipelines Beyond a Single Modele
abstract
While deep neural networks (DNNs) have shown to be successful in several domains like computer vision, non-DNN models such as linear models and gradient boosting trees are still considered state-of-the-art over tabular data. When using these models, data scientists often author machine learning (ML) pipelines: DAG of ML operators comprising data transforms and ML models, whereby each operator is sequentially trained one-at-a-time. Conversely, when training DNNs, layers composing the neural networks are simultaneously trained using backpropagation. In this paper, we argue that the training scheme of ML pipelines is sub-optimal because it tries to optimize a single operator at a time thus losing the chance of global optimization. We therefore propose WindTunnel: a system that translates a trained ML pipeline into a pipeline of neural network modules and jointly optimizes the modules using backpropagation. We also suggest translation methodologies for several non-differentiable operators such as gradient boosting trees and categorical feature encoders. Our experiments show that fine-tuning of the translated WindTunnel pipelines is a promising technique able to increase the final accuracy.
Gyeong-In Yu, Saeed Amizadeh, Sehoon Kim 0001, Artidoro Pagnoni, Ce Zhang 0001, Byung-Gon Chun, Markus Weimer, Matteo Interlandi
Proc. VLDB Endow.4
2020 Definition Frames: Using Definitions for Hybrid Concept Representations
abstract
Advances in word representations have shown tremendous improvements in downstream NLP tasks, but lack semantic interpretability.In this paper 1 , we introduce Definition Frames (DF), a matrix distributed representation extracted from definitions, where each dimension is semantically interpretable.DF dimensions correspond to the Qualia structure relations (Boguraev and Pustejovsky, 1990): a set of relations that uniquely define a term.Our results show that DFs have competitive performance with other distributional semantic approaches on word similarity tasks.
Evangelia Spiliopoulou, Artidoro Pagnoni, Eduard H. Hovy
COLING2
2019 Machine Learning at Microsoft with ML.NET
abstract
Machine Learning is transitioning from an art and science into a technology available to every developer. In the near future, every application on every platform will incorporate trained models to encode data-based decisions that would be impossible for developers to author. This presents a significant engineering challenge, since currently data science and modeling are largely decoupled from standard software development processes. This separation makes incorporating machine learning capabilities inside applications unnecessarily costly and difficult, and furthermore discourage developers from embracing ML in first place. In this paper we present ML.NET, a framework developed at Microsoft over the last decade in response to the challenge of making it easy to ship machine learning models in large software applications. We present its architecture, and illuminate the application demands that shaped it. Specifically, we introduce DataView, the core data abstraction of ML.NET which allows it to capture full predictive pipelines efficiently and consistently across training and inference lifecycles. We close the paper with a surprisingly favorable performance study of ML.NET compared to more recent entrants, and a discussion of some lessons learned.
Saeed Amizadeh, Mikhail Bilenko, Rogan Carr, Wei-Sheng Chin, Yael Dekel, Xavier Dupré, Vadim Eksarevskiy, Senja Filipi, Tom Finley, Abhishek Goswami, Monte Hoover, Scott Inglis, Matteo Interlandi, Najeeb Kazmi, Gleb Krivosheev, Pete Luferenko, Ivan Matantsev, Sergiy Matusevych, Shahab Moradi, Gani Nazirov, Justin Ormont, Gal Oshri, Artidoro Pagnoni, Jignesh Parmar, Prabhat Roy, Mohammad Zeeshan Siddiqui, Markus Weimer, Shauheen Zahirazami
KDD24