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,657 papers · 148 categories

Trend · papers per month

1234 · Oct 202319922001200920172026
48 results for TDA

ASTRA improves TDA by more accurately approximating iHVP.

problem Improving insights into training data attribution.
method ASTRA uses EKFAC-preconditioner on Neumann series iterations to accurately approximate iHVP.
result Improving iHVP approximation significantly improves TDA performance.

TDA improves FX clustering quality over traditional methods.

problem Capturing complex currency co-movements in FX markets.
method Topological Data Analysis (TDA) compared to traditional statistical methods on monthly FX returns.
result TDA-based clustering yields more compact and well-separated clusters.

This paper introduces TDA and TSI for better business analytics.

problem Nonlinear, multi-scale business datasets under-represented by traditional tools.
method Topological Data Analysis (TDA) and Topological Stability Index (TSI).
result TSI reveals structural variability in business data.

Study evaluates financial anomaly detection methods on Canadian stock market.

problem Detecting financial anomalies in the Canadian stock market.
method Topological data analysis (TDA), principal component analysis (PCA), and neural network-based approaches.
result Neural network-based methods achieve the strongest performance in detecting financial anomalies.

We present a way to use Topological Data Analysis (TDA) for machine learning tasks on grayscale images. We apply persistent homology to generate a wide range of topological features using a point cloud obtained from an image, its natural grayscale filtration, and different filtrations defined on the binarized image. We…

2019-10-18abs ↗pdf ↗

TDA improves stock portfolio selection by analyzing data structure.

problem Traditional portfolio selection methods fail to handle stock market data complexities.
method Two-stage method involving time series generation and clustering with TDA features.
result TDA-based portfolio outperforms other methods consistently over different time frames.

The fingerprint classification problem is to sort fingerprints into pre-determined groups, such as arch, loop, and whorl. It was asserted in the literature that minutiae points, which are commonly used for fingerprint matching, are not useful for classification. We show that, to the contrary, near state-of-the-art clas…

2017-11-24abs ↗pdf ↗

Paper uses TDA for automated Parkinson's disease classification and severity assessment.

problem Manual diagnosis of neurological diseases is time-consuming and inaccurate.
method Combines Topological Data Analysis (TDA) with machine learning on postural shift data.
result Proposes a stable and accurate method for classifying Parkinson's disease.

TDA-based portfolios show better risk-adjusted returns than classical methods.

problem Traditional portfolio selection methods fail to capture complex asset dynamics.
method Topological Data Analysis (TDA) using persistence landscapes to quantify portfolio risk.
result TDA-based portfolios outperform classical models in excess mean return and financial ratios.

The paper uses TDA to select stocks for a sparse portfolio, improving performance across market scenarios.

problem Sparse portfolio selection in financial markets.
method Topological data analysis (TDA) for clustering stock price movements.
result The TDA-based clustering strategy significantly enhances sparse portfolio performance.

Topological Data Analysis (TDA) is a recent and growing branch of statistics devoted to the study of the shape of the data. In this work we investigate the predictive power of TDA in the context of supervised learning. Since topological summaries, most noticeably the Persistence Diagram, are typically defined in comple…

2017-09-20abs ↗pdf ↗

This study uses persistent homology to analyze complex transitional networks from time series data.

problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.

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.

This paper extends hypergraph construction to multivariate time series using signature transforms.

problem Constructing hypergraphs from collections of multivariate time series.
method Leveraging signature transforms to introduce controlled randomness and robustness.
result Validated on synthetic datasets, the method enhances robustness in hypergraph construction.

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.

This review explores TDA and TDL beyond persistent homology.

problem Limitations of persistent homology in capturing topological invariants and homotopic evolution.
method Spectral representations, sheaf theory, Mayer topology, interaction topology, differential topology, geometric topology.
result Review of topological tools for various data types.

A new landmark sampling method improves TDA performance on biomedical data.

problem Improving landmark samplers for pseudometric spaces with varying density and multiplicities.
method Proposes 'lastfirst' procedure based on ranked distances, proving landmarks have desired properties.
result lastfirst outperforms maxmin on homology detection tasks and comparable on prediction tasks.

A new method uses vectorized summaries of persistence diagrams for efficient hypothesis testing.

problem Efficient hypothesis testing for large and complex persistence diagrams.
method Vectorized summaries of Betti functions and a new shuffling technique.
result The vectorized Betti function leads to competitive results compared to baseline methods.

Paper uses TDA to assess cryptocurrency risk by measuring phase space instability.

problem Traditional risk measures fail to capture market dynamics' geometric structure.
method Applied Takens' Delay Embedding Theorem to generate point cloud, computed persistent homology groups, defined Topological Persistence Norm.
result Proposed leverage calibration heuristic based on persistence of 1-dimensional cycles.

New method estimates deep neural network's intrinsic dimension for better generalization.

problem Estimating intrinsic dimension of deep neural networks for generalization.
method Topological data analysis (TDA) and persistent homology (PHD).
result Efficient algorithm to estimate PHD in deep neural networks.

New method predicts model output distributions to improve data attribution.

problem Traditional training data attribution ignores randomness in model training.
method Distributional Training Data Attribution (d-TDA) using influence functions.
result Influence functions are effective and emerge naturally from d-TDA.

A new method detects small holes in noisy data.

problem Detecting small holes in high-density regions from noise.
method Robust Density-Aware Distance (RDAD) filtration, incorporating distance-to-measure concept.
result The RDAD filtration prolongs the persistences of small holes, making them distinguishable from noise.

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.

Topological parallax assesses AI models' geometric similarity to datasets for safety.

problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.