Andrea Paudice

Computer Science · Physical Sciences

9h-index849citations37works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Machine Learning and Algorithms(12), Network Security and Intrusion Detection(7), Anomaly Detection Techniques and Applications(5), Adversarial Robustness in Machine Learning(5), Data Management and Algorithms(4)

Publications37 total

Sample-Near-Optimal Agnostic Boosting with Improved Running Time
arXiv (Cornell University)·2026Open Access
Sample-Near-Optimal Agnostic Boosting with Improved Running Time
arXiv (Cornell University)·2026Open Access
Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means
arXiv (Cornell University)·2025Open Access
Revisiting Agnostic Boosting
arXiv (Cornell University)·2025Open Access
Revisiting Agnostic Boosting
2025
An improved uniform convergence bound with fat-shattering dimension
Information Processing Letters·2024Open Access
High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise]
SIAM Journal on Mathematics of Data Science·2024Open Access
An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise
arXiv (Cornell University)·2024Open Access
General Tail Bounds for Non-Smooth Stochastic Mirror Descent
arXiv (Cornell University)·2023Open Access
An Improved Uniform Convergence Bound with Fat-Shattering Dimension
arXiv (Cornell University)·2023Open Access
An Improved Uniform Convergence Bound with Fat-Shattering Dimension
SSRN Electronic Journal·2023Open Access
Active Learning of Classifiers with Label and Seed Queries
arXiv (Cornell University)·2022Open Access
Regret Analysis of Dyadic Search
arXiv (Cornell University)·2022Open Access
High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise
arXiv (Cornell University)·2022Open Access
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization
arXiv (Cornell University)·2022· 2 citedOpen Access
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)·2021Open Access
On Margin-Based Cluster Recovery with Oracle Queries
arXiv (Cornell University)·2021Open Access
Multitask Online Mirror Descent
arXiv (Cornell University)·2021Open Access
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
arXiv (Cornell University)·2021· 3 citedOpen Access
A Perturbation Resilient Framework for Unsupervised Learning.
arXiv (Cornell University)·2020Open Access
page 1 of 2Next →

Frequent Co-authors

Nicolò Cesa‐Bianchi(10), Marco Bressan(9), Luis Muñoz-González(8), Emil Lupu(8), Silvio Lattanzi(6), Roberto Colomboni(5), Daniela A. Parletta(5), Massimiliano Pontil(5), Battista Biggio(3), Ambra Demontis(3), Vasin Wongrassamee(3), Fabio Roli(3), Domenico Cotroneo(3), Fabio Vitale(3), Saverio Salzo(3), Emmanuel Esposito(3), Arthur da Cunha(3), Antonio Pecchia(2), François Bachoc(2), Tommaso Cesari(2)