25 citations · 55 across the 12 of their papers we have counts for
12 papers
The Ideal Continual Learner: An Agent That Never Forgets
Liangzu Peng, Paris V. Giampouras, René Vidal
The goal of continual learning is to find a model that solves multiple learning tasks which are presented sequentially to the learner. A key challenge in this setting is that the l…
Block Coordinate Descent on Smooth Manifolds: Convergence Theory and Twenty-One Examples
Liangzu Peng, René Vidal
Block coordinate descent is an optimization paradigm that iteratively updates one block of variables at a time, making it quite amenable to big data applications due to its scalabi…
Accelerating Globally Optimal Consensus Maximization in Geometric Vision
Xinyue Zhang, Liangzu Peng, Wanting Xu +1
Branch-and-bound-based consensus maximization stands out due to its important ability of retrieving the globally optimal solution to outlier-affected geometric problems. However, w…
PeSOTIF: a Challenging Visual Dataset for Perception SOTIF Problems in Long-tail Traffic Scenarios
Liang Peng, Jun Li, Wenbo Shao +1
Perception algorithms in autonomous driving systems confront great challenges in long-tail traffic scenarios, where the problems of Safety of the Intended Functionality (SOTIF) cou…
Global Linear and Local Superlinear Convergence of IRLS for Non-Smooth Robust Regression
Liangzu Peng, Christian Kümmerle, René Vidal
We advance both the theory and practice of robust -quasinorm regression for by using novel variants of iteratively reweighted least-squares (IRLS) to solve th…
Towards Understanding The Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search
Liangzu Peng, Mahyar Fazlyab, René Vidal
The rotation search problem aims to find a 3D rotation that best aligns a given number of point pairs. To induce robustness against outliers for rotation search, prior work conside…
ARCS: Accurate Rotation and Correspondence Search
Liangzu Peng, Manolis C. Tsakiris, René Vidal
This paper is about the old Wahba problem in its more general form, which we call "simultaneous rotation and correspondence search". In this generalization we need to find a rotati…
Unlabeled Principal Component Analysis and Matrix Completion
Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris
We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component An…
Homomorphic Sensing of Subspace Arrangements
Liangzu Peng, Manolis C. Tsakiris
Homomorphic sensing is a recent algebraic-geometric framework that studies the unique recovery of points in a linear subspace from their images under a given collection of linear m…
Linear Regression without Correspondences via Concave Minimization
Liangzu Peng, Manolis C. Tsakiris
Linear regression without correspondences concerns the recovery of a signal in the linear regression setting, where the correspondences between the observations and the linear func…
Homomorphic Sensing
Manolis C. Tsakiris, Liangzu Peng
A recent line of research termed unlabeled sensing and shuffled linear regression has been exploring under great generality the recovery of signals from subsampled and permuted mea…
An algebraic-geometric approach for linear regression without correspondences
Manolis C. Tsakiris, Liangzu Peng, Aldo Conca +3
Linear regression without correspondences is the problem of performing a linear regression fit to a dataset for which the correspondences between the independent samples and the ob…