arXiv research

Detects adversarial examples with non-linear dimensionality reduction.

Paper uses non-linear dimension reduction for better economic forecasting.

Develops an efficient method for real-time data analysis and visualization.

Bayesian neural networks improve uncertainty quantification in non-linear dimensionality reduction.

ML reduces high-dimensional data to reveal its underlying structure.

New algorithm improves topological stability in non-linear dimensionality reduction.

PEA improves PCA and k-means for non-linear data and complex clusters.

Efficient method estimates intrinsic dimension for big data.

Two new algorithms reduce feature space while preserving non-linear relationships.

Diffusion Maps improves on Functional PCA for non-linear functional data.

Dimensionality reduction is an important step in processing the hyperspectral images (HSI) to overcome the curse of dimensionality problem. Linear dimensionality reduction methods such as Independent component analysis (ICA) and Linear discriminant analysis (LDA) are commonly employed to reduce the dimensionality of HS…

Introduces MFVDM for high-dimensional data analysis.

FPP creates interpretable 2D embeddings for high-dimensional data.

In recent years, manifold learning has become increasingly popular as a tool for performing non-linear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover man ifold geometry using either local or global features of the data. Building on t…

This paper introduces an acceleration structure for hyperbolic embeddings.

This paper improves HSIC-based dimensionality reduction for non-linear kernels.

Paper interprets UMAP and t-SNE as probabilistic MAP inference.

Solla discusses neural processing using statistical physics and Bayesian methods.

Adaptive framework improves nonparametric dimensionality reduction.

Scientific and engineering processes deliver massive high-dimensional data sets that are generated as non-linear transformations of an initial state and few process parameters. Mapping such data to a low-dimensional manifold facilitates better understanding of the underlying processes, and enables their optimization. I…

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-…

Optimal persuasion involves projecting state vectors onto lower-dimensional 'optimal information manifolds'.

Molecular simulations produce very high-dimensional data-sets with millions of data points. As analysis methods are often unable to cope with so many dimensions, it is common to use dimensionality reduction and clustering methods to reach a reduced representation of the data. Yet these methods often fail to capture the…

This paper introduces a new unsupervised method for dimensionality reduction via regression (DRR). The algorithm belongs to the family of invertible transforms that generalize Principal Component Analysis (PCA) by using curvilinear instead of linear features. DRR identifies the nonlinear features through multivariate r…

BasisVAE combines VAE and clustering for tabular data analysis.

Uncertainty-aware PCA preserves data uncertainty during dimensionality reduction.

On any space-like W-surface in the three-dimensional Minkowski space we introduce locally natural principal parameters and prove that such a surface is determined uniquely up to motion by a special invariant function, which satisfies a natural non-linear partial differential equation. This result can be interpreted as …

In machine learning or statistics, it is often desirable to reduce the dimensionality of a sample of data points in a high dimensional space $\mathbb{R}^d$. This paper introduces a dimensionality reduction method where the embedding coordinates are the eigenvectors of a positive semi-definite kernel obtained as the sol…

The interpretation of complex high-dimensional data typically requires the use of dimensionality reduction techniques to extract explanatory low-dimensional representations. However, in many real-world problems these representations may not be sufficient to aid interpretation on their own, and it would be desirable to …

This paper addresses overfitting in dimension reduction methods by calibrating hyperparameters considering noise.

We show that generalised geometry gives a unified description of maximally supersymmetric consistent truncations of ten- and eleven-dimensional supergravity. In all cases the reduction manifold admits a "generalised parallelisation" with a frame algebra with constant coefficients. The consistent truncation then arises …

The un-reduction procedure introduced previously in the context of Mechanics is extended to covariant Field Theory. The new covariant un-reduction procedure is applied to the problem of shape matching of images which depend on more than one independent variable (for instance, time and an additional labelling parameter)…

Scalable GPLVM reduces complexity in scRNA-seq data, accounting for technical and biological confounders.

Canonical Correlation Analysis (CCA) is a linear representation learning method that seeks maximally correlated variables in multi-view data. Non-linear CCA extends this notion to a broader family of transformations, which are more powerful in many real-world applications. Given the joint probability, the Alternating C…

Proposes a deep learning model for imputing missing values in time series data.

The paper constructs special Lagrangian n-folds in arbitrary dimensions.

In this paper, we present a novel approach to construct multiclass classifiers by means of arrangements of hyperplanes. We propose different mixed integer (linear and non linear) programming formulations for the problem using extensions of widely used measures for misclassifying observations where the \textit{kernel tr…

New method for analyzing complex data spaces.

This work improves manifold learning for multi-modal data.

Diffusion maps are an emerging data-driven technique for non-linear dimensionality reduction, which are especially useful for the analysis of coherent structures and nonlinear embeddings of dynamical systems. However, the computational complexity of the diffusion maps algorithm scales with the number of observations. T…

UMAP visualizes patient phenotypes from EHR data for emergency triage.

TaCo prevents non-linear classifiers from detecting sensitive attributes.

We study time-like surfaces in the three-dimensional Minkowski space with diagonalizable second fundamental form. On any time-like W-surface we introduce locally natural principal parameters and prove that such a surface is determined uniquely (up to motion) by a special invariant function, which satisfies a natural no…

Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-r…

Researchers improve visualization of neural network loss landscapes.

The Ryu-Takayanagi conjecture connects the entanglement entropy in the boundary CFT to the area of open co-dimension two minimal surfaces in the bulk. Especially in AdS(4), the latter are two-dimensional surfaces, and, thus, solutions of a Euclidean non-linear sigma model on a symmetric target space that can be reduced…

In many scientific disciplines structures in high-dimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regressio…

This work improves understanding of dimension reduction algorithms and their probabilistic embeddings.