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

275481108 · May 202619922001200920172026
48 results for persistent entropy

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.

Persistence diagrams from random matrices follow RMT universality, offering a new spectral diagnostic.

problem Understanding spectral properties of random matrices using topological data analysis.
method Applying Morse theory to persistence diagrams of quadratic forms restricted to unit spheres.
result Persistence entropy outperforms traditional level spacing ratios in discriminating random matrix ensembles.

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.

Alexandrov spaces with non-negative curvature are characterized by the matrix displacement convexity of an entropy tensor.

problem Characterizing non-negative curvature in Alexandrov spaces
method Constructing a parallel trivialization of the entropy tensor
result The entropy tensor is matrix displacement convex on Alexandrov spaces

New method predicts Alzheimer's risk with individual uncertainty estimates.

problem Predicting conversion from mild cognitive impairment to Alzheimer's disease.
method Persistent homology of clinical trajectories combined with stacking ensemble.
result Pipeline achieves high accuracy and individual-level uncertainty quantification.

Entropy-regularized NPG converges linearly with linear function approximation.

problem Analyzing convergence of entropy-regularized NPG with function approximation.
method Established finite-time convergence analyses with entropy regularization and linear function approximation.
result Entropy-regularized NPG achieves linear convergence up to a function approximation error.

Researchers modify dpd_p distance to handle long, thin splines.

problem Maintaining stability in convergence metrics with scalar curvature approaching positivity.
method Introducing and analyzing a modified dpd_p distance to handle persistent splines.
result The modified dpd_p distance provides a stable estimate, useful for geometric stability.

Study predicts price predictability in ultra-high frequency financial data using entropy tests.

problem Tackles predictability of ultra-high frequency financial data.
method Develops statistical tests based on Shannon entropy and Kullback-Leibler divergence to analyze predictability.
result Degree of randomness increases with aggregation level in transaction time.

We measure the influence of different time-scales on the dynamics of financial market data. This is obtained by decomposing financial time series into simple oscillations associated with distinct time-scales. We propose two new time-varying measures: 1) an amplitude scaling exponent and 2) an entropy-like measure. We a…

2015-08-29abs ↗pdf ↗

When an online learning algorithm is used to estimate the unknown parameters of a model, the signals interacting with the parameter estimates should not decay too quickly for the optimal values to be discovered correctly. This requirement is referred to as persistency of excitation, and it arises in various contexts, s…

2019-11-04abs ↗pdf ↗

Timely detection of abrupt anomalies is crucial for real-time monitoring and security of modern systems producing high-dimensional data. With this goal, we propose effective and scalable algorithms. Proposed algorithms are nonparametric as both the nominal and anomalous multivariate data distributions are assumed unkno…

2018-09-14abs ↗pdf ↗

Study shows translators can have non-removable singularities at infinity but eventually converge to unique planes.

problem Understanding singularities and convergence of translators at infinity.
method Global analysis of quasilinear soliton equations, sharp non-standard elliptic decay estimates, and potential theory.
result Finite entropy, finite genus translators converge to uniquely determined planes at infinity.

We analyze the market efficiency of 25 commodity futures across various groups -- metals, energies, softs, grains and other agricultural commodities. To do so, we utilize recently proposed Efficiency Index to find that the most efficient of all the analyzed commodities is heating oil, closely followed by WTI crude oil,…

2013-09-05abs ↗pdf ↗

Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is that it allows one to apply tools from statistics and machine lea…

2018-10-11abs ↗pdf ↗

Proposes deep graph persistence to address neural persistence issues in deep learning.

problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.

DG improves policy gradients by weighting actions with a sigmoid of advantage and surprisal.

problem Pathologies in standard policy gradients, leading to poor updates and over-allocation of gradient budget.
method Introduces Delightful Policy Gradient (DG) that gates each term with a sigmoid of advantage and surprisal.
result DG provably improves directional accuracy in a single context and shifts the expected gradient closer to the oracle across multiple contexts.

This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…

2011-12-06abs ↗pdf ↗

Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.

problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.

This paper interprets critical scales in persistent homology for compact metric spaces.

problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.

MuRiT efficiently computes multi-parameter persistence barcodes.

problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.

This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…

2011-12-17abs ↗pdf ↗

This study investigates porosity and topological properties of TPMS using machine learning.

problem Understanding the relationships between porosity and topological properties of TPMS.
method Application of machine learning techniques to analyze porosity and shape factor of TPMS.
result Conjectures suggesting polynomial relationships between porosity and shape factor of TPMS.

A new approach to reinforcement learning improves policy performance by adjusting control frequency.

problem Improving reinforcement learning performance by optimizing control frequency.
method Introducing action persistence and a novel algorithm, PFQI, to learn optimal value function at a given persistence.
result PFQI effectively learns optimal value function with action persistence, improving reinforcement learning performance.

Given a compact geodesic space XX we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of XX to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

2017-09-15abs ↗pdf ↗

A new method compares persistent cycles in topological data.

problem Comparing persistent homology representations of two spaces.
method Direct comparison of individual persistent cycles based on persistence intervals and spatial placement.
result Demonstrated the effectiveness of the method in topological inference.

Improved persistence spheres map measures to functions, stable under partial transport.

problem Representing and comparing measures in topological machine learning.
method Persistence spheres map measures to continuous functions on the sphere, stable under 1-Wasserstein partial transport.
result Persistence spheres provide a stable, parameter-free representation of measures, improving upon existing methods.

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …

2021-03-11abs ↗pdf ↗

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of non-trivial colorings for the tangles in question. Our main result in this article i…

2019-04-11abs ↗pdf ↗

The interbank market has a natural multiplex network representation. We employ a unique database of supervisory reports of Italian banks to the Banca d'Italia that includes all bilateral exposures broken down by maturity and by the secured and unsecured nature of the contract. We find that layers have different topolog…

2013-11-19abs ↗pdf ↗

Study cosmic structures using Topological Data Analysis and Persistence Energy.

problem Investigate cosmic web evolution in ΛΛCDM cosmologies.
method Apply LITE method to embed persistence diagrams into vector spaces and analyze cosmic structures.
result Discover a correlation between Persistence Energy and redshift values.

The paper examines how long-memory dynamics, rough-volatility, and persistence affect equity volatility forecasting.

problem The study investigates how long-memory dynamics, rough-volatility, and persistence impact equity volatility forecasting.
method The paper combines semiparametric long-memory estimation, rough-volatility diagnostics, and structured forecasting regressions.
result Persistence measures improve out-of-sample volatility forecasts, particularly during periods of elevated market volatility and in volatility-managed portfolio applications.