default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiangzu Peng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris:
Unlabeled Principal Component Analysis and Matrix Completion. J. Mach. Learn. Res. 25: 77:1-77:38 (2024)- [j4]Xinyue Zhang
, Liangzu Peng, Wanting Xu, Laurent Kneip:
Accelerating Globally Optimal Consensus Maximization in Geometric Vision. IEEE Trans. Pattern Anal. Mach. Intell. 46(6): 4280-4297 (2024) - [j3]Tianyu Huang, Haoang Li, Liangzu Peng, Yinlong Liu, Yun-Hui Liu:
Efficient and Robust Point Cloud Registration via Heuristics-Guided Parameter Search. IEEE Trans. Pattern Anal. Mach. Intell. 46(10): 6966-6984 (2024) - [c12]Tianyu Huang, Liangzu Peng, René Vidal, Yun-Hui Liu:
Scalable 3D Registration via Truncated Entry-Wise Absolute Residuals. CVPR 2024: 27467-27477 - [c11]Liangzu Peng, Wotao Yin:
Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares. ICML 2024 - [i13]Tianyu Huang, Liangzu Peng, René Vidal, Yun-Hui Liu:
Scalable 3D Registration via Truncated Entry-wise Absolute Residuals. CoRR abs/2404.00915 (2024) - [i12]Tianyu Huang, Haoang Li, Liangzu Peng, Yinlong Liu, Yun-Hui Liu:
Efficient and Robust Point Cloud Registration via Heuristics-guided Parameter Search. CoRR abs/2404.06155 (2024) - [i11]Liangzu Peng, Wotao Yin:
Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares. CoRR abs/2405.16020 (2024) - [i10]Liangzu Peng, Juan Elenter, Joshua Agterberg, Alejandro Ribeiro, René Vidal:
ICL-TSVD: Bridging Theory and Practice in Continual Learning with Pre-trained Models. CoRR abs/2410.00645 (2024) - 2023
- [c10]Liangzu Peng, Christian Kümmerle, René Vidal:
On the Convergence of IRLS and Its Variants in Outlier-Robust Estimation. CVPR 2023: 17808-17818 - [c9]Liangzu Peng, Paris Giampouras, René Vidal:
The Ideal Continual Learner: An Agent That Never Forgets. ICML 2023: 27585-27610 - [i9]Xinyue Zhang, Liangzu Peng, Wanting Xu, Laurent Kneip:
Accelerating Globally Optimal Consensus Maximization in Geometric Vision. CoRR abs/2304.05156 (2023) - [i8]Liangzu Peng, Paris V. Giampouras, René Vidal:
The Ideal Continual Learner: An Agent That Never Forgets. CoRR abs/2305.00316 (2023) - 2022
- [c8]Liangzu Peng, Manolis C. Tsakiris, René Vidal:
ARCS: Accurate Rotation and Correspondence Search. CVPR 2022: 11143-11153 - [c7]Liangzu Peng, Mahyar Fazlyab, René Vidal:
Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search: Tight or Not. ECCV (23) 2022: 673-691 - [c6]Liangzu Peng, Christian Kümmerle, René Vidal:
Global Linear and Local Superlinear Convergence of IRLS for Non-Smooth Robust Regression. NeurIPS 2022 - [i7]Liangzu Peng, Manolis C. Tsakiris, René Vidal:
ARCS: Accurate Rotation and Correspondence Search. CoRR abs/2203.14493 (2022) - [i6]Liangzu Peng, Mahyar Fazlyab, René Vidal:
Towards Understanding The Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search. CoRR abs/2207.08350 (2022) - 2021
- [c5]Liangzu Peng, Boshi Wang, Manolis C. Tsakiris:
Homomorphic Sensing: Sparsity and Noise. ICML 2021: 8464-8475 - [c4]Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris:
Unsigned Matrix Completion. ISIT 2021: 2250-2255 - [c3]Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris:
Unlabeled Principal Component Analysis. NeurIPS 2021: 30452-30464 - [i5]Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris:
Unlabeled Principal Component Analysis. CoRR abs/2101.09446 (2021) - 2020
- [j2]Liangzu Peng, Manolis C. Tsakiris:
Linear Regression Without Correspondences via Concave Minimization. IEEE Signal Process. Lett. 27: 1580-1584 (2020) - [j1]Manolis C. Tsakiris, Liangzu Peng, Aldo Conca, Laurent Kneip, Yuanming Shi, Hayoung Choi:
An Algebraic-Geometric Approach for Linear Regression Without Correspondences. IEEE Trans. Inf. Theory 66(8): 5130-5144 (2020) - [i4]Liangzu Peng, Manolis C. Tsakiris:
Linear Regression without Correspondences via Concave Minimization. CoRR abs/2003.07706 (2020) - [i3]Liangzu Peng, Boshi Wang, Manolis C. Tsakiris:
Homomorphic Sensing of Subspace Arrangements. CoRR abs/2006.05158 (2020)
2010 – 2019
- 2019
- [c2]Liangzu Peng, Xuming Song, Manolis C. Tsakiris, Hayoung Choi, Laurent Kneip, Yuanming Shi:
Algebraically-initialized Expectation Maximization for Header-free Communication. ICASSP 2019: 5182-5186 - [c1]Manolis C. Tsakiris, Liangzu Peng:
Homomorphic Sensing. ICML 2019: 6335-6344 - [i2]Manolis C. Tsakiris, Liangzu Peng:
Homomorphic Sensing. CoRR abs/1901.07852 (2019) - 2018
- [i1]Manolis C. Tsakiris, Liangzu Peng, Aldo Conca, Laurent Kneip, Yuanming Shi, Hayoung Choi:
An Algebraic-Geometric Approach to Shuffled Linear Regression. CoRR abs/1810.05440 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
