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

148297445593 · Jun 202019922001200920172026
48 results for similarity structures

Similarity algebra extends algebraic structures with quantitative bounds.

problem Exact algebraic structures with strict axioms.
method Framework for approximate algebraic and Lie structures with ε\varepsilon-estimates.
result Similarity structures converge to classical algebraic objects as εightarrow0\varepsilon ightarrow 0.

Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much …

2012-07-28abs ↗pdf ↗

The study examines nilpotent similarity structures on manifolds and their properties.

problem Characterizing closed manifolds with nilpotent similarity structures.
method Generalizes convexity arguments to geodesic segments in nilpotent Lie groups.
result Closed manifolds with nilpotent similarity structures are either complete or radiant.

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured by solving a non-linear, low-rank representation problem. We show that this low-…

2011-10-26abs ↗pdf ↗

We propose a method to visualize class similarity in large-scale classifiers.

problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.

Measuring sentence similarity is a classic topic in natural language processing. Light-weighted similarities are still of particular practical significance even when deep learning models have succeeded in many other tasks. Some light-weighted similarities with more theoretical insights have been demonstrated to be even…

2020-01-28abs ↗pdf ↗

Leveraging on the underlying low-dimensional structure of data, low-rank and sparse modeling approaches have achieved great success in a wide range of applications. However, in many applications the data can display structures beyond simply being low-rank or sparse. Fully extracting and exploiting hidden structure info…

2019-12-03abs ↗pdf ↗

The paper analyzes the generalization of deep neural networks for metric and similarity learning.

problem Lack of rigorous understanding of generalization performance in metric and similarity learning.
method Derive explicit form of true metric, construct structured deep ReLU neural network, establish excess risk bounds.
result Explicit excess risk bounds for metric and similarity learning are derived.

Inferring the structural properties of a protein from its amino acid sequence is a challenging yet important problem in biology. Structures are not known for the vast majority of protein sequences, but structure is critical for understanding function. Existing approaches for detecting structural similarity between prot…

2019-02-22abs ↗pdf ↗

Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. Similar to some co-clustering methods, the method is based on regu…

2017-02-16abs ↗pdf ↗

New method improves reinforcement learning generalization.

problem Few environments lead to poor generalization in reinforcement learning.
method Integrates sequential structure into representation learning, using a policy similarity metric (PSM) and contrastive embeddings (PSEs).
result PSEs improve generalization across various benchmarks.

Enhances CLIP's similarity computation using PMI's linear structure.

problem CLIP's similarity computation misses the optimal linear structure of PMI.
method KME-CLIP, utilizing inner product in a reproducing kernel Hilbert space.
result KME-CLIP approximates PMI with arbitrary accuracy and outperforms CLIP.

Method screens similar capsule endoscopic images, reducing doctor workload and improving accuracy.

problem Time-consuming and high error rate in manual inspection of large numbers of similar capsule endoscopic images.
method Structural similarity analysis of visually salient areas and hierarchical clustering.
result 76% reduction in similar images, 100% lesion recall, 18-minute average play time.

Framework for inferring latent structure from sparse, imperfectly detected bipartite networks.

problem Recovering latent structure from sparse, imperfectly detected bipartite networks in ecology.
method Structured sparse nonnegative low-rank factorization with detection probability estimation and ADMM-based algorithm.
result Improved recovery of latent factors and structure compared to existing methods.

Infinite-genus surfaces have many isospectral hyperbolic structures.

problem Finding many isospectral hyperbolic structures on infinite-genus surfaces.
method Constructing families of isospectral hyperbolic structures on infinite-type surfaces without planar ends.
result Uncountable families of isospectral and quasiconformally distinct hyperbolic structures on infinite-genus surfaces with self-similar end spaces.

Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping is called similarity-preserving hashing and approximates a similarity metric by using the Hamming distance. Although many efficient similarit…

2019-10-18abs ↗pdf ↗

Proposes SimPool for graph pooling using structural similarity features.

problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.

Rewiring GNNs to optimize community and feature alignment improves their performance.

