Mihai Cucuringu

activity

20162021

most citedSPONGE: A generalized eigenproblem for clustering signed networks

26 citations · 39 across the 4 of their papers we have counts for

collaborators

Showing stat.MLShow all

5 papers · 1 filter

stat.ML2021

An extension of the angular synchronization problem to the heterogeneous setting

Mihai Cucuringu, Hemant Tyagi

Given an undirected measurement graph $G = ([n], E)$ , the classical angular synchronization problem consists of recovering unknown angles $θ_{1}, \dots, θ_{n}$ from a collection of noisy…

stat.ML2020★ 13 cited

Regularized spectral methods for clustering signed networks

Mihai Cucuringu, Apoorv Vikram Singh, Déborah Sulem +1

We study the problem of $k$ -way clustering in signed graphs. Considerable attention in recent years has been devoted to analyzing and modeling signed graphs, where the affinity mea…

stat.ML2019

Ranking and synchronization from pairwise measurements via SVD

Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi

Given a measurement graph $G = (V, E)$ and an unknown signal $r \in R^{n}$ , we investigate algorithms for recovering $r$ from pairwise measurements of the form $r_{i} - r_{j}$ ; $\…

stat.ML2019★ 26 cited

SPONGE: A generalized eigenproblem for clustering signed networks

Mihai Cucuringu, Peter Davies, Aldo Glielmo +1

We introduce a principled and theoretically sound spectral method for $k$ -way clustering in signed graphs, where the affinity measure between nodes takes either positive or negativ…

stat.ML2018

Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping

Mihai Cucuringu, Hemant Tyagi

Consider an unknown smooth function $f : [0, 1]^{d} \to R$ , and say we are given $n$ noisy mod 1 samples of $f$ , i.e., $y_{i} = (f (x_{i}) + η_{i}) mod 1$ , for $x_i \in [0,1]…