Search Results for author: Marco Avella-Medina

Found 6 papers, 1 papers with code

Kernel PCA for multivariate extremes

no code implementations23 Nov 2022 Marco Avella-Medina, Richard A. Davis, Gennady Samorodnitsky

We propose kernel PCA as a method for analyzing the dependence structure of multivariate extremes and demonstrate that it can be a powerful tool for clustering and dimension reduction.

Dimensionality Reduction

Differentially private inference via noisy optimization

1 code implementation19 Mar 2021 Marco Avella-Medina, Casey Bradshaw, Po-Ling Loh

We propose a general optimization-based framework for computing differentially private M-estimators and a new method for constructing differentially private confidence regions.

Propose, Test, Release: Differentially private estimation with high probability

no code implementations19 Feb 2020 Victor-Emmanuel Brunel, Marco Avella-Medina

We derive concentration inequalities for differentially private median and mean estimators building on the "Propose, Test, Release" (PTR) mechanism introduced by Dwork and Lei (2009).

Vocal Bursts Intensity Prediction

Privacy-preserving parametric inference: a case for robust statistics

no code implementations22 Nov 2019 Marco Avella-Medina

Differential privacy is a cryptographically-motivated approach to privacy that has become a very active field of research over the last decade in theoretical computer science and machine learning.

Privacy Preserving

Differentially private sub-Gaussian location estimators

no code implementations27 Jun 2019 Marco Avella-Medina, Victor-Emmanuel Brunel

We tackle the problem of estimating a location parameter with differential privacy guarantees and sub-Gaussian deviations.

Centrality measures for graphons: Accounting for uncertainty in networks

no code implementations28 Jul 2017 Marco Avella-Medina, Francesca Parise, Michael T. Schaub, Santiago Segarra

Using the theory of linear integral operators, we define degree, eigenvector, Katz and PageRank centrality functions for graphons and establish concentration inequalities demonstrating that graphon centrality functions arise naturally as limits of their counterparts defined on sequences of graphs of increasing size.

Cannot find the paper you are looking for? You can Submit a new open access paper.