Yuetian Luo

According to our database1, Yuetian Luo authored at least 17 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Limits of Assumption-free Tests for Algorithm Performance.
CoRR, 2024

2023
Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials.
CoRR, 2023

Iterative Approximate Cross-Validation.
Proceedings of the International Conference on Machine Learning, 2023

Statistical and Computational Limits for Tensor-on-Tensor Association Detection.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective.
CoRR, 2022

Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay.
CoRR, 2022

Provable Second-Order Riemannian Gauss-Newton Method for Low-Rank Tensor Estimation <sup>‖</sup>.
Proceedings of the IEEE International Conference on Acoustics, 2022

2021
A Sharp Blockwise Tensor Perturbation Bound for Orthogonal Iteration.
J. Mach. Learn. Res., 2021

On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization.
CoRR, 2021

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization.
CoRR, 2021

Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence.
CoRR, 2021

2020
ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching.
SIAM J. Math. Data Sci., 2020

Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence.
CoRR, 2020

A Schatten-q Matrix Perturbation Theory via Perturbation Projection Error Bound.
CoRR, 2020

Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits.
CoRR, 2020

Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection.
Proceedings of the Conference on Learning Theory, 2020

2018
Diagnosing University Student Subject Proficiency and Predicting Degree Completion in Vector Space.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018


  Loading...