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.

169,341 papers · 148 categories

Trend · papers per month

80161241321 · Jun 202019922001200920182026
48 results for statistical topology

Flexible approach for normal approximations in geometric and topological statistics.

problem Normal approximation for complex statistics not expressible as sums of score functions.
method Flexible add-one cost operator combined with strong stabilization theory.
result Established normal approximation results for geometric and topological statistics.

New method detects uncertainty in neural networks for out-of-distribution detection.

problem Detecting out-of-distribution inputs to ensure model reliability.
method Predictive topological uncertainty (pTU) based on persistent homology.
result pTU provides a statistical framework for OOD detection.

Constructing exponential families from statistical manifolds.

problem The central problem of constructing exponential families from statistical manifolds.
method Constructive approach proving every compact statistical manifold admits a foliation of Hessian manifolds.
result Compact orientable leaves are either finite quotients of flat torus or mapping torus with periodic monodromy.

The paper explores statistical and topological properties of sliced probability divergences.

problem Understanding the topological, statistical, and computational consequences of slicing divergences.
method Deriving theoretical properties of sliced probability divergences, including metric axioms preservation and weak continuity.
result Sliced divergences share similar topological properties and have stable sample complexity.

New methods compare neural network models using geometric and topological summaries.

problem Comparing deep representations of complex networks in models and brains.
method Develops inference methods based on topological data analysis (TDA) and graph-based techniques.
result New statistical methods enable better model comparison and inference.

This chapter covers methods for identifying and inferring graph topologies.

problem Identifying and inferring graph topologies from multidimensional relational data.
method Overview of methods including correlation metrics, covariance selection, kernels, structural equations, and vector autoregressions.
result Supports both batch and online learning with convergence guarantees and leverages high-order statistical information.

Information geometry provides a geometric approach to families of statistical models. The key geometric structures are the Fisher quadratic form and the Amari-Chentsov tensor. In statistics, the notion of sufficient statistic expresses the criterion for passing from one model to another without loss of information. Thi…

2012-07-28abs ↗pdf ↗

We develop a theory of higher-order feature attribution for complex models.

problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.

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.

Explains how geometry and statistics intertwine, focusing on information geometry.

problem Understanding the interplay between geometry and statistics.
method Introduces differential topology, geometry, probability, and (pre-)Frobenius manifolds.
result Discovers connections between geometry and statistics, particularly in information geometry.

New algebraic geometry and statistical manifold connections proven.

problem Understanding the structure of statistical manifolds and their algebraic properties.
method Developed relations between algebraic geometry, information theory, and Topological Field Theory.
result Statistical pre-Frobenius manifolds form algebraic varieties and have hexagonal, isoclinic webs.

A reinforcement learning framework evolves persistence diagrams on PD space for stochastic dynamics.

problem Stochastic modeling and evolution of persistence diagrams (PDs) for topological analysis.
method Reinforcement learning framework for PD space, evolving diagrams through topology-aware local edit operations.
result Established conditions for geometric ergodicity of Markov chains on PD space, yielding unique stationary laws.

Discovering topological quantum field theories in 2+1 and 3+1 dimensions.

problem Exploring topological orders in condensed matter lattice models.
method Calculating braiding statistics and link invariants of anyon excitations.
result Identifying new spin topological quantum field theories with specific knot/link invariants.

Researchers use topological summaries in regression and classification tasks.

problem Lack of positive semi-definite property in topological summaries.
method Defined a topological exponential kernel and showed its effectiveness in regression and classification.
result Topological summaries can be successfully used in supervised learning tasks.

We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…

2008-03-08abs ↗pdf ↗

Survey of techniques for diagnosing pediatric sleep apnea from inexpensive data.

problem Diagnosing pediatric sleep apnea from limited and variable data.
method Exploratory data analysis using correlation networks, Mapper, SVD; supervised and unsupervised learning techniques.
result Analysis of various learning techniques applied to pediatric sleep apnea data.

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

Improved modeling of persistence diagrams for data analysis.

problem Determining significant outliers in persistence diagrams.
method Modification of the RST (Replicating Statistical Topology) model using MCMC Metropolis-Hastings algorithm.
result The modified RST model improves the goodness of fit in persistence diagram analysis.

Artificial neural networks map quantum phases of disordered topological superconductors.

problem Classifying quantum phases of disordered topological superconductors.
method Supervised artificial neural network trained on ensemble averages of quasiparticle distributions.
result Artificial neural networks can classify quantum phases with high confidence, identifying unknown phases.

The paper explores the topology of polygonal meshes and their properties.

problem Understanding the topological properties of polygonal meshes.
method Overview of topological concepts, definitions of intrinsic and extrinsic topology, proofs of Euler and Euler-Poincaré formulas, and discussion on cutting meshes.
result Detailed understanding and definitions of polygonal mesh topology, including intrinsic and extrinsic properties.

TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.

problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.

The paper addresses statistical inference for cluster trees, providing methods to quantify uncertainty.

problem Quantifying uncertainty in cluster tree estimates.
method Developed metrics for comparing cluster trees, proposed methods for constructing and summarizing confidence sets, introduced a partial ordering for pruning insignificant features.
result Proposed methods for constructing and summarizing confidence sets for the unknown true cluster tree.

Persistent entropy detects phase transitions in complex systems.

problem Detecting phase transitions in complex systems.
method Established a general theorem for persistent entropy to reliably detect phase transitions, introduced operational framework for finite-time computations.
result Persistent entropy exhibits an asymptotically non-vanishing gap across phases, robust numerical signatures across experiments.

Study detects P-type bifurcations in single system realizations using unreliable kernel density estimates.

problem Detecting P-type bifurcations in signals with unreliable kernel density estimates.
method Create persistence diagrams from single system realization, statistically analyze resulting set, compare point process modeling methods.
result Subsampling outperforms other point process modeling methods in predicting P-type bifurcations.

The main aim of this paper is to extend Bochner's technique to statistical structures. Other topics related to this technique are also introduced to the theory of statistical structures. It deals, in particular, with Hodge's theory, Bochner-Weitzenbock and Simon's type formulas. Moreover, a few global and local theorem…

2015-04-23abs ↗pdf ↗

A new Riemannian framework for efficiently comparing topological persistence diagrams.

problem Efficiently comparing topological persistence diagrams without point-to-point matching.
method Developed a Riemannian geometry framework to represent and compare persistence diagrams.
result The new framework reduces computational complexity and enables statistical analysis.