Geometric framework detects outliers in high-dimensional data.
problem Detecting outliers in high-dimensional data.
method Geometric framework exploiting manifold structure.
result Significant improvement in outlier detection in high-dimensional data.
New findings show mapping class groups of certain high-dimensional manifolds are not residually finite.
problem Understanding the mapping class groups of simply connected high-dimensional manifolds.
method Provided a counterexample showing mapping class groups are not residually finite.
result Mapping class groups of some high-dimensional manifolds are not residually finite.
Proposes a method to compare noisy high-dimensional datasets with low-dimensional manifolds.
problem Comparing distributions on manifolds in noisy high-dimensional datasets.
method Linking low-rank structure to manifold geometry, developing a scale-invariant distance measure.
result Superior robustness and statistical power compared to existing methods.
Proposes a new method for efficient manifold denoising robust to high dimensional noise.
problem Efficiently denoise manifolds in high dimensional spaces with complicated noise.
method Landmark diffusion and optimal shrinkage under high dimensional noise and compact manifold setup.
result Systematic comparison with other algorithms on simulated and real datasets shows superior performance.
Derives a method to optimize high-dimensional functions on low-dimensional manifolds.
problem High-dimensional derivative-free optimization with high sample complexity.
method Online learning approach that learns the manifold while optimizing the function.
result Significantly reduces sample complexity compared to existing methods.
Two methods monitor high-dimensional processes via manifold fitting or learning.
problem Monitoring high-dimensional, dynamic industrial processes.
method Manifold fitting and learning approaches for online SPC.
result Manifold-fitting approach achieves performance competitive with classical methods.
Proves triviality of inertia groups in high-dimensional manifolds.
problem Classifying manifolds in the metastable range.
method Understanding the second extended power functor in synthetic spectra.
result Inertia groups of high-dimensional manifolds are trivial.
Paper extends tail bounds to high-dimensional random objects on Riemannian manifolds.
problem Need for tail bounds in high-dimensional data.
method Random walks on graph approximating the manifold, ensuring spectral similarity.
result Derived tensor Chernoff bound for Riemannian manifolds.
Topological manifolds can be embedded flatly in high-dimensional Euclidean space and are locally retracts.
problem Embedding and retraction of topological manifolds in Euclidean spaces.
method Locally flat embedding and retraction of manifolds in high-dimensional Euclidean space.
result Every topological n-manifold can be embedded locally flatly in R2n+1 and is a retract of some neighborhood in R2n+1. Classifies hyperbolic manifolds with specific automorphism groups.
problem Classifying Kobayashi-hyperbolic manifolds with high-dimensional automorphism groups.
method Analyzes manifolds of dimension n≥2 with automorphism groups of dimensions n2−7 or n2−8. result Completes the classification for automorphism groups n2−7 and n2−8. Active learning improves GP regression on complex, high-dimensional data.
problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.
Simple model explains manifold structure in high-dimensional data.
problem Understanding manifold structure in high-dimensional data.
method Latent Metric Model with latent variables, correlation, and stationarity.
result Establishes statistical explanation for manifold hypothesis.
This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use few literal expressions, equations, functions, etc. We barely suppose that the re…
New methods implement manifold scattering transform for high-dimensional point cloud data.
problem Classifying data on complex, non-linear manifolds.
method Adapting diffusion maps theory for numerical implementation.
result Effective for signal and manifold classification tasks.
This paper tackles high-dimensional Bayesian optimization by projecting a manifold into a lower space.
problem High-dimensional optimization of expensive functions with limited labeled data.
method Random linear projection of a manifold embedded in high-dimensional space, combined with semi-supervised learning of the manifold's geometry.
result Our approach outperforms existing high-dimensional BO methods in various synthetic and real-world applications.
We provide a way to infer about existence of topological circularity in high-dimensional data sets in Rd from its projection in R2 obtained through a fast manifold learning map as a function of the high-dimensional dataset X and a particular choice of a positive real σ known as band…
This study evaluates clustering algorithms on high-dimensional data.
problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.
GTSNE improves data visualization for high-dimensional data.
problem Visualizing high-dimensional data points in a 2D map.
method GTSNE is a variation of t-SNE that captures both local and macro structures.
result GTSNE produces better visualizations of high-dimensional data compared to other methods.
While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the…
Stabilization operation for high-dimensional contact manifolds, proving many links are non-simple.
problem Understanding the structure and properties of high-dimensional contact manifolds.
method Definition and proof of stabilization operation for codimension 2 contact submanifolds in dim≥5 contact manifolds. result Many transverse links are non-simple.
New method for high-dimensional manifold-based inference tackles latent responses.
problem Inference on latent right factor vectors in multi-task learning with large numbers of responses and features.
method SOFARI-R method with two variants: one for strongly orthogonal factors and another for weakly orthogonal factors.
result Bias-corrected estimators for latent right factor vectors with asymptotically normal distributions and justified asymptotic variance estimates.
DADApy analyzes high-dimensional data manifolds in Python.
problem Analyzing complex, high-dimensional data.
method Estimating intrinsic dimension, density, clustering, comparing distance metrics.
result Effective analysis of data manifolds in Python.
Improved diffusion models for manifold learning.
problem Learning distributions on general manifolds with geometric complexity.
method Revised approximations for score matching on symmetric spaces.
result Improved performance and scalability to high dimensions.
New framework tackles high-dimensional reliability analysis using surrogate models and active subspaces.
problem High computational cost and curse of dimensionality in reliability analysis of high-dimensional systems.
method Sparse Active Subspace (SAS) algorithm for identifying low-dimensional manifolds and constructing efficient surrogate models.
result Proposed framework significantly improves accuracy and efficiency of reliability analysis compared to existing methods.
We explicitly classify all pairs (M,G), where M is a connected complex manifold of dimension n≥2 and G is a connected Lie group acting properly and effectively on M by holomorphic transformations and having dimension dG satisfying n2+2≤dG<n2+2n. These results extend -- in the complex case -- the…
A new stock index model simplifies high-dimensional stock data.
problem Reflecting the overall stock market activity in high-dimensional data.
method Manifold learning and feature detection on discrete Laplace-Beltrami operator.
result The MF index series approximates the stock market better and has lower risk.
A new Gaussian process regression method infers implicit manifold structure from data.
problem Scaling Gaussian process regression to high-dimensional data.
method Proposes a fully differentiable Gaussian process regression technique that infers implicit manifold structure from data.
result Improves predictive performance and calibration of standard Gaussian process regression in high-dimensional settings.
Proposes a boundary detection method inspired by LLE for high-dimensional data.
problem Identifying boundary points from data on an embedded manifold.
method Inspired by locally linear embedding, uses nearest neighbor search schemes and spectral properties of local covariance matrix.
result Enhanced boundary detection in noisy data.
MFCNs use sparse graphs to approximate manifold convergence.
problem Understanding manifold neural networks (MNNs).
method Sparse graph approximation for manifold convergence.
result Method converges to continuum limit as data points increase.
ML reduces high-dimensional data to reveal its underlying structure.
problem Handling large, high-dimensional data sets.
method Non-linear dimension reduction techniques.
result Reveals the geometric shape of high-dimensional data.
ReliefE ranks features faster and better in high-dimensional data.
problem Feature ranking in high-dimensional spaces.
method Adapting Relief algorithms to manifold embeddings.
result ReliefE outperforms traditional Relief algorithms in feature ranking.
The paper finds singular isoperimetric regions in high-dimensional spaces.
problem Existence of singular isoperimetric regions in high-dimensional manifolds.
method Construction of specific manifolds with singular isoperimetric regions.
result Construction of manifolds with singular isoperimetric regions.
The Bryant-Ferry-Mio-Weinberger surgery exact sequence for high-dimensional compact ANR homology manifolds is used to obtain transversality, splitting and bordism results for homology manifolds, generalizing previous work of Johnston.
The study constructs and shows isotopy of high-dimensional Legendrian spheres.
problem Understanding Legendrian spheres in contact manifolds of any dimension.
method Three Legendrian sphere constructions using open books and a doubling procedure.
result These constructions are isotopic to the Legendrian unknot.
The homotopy theory of gauge groups has received considerable attention in recent decades. In this work, we study the homotopy theory of gauge groups over some high dimensional manifolds. To be more specific, we study gauge groups of bundles over (n−1)-connected closed 2n-manifolds, the classification of which was …
Paper proves embedding theorem for conformally compact manifolds.
problem Embedding conformally compact manifolds into hyperbolic spaces.
method Proves analogous Nash Embedding Theorem for conformally compact manifolds.
result Conformally compact manifolds can be isometrically embedded into hyperbolic spaces.
Non-linear manifold learning enables high-dimensional data analysis, but requires out-of-sample-extension methods to process new data points. In this paper, we propose a manifold learning algorithm based on deep learning to create an encoder, which maps a high-dimensional dataset and its low-dimensional embedding, and …
Introduces MFCNs for better understanding manifold neural networks.
problem Understanding manifold neural networks (MNNs).
method Filter-combine framework on high-dimensional point clouds, approximating manifold by sparse graph.
result Method converges to continuum limit as data points increase.
Using recent work on high dimensional Lutz twists and families of Weinstein structures we show that any almost contact structure on a 5-manifold is homotopic to a contact structure.
In this paper, we recall Quillen's plus construction for high-dimensional smooth manifolds and the solution to the group extension problem. We then develop a geometric procedure due for producing a "reverse" to the plus construction, a one-sided s-cobordism called a semi-s-cobordism, when the total group of the group e…
OptIMIS method improves SRAM yield estimation efficiency and accuracy.
problem Efficient estimation of SRAM failure probability with shrinking technology nodes.
method Generalized norm minimization method, optimal manifold concept, onion sampling, neural coupling flow.
result OptIMIS method delivers up to 3.5x efficiency and 3x accuracy over state-of-the-art methods.
GOLFS selects features for clustering by combining global and local information.
problem Feature selection for high-dimensional clustering without labels.
method Combines global and local information via manifold learning and regularized self-representation.
result Improves feature selection and clustering accuracy.
GDMaps reduces high-dimensional data to lower dimensions for better classification.
problem High-dimensional data classification and representation.
method Grassmannian Diffusion Maps technique for nonlinear dimensionality reduction.
result GDMaps effectively identifies intrinsic subspace structures in high-dimensional data.
Proposes methods to accurately learn manifolds and their distributions.
problem Data often lives on low-dimensional manifolds, but normalizing flows struggle with this.
method Introduces two methods to calculate the volume-change term for flows on manifolds.
result Tractable calculation of volume-change term leads to more accurate manifold learning.
New method deflates manifolds to visualize high-dimensional data.
problem Failure of nonlinear dimensionality reduction methods on simple manifolds.
method Iterative deflation of differential operators using single-coordinate estimates.
result Empirically, recovers novel embeddings on real-world and synthetic datasets.
KPCA-BO improves BO for high-dimensional optimization problems by learning a non-linear sub-manifold.
problem High-dimensional optimization problems where Gaussian Process regression requires too much data and computation.
method KPCA-BO embeds a non-linear sub-manifold in the search space, learning a GPR model on this sub-manifold.
result KPCA-BO outperforms vanilla BO in convergence speed, especially as dimensionality increases.
Enhances forecasting of complex systems using FKMD.
problem Forecasting high-dimensional dynamical systems with unknown features.
method Featurized Koopman Mode Decomposition (FKMD) using delay embedding and learned Mahalanobis distance.
result Improves prediction accuracy for various complex systems.
A novel GPUM constructs Gaussian Processes for unknown manifolds with probabilistic metrics.
problem High-dimensional data on unknown manifolds with non-Euclidean geometry.
method Bayesian Gaussian Processes latent variable models (BGPLVM), Riemannian geometry, probabilistic metric tensor, Brownian Motion.
result GPUM provides more accurate predictions on unknown manifolds compared to traditional methods.