| Multiview clustering via adaptively weighted procrustes F Nie, L Tian, X Li ACM SIGKDD international conference on knowledge discovery & data mining …, 2018 | 215 | 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, 3009-3015, 2020 | 72 | 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 | 60 | 2020 |
| Unsupervised feature selection with constrained L20-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 | 53 | 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 | 46 | 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, 21360-21379, 2022 | 27* | 2022 |
| Learning feature sparse principal subspace L Tian, F Nie, R Wang, X Li Advances in Neural Information Processing Systems 33, 14997-15008, 2020 | 22* | 2020 |
| A unified weight learning paradigm for multi-view learning L Tian, F Nie, X Li International Conference on Artificial Intelligence and Statistics, 2790-2800, 2019 | 21 | 2019 |
| Non-greedy L21-norm maximization for principal component analysis F Nie, L Tian, H Huang, C Ding IEEE Transactions on Image Processing 30, 5277-5286, 2021 | 13 | 2021 |
| 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, 3684-3708, 2022 | 11 | 2022 |
| No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians L Tian, AMC So Mathematical Programming, 1-24, 2024 | 5 | 2024 |
| On the Hardness of Computing Near-Approximate Stationary Points of Clarke Regular Nonsmooth Nonconvex Problems and Certain DC Programs L Tian, AMC So ICML 2021 BFOM Workshop, 2021 | 4 | 2021 |
| Testing Approximate Stationarity Concepts for Piecewise Affine Functions and Extensions L Tian, AMC So OPT 2023: Optimization for Machine Learning, 2023 | 1* | 2023 |
| Computing D-Stationary Points of -Margin Loss SVM L Tian, AMC So International Conference on Artificial Intelligence and Statistics, 3772-3793, 2022 | 1 | 2022 |
Feiping NieOPTIMAL在 mails.tsinghua.edu.cn 的电子邮件经过验证
