Designed and built with care, filled with creative elements

Top

Serte Donderwinkel – Counting connected graphs

Salle W (ENS)

How many connected graphs have a prescribed degree sequence?This classical combinatorial question turns out to admit a natural probabilistic approach. In joint ongoing work with Sasha Bell and Remco van der Hofstad, we derive asymptotic formulas for the number of connected graphs with a given degree sequence. Our approach is an example of the probabilistic method: rather than counting directly, we introduce a suitable random graph model and study the likelihood that it exhibits a desired structure. Concretely, we construct a random graph in which (an approximation of) the prescribed […]

Conformal Prediction for Uncertainty Quantification in Machine Learning: Recent Advances

Salle W

Machine learning models are often seen as black-box systems that output point predictions without indicating how confident they are in those predictions. Recently, Conformal Prediction (CP) has emerged as a powerful framework to address this issue by transforming point predictions into set-valued predictions with probabilistic guarantees. In this talk, I will introduce CP and briefly present some key challenges and recent advances in the area. I will first discuss how to perform CP in a Federated Learning setting, showing that a single round of communication is sufficient to match the […]

Marco Mazzucchelli

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Céline Lévy-Leduc

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Vlad Vicol

Jussieu -- salle 15-16-309 4 Place Jussieu, Paris, France

Rémi Coulon

ENS — amphi Galois 45 rue d'Ulm, Paris, France

Séminaires des Mathématiques

Hélène Mathis

Salle W - ENS PSL 45 rue d'Ulm, Paris, France