← Search

Stefano Peluchetti

8 accepted papers

2026

Sparser, Faster, Lighter Transformer Language Models

ICML 2026poster

Scaling autoregressive large language models (LLMs) has had an unprecedented impact, but at vast computational costs. In this work, we tackle these costs by leveraging unstructured sparsity within an LLM's feedforward layers, which account for the majority of its parameters and execution FLOPs. To a…

Cited by 0SourceScholar
2021

A Bayesian nonparametric approach to count-min sketch under power-law data streams

AISTATS 2021poster

The count-min sketch (CMS) is a randomized data structure that provides estimates of tokens’ frequencies in a large data stream using a compressed representation of the data by random hashing. In this paper, we rely on a recent Bayesian nonparametric (BNP) view on the CMS to develop a novel learning…

Cited by 11SourcePDFScholar
2021

Large-width functional asymptotics for deep Gaussian neural networks

ICLR 2021poster

In this paper, we consider fully connected feed-forward deep neural networks where weights and biases are independent and identically distributed according to Gaussian distributions. Extending previous results (Matthews et al., 2018a;b;Yang, 2019) we adopt a function-space perspective, i.e. we look…

Cited by 20SourcePDFScholar
2020

Stable behaviour of infinitely wide deep neural networks

AISTATS 2020poster

We consider fully connected feed-forward deep neural networks (NNs) where weights and biases are independent and identically distributed as symmetric centered stable distributions. Then, we show that the infinite wide limit of the NN, under suitable scaling on the weights, is a stochastic process wh…