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

152305457609 · Jun 202019922001200920172026
48 results for topology sampling

Study evaluates synthetic data augmentation for small datasets, highlighting inconsistencies in traditional metrics.

problem Inconsistent validation of synthetic data generated for small sample sizes.
method Proposes a normalized Bottleneck distance metric to evaluate synthetic tabular data.
result Common metrics like propensity scoring and MMD fail for small datasets, showing instability and high variability.

IVFS simplifies feature selection for high-dimensional data preservation.

problem Maintaining structure and pairwise distances in high-dimensional data.
method IVFS framework based on persistent diagrams from computational topology.
result IVFS well preserves pairwise distances and topological patterns of full data.

In this study, a novel topology optimization approach based on conditional Wasserstein generative adversarial networks (CWGAN) is developed to replicate the conventional topology optimization algorithms in an extremely computationally inexpensive way. CWGAN consists of a generator and a discriminator, both of which are…

2019-01-14abs ↗pdf ↗

Study shows effective resistance distance yields more accurate network barycenter than Hamming distance.

problem Identifying the best metric for computing the Fréchet mean network.
method Compared the effectiveness of Hamming distance and effective resistance distance in capturing network topology.
result Effective resistance distance produces a more accurate Fréchet mean network.

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

We study regularization in the context of small sample-size learning with over-parameterized neural networks. Specifically, we shift focus from architectural properties, such as norms on the network weights, to properties of the internal representations before a linear classifier. Specifically, we impose a topological …

2020-02-12abs ↗pdf ↗

Unified toolkit for comparing neural representations using SRTD and NTS.

problem Heuristic asymmetry and unbounded scores in existing divergences.
method Developed SRTD and NTS to address these issues.
result Unified, robust, and scale-invariant metric for comparing neural representations.

Topology guidance controls generative model outputs by specifying topological features.

problem Lack of control in generative models for visual analysis.
method Coupling a coordinate-based neural network with a diffusion model to guide sampling.
result Generated fields adhere to specified topological features while staying within the generative distribution.

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.

The paper studies the convergence of SAA for systemic risk measures.

problem Theoretical convergence of SAA for set-valued systemic risk measures.
method General theory and specific case study with mixed-integer programming formulations.
result Theoretical convergence results for SAA under Wijsman and Hausdorff topologies.

Paper tackles few-shot class-incremental learning with a neural gas network.

problem Incrementally learn new classes from very few labelled samples without forgetting old classes.
method Proposes TOPIC framework using a neural gas network to preserve class topology and adapt to new samples.
result Significantly outperforms other methods on CIFAR100, miniImageNet, and CUB200 datasets.

We implement methods from computational homology to obtain a topological signal of singularity formation in a selection of geometries evolved numerically by Ricci flow. Our approach, based on persistent homology, produces precise, quantitative measures describing the behavior of an entire collection of data across a di…

2015-02-09abs ↗pdf ↗

HLTF generates chemically valid 3D molecules with improved topology control.

problem Generating chemically valid 3D molecules is challenging due to bond topology errors.
method HLTF uses a latent multi-scale plan for global context and a constraint-aware sampler to suppress topology-driven failures.
result HLTF achieves high validity and uniqueness on QM9 and GEOM-DRUGS datasets.

Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in order to facilitate study. For these reasons, a more thorough and complete unde…

2012-11-14abs ↗pdf ↗

Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing and validating multiple network topologies, it often requires an enormous numbe…

2020-02-17abs ↗pdf ↗

We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space XX, and output a clustering of the data based on the selection of a topological model for the connected components of XX. Both algorithms work by selectin…

2015-06-08abs ↗pdf ↗

A new model for graph sampling that preserves structure without explicit targeting.

problem Graphs are often not fully representative of true relationships, leading to biased machine learning models.
method Node copying model: randomly replaces each node's neighbors with those of a randomly sampled similar node.
result The model achieves higher accuracy in node classification and mitigates adversarial attacks.

Bayesian method infers network topology and dynamics from noisy, sparse measurements.

problem Learning network topology and dynamics from partial, noisy data.
method Developed method uses dynamical structure functions derived from linear stochastic differential equations.
result Method outperforms state-of-the-art methods in various network types.

Improved phylogenetic inference using VBPI-Mixtures for tree topology and branch length.

problem Multimodality of tree-topology posterior distributions in phylogenetic inference.
method VBPI-Mixtures algorithm that uses mixture learning within the BBVI framework.
result VBPI-Mixtures captures tree-topology distributions better than VBPI.

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.

We present a new family of zero-field Ising models over NN binary variables/spins obtained by consecutive "gluing" of planar and O(1)O(1)-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of the dynamic programming type for solving exact inference (computing partition func…

2019-10-22abs ↗pdf ↗

SOM-VQ tokenizes discrete models with semantic structure and navigable topology.

problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.

Recent studies classify the topology of proteins by analysing the distribution of their projections using knotoids. The approximation of this distribution depends on the number of projection directions that are sampled. Here we investigate the relation between knotoids differing only by small perturbations of the direc…

2019-09-18abs ↗pdf ↗