problem Improving GNNs' performance by addressing over-squashing and generalization issues.
method Three rewiring strategies: ComMa, FeaSt, and ComFy, targeting community structure, node labels, and their alignment.
result Rewiring strategies enhance GNNs' performance by optimizing label-community alignment.

The presence of log-periodic structures before and after stock market crashes is considered to be an imprint of an intrinsic discrete scale invariance (DSI) in this complex system. The fractal framework of the theory leaves open the possibility of observing self-similar log-periodic structures at different time scales.…

2005-01-21abs ↗pdf ↗

It is common for CCTV operators to overlook inter- esting events taking place within the crowd due to large number of people in the crowded scene (i.e. marathon, rally). Thus, there is a dire need to automate the detection of salient crowd regions acquiring immediate attention for a more effective and proactive surveil…

2014-10-14abs ↗pdf ↗

This paper describes the characteristic group of LCP structures and their construction.

problem Understanding the characteristic group of LCP structures and their construction.
method Analyzing the characteristic group and constructing LCP structures.
result It is possible to endow certain quotients with LCP structures.

Paper proposes a new method for joint feature selection and graph learning.

problem Previous methods suffer from neglecting joint formulation and lack of graph learning.
method Formulates multi-view feature selection with orthogonal decomposition, incorporates cross-space locality preservation, and uses a unified objective function for simultaneous learning.
result Demonstrates superior performance in multi-view feature selection and graph learning tasks.

Deconfounds neural network representation similarity metrics to improve consistency and accuracy.

problem Confounding by population structure in similarity metrics like RSA and CKA.
method Covariate adjustment regression to adjust for confounders.
result Improves detection of semantically similar neural networks and consistency in transfer learning.

In this paper we show similarities between turbulence and financial systems. Motivated by similarities between the two systems, we construct a multiscale model for hierarchical financial structures that exhibits a constant cascade of wealth from large financial entities to small financial entities. According to our mod…

2019-02-23abs ↗pdf ↗

Enhances graph neural networks by considering feature similarities in node aggregation.

problem Ignoring node feature similarities in traditional graph aggregation schemes.
method Interprets node aggregation as kernel weighting, proposing a framework that considers feature similarities.
result Proposed framework outperforms traditional GCNs in real-world applications.

The study explores homeomorphism groups of self-similar 2-manifolds, including the 2-sphere and Cantor set.

problem Understanding the structure and properties of homeomorphism groups of self-similar 2-manifolds.
method Survey of recent results, exposition of classical results, treatment of stable sets, and proof of new theorems.
result Characterization of homeomorphisms of perfectly self-similar 2-manifolds and extensions of existing results.

We describe first integrals of geostrophic equations, which are similar to the enstrophy invariants of the Euler equation for an ideal incompressible fluid. We explain the geometry behind this similarity, give several equivalent definitions of the Poisson structure on the space of smooth densities on a symplectic manif…

2008-02-29abs ↗pdf ↗

A similarity structure on a connected manifold M is a Riemannian metric on its universal cover such that the fundamental group of M acts by similarities. If the manifold M is compact, we show that the universal cover admits a de Rham decomposition with at most two factors, one of which is Euclidean. Very recently, afte…

2015-07-20abs ↗pdf ↗

Geometric stability measures neural network robustness, distinguishing from similarity metrics.

problem Lack of robustness in neural network representations.
method Introduces geometric stability, quantified by Shesha metric measuring self-consistency.
result Stability and similarity are uncorrelated, revealing distinct properties of neural network robustness.

This paper explores using SSIM for better image generation in generative models.

problem Improving perceptual quality in generated images using 2\ell_2 norm.
method Theoretical discussion and practical implementation of SSIM in generative models and autoencoders.
result SSIM can be used in generative models and autoencoders to generate better images.

The study reveals the hierarchical structure of the international FOREX market using currency fluctuation distribution similarities.

problem Understanding the hierarchical structure of the international FOREX market.
method Using Jensen-Shannon divergence to quantify the similarity between normalized logarithmic return distributions of currencies.
result Clusters of currencies are consistent with the nature of underlying economies but diverge during crises.