← Search

Paolo Papotti

12 accepted papers

2025

An LLM-Based Approach for Insight Generation in Data Analysis

NAACL 2025long

Generating insightful and actionable information from databases is critical in data analysis. This paper introduces a novel approach using Large Language Models (LLMs) to automatically generate textual insights. Given a multi-table database as input, our method leverages LLMs to produce concise, tex…

Cited by 0SourcePDFScholar
2025

Automated Detection of Tropes In Short Texts

COLING 2025main

Tropes — recurring narrative elements like the “smoking gun” or the “veil of secrecy” — are often used in movies to convey familiar patterns. However, they also play a significant role in online communication about societal issues, where they can oversimplify complex matters and deteriorate public d…

Cited by 0SourcePDFScholar
2025

Data Void Exploits: Tracking & Mitigation Strategies (Extended Abstract)

IJCAI 2025

In the evolving landscape of online information, disinformation is a growing concern. A concept central to this challenge is the "data void", a situation where there is a lack of relevant information online regarding certain search terms. This creates an opportunity for misleading or false narrative

2025

Refining Attention for Explainable and Noise-Robust Fact-Checking with Transformers

EMNLP 2025

In tasks like question answering and fact-checking, models must discern relevant information from extensive corpora in an “open-book” setting. Conventional transformer-based models excel at classifying input data, but (i) often falter due to sensitivity to noise and (ii) lack explainability regardin

2025

SQUAB: Evaluating LLM robustness to Ambiguous and Unanswerable Questions in Semantic Parsing

EMNLP 2025

Large Language Models (LLMs) have demonstrated robust performance in Semantic Parsing (SP) for well-defined queries with unambiguous intent and answerable responses. However, practical user questions frequently deviate from these ideal conditions, challenging the applicability of existing benchmarks

2024

Unknown Claims: Generation of Fact-Checking Training Examples from Unstructured and Structured Data

EMNLP 2024main

Computational fact-checking (FC) relies on supervised models to verify claims based on given evidence, requiring a resource-intensive process to annotate large volumes of training data. We introduce Unown, a novel framework that generates training instances for FC systems automatically using both te…

2023

Definitions Matter: Guiding GPT for Multi-label Classification

EMNLP 2023short findings

Large language models have recently risen in popularity due to their ability to perform many natural language tasks without requiring any fine-tuning. In this work, we focus on two novel ideas: (1) generating definitions from examples and using them for zero-shot classification, and (2) investigatin…

Cited by 0SourceScholar
2023

QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data

NeurIPS 2023poster

Table Representation Learning (TRL) models are commonly pre-trained on large open-domain datasets comprising millions of tables and then used to address downstream tasks. Choosing the right TRL model to use on proprietary data can be challenging, as the best results depend on the content domain, sch…

2021

Automated Fact-Checking for Assisting Human Fact-Checkers

IJCAI 2021poster

The reporting and the analysis of current events around the globe has expanded from professional, editor-lead journalism all the way to citizen journalism. Nowadays, politicians and other key players enjoy direct access to their audiences through social media, bypassing the filters of official cable…

Cited by 281SourcePDFScholar
2021

RuleBERT: Teaching Soft Rules to Pre-Trained Language Models

EMNLP 2021main

While pre-trained language models (PLMs) are the go-to solution to tackle many natural language processing problems, they are still very limited in their ability to capture and to use common-sense knowledge. In fact, even if information is available in the form of approximate (soft) logical rules, i…

2020

LIBRE: Learning Interpretable Boolean Rule Ensembles

AISTATS 2020poster

We present a novel method—LIBRE—learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up, weak learners operating on a random subset of features, which allows for the learning of rules that generalize well on unseen data even in imbalanced…

Cited by 25SourcePDFScholar