research
∙
03/27/2023
Learning linear dynamical systems under convex constraints
We consider the problem of identification of linear dynamical systems fr...
share
research
∙
07/04/2022
Dynamic Ranking and Translation Synchronization
In many applications, such as sport tournaments or recommendation system...
research
∙
05/24/2022
Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method
Clustering bipartite graphs is a fundamental task in network analysis. I...
research
∙
04/08/2022
Seeded graph matching for the correlated Wigner model via the projected power method
In the graph matching problem we observe two graphs G,H and the goal is ...
research
∙
12/20/2021
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees
Real-world networks often come with side information that can help to im...
research
∙
12/02/2021
Recovering Hölder smooth functions from noisy modulo samples
In signal processing, several applications involve the recovery of a fun...
research
∙
09/28/2021
Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method
Many applications such as recommendation systems or sports tournaments i...
research
∙
03/04/2021
Clustering multilayer graphs with missing nodes
Relationship between agents can be conveniently represented by graphs. W...
research
∙
12/29/2020
An extension of the angular synchronization problem to the heterogeneous setting
Given an undirected measurement graph G = ([n], E), the classical angula...
research
∙
11/03/2020
Regularized spectral methods for clustering signed networks
We study the problem of k-way clustering in signed graphs. Considerable ...
research
∙
09/10/2020
Error analysis for denoising smooth modulo signals on a graph
In many applications, we are given access to noisy modulo samples of a s...
research
∙
09/10/2020
Denoising modulo samples: k-NN regression and tightness of SDP relaxation
Many modern applications involve the acquisition of noisy modulo samples...
research
∙
06/06/2019
Ranking and synchronization from pairwise measurements via SVD
Given a measurement graph G= (V,E) and an unknown signal r ∈R^n, we inve...
research
∙
04/18/2019
SPONGE: A generalized eigenproblem for clustering signed networks
We introduce a principled and theoretically sound spectral method for k-...
research
∙
07/08/2018
Multi-kernel unmixing and super-resolution using the Modified Matrix Pencil method
Consider L groups of point sources or spike trains, with the l^th group ...
research
∙
04/04/2018
Sparse non-negative super-resolution - simplified and stabilised
The convolution of a discrete measure, x=∑_i=1^ka_iδ_t_i, with a local w...
research
∙
03/09/2018
Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
Consider an unknown smooth function f: [0,1]^d →R, and say we are given ...
research
∙
10/27/2017
On denoising modulo 1 samples of a function
Consider an unknown smooth function f: [0,1] →R, and say we are given n ...
research
∙
05/02/2016
Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions
A function f: R^d →R is a Sparse Additive Model (SPAM), if it is of the ...
research
∙
04/18/2016
Learning Sparse Additive Models with Interactions in High Dimensions
A function f: R^d →R is referred to as a Sparse Additive Model (SPAM), i...
research
∙
12/01/2013
Stochastic continuum armed bandit problem of few linear parameters in high dimensions
We consider a stochastic continuum armed bandit problem where the arms a...
research
∙
10/07/2013
