activity
20152021
most citedSelf-Calibration and Biconvex Compressive Sensing

237 citations · 349 across the 15 of their papers we have counts for

collaborators

15 papers

cs.IT2021

Near-Optimal Bounds for Generalized Orthogonal Procrustes Problem via Generalized Power Method

Shuyang Ling

Given multiple point clouds, how to find the rigid transform (rotation, reflection, and shifting) such that these point clouds are well aligned? This problem, known as the generali…

cs.IT2021★ 1 cited

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries

Shuyang Ling

The generalized orthogonal Procrustes problem (GOPP) plays a fundamental role in several scientific disciplines including statistics, imaging science and computer vision. Despite i…

cs.IT2020★ 2 cited

Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method

Shuyang Ling

Given the noisy pairwise measurements among a set of unknown group elements, how to recover them efficiently and robustly? This problem, known as group synchronization, has drawn t…

cs.IT2020★ 3 cited

Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods

Shuyang Ling

Group synchronization asks to recover group elements from their pairwise measurements. It has found numerous applications across various scientific disciplines. In this work, we fo…

math.OC2020★ 3 cited

Solving Orthogonal Group Synchronization via Convex and Low-Rank Optimization: Tightness and Landscape Analysis

Shuyang Ling

Group synchronization aims to recover the group elements from their noisy pairwise measurements. It has found many applications in community detection, clock synchronization, and j…

stat.ML2020★ 4 cited

Strong Consistency, Graph Laplacians, and the Stochastic Block Model

Shaofeng Deng, Shuyang Ling, Thomas Strohmer

Spectral clustering has become one of the most popular algorithms in data clustering and community detection. We study the performance of classical two-step spectral clustering via…

nlin.AO2020★ 1 cited

On the Critical Coupling of the Finite Kuramoto Model on Dense Networks

Shuyang Ling

Kuramoto model is one of the most prominent models for the synchronization of coupled oscillators. It has long been a research hotspot to understand how natural frequencies, the in…

math.OC2018★ 3 cited

On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization

Shuyang Ling, Ruitu Xu, Afonso S. Bandeira

Studying the landscape of nonconvex cost function is key towards a better understanding of optimization algorithms widely used in signal processing, statistics, and machine learnin…

stat.ML2018★ 1 cited

Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering

Shuyang Ling, Thomas Strohmer

Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its…

math.OC2017★ 1 cited

When Do Birds of a Feather Flock Together? k-Means, Proximity, and Conic Programming

Xiaodong Li, Yang Li, Shuyang Ling +2

Given a set of data, one central goal is to group them into clusters based on some notion of similarity between the individual objects. One of the most popular and widely-used appr…

cs.IT2017★ 9 cited

Regularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing

Shuyang Ling, Thomas Strohmer

We study the question of extracting a sequence of functions from observing only the sum of their convolutions, i.e., from $\boldsym…

cs.IT2016★ 2 cited

Self-Calibration and Bilinear Inverse Problems via Linear Least Squares

Shuyang Ling, Thomas Strohmer

Whenever we use devices to take measurements, calibration is indispensable. While the purpose of calibration is to reduce bias and uncertainty in the measurements, it can be quite…

cs.IT2016★ 58 cited

Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization

Xiaodong Li, Shuyang Ling, Thomas Strohmer +1

We study the question of reconstructing two signals and from their convolution . This problem, known as {\em blind deconvolution}, pervades many areas of scien…

cs.IT2015★ 24 cited

Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds

Shuyang Ling, Thomas Strohmer

Suppose that we have sensors and each one intends to send a function (e.g.\ a signal or an image) to a receiver common to all sensors. During transmissio…

cs.IT2015★ 237 cited

Self-Calibration and Biconvex Compressive Sensing

Shuyang Ling, Thomas Strohmer

The design of high-precision sensing devises becomes ever more difficult and expensive. At the same time, the need for precise calibration of these devices (ranging from tiny senso…