Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

55110165220 · Jun 202019922001200920172026
48 results for high-dimensional topology

PERCEPT detects changes in high-dimensional data streams using topological data analysis.

problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.

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+1R^{2n+1} and is a retract of some neighborhood in R2n+1R^{2n+1}.

A novel method extracts topological features from word embeddings for text classification.

problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.

IVFS simplifies feature selection for high-dimensional data preservation.

problem Maintaining structure and pairwise distances in high-dimensional data.
method IVFS framework based on persistent diagrams from computational topology.
result IVFS well preserves pairwise distances and topological patterns of full data.

Reproduces IVFS for high-dimensional data structure preservation.

problem Preserving high-dimensional data structure in unsupervised feature selection.
method Inspired by random subset method, IVFS maintains data similarity through topological structure.
result IVFS outperforms SPEC and MCFS on most datasets.

Paper proposes a method to improve circular coordinate representation for detecting changes in high-dimensional datasets.

problem Detecting changes in high-dimensional datasets with preserved topological structures.
method Adapt circular coordinate framework using a generalized penalty function instead of an L2 penalty.
result Circular coordinates with generalized penalty can detect changes in high-dimensional datasets under different sampling schemes.

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to simplicial complexes, among them stand out coboundary expansion and topological expand…

2014-08-27abs ↗pdf ↗

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…

2013-04-22abs ↗pdf ↗

Mapper and Ball Mapper tools for complex data analysis.

problem Exploring and visualizing high-dimensional data and scalar functions.
method Combining Mapper and Ball Mapper, adding new features for encoding structure and symmetries.
result A new hybrid algorithm, Mapper on Ball Mapper, for comparing high-dimensional data descriptors.

The paper analyzes high-dimensional sphere solutions to the Nirenberg problem with residual mass.

problem The Nirenberg problem on high-dimensional spheres with residual mass.
method Analysis of subcritical approximations and blowing up solutions.
result Comprehensive description of blowing up solutions, including blow-up points and rates.

We analyze the landscape of empirical risk minimization for high-dimensional models, predicting phase transitions and critical point properties.

problem Understanding the complexity and structure of high-dimensional empirical risk landscapes.
method Using the Kac-Rice formula, we analyze the expected number of critical points and their spectral properties, providing detailed predictions.
result We derive complete topological phase diagrams for the phase retrieval problem, predicting BBP-type transitions and critical point stability.

Some generalizations and variations of the Fintushel-Stern rim surgery are known to produce smoothly knotted surfaces. We show that if the fundamental groups of their complements are cyclic, then these surfaces are topologically unknotted. Using a twist-spinning construction from high-dimensional knot theory, we constr…

2006-10-06abs ↗pdf ↗

The paper analyzes diffusion condensation for data geometry and topology.

problem Understanding the geometry and topology of high-dimensional data.
method Time-inhomogeneous diffusion process with geometric, spectral, and topological analysis.
result The condensation process defines intrinsic condensation homology and ambient persistent homology.

Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel…

2018-09-26abs ↗pdf ↗

Paper explores applying TDA to text classification, improving model performance.

problem Applying TDA to text classification is challenging due to the complexity of text geometry.
method Used word embeddings and TF-IDF vectors to extract topological features from text.
result Topological features improve classification results, especially in ensemble models.

Proposes using continuum percolation to analyze data manifolds and improve generative models.

problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.

Survey of embedding methods for high-dimensional and network data.

problem Embedding high-dimensional and nonlinear data structures in a lower-dimensional space.
method Survey of various embedding methods including principal curves, multidimensional scaling, graph-based methods, and topological embeddings.
result Discussion of the pros and cons of algorithmic machine learning and statistical modeling approaches.

Study on stable Hamiltonian topology finds non-density of certain structures.

problem Non-density of stable hypersurfaces and Hamiltonian structures.
method Proving non-density results for stable hypersurfaces and Hamiltonian structures in various dimensions.
result Non-density of stable hypersurfaces and Hamiltonian structures in specific isotopy and homotopy classes.

In this work we present a new local to global criterion for proving a form of high dimensional expansion, which we term cosystolic expansion. Applying this criterion on Ramanujan complexes, yields for every dimension, an infinite family of bounded degree complexes with the topological overlapping property. This answer …

2015-10-03abs ↗pdf ↗

We introduce the notion of an EZ-structure on a group. Delta-hyperbolic groups and CAT(0)-groups have EZ-structures. We show torsion-free groups having an EZ-structure automatically have an action by homeomorphisms on a closed (high-dimensional) ball, which is well-behaved away from a "bad limit set" in the boundary of…

2004-05-13abs ↗pdf ↗

Regularization preserves topological data structure in autoencoders.

problem Ensuring topological data structure preservation in autoencoders.
method Regularization using Legendre nodes to preserve manifold embedding.
result Regularized autoencoders ensure one-to-one embedding of data manifolds.

A new method for state estimation on complex networks.

problem Reconstructing latent dynamics from multivariate time-series on topological cell complexes.
method Topology-aware state space framework derived from stochastic partial differential equations, with state evolution following heat-like topological diffusion.
result The proposed method successfully recovers latent states and topological structures in real-world networks.

Framework for analyzing dynamic topological changes in point clouds using persistent homology and dynamic optimal transport.

problem Analyzing transient structural reorganizations during dynamic phase transitions in time-evolutionary point clouds.
method Hierarchical dynamic evaluation framework driven by topological and hypergraph reconstruction strategy.
result Combining transport-based alignment with multi-scale entropy diagnostics for dynamic topological analysis.

When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and continuous with a continuous inverse. Using topological arguments, we show that wh…

2018-12-27abs ↗pdf ↗

JORC-UMAP improves UMAP by incorporating geometric and topological priors.

problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.