424 citations · 1.3k across the 35 of their papers we have counts for
37 papers
Optimal Local Convergence Rates of Stochastic First-Order Methods under Local -PL
Saeed Masiha, Saber Salehkaleybar, Niao He +2
We study the local convergence rate of stochastic first-order methods under a local -Polyak-Lojasiewicz (-PL) condition in a neighborhood of a target connected component $\ma…
Fast Proxy Experiment Design for Causal Effect Identification
Sepehr Elahi, Sina Akbari, Jalal Etesami +2
Identifying causal effects is a key problem of interest across many disciplines. The two long-standing approaches to estimate causal effects are observational and experimental (ran…
Why the Metric Backbone Preserves Community Structure
Maximilien Dreveton, Charbel Chucri, Matthias Grossglauser +1
The metric backbone of a weighted graph is the union of all-pairs shortest paths. It is obtained by removing all edges that are not the shortest path between and . I…
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models
Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser +1
Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster label…
Differences Between Hard and Noisy-labeled Samples: An Empirical Study
Mahsa Forouzesh, Patrick Thiran
Extracting noisy or incorrectly labeled samples from a labeled dataset with hard/difficult samples is an important yet under-explored topic. Two general and often independent lines…
When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
Maximilien Dreveton, Daichi Kuroda, Matthias Grossglauser +1
Hierarchical clustering of networks consists in finding a tree of communities, such that lower levels of the hierarchy reveal finer-grained community structures. There are two main…