mlsanityData to 7 Oct 2026

Non-Linear Spectral Dimensionality Reduction Under Uncertainty

arXiv 2202.04678 ↗First posted 9 Feb 2022cs.LG cs.AI math.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider the problem of non-linear dimensionality reduction under uncertainty, both from a theoretical and algorithmic perspectives. Since real-world data usually contain measurements with uncertainties and artifacts, the input space in the proposed framework consists of probability distributions to model the uncertainties associated with each sample. We propose a new dimensionality reduction framework, called NGEU, which leverages uncertainty information and directly extends several traditional approaches, e.g., KPCA, MDA/KMFA, to receive as inputs the probability distributions instead of the original data. We show that the proposed NGEU formulation exhibits a global closed-form solution, and we analyze, based on the Rademacher complexity, how the underlying uncertainties theoretically affect the generalization ability of the framework. Empirical results on different datasets show the effectiveness of the proposed framework.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 61 references that are in the map. First posted on arXiv 9 Feb 2022.

Builds on

14 of 61 references.

References · 14

  1. 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
  2. 2013Domain Generalization via Invariant Feature Representationcited by 622
  3. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
  4. 2018Robust Graph Learning from Noisy Datacited by 34
  5. 2014Kernel Mean Shrinkage Estimatorscited by 16
  6. 2013Adaptive Metric Dimensionality Reductioncited by 14
  7. 2013One-Class Support Measure Machines for Group Anomaly Detectioncited by 12
  8. 2015Learning Sparse Feature Representations using Probabilistic Quadtrees and Deep Belief Netscited by 9
  9. 2019Bayesian Deconditional Kernel Mean Embeddingscited by 6
  10. 2018Hyperparameter Learning for Conditional Kernel Mean Embeddings with Rademacher Complexity Boundscited by 4
  11. 2019Speed-up and multi-view extensions to Subclass Discriminant Analysiscited by 3
  12. 2015Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifoldcited by 2
2 more
  1. 2020Graph Embedding with Data Uncertaintycited by 2
  2. 2020Incremental Fast Subclass Discriminant Analysiscited by 1

Built on by

Not cited yet.