Research map / Learning theory and algorithms / Matrix and tensor methods
Towards Robust Discriminative Projections Learning via Non-Greedy -Norm MinMax
Feiping Nie, Zheng Wang, Rong Wang, Zhen Wang, Xuelong Li
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Robust Formulation for PCA: Avoiding Mean Calculation With L2,p-norm Maximization (AAAI 2018 · similarity 0.86)
- Unsupervised Discriminative Feature Selection With $\ell _{2,0}$ℓ2,0-Norm Constrained Sparse Projection (TPAMI 2025 · similarity 0.86)
- Robust Discriminative Clustering with Sparse Regularizers (JMLR 2017 · similarity 0.85)
- Uncertain LDA: Including Observation Uncertainties in Discriminative Transforms (TPAMI 2016 · similarity 0.85)
- Robust Methods for High-Dimensional Linear Learning (JMLR 2023 · similarity 0.85)
- Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis (JMLR 2020 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
