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

220440660880 · Jun 202019922001200920172026
48 results for representational similarity analysis

Unified understanding of neural representation similarity measures.

problem Fragmented research landscape of neural network similarity measures.
method Observation and exploration of connections between shape distances and normalized Bures similarity.
result Cosine of the Riemannian shape distance equals normalized Bures similarity.

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.

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.

Recent work has sought to understand the behavior of neural networks by comparing representations between layers and between different trained models. We examine methods for comparing neural network representations based on canonical correlation analysis (CCA). We show that CCA belongs to a family of statistics for mea…

2019-05-01abs ↗pdf ↗

The paper analyzes MAML's representation using RSA, revealing that feature reuse is not the primary reason for its success.

problem Understanding why model-agnostic meta-learning (MAML) works well in few-shot learning tasks.
method Representation similarity analysis (RSA) applied to MAML's few-shot learning instantiation.
result Feature reuse is not the primary reason for MAML's success; instead, it is the learning task itself that increases representation similarity.

Novel tRSA combines geometry and topology for brain and model analysis.

problem Traditional RSA overlooks topological information in neural representations.
method Topological RSA (tRSA) using nonlinear monotonic transforms.
result Robust model comparisons and novel insights into neural computation.

New measures link neural representation geometry to decoding ability.

problem Understanding how neural representations relate to decoding ability.
method Showed that popular similarity measures can be interpreted from a decoding perspective.
result Proved that measures like CKA and CCA quantify alignment between optimal linear readouts.

New method learns behavioral representations from mobility data.

problem Analyzing behavioral similarity of moving individuals from CDR trajectories.
method mob2vec framework combining segmentation, generalization, and unsupervised learning.
result Mob2vec generates low-dimensional vector representations preserving mobility behavior similarities.

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.

MSA compares neural representations' intrinsic geometry for better understanding.

problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.

The paper studies how neural networks evolve representations, finding a unique fixed point for nonlinear activations.

problem Understanding how neural networks transform input data across layers.
method Theoretical framework for the evolution of the kernel sequence, using mean-field regime and Hermite polynomials.
result For nonlinear activations, the kernel sequence converges globally to a unique fixed point.

New framework to test neural network representation similarity measures.

problem Disagreements among dissimilarity measures in neural networks.
method Statistical testing framework to evaluate measures based on functional behavior.
result Current metrics have different weaknesses; a classical baseline performs surprisingly well.

Correlated component analysis as proposed by Dmochowski et al. (2012) is a tool for investigating brain process similarity in the responses to multiple views of a given stimulus. Correlated components are identified under the assumption that the involved spatial networks are identical. Here we propose a hierarchical pr…

2018-02-07abs ↗pdf ↗

This paper investigates how forgetting affects neural network representations and stabilizes deeper layers.

problem Catastrophic forgetting in machine learning models trained on sequential tasks.
method Representational analysis techniques and empirical studies on CIFAR-10 and CIFAR-100 datasets.
result Deeper layers are disproportionately the source of forgetting, and methods to mitigate forgetting stabilize these layers.

PRESTO maps latent representations across diverse ML models.

problem Understanding variability in latent representations across different ML models.
method Uses persistent homology to characterize latent spaces and measure their pairwise similarity.
result Preserves desirable properties and enables sensitivity analysis of latent representations.

Defines metrics to compare neural network representations.

problem Comparing neural network representations across different architectures and tasks.
method Developed a family of metric spaces and modified existing measures to quantify representational dissimilarity.
result Identified relationships between neural representations and anatomical features.

Representations of CC^*-algebras are realized on section spaces of holomorphic homogeneous vector bundles. The corresponding section spaces are investigated by means of a new notion of reproducing kernel, suitable for dealing with involutive diffeomorphisms defined on the base spaces of the bundles. Applications of th…

2007-07-05abs ↗pdf ↗

Proposes a method to compare neural networks using feature and gradient vectors.

problem Understanding the behavior of neural networks trained on different datasets.
method Defines a similarity index using feature and gradient vectors, and employs sketching techniques for efficient comparison.
result Demonstrates superior performance in computing similarity of neural networks trained on different datasets.

New findings clarify the link between distributional closeness and representational similarity.

problem When and why do different neural network representations become similar?
method Identifiability theory, focusing on model families including autoregressive language models.
result Small Kullback-Leibler divergence does not guarantee similar representations.

Paper analyzes how contrastive learning structures learned representations.

problem Understanding the structure of learned representations in contrastive learning.
method Kernel-based contrastive learning framework (KCL) and statistical dependency viewpoint.
result Theoretical upper bound and generalization error bound for KCL.

The autoencoder is an artificial neural network model that learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar…

2017-11-21abs ↗pdf ↗

New method learns low-dimensional representations of AI-generated treatments.

problem Representing AI-generated treatments without losing semantic meaning.
method Double kernel representation learning with alternating minimization.
result Efficiently learned representations guide generative models and facilitate adaptive online experiments.

One of the ubiquitous representation of long DNA sequence is dividing it into shorter k-mer components. Unfortunately, the straightforward vector encoding of k-mer as a one-hot vector is vulnerable to the curse of dimensionality. Worse yet, the distance between any pair of one-hot vectors is equidistant. This is partic…

2017-01-23abs ↗pdf ↗

Feature normalization prevents collapse in non-contrastive learning dynamics.

problem Non-contrastive learning can collapse into a single point due to lack of repulsive force.
method Extended previous theory based on L2 loss to cosine loss, considering feature normalization.
result Cosine loss induces stable equilibrium, preventing collapse even with insufficient repulsive force.

DORA analyzes deep neural networks' internal representations to detect spurious correlations.

problem Detecting spurious correlations in deep neural networks' internal representations.
method DORA uses Extreme-Activation (EA) distance measure to assess representation similarities.
result Identifies internal representations capable of detecting spurious correlations.

Deep Belief Network predicts lncRNA-disease associations with high accuracy.

problem Accurately identifying lncRNA-disease associations to understand lncRNA functionality and disease mechanism.
method Proposes a DBN-based model using heterogeneous networks and DBN for feature learning.
result Obtained AUC of 0.96 and AUPR of 0.967 on standard dataset.

New metric for disentangling multivariate representations, accounting for more complex entanglements.

problem Current disentanglement metrics fail to detect entanglements involving more than two variables.
method Partial Information Decomposition framework to analyze information sharing and propose a new disentanglement metric.
result The proposed metric correctly identifies entanglements in high-dimensional spaces.

Diffusion Maps framework is a kernel based method for manifold learning and data analysis that defines diffusion similarities by imposing a Markovian process on the given dataset. Analysis by this process uncovers the intrinsic geometric structures in the data. Recently, it was suggested to replace the standard kernel …

2015-11-19abs ↗pdf ↗

Extract common latent factors from graphs for better representation learning.

problem Graph-level representation learning challenges due to limited labeled data and poor negative sample selection.
method Graph-wise Common Latent Factor Extraction (GCFX) using deepGCFX model.
result Improved graph-level and node-level tasks performance compared to state-of-the-art methods.

We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perfor…

2014-06-08abs ↗pdf ↗

Task loss matching misrepresents similarity between neural network layers.

problem Measuring similarity between neural network layers using task loss matching.
method Task loss matching vs. direct matching; comparison with CCA and CKA.
result Direct matching provides a better similarity index than task loss matching.