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

Trend · papers per month

3468102136 · Jun 202619922001200920172026
48 results for topological thresholds

A new algorithm infers causal networks from data using topological thresholds.

problem Inferring causal networks from data.
method Two methods for determining topological thresholds: one to leave no disconnected nodes, the other to find a causal large connected component.
result The novel algorithm is faster and more accurate than the PC algorithm.

Although the threshold network is one of the most used tools to characterize the underlying structure of a stock market, the identification of the optimal threshold to construct a reliable stock network remains challenging. In this paper, the concept of dynamic consistence between the threshold network and the stock ma…

2018-03-06abs ↗pdf ↗

Based on the daily data of American and Chinese stock markets, the dynamic behavior of a financial network with static and dynamic thresholds is investigated. Compared with the static threshold, the dynamic threshold suppresses the large fluctuation induced by the cross-correlation of individual stock prices, and leads…

2010-02-18abs ↗pdf ↗

RCLA reduces noise in topological data analysis, preserving essential structure.

problem Noise in large datasets obscures topological features in persistent homology.
method Grid-based RCLA integrates data reduction and denoising with a threshold parameter.
result RCLA provides a theoretical guarantee and automatic parameter selection.

We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.

problem The topology of Kähler manifolds is largely determined by the geometry due to its rigidity.
method We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.
result We prove that within a certain threshold, the odd Betti numbers of any compact almost-hermitian manifold satisfying a degenerate Kähler condition are even, and the even Betti numbers are strictly positive.

We consider 2-dimensional random simplicial complexes YY in the multi-parameter model. We establish the multi-parameter threshold for the property that every 2-dimensional simplicial complex SS admits a topological embedding into YY asymptotically almost surely. Namely, if in the procedure of the multi-parameter mod…

2019-12-09abs ↗pdf ↗

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

Study reveals how dengue spread patterns vary across different years in Recife, Brazil.

problem Understanding spatial organization of dengue transmission in urban areas.
method Spatial analysis of dengue cases using topological data analysis and Vietoris-Rips filtrations.
result Critical percolation thresholds define distinct geometric regimes of dengue spread.

New algorithms detect communities in sparse graphs with labeled data.

problem Detecting communities in sparse graphs with limited labeled data.
method Introduces two algorithms: combinatorial and optimization-based, to integrate labeled data with graph structures.
result Detection of communities is feasible throughout the parameter domain with arbitrary labeled data.

This study examined how the correlation and network structure of 30 global indices and 145 local Korean indices belonging to the KOSPI 200 have changed during the 13-year period, 2000-2012. The correlations among the indices were calculated. The results showed that although the average correlations of the global indice…

2014-02-07abs ↗pdf ↗

The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…

2017-07-05abs ↗pdf ↗

In this study the Voronoi interpolation is used to interpolate a set of points drawn from a topological space with higher homology groups on its filtration. The technique is based on Voronoi tessellation, which induces a natural dual map to the Delaunay triangulation. Advantage is taken from this fact calculating the p…

2019-11-08abs ↗pdf ↗

Finding optimal correction of errors in generic stabilizer codes is a computationally hard problem, even for simple noise models. While this task can be simplified for codes with some structure, such as topological stabilizer codes, developing good and efficient decoders still remains a challenge. In our work, we syste…

2018-02-23abs ↗pdf ↗

Unified geometric flows improve deep learning efficiency and simplify neural network topologies.

problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN)\mathcal{O}(N\log N) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy.

Community detection algorithms are fundamental tools to understand organizational principles in social networks. With the increasing power of social media platforms, when detecting communities there are two possi- ble sources of information one can use: the structure of social network and node attributes. However struc…

2016-04-12abs ↗pdf ↗

Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.

problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

A new SSL method uses instance-dependent thresholds to improve accuracy.

problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.

Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.

problem Identifying outliers in a set of rewards where the threshold is a function of all rewards.
method Adaptively updated confidence interval for the threshold based on previous rounds' estimates, balancing exploration of individual arms and the outlier threshold.
result Efficient algorithm with reduced sample complexity for outlier detection.

External or internal shocks may lead to the collapse of a system consisting of many agents. If the shock hits only one agent initially and causes it to fail, this can induce a cascade of failures among neighoring agents. Several critical constellations determine whether this cascade remains finite or reaches the size o…

2012-09-05abs ↗pdf ↗

The paper proves the existence of singular cscK metrics on smoothable varieties.

problem Existence of singular cscK metrics on smoothable varieties.
method Developing a strong topology of pluripotential theory in families and uniform estimates for cscK metrics.
result Existence of singular cscK metrics on Q\mathbb{Q}-Gorenstein smoothable klt varieties when the Mabuchi functional is coercive.

An adaptive clustering algorithm learns from evolving data without manual tuning.

problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.

The article examines different thresholding methods for improving PAM algorithm in cancer classification.

problem High-dimensional classification with too many features selected by PAM.
method Extends PAM with hard and order thresholding methods and a deep search algorithm.
result Improved cancer status prediction accuracy and smaller number of features.

Proposes a conservative LR estimator for infrequent data near a frequency threshold.

problem Overestimation of likelihood ratios for infrequent data near a frequency threshold.
method Conservative likelihood ratio estimator for frequencies slightly above a threshold.
result Improves prediction accuracy in named entity context prediction.

New method trains neural networks with threshold activation functions efficiently.

problem Training neural networks with threshold activation functions is challenging due to zero gradients.
method We study weight decay regularized training problems of deep neural networks with threshold activations, showing they can be formulated as convex optimization problems.
result Regularized deep threshold network training problems can be formulated as standard convex optimization problems, paralleling the LASSO method.

Polynomial neural networks explore thresholds for maximum expressiveness.

problem Understanding the limits of polynomial neural networks' expressiveness.
method Introducing activation degree threshold to measure network expressiveness and proving its existence and upper bounds.
result Polynomial neural networks with equi-width architectures achieve the maximum expressiveness.

Paper introduces threshold invariant fairness to ensure equitable predictions across different groups.

problem Machine learning models can be unfair to certain groups based on sensitive attributes.
method Proposes threshold invariant fairness and uses two approximation methods to equalize risk distributions.
result Demonstrates effectiveness in alleviating threshold sensitivity in fairness models.

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.

We investigate geometric invariants of the one parameter family of Mukai threefolds that admit C\mathbb C^{*} action. In particular we find the invariant divisors in the anticanonical system, and thus establish a bound on the log canonical thresholds. Furthermore we find an explicit description of such threefolds in t…

2015-06-10abs ↗pdf ↗

FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.

problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.

The paper considers an investment timing problem appearing in real options theory. Present values from an investment project are modeled by general diffusion process. We prove necessary and sufficient conditions under which an optimal investment time is induced by threshold strategy. We study also the conditions of opt…

2015-11-02abs ↗pdf ↗

Deep learning detects bifurcations in dynamical systems.

problem Predicting catastrophic changes in dynamical systems across sciences.
method Data-driven, physically-informed deep-learning framework for classifying dynamical regimes and characterizing bifurcation boundaries.
result Extracts topologically invariant features to detect bifurcation boundaries in unseen systems.

Paper proves integrability and entropy compactness for Kähler potentials with uniform log-log threshold.

problem Integrability and entropy compactness for Kähler potentials with specific density.
method Skoda-Zeriahi type integrability theorem and log-log threshold detection.
result Positivity of integrability threshold and entropy compactness for uniform log-log threshold.