Gabriele Sicuro

According to our database, Gabriele Sicuro authored at least 12 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

High-dimensional robust regression under heavy-tailed data: Asymptotics and Universality.

Urte Adomaityte, Leonardo Defilippis, Bruno Loureiro, Gabriele Sicuro

CoRR, 2023

Classification of Superstatistical Features in High Dimensions.

Urte Adomaityte, Gabriele Sicuro, Pierpaolo Vivo

CoRR, 2023

Classification of Heavy-tailed Features in High Dimensions: a Superstatistical Approach.

Urte Adomaityte, Gabriele Sicuro, Pierpaolo Vivo

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Planted matching problems on random hypergraphs.

Urte Adomaityte, Anshul Toshniwal, Gabriele Sicuro, Lenka Zdeborová

CoRR, 2022

Fluctuations, Bias, Variance & Ensemble of Learners: Exact Asymptotics for Convex Losses in High-Dimension.

Bruno Loureiro, Cédric Gerbelot, Maria Refinetti, Gabriele Sicuro, Florent Krzakala

Proceedings of the International Conference on Machine Learning, 2022

2021

Aligning random graphs with a sub-tree similarity message-passing algorithm.

Giovanni Piccioli, Guilhem Semerjian, Gabriele Sicuro, Lenka Zdeborová

CoRR, 2021

Learning Gaussian Mixtures with Generalised Linear Models: Precise Asymptotics in High-dimensions.

Bruno Loureiro, Gabriele Sicuro, Cédric Gerbelot, Alessandro Pacco, Florent Krzakala, Lenka Zdeborová

CoRR, 2021

Learning Gaussian Mixtures with Generalized Linear Models: Precise Asymptotics in High-dimensions.

Bruno Loureiro, Gabriele Sicuro, Cédric Gerbelot, Alessandro Pacco, Florent Krzakala, Lenka Zdeborová

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

The planted k-factor problem.

Gabriele Sicuro, Lenka Zdeborová

CoRR, 2020

Recovery thresholds in the sparse planted matching problem.

Guilhem Semerjian, Gabriele Sicuro, Lenka Zdeborová

CoRR, 2020

2016

One-loop diagrams in the Random Euclidean Matching Problem.

Carlo Lucibello, Giorgio Parisi, Gabriele Sicuro

CoRR, 2016

2014

A Scaling Hypothesis for the Euclidean Bipartite Matching Problem.

Sergio Caracciolo, Carlo Lucibello, Giorgio Parisi, Gabriele Sicuro

CoRR, 2014