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

24497397 · Jun 202019922001200920172026
48 results for topological descriptors

This work characterizes topological descriptors of graph products and their expressive power.

problem Capturing multiscale structural information in graph products using topological descriptors.
method Analysis of various filtrations on graph products, including Euler characteristic and persistent homology.
result Persistent homology of graph products contains more information than individual graphs.

Paper introduces stable vectorization for multiparameter PH using signed barcodes.

problem Lack of stable vectorization methods for multiparameter persistent homology.
method Signed barcodes as measures for stable vectorization of MPH.
result Stable feature vectors from signed barcodes improve performance in data science.

Persistent homology provides a new, efficient molecular descriptor for protein dynamics.

problem Designing effective molecular descriptors for high-dimensional MD trajectories.
method Introduced masked Flood complex, a protein-tailored modification of simplicial complexes, for persistent homology.
result Persistent homology-based descriptors are competitive across protein dynamics tasks, including frame-level observable regression and MSM estimation.

PTOPOFL uses topological descriptors to protect privacy in federated learning.

problem Privacy and data reconstruction attacks in federated learning.
method PTOPOFL replaces gradient communication with persistent homology feature vectors for privacy and topology-guided aggregation.
result PTOPOFL achieves higher AUC and reduces reconstruction risk compared to gradient sharing.

We use persistent homology along with the eigenfunctions of the Laplacian to study similarity amongst triangulated 2-manifolds. Our method relies on studying the lower-star filtration induced by the eigenfunctions of the Laplacian. This gives us a shape descriptor that inherits the rich information encoded in the eigen…

2019-04-21abs ↗pdf ↗

Hyperbolic volume correlates with chemical properties of fullerenes.

problem Understanding the relationship between fullerene structure and chemical properties.
method Calculated hyperbolic volumes of fullerenes and correlated them with topological indices.
result Hyperbolic volume correlates with Wiener index and other topological indices of fullerenes.

The paper tackles binary classification with measure data using topological descriptors.

problem Binary classification with measure data.
method Develops classifiers for measure data using topological descriptors (persistence diagrams).
result Upper and lower bounds on the Rademacher complexity of classifiers on measures.

A framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative contributions.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

Z-GCNETs uses topological data to improve time series forecasting.

problem Improving time series forecasting accuracy.
method Integrates topological data into graph convolutional networks (GCNs) using zigzag persistence.
result Z-GCNETs outperforms 13 state-of-the-art methods in traffic forecasting and Ethereum price prediction.

New method enhances graph neural networks using contractions and hourglass persistence.

problem Limitations of traditional persistent homology in graph neural networks.
method Hourglass Persistence, Contraction Homology, contractions as a topological operation.
result Hourglass Persistence boosts expressivity, learnability, and stability in graph representation learning.

Framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative importance.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

Optimizes atomic descriptors to reduce redundancy and improve machine learning models.

problem Redundant descriptors in atomistic machine learning models increase computational burden and limit model expressivity.
method Employing techniques from pattern recognition, we refine and augment existing atomistic representations to produce optimal sets of descriptors.
result New architectures recognize up to 5-body patterns with low computational cost and high accuracy.

Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs) which are 2D multisets of points. Their variable size makes them, however, difficult to combine with typical machine learning workflows. In this paper we introduce persistence c…

2018-02-13abs ↗pdf ↗

Persistent homology enhances graph classification by capturing long-range graph properties.

problem Lack of formal assessment of persistent homology in graph learning.
method Brief introduction and theoretical discussion of persistent homology in graph context, followed by empirical analysis.
result Persistent homology improves graph classification, especially for data with prominent topological structures.

Informative and discriminative feature descriptors play a fundamental role in deformable shape analysis. For example, they have been successfully employed in correspondence, registration, and retrieval tasks. In the recent years, significant attention has been devoted to descriptors obtained from the spectral decomposi…

2011-10-23abs ↗pdf ↗

Although the recent progress in the deep neural network has led to the development of learnable local feature descriptors, there is no explicit answer for estimation of the necessary size of a neural network. Specifically, the local feature is represented in a low dimensional space, so the neural network should have mo…

2017-06-16abs ↗pdf ↗

This thesis uses Kantorovich-Rubinstein distance for classifying points based on their measures.

problem Classifying points based on their measures in a metric space.
method Using Kantorovich-Rubinstein distance as a metric in the space of measures to capture geometry and topology.
result A large Kantorovich-Rubinstein distance indicates the existence of a 1-Lipschitz classifier that well classifies the points.

ALP outperforms other data descriptors in one-class classification.

problem Challenges in one-class classification using data descriptors.
method Determined optimal default hyperparameters for data descriptors, proposed ALP, evaluated using leave-one-dataset-out procedure.
result ALP outperforms other data descriptors, including IF and SVM.

Wittgenstein's Rule Following evolves datasets by extrapolating structural descriptors.

problem Generating meaningful continuations of evolving datasets.
method Wittgenstein's Rule Following (WRF) uses structural descriptors to extrapolate trajectories and average historical descriptors.
result WRF can generate meaningful continuations of evolving datasets.

Support Vector Machines (SVMs) are powerful learners that have led to state-of-the-art results in various computer vision problems. SVMs suffer from various drawbacks in terms of selecting the right kernel, which depends on the image descriptors, as well as computational and memory efficiency. This paper introduces a n…

2013-07-19abs ↗pdf ↗

Robustly computes intrinsic coordinates on point clouds using resampling and averaging.

problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.

PolyGraph Discrepancy improves graph generative model evaluation.

problem Inability of existing metrics to provide an absolute performance measure and comparability across different graph descriptors.
method Approximates Jensen-Shannon distance using binary classifiers trained to distinguish between real and generated graphs.
result PGD provides a more robust and insightful evaluation compared to MMD metrics.

Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs). PDs exhibit, however, complex structure and are difficult to integrate in today's machine learning workflows. This paper introduces persistence bag-of-words: a novel and stable…

2018-12-21abs ↗pdf ↗

Method separates target signal properties from noisy mixtures.

problem Signal recovery from noisy mixtures with specific statistical properties.
method Statistical component separation method using noise samples and matching statistics.
result Method outperforms standard denoising methods in recovering target signal properties.

The ability to visually re-identify objects is a fundamental capability in vision systems. Oftentimes, it relies on collections of visual signatures based on descriptors, such as SIFT or SURF. However, these traditional descriptors were designed for a certain domain of surface appearances and geometries (limited relief…

2019-12-06abs ↗pdf ↗

Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can stabilize invariants characterizing these objects. We outline how so called contour fun…

2019-06-11abs ↗pdf ↗

DRAGON improves learning for rare classes in unbalanced datasets using class descriptions.

problem Learning rare classes in unbalanced datasets with deep models.
method DRAGON is a late-fusion architecture that corrects bias towards frequent classes and fuses class-descriptions to improve tail-class accuracy.
result DRAGON outperforms state-of-the-art models on new benchmarks for long-tail learning with class descriptors.

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.

GeoTop resolves topological ambiguity in diagnostic imaging using geometric-topological analysis.

problem Topological equivalence between benign and malignant structures in diagnostic images.
method Combines Topological Data Analysis and Lipschitz-Killing Curvatures to resolve ambiguity.
result Achieves 3.6% accuracy improvement and reduces false positives/negatives by 15-18%.

Covariance and histogram image descriptors provide an effective way to capture information about images. Both excel when used in combination with special purpose distance metrics. For covariance descriptors these metrics measure the distance along the non-Euclidean Riemannian manifold of symmetric positive definite mat…

2014-12-04abs ↗pdf ↗