default search action
Lai Tian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Lai Tian, Anthony Man-Cho So
:
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians. Math. Program. 208(1): 51-74 (2024) - 2023
- [j6]Feiping Nie
Learning Feature-Sparse Principal Subspace. IEEE Trans. Pattern Anal. Mach. Intell. 45(4): 4858-4869 (2023) - [i4]Lai Tian, Anthony Man-Cho So:
Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms. CoRR abs/2302.12261 (2023) - 2022
- [j5]Ke Wang
Analyzing vulnerability of optical fiber network considering recoverability. Reliab. Eng. Syst. Saf. 221: 108308 (2022) - [j4]Feiping Nie
Subspace Sparse Discriminative Feature Selection. IEEE Trans. Cybern. 52(6): 4221-4233 (2022) - [j3]Feiping Nie
Unsupervised Feature Selection With Constrained ℓ₂, ₀-Norm and Optimized Graph. IEEE Trans. Neural Networks Learn. Syst. 33(4): 1702-1713 (2022) - [c7]Kaiwen Zhou, Lai Tian, Anthony Man-Cho So, James Cheng:
Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums. AISTATS 2022: 3684-3708 - [c6]Lai Tian, Anthony Man-Cho So:
Computing D-Stationary Points of ρ-Margin Loss SVM. AISTATS 2022: 3772-3793 - [c5]Lai Tian, Kaiwen Zhou, Anthony Man-Cho So:
On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions. ICML 2022: 21360-21379 - 2021
- [j2]Feiping Nie
Non-Greedy L21-Norm Maximization for Principal Component Analysis. IEEE Trans. Image Process. 30: 5277-5286 (2021) - [i3]Kaiwen Zhou, Lai Tian, Anthony Man-Cho So, James Cheng:
Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums. CoRR abs/2105.12062 (2021) - 2020
- [j1]Feiping Nie
Multiview Semi-Supervised Learning Model for Image Classification. IEEE Trans. Knowl. Data Eng. 32(12): 2389-2400 (2020) - [c4]Zheng Wang, Feiping Nie, Lai Tian, Rong Wang, Xuelong Li:
Discriminative Feature Selection via A Structured Sparse Subspace Learning Module. IJCAI 2020: 3009-3015 - [c3]Lai Tian, Feiping Nie, Rong Wang, Xuelong Li:
Learning Feature Sparse Principal Subspace. NeurIPS 2020
2010 – 2019
- 2019
- [c2]Lai Tian, Feiping Nie, Xuelong Li:
A Unified Weight Learning Paradigm for Multi-view Learning. AISTATS 2019: 2790-2800 - [i2]Lai Tian, Feiping Nie, Xuelong Li:
Learning Feature Sparse Principal Components. CoRR abs/1904.10155 (2019) - 2018
- [c1]Feiping Nie
Multiview Clustering via Adaptively Weighted Procrustes. KDD 2018: 2022-2030 - [i1]Zhanxuan Hu, Feiping Nie, Lai Tian, Xuelong Li:
A Comprehensive Survey for Low Rank Regularization. CoRR abs/1808.04521 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: