Ph.D. Student · Iowa State University
Xiao Liang
梁笑
Mapping nonconvex landscapes, one saddle point at a time.
Department of Electrical and Computer Engineering
Iowa State University, Ames, Iowa
liangx [at] iastate [dot] edu
About
Hi, I'm Xiao! I'm a Ph.D. student in Electrical and Computer Engineering at Iowa State University, working with Prof. Shuang Li.
I'm fascinated by a question that sounds almost too simple: why does plain gradient descent work so well on certain problems that look hopelessly nonconvex on paper? To find out, I map optimization landscapes. I look for the valleys, ridges, and saddle points of structured low-rank problems, such as recovering a signal and its blur kernel from magnitude-only measurements, or sensing tensors through their Fourier slices. Once I understand the geometry, I like to turn those insights into faster algorithms. More recently, I've been exploring how Muon-style orthogonalized updates can accelerate tensor regression.
My path here has a few turns in it. I studied data science in Beijing at North China University of Technology (2018–2022), then computer science at Washington University in St. Louis (2022–2024), and spent some time as an intern at Huawei before starting my Ph.D. in Ames. Iowa is famously flat, so these days the interesting terrain lives in my loss functions.
- Nonconvex optimization & landscape analysis
- Low-rank matrix and tensor recovery
- Blind deconvolution & phase retrieval
- Scalable algorithms for tensor models
Research
-
Preprint
Strict-Saddle Landscapes and Multi-Rank Geometry in Low-Tubal-Rank Tensor Sensing
arXiv preprint, 2026 (*, † equal contribution)
Under a tubal restricted isometry condition, the balanced factorized objective has no spurious local minima and a quantitative strict-saddle structure. Its local geometry is governed by the ranks of the Fourier slices, not by the tubal rank alone.
-
Preprint
A Muon-Accelerated Algorithm for Low Separation Rank Tensor Generalized Linear Models
arXiv preprint, 2026
LSRTR-M replaces the QR-based projection steps of LSRTR with Muon (momentum orthogonalized by Newton–Schulz) updates. On linear, logistic, and Poisson tensor GLMs it converges faster in both iterations and wall-clock time, and it stays competitive on Vessel MNIST 3D classification.
-
ICASSP 2026
Landscape Analysis of Simultaneous Blind Deconvolution and Phase Retrieval
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, 2026
Blind deconvolution and phase retrieval, solved at the same time, become a structured low-rank tensor recovery problem. For a tractable surrogate, the paper characterizes the global landscape of the population risk on the sphere and shows that Riemannian gradient descent converges linearly.
Paper DOIBibTeX
@inproceedings{liang2026landscape, title = {Landscape Analysis of Simultaneous Blind Deconvolution and Phase Retrieval}, author = {Liang, Xiao and Qin, Zhen and Zhu, Zhihui and Li, Shuang}, booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, pages = {511--515}, year = {2026}, doi = {10.1109/ICASSP55912.2026.11461778} } -
Preprint
Landscape Analysis of Simultaneous Blind Deconvolution and Phase Retrieval via Structured Low-Rank Tensor Recovery
arXiv preprint, 2025 (* equal contribution)
The full story behind the ICASSP paper. Beyond the global landscape of the population surrogate, it establishes local geometry, convergence guarantees, and robustness to measurement noise for the full tensor sensing problem, with experiments that point the way back to the original problem.
arXiv PDFBibTeX
@article{liang2025landscape, title = {Landscape Analysis of Simultaneous Blind Deconvolution and Phase Retrieval via Structured Low-Rank Tensor Recovery}, author = {Liang, Xiao and Qin, Zhen and Zhu, Zhihui and Li, Shuang}, journal = {arXiv preprint arXiv:2509.10834}, year = {2025} }
Other Publications
- Not All Flows are Worth N Packets: Robust Encrypted Traffic Classification via Dynamic Patch-level Feature Learning Asia-Pacific Workshop on Networking (APNet), 2026
- Not All Pretrained Representation has The Sweet Danger of Sugar: Robust and Trustworthy Representation Learning for Encrypted Malicious Traffic Identification Asia-Pacific Workshop on Networking (APNet), 2026
- An Undergraduate Course for FOSS and with FOSS International Conference on Education and E-Learning (ICEEL), 2021
- Flower Data Set Expansion Based on DCGAN and ResNet Classification Algorithm Based on Transfer Learning International Symposium on Computer and Information Processing Technology (ISCIPT), 2021
- Improved SIFT Algorithm Based on Image Filtering Journal of Physics: Conference Series, 2021
- Student Performance Protection Based on Blockchain Technology Journal of Physics: Conference Series, 2021
Education
-
Ph.D. in Electrical and Computer Engineering
Iowa State University · 2024 – present
Advisor: Prof. Shuang Li
-
Master's in Computer Science
Washington University in St. Louis · 2022 – 2024
-
Bachelor's in Data Science
North China University of Technology, Beijing · 2018 – 2022