EN

Ricerca

Ruoli

Set 2025 – presente

Ricercatore di tesi magistrale

Studio di come i modelli di diffusione memorizzano esempi specifici di training oltre a quanto appreso come pattern generale, e di come misurare e controllare questo fenomeno.

Apr 2025 – presente

Advisor e ricercatore

Advisor per progetti BSML e co-organizzatore di eventi in ateneo (un tutorial HPC, incontri con aziende del settore). Primo autore di uno studio che confronta le saliency map di CNN con l'attenzione dei radiologi su radiografie toraciche pediatriche, con oltre 300 annotazioni di esperti.

Pubblicazioni

2026

Diffusion Language Models Are Natively Length-Aware

arXiv:2603.06123

*Contributo equo.

Abstract

Unlike autoregressive language models, which terminate variable-length generation upon predicting an End-of-Sequence (EoS) token, Diffusion Language Models (DLMs) operate over a fixed maximum-length context window for a predetermined number of denoising steps. However, this process is independent of the required response length, resulting in computational waste for the majority of short responses common in reasoning and chat tasks. To address this problem, we conjecture that the latent prompt representation contains sufficient information to estimate the required output length. We provide empirical evidence for this phenomenon and propose a zero-shot mechanism to dynamically crop the context window before generation begins, leading to fewer diffusion steps and substantial computational savings. We evaluate our approach on four benchmarks with diverse tasks -- GSM8K (reasoning), HumanEval (code generation), IfEval (instruction following), and LongFormQA (question answering) -- revealing massive efficiency gains at minimal performance impact. We report significant reductions in FLOPs across all tasks, with no statistically significant performance degradation, and significant performance improvements in 2 out of 4 tasks.

2026

Generalizzazione Parziale nei Modelli di Diffusione

ICML 2026 arXiv:2603.03469

Spotlight, primo 2.2% delle submission. *Contributo equo.

Preprint su arXiv Codice
Abstract

Generalization in generative modeling is defined as the ability to learn an underlying distribution from a finite dataset and produce novel samples, with evaluation largely driven by held-out performance and perceived sample quality. In practice, training is often stopped at the minimum of the test loss, taken as an operational indicator of generalization. We challenge this viewpoint by identifying a phase of biased generalization during training, in which the model continues to decrease the test loss while favoring samples with anomalously high proximity to training data. By training the same network on two disjoint datasets and comparing the mutual distances of generated samples and their similarity to training data, we introduce a quantitative measure of bias and demonstrate its presence on real images. We then study the mechanism of bias, using a controlled hierarchical data model where access to exact scores and ground-truth statistics allows us to precisely characterize its onset. We attribute this phenomenon to the sequential nature of feature learning in deep networks, where coarse structure is learned early in a data-independent manner, while finer features are resolved later in a way that increasingly depends on individual training samples. Our results show that early stopping at the test loss minimum, while optimal under standard generalization criteria, may be insufficient for privacy-critical applications.