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,742 papers · 148 categories

Trend · papers per month

2685368031,071 · Jun 202019922001200920172026
48 results for similarity network

Method measures weight similarity in neural networks using normalization and statistical inference.

problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.

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.

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

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.

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.

Quantum networks learn task-dependent asymmetric similarity measures.

problem Challenges of conventional distance functions in capturing meaningful similarity.
method GQSim: Quantum networks for learning task-dependent (a)symmetric similarity.
result Quantum similarity measures extract salient features and achieve theoretically guaranteed performance.

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 ↗

PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.

problem Efficiently compute graph similarity scores for large graphs.
method Graph partitioning followed by subgraph-level and node-level comparisons using a graph neural network.
result PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks.

Modified RV-coefficient reveals how training affects neural network representations.

problem Understanding how training affects intermediate representations in convolutional neural networks.
method Experimented with modified RV-coefficient (RV2) to compare activation patterns in deep networks trained on varying amounts of data and layers.
result RV2 successfully recovered expected similarity patterns and provided interpretable similarity matrices.

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.

As a highlighting research topic in the multimedia area, cross-media retrieval aims to capture the complex correlations among multiple media types. Learning better shared representation and distance metric for multimedia data is important to boost the cross-media retrieval. Motivated by the strong ability of deep neura…

2017-04-14abs ↗pdf ↗

From a sequence of similarity networks, with edges representing certain similarity measures between nodes, we are interested in detecting a change-point which changes the statistical property of the networks. After the change, a subset of anomalous nodes which compares dissimilarly with the normal nodes. We study a sim…

2016-12-05abs ↗pdf ↗

We propose weighted inner product similarity\textit{weighted inner product similarity} (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…

2019-02-27abs ↗pdf ↗

funcGNN uses graph neural networks to estimate program similarity efficiently.

problem Estimating accurate program similarity for software engineering tasks.
method funcGNN trains on labeled CFG pairs to predict GED between unseen programs using effective embedding vectors.
result funcGNN achieves lower error rate (0.00194) and is 23 times faster than traditional methods.

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.

Partial fusion combines neural networks to balance accuracy and efficiency.

problem Balancing accuracy and computational cost in neural networks.
method Extending weight aggregation methods based on neuron-level similarity, using partial optimal transport to match similar neurons.
result Achieves a flexible tradeoff between computational cost and performance.

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.

Inner product-based convolution has been the founding stone of convolutional neural networks (CNNs), enabling end-to-end learning of visual representation. By generalizing inner product with a bilinear matrix, we propose the neural similarity which serves as a learnable parametric similarity measure for CNNs. Neural si…

2019-10-28abs ↗pdf ↗

TLMG4Eth combines language and graph models for Ethereum fraud detection.

problem Current fraud detection methods fail to consider semantic and similarity patterns in Ethereum transactions.
method TLMG4Eth uses a transaction language model and graph-based methods to capture semantic, similarity, and structural features.
result TLMG4Eth detects anomalies in Ethereum transactions more effectively than existing methods.

Network Embeddings (NEs) map the nodes of a given network into dd-dimensional Euclidean space Rd\mathbb{R}^d. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such as link prediction (if `similar' means being `more likely to be connected') or c…

2018-05-19abs ↗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.

Graph similarity search is among the most important graph-based applications, e.g. finding the chemical compounds that are most similar to a query compound. Graph similarity computation, such as Graph Edit Distance (GED) and Maximum Common Subgraph (MCS), is the core operation of graph similarity search and many other …

2018-08-16abs ↗pdf ↗

We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…

2018-10-23abs ↗pdf ↗

A new kernel measures brain network similarities, improving disease classification.

problem Lack of edge weight information in existing graph kernels for brain connectivity networks.
method Ordinal pattern kernel for weighted brain connectivity networks.
result The ordinal pattern kernel achieves better classification performance than state-of-the-art graph kernels.

Proposes MGMN for end-to-end graph similarity learning.

problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.

Study shows how task similarity affects forgetting in teacher-student setup.

problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.

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.

International trade has been increasingly organized in the form of global value chains (GVCs) where different stages of production are located in different countries. This recent phenomenon has substantial consequences for both trade policy design at the national or regional level and business decision making at the fi…

2015-08-18abs ↗pdf ↗