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

104209313417 · Jun 202019922001200920172026
48 results for representation comparison

MKA incorporates manifold geometry into kernel alignment for more robust representation comparison.

problem Inadequate accounting for manifold geometry in kernel alignment metrics.
method Derives a theoretical framework for Manifold Approximated Kernel Alignment (MKA).
result MKA provides a more robust foundation for measuring representations.

Learning high quality class representations from few examples is a key problem in metric-learning approaches to few-shot learning. To accomplish this, we introduce a novel architecture where class representations are conditioned for each few-shot trial based on a target image. We also deviate from traditional metric-le…

2018-02-12abs ↗pdf ↗

The concept of F-algebra and its representation can be extended to an arbitrary bundle. We define operations of fibered F-algebra in fiber. The paper presents the representation theory of of fibered F-algebra as well as a comparison of representation of F-algebra and of representation of fibered F-algebra.

2007-02-19abs ↗pdf ↗

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

We construct a new representation formula for indefinite improper affine spheres in terms of two para-holomorphic functions and study singularities which appear in this representation formula. As a result, it follows that cuspidal cross caps never appear as the singularities on indefinite improper affine spheres and so…

2008-01-31abs ↗pdf ↗

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

We address the classical problem of hierarchical clustering, but in a framework where one does not have access to a representation of the objects or their pairwise similarities. Instead, we assume that only a set of comparisons between objects is available, that is, statements of the form "objects ii and jj are more …

2018-11-02abs ↗pdf ↗

New methods compare neural network models using geometric and topological summaries.

problem Comparing deep representations of complex networks in models and brains.
method Develops inference methods based on topological data analysis (TDA) and graph-based techniques.
result New statistical methods enable better model comparison and inference.

Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C) and ask an oracle whether item A is closer to item B or to item C. In this paper,…

2018-06-18abs ↗pdf ↗

Representation learning becomes especially important for complex systems with multimodal data sources such as cameras or sensors. Recent advances in reinforcement learning and optimal control make it possible to design control algorithms on these latent representations, but the field still lacks a large-scale standard …

2018-11-27abs ↗pdf ↗

SEMASIA provides a large dataset of latent representations for model comparison.

problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.

We study the functor of points and the local functor of points (here called the Weil--Berezin functor) for smooth and holomorphic supermanifolds, providing characterization theorems and fully discussing the representability issues. In the end we examine applications to differential calculus including the transitivity t…

2009-02-11abs ↗pdf ↗

Deep learning has proven itself as a successful set of models for learning useful semantic representations of data. These, however, are mostly implicitly learned as part of a classification task. In this paper we propose the triplet network model, which aims to learn useful representations by distance comparisons. A si…

2014-12-20abs ↗pdf ↗

By performing required evaluations, we show that in the Finsleroid-regular space the Landsberg-space condition just degenerates to the Berwald-space condition (at any dimension number N2N\ge2). Simple and clear expository representations are obtained. Due comparisons with the Finsleroid-Finsler space are indicated. Key…

2008-01-30abs ↗pdf ↗

Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.

problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.

This paper contains an overview of results for dynamic multivariate risk measures. We provide the main results of four different approaches. We will prove under which assumptions results within these approaches coincide, and how properties like primal and dual representation and time consistency in the different approa…

2013-05-09abs ↗pdf ↗

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.

NGAT predicts long-term stock trends using graph attention networks.

problem Lack of effective corporate relationship graph comparison methods and model complexity in stock prediction.
method Developed a Node-level Graph Attention Network (NGAT) for corporate relationship graphs.
result Demonstrated the effectiveness of NGAT across two datasets.

Develops a new self-supervised learning method combining contrastive and non-contrastive approaches.

problem Leveraging unlabeled data for representation learning, especially with high variance and low batch sizes.
method Converts a contrastive method (Spectral Contrastive Loss) into a non-contrastive form (MINC loss) to reduce variance and mutual information.
result MINC loss consistently improves upon the Spectral Contrastive loss baseline in learning image representations.

Learning distributed representations of documents has pushed the state-of-the-art in several natural language processing tasks and was successfully applied to the field of recommender systems recently. In this paper, we propose a novel content-based recommender system based on learned representations and a generative m…

2017-11-28abs ↗pdf ↗

Bispectral OT improves dataset comparison by preserving intrinsic coherence.

problem Ignoring intrinsic coherence in dataset comparisons using pairwise geometric distances.
method Introduces Bispectral Optimal Transport, a symmetry-aware extension of discrete OT.
result Transport plans computed with Bispectral OT achieve greater class preservation accuracy.

Observational studies are rising in importance due to the widespread accumulation of data in fields such as healthcare, education, employment and ecology. We consider the task of answering counterfactual questions such as, "Would this patient have lower blood sugar had she received a different medication?". We propose …

2016-05-12abs ↗pdf ↗

We analyze (the harmonic map representation of) static solutions of the Einstein Equations in dimension three from the point of view of comparison geometry. We find simple monotonic quantities capturing sharply the influence of the Lapse function on the focussing of geodesics. This allows, in particular, a sharp estima…

2011-03-24abs ↗pdf ↗

We introduce GeNet, a method for shotgun metagenomic classification from raw DNA sequences that exploits the known hierarchical structure between labels for training. We provide a comparison with state-of-the-art methods Kraken and Centrifuge on datasets obtained from several sequencing technologies, in which dataset s…

2019-01-30abs ↗pdf ↗

Study compares atom representations in graph neural networks for molecular properties.

problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.

For a compact 3-manifold M with arbitrary (possibly empty) boundary, we give a parametrization of the set of conjugacy classes of boundary-unipotent representations of the fundamental group of M into SL(n,C). Our parametrization uses Ptolemy coordinates, which are inspired by coordinates on higher Teichmueller spaces d…

2011-11-11abs ↗pdf ↗

We study the properties of nonlinear Backward Stochastic Differential Equations (BSDEs) driven by a Brownian motion and a martingale measure associated with a default jump with intensity process (λt)(λ_t). We give a priori estimates for these equations and prove comparison and strict comparison theorems. These results ar…

2016-12-16abs ↗pdf ↗