![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Shuyang Ling
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i16]Li Guo, Keith W. Ross, Zifan Zhao, George Andriopoulos, Shuyang Ling, Yufeng Xu, Zixuan Dong:
Cross Entropy versus Label Smoothing: A Neural Collapse Perspective. CoRR abs/2402.03979 (2024) - 2023
- [j8]Shuyang Ling
:
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis. Math. Program. 200(1): 589-628 (2023) - [i15]Ziliang Samuel Zhong, Shuyang Ling:
Improved theoretical guarantee for rank aggregation via spectral method. CoRR abs/2309.03808 (2023) - [i14]Wanli Hong, Shuyang Ling:
Neural Collapse for Unconstrained Feature Model under Cross-entropy Loss with Imbalanced Data. CoRR abs/2309.09725 (2023) - [i13]Shuyang Ling:
Local Geometry Determines Global Landscape in Low-rank Factorization for Synchronization. CoRR abs/2311.18670 (2023) - 2022
- [j7]Shuyang Ling:
Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method. SIAM J. Optim. 32(2): 1018-1048 (2022) - 2021
- [j6]Shaofeng Deng, Shuyang Ling, Thomas Strohmer:
Strong Consistency, Graph Laplacians, and the Stochastic Block Model. J. Mach. Learn. Res. 22: 117:1-117:44 (2021) - [i12]Shuyang Ling:
Generalized Power Method for Generalized Orthogonal Procrustes Problem: Global Convergence and Optimization Landscape Analysis. CoRR abs/2106.15493 (2021) - [i11]Shuyang Ling:
Near-Optimal Bounds for Generalized Orthogonal Procrustes Problem via Generalized Power Method. CoRR abs/2112.13725 (2021) - 2020
- [j5]Shuyang Ling, Thomas Strohmer:
Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering. Found. Comput. Math. 20(3): 367-421 (2020) - [j4]Xiaodong Li, Yang Li, Shuyang Ling, Thomas Strohmer, Ke Wei:
When do birds of a feather flock together? k-Means, proximity, and conic programming. Math. Program. 179(1): 295-341 (2020) - [i10]Shaofeng Deng, Shuyang Ling, Thomas Strohmer:
Strong Consistency, Graph Laplacians, and the Stochastic Block Model. CoRR abs/2004.09780 (2020) - [i9]Shuyang Ling:
Solving Orthogonal Group Synchronization via Convex and Low-Rank Optimization: Tightness and Landscape Analysis. CoRR abs/2006.00902 (2020) - [i8]Shuyang Ling:
Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods. CoRR abs/2008.05341 (2020) - [i7]Shuyang Ling:
Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method. CoRR abs/2012.00470 (2020)
2010 – 2019
- 2019
- [j3]Shuyang Ling, Ruitu Xu, Afonso S. Bandeira:
On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization. SIAM J. Optim. 29(3): 1879-1907 (2019) - 2018
- [j2]Shuyang Ling, Thomas Strohmer:
Self-Calibration and Bilinear Inverse Problems via Linear Least Squares. SIAM J. Imaging Sci. 11(1): 252-292 (2018) - [i6]Shuyang Ling, Thomas Strohmer:
Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering. CoRR abs/1806.11429 (2018) - 2017
- [j1]Shuyang Ling
, Thomas Strohmer:
Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds. IEEE Trans. Inf. Theory 63(7): 4497-4520 (2017) - [i5]Shuyang Ling, Thomas Strohmer:
Regularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing. CoRR abs/1703.08642 (2017) - 2016
- [c1]Shuyang Ling, Thomas Strohmer:
Simultaneous blind deconvolution and blind demixing via convex programming. ACSSC 2016: 1223-1227 - [i4]Xiaodong Li, Shuyang Ling, Thomas Strohmer, Ke Wei:
Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization. CoRR abs/1606.04933 (2016) - [i3]Shuyang Ling, Thomas Strohmer:
Self-Calibration via Linear Least Squares. CoRR abs/1611.04196 (2016) - 2015
- [i2]Shuyang Ling, Thomas Strohmer:
Self-Calibration and Biconvex Compressive Sensing. CoRR abs/1501.06864 (2015) - [i1]Shuyang Ling, Thomas Strohmer:
Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds. CoRR abs/1512.07730 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint