no code implementations • 23 Feb 2023 • Lai Tian, Anthony Man-Cho So
This implies that testing a certain stationarity concept for a modern nonsmooth neural network is in general computationally intractable.
no code implementations • NeurIPS 2021 • Kaiwen Zhou, Lai Tian, Anthony Man-Cho So, James Cheng
In convex optimization, the problem of finding near-stationary points has not been adequately studied yet, unlike other optimality measures such as the function value.
1 code implementation • NeurIPS 2020 • Lai Tian, Feiping Nie, Rong Wang, Xuelong Li
This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously.
no code implementations • 23 Apr 2019 • Lai Tian, Feiping Nie, Xuelong. Li
This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously.