Multiview Clustering via Adaptively Weighted Procrustes. - Feiping Nie 001; Lai Tian; Xuelong Li 001 (KDD, 2018)

A Comprehensive Survey for Low Rank Regularization. - Zhanxuan Hu; Feiping Nie 001; Lai Tian; Xuelong Li 001 (CoRR, 2018)

A Unified Weight Learning Paradigm for Multi-view Learning. - Lai Tian; Feiping Nie 001; Xuelong Li 001 (AISTATS, 2019)

Learning Feature Sparse Principal Components. - Lai Tian; Feiping Nie 001; Xuelong Li 001 (CoRR, 2019)

Discriminative Feature Selection via A Structured Sparse Subspace Learning Module. - Zheng Wang 037; Feiping Nie 001; Lai Tian; Rong Wang 001; Xuelong Li 001 (IJCAI, 2020)

Multiview Semi-Supervised Learning Model for Image Classification. - Feiping Nie 001; Lai Tian; Rong Wang 001; Xuelong Li 001 (IEEE Trans. Knowl. Data Eng., 2020)

Non-Greedy L21-Norm Maximization for Principal Component Analysis. - Feiping Nie 001; Lai Tian; Heng Huang; Chris Ding (IEEE Trans. Image Process., 2021)

Computing D-Stationary Points of ρ-Margin Loss SVM. - Lai Tian; Anthony Man-Cho So (AISTATS, 2022)

Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums. - Kaiwen Zhou; Lai Tian; Anthony Man-Cho So; James Cheng (AISTATS, 2022)

On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions. - Lai Tian; Kaiwen Zhou; Anthony Man-Cho So (ICML, 2022)

Analyzing vulnerability of optical fiber network considering recoverability. - Ke Wang; Jinfeng Liu; Lai Tian; Xianfeng Tan; Guansheng Peng; Tianwen Qin; Jun Wu 004 (Reliab. Eng. Syst. Saf., 2022)

Subspace Sparse Discriminative Feature Selection. - Feiping Nie 001; Zheng Wang 037; Lai Tian; Rong Wang 001; Xuelong Li 001 (IEEE Trans. Cybern., 2022)

Unsupervised Feature Selection With Constrained ℓ₂, ₀-Norm and Optimized Graph. - Feiping Nie 001; Xia Dong; Lai Tian; Rong Wang 001; Xuelong Li 001 (IEEE Trans. Neural Networks Learn. Syst., 2022)

Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms. - Lai Tian; Anthony Man-Cho So (CoRR, 2023)

Learning Feature-Sparse Principal Subspace. - Feiping Nie 001; Lai Tian; Rong Wang 001; Xuelong Li 001 (IEEE Trans. Pattern Anal. Mach. Intell., 2023)

No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians. - Lai Tian; Anthony Man-Cho So (Math. Program., 2024)

Testing Approximate Stationarity Concepts for Piecewise Affine Functions. - Lai Tian; Anthony Man-Cho So (SODA, 2025)