Study dynamic matching in heterogeneous networks using ODE model.
problem Dynamic matching in heterogeneous networks with compatibility restrictions.
method Introduced an ODE model to evaluate matching algorithms.
result Demonstrated trade-off between quick matching and optimal matching.
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
NeuroMatch efficiently matches subgraphs in large graphs using neural networks.
problem Determining the presence and location of a query graph in a large target graph.
method NeuroMatch decomposes graphs into subgraphs, embeds them using graph neural networks, and matches them directly in the embedding space.
result NeuroMatch is 100x faster and 18% more accurate than existing methods.
New theory shows neural networks learn similar representations under certain conditions.
problem Understanding how different neural networks learn similar representations.
method Developed a theory based on neuron activation subspace match model, characterized maximum match and simple match.
result Representations learned by networks with identical architecture but different initializations are not as similar as previously thought.
Study uses complex networks and machine learning to predict soccer match outcomes.
problem Predicting soccer match outcomes with complex networks and machine learning.
method Complex network metrics and match statistics were used to build machine learning models.
result Models based on passing networks were as effective as traditional models using match statistics.
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.
Paper tackles distribution matching by partially matching distributions, achieving robust results.
problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.
New method for matching bipartite and unipartite graphs without collapsing.
problem Matching between bipartite and unipartite networks without losing information.
method Formulated as an undirected graphical model, aligns graphs without collapsing.
result Consistent method with conditions for exact recovery of matching solution.
The paper explores a new method for landmark matching using sub-Riemannian geometry and neural networks.
problem Finding a time-dependent vector field to warp points from an initial set to a target set.
method Sub-Riemannian geometry and residual neural networks.
result Demonstrates the importance of regularization in landmark matching.
Neural score matching improves high-dimensional causal inference by using neural networks for balancing scores.
problem Impracticality of traditional matching methods in high-dimensional datasets due to the curse of dimensionality.
method Develops neural networks to create non-trivial, multivariate balancing scores for high-dimensional causal inference.
result Neural score matching outperforms other methods in treatment effect estimation and reducing imbalance on high-dimensional datasets.
We introduce a technique to compute probably approximately correct (PAC) bounds on precision and recall for matching algorithms. The bounds require some verified matches, but those matches may be used to develop the algorithms. The bounds can be applied to network reconciliation or entity resolution algorithms, which i…
The paper analyzes set-to-set matching with neural networks, focusing on theoretical generalization.
problem Theoretical analysis of set-to-set matching with neural networks.
method Generalization error analysis of set-to-set matching with neural networks.
result Theoretical insights into the behavior of set-to-set matching models.
Network learns graph matching directly from edge affinity matrices.
problem Graph matching optimization based on edge-to-edge affinity matrices.
method Embedding network for vertex classification, Sinkhorn normalization, cross-entropy loss, matching-aware constraints, dummy nodes.
result Competitive performance on synthetic and real-world graphs, faster than state-of-the-art.
Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph matching methods can be applied directly to recover the missing correspondences,…
KD2M unifies feature matching in neural networks.
problem Matching neural network activations for knowledge transfer.
method Formalizes distribution matching strategy.
result New theoretical results for KD.
Subspace match fails to accurately assess neural network representations.
problem Understanding the learned representations of neural networks.
method Subspace match method to assess representation similarity.
result Representations with low subspace match can still be isomorphic.
New algorithm speeds up causal discovery for network data.
problem Scalability issues in score-matching for temporal network data.
method Developed a new parent-finding subroutine for DAGs, improving score matching efficiency.
result Efficiency-lifted score matching for both i.i.d. and temporal data on networks.
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.
Score matching method improves image generation quality.
problem Score matching method underperforms GANs in metrics like Fréchet Inception Distance.
method DSM-ALS with denoising and improved sampling techniques.
result Score matching methods can match GANs in image generation quality.
SIGMA model improves graph matching across various applications.
problem Graph matching problem in different domains.
method Stochastic Iterative Graph Matching (SIGMA) model with multi-step refinement and dummy nodes.
result SIGMA produces significantly improved graph matching results compared to state-of-the-art models.
Generative Adversarial Networks optimize model parameters for image matching.
problem Optimizing model parameters for accurate image matching.
method Model-Assisted Generative Adversarial Network (GAN) to produce fake images matching true images.
result Best match model parameter values can minimize bias in image recognition.
Graph Matching Networks learn graph similarity using GNN embeddings.
problem Learning similarity between graph structured objects.
method Graph Matching Network model using cross-graph attention mechanism.
result Models outperform baseline systems in function similarity search.
Statistical framework for inexact graph matching with errorfully observed graphs.
problem Finding a correspondence between graphs with errors.
method Introducing a corrupting channel model and using maximum likelihood estimation.
result Maximum likelihood estimation is a solution to the inexact graph matching problem.
Neural execution solves complex graph problems like bipartite matching.
problem Solving complex graph algorithms like maximum bipartite matching.
method Reduces bipartite matching to a flow problem and uses Ford-Fulkerson for maximum flow.
result Neural network achieves optimal matching almost 100% of the time.
FedMA improves federated learning for neural nets, matching and averaging model elements.
problem Federated learning's communication burden and model performance.
method Layer-wise construction of shared model by matching and averaging hidden elements.
result FedMA outperforms state-of-the-art algorithms on deep CNN and LSTM architectures.
Machine learning improves predicting species interactions based on traits.
problem Variability in empirical trait-matching studies for ecological networks.
method Compared conventional GLMs with ML models (Random Forest, Boosted Regression Trees, etc.) on simulated and real data.
result ML models outperform GLMs in predicting species interactions and identifying trait-matching combinations.
New methods improve matching in high-dimensional data.
problem Matching in high-dimensional data is challenging due to the curse of dimensionality.
method Pseudo-metric learning approach using MLPs or siamese neural networks.
result Neural-net-based methods outperform traditional matching methods in simulations and real data.
Deep generative models can learn to generate realistic-looking images, but many of the most effective methods are adversarial and involve a saddlepoint optimization, which requires a careful balancing of training between a generator network and a critic network. Maximum mean discrepancy networks (MMD-nets) avoid this i…
Improved graph matching using covariates for network data integration.
problem Matching networks without unique identifiers.
method Two novel covariate-assisted seeded graph matching methods.
result Improved alignment accuracy through covariate information.
The paper establishes bounds for score-matching in causal discovery and generative modeling.
problem Estimating causal relationships from data.
method Training a deep neural network to estimate the score function and applying it to causal discovery.
result Bounds on the error rate of causal discovery methods using score-matching.
Despite recent advances, the remaining bottlenecks in deep generative models are necessity of extensive training and difficulties with generalization from small number of training examples. We develop a new generative model called Generative Matching Network which is inspired by the recently proposed matching networks …
Centroids Matching tackles catastrophic forgetting by matching feature vectors to class centroids.
problem Catastrophic forgetting in neural networks when learning new tasks.
method Centroids Matching operates in the embedding space of neural network features, matching these vectors to class centroids.
result Centroids Matching achieves high accuracy on all tasks without using external memory, even in realistic scenarios.
Proposes a new neural network approach to credit assignment.
problem Credit assignment problem in deep neural networks.
method Contrastive similarity matching objective function.
result Deep networks learn to match similarity between layers.
Graph matching with feature vectors is solved using a two-layer graph neural network.
problem Graph matching in the presence of sparse binary features.
method Two-layer graph neural network with graph structure.
result Graph neural network can recover correct mapping with high probability under certain conditions.
This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.
problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.
Map matching of GPS trajectories from a sequence of noisy observations serves the purpose of recovering the original routes in a road network. In this work in progress, we attempt to share our experience of feature construction in a spatial database by reporting our ongoing experiment of feature extrac-tion in Conditio…
Deep Reinforcement Learning automates match-3 game testing.
problem Reducing human effort in testing match-3 video games.
method Dueling Deep Q-Network paradigm applied to Jelly Juice game.
result The network outperforms random player and adapts to game difficulty.
A test for comparing networks using stochastic block models.
problem Determining if two network datasets come from the same model.
method Adopting stochastic block models, the study introduces an efficient algorithm to match estimated network parameters and develops a powerful test.
result The test is consistent and asymptotically follows a chi-squared distribution.
End-to-end neural network improves QbE-STD in multilingual speech search.
problem Query by example spoken term detection in zero-resource scenarios.
method Use of multilingual bottleneck features and CNN for pattern matching, integrated into a fully neural network framework.
result CNN-based matching outperforms DTW-based matching using bottleneck features.
Distilled models often fail to match teacher models, despite improving generalization.
problem The discrepancy between teacher and student predictive distributions remains large.
method Investigated the optimization difficulties and dataset details affecting student performance.
result Optimizing for matching the teacher does not always lead to better generalization.
Improved graph matching algorithm robust to noise.
problem Finding a bijection between vertex sets of two graphs.
method Uses multistage signature vectors to match vertices.
result Recover matching exactly with high probability for α≤1/(loglogn)C. Machine learning improves invoice matching speed and accuracy.
problem Efficiently matching similar invoices from various businesses and organizations.
method Combining machine learning with string similarity functions on invoice datasets.
result Neural network and boosted decision tree outperformed existing solutions.
The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding…
Framework generates causal probabilities from observational data.
problem Generating causal probabilities from observational data.
method Moment-matching graph-networks for causal inference.
result Automated sampling of latent space conditional probability distributions.
New methods distill data for deep networks efficiently.
problem Reduction of training data cost and inconvenience.
method Generative teaching networks, gradient matching, Implicit Function Theorem.
result New methods are computationally more efficient and improve model performance.
Stochastic gradient descent (SGD) has achieved great success in training deep neural network, where the gradient is computed through back-propagation. However, the back-propagated values of different layers vary dramatically. This inconsistence of gradient magnitude across different layers renders optimization of deep …
Proposes TSBP for matching topological signal distributions.
problem Matching signal distributions on topological domains.
method Topological Schrödinger Bridge (TSBP) with linear topology-aware stochastic dynamics.
result Derives closed-form topological SB (TSB) for Gaussian boundary distributions.
Combining deep learning and ensemble smoothers for better history matching.
problem Dealing with complex facies distributions in history matching.
method Using autoencoders and generative adversarial networks to parameterize facies models, applying distance-based localization.
result Improved history matching performance with deep learning parameterizations.