| Multiview clustering via adaptively weighted Procrustes F Nie, L Tian, X Li ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2022-2030, 2018 | 240 | 2018 |
| Discriminative feature selection via a structured sparse subspace learning module Z Wang, F Nie, L Tian, R Wang, X Li International Joint Conference on Artificial Intelligence (IJCAI), 3009-3015, 2020 | 80 | 2020 |
| Subspace sparse discriminative feature selection F Nie, Z Wang, L Tian, R Wang, X Li IEEE Transactions on Cybernetics 52 (6), 4221-4233, 2020 | 68 | 2020 |
| Unsupervised feature selection with constrained -norm and optimized graph F Nie, X Dong, L Tian, R Wang, X Li IEEE Transactions on Neural Networks and Learning Systems 33 (4), 1702-1713, 2020 | 65 | 2020 |
| Multiview semi-supervised learning model for image classification F Nie, L Tian, R Wang, X Li IEEE Transactions on Knowledge and Data Engineering 32 (12), 2389-2400, 2019 | 54 | 2019 |
| On the finite-time complexity and practical computation of approximate stationarity concepts of Lipschitz functions L Tian, K Zhou, AMC So International Conference on Machine Learning (ICML), 21360-21379, 2022 | 35 | 2022 |
| Learning feature sparse principal subspace L Tian, F Nie, R Wang, X Li Advances in Neural Information Processing Systems (NeurIPS) 33, 14997-15008, 2020 | 25* | 2020 |
| A unified weight learning paradigm for multi-view learning L Tian, F Nie, X Li International Conference on Artificial Intelligence and Statistics (AISTATS …, 2019 | 22 | 2019 |
| Non-greedy -norm maximization for principal component analysis F Nie, L Tian, H Huang, C Ding IEEE Transactions on Image Processing 30, 5277-5286, 2021 | 18 | 2021 |
| No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians L Tian, AMC So Mathematical Programming 208, 51-74, 2024 | 15 | 2024 |
| Practical schemes for finding near-stationary points of convex finite-sums K Zhou, L Tian, AMC So, J Cheng International Conference on Artificial Intelligence and Statistics (AISTATS …, 2022 | 13 | 2022 |
| On the hardness of computing near-approximate stationary points of Clarke regular nonsmooth nonconvex problems and certain DC programs L Tian, AMC So ICML Workshop on Beyond First-Order Methods in ML Systems, 2021 | 9 | 2021 |
| Computing d-stationary points of -margin loss SVM L Tian, AMC So International Conference on Artificial Intelligence and Statistics (AISTATS …, 2022 | 4 | 2022 |
| Testing Approximate Stationarity Concepts for Piecewise Affine Functions L Tian, AMC So ACM-SIAM Symposium on Discrete Algorithms (SODA), 2213-2224, 2025 | 3* | 2025 |
Feiping NieOPTIMALVerified email at mails.tsinghua.edu.cn
