Unsupervised DA method using hyper-graph matching.
problem Discrepancy between source and target data distributions.
method Class-regularized hyper-graph matching with first-, second-, and third-order similarities.
result Improved performance on target domain compared to state-of-the-art methods.
New model predicts chemical reactions without human input.
problem Automating retrosynthetic planning in chemistry.
method Combined Molecular Transformer and hyper-graph exploration.
result Improved accuracy in predicting reactants, reagents, solvents, and catalysts.
Neural decoders improve performance on large algebraic block codes.
problem Improving decoding performance for large algebraic block codes.
method Graph neural networks for message passing with hypernetworks and arctanh activation.
result Neural decoding outperforms traditional methods for various code families.
LCNs use Lovasz embeddings to capture global graph properties.
problem Semi-supervised learning on graph data.
method LCNs use Lovasz embeddings to incorporate global graph properties.
result LCNs outperform GCNs on various graph models and real-world datasets.
Paper presents voxel graph operators for vector data models.
problem Efficient conversion and analysis of geometric models.
method Topological voxelization, graph construction, differential operator derivation.
result Discrete differential and integral operators from voxel complexes.
Paper uses GANs to simulate consumer transactions with SKU constraints.
problem Simulating realistic consumer transactions in retail systems.
method Integrates GANs with consumer behavior and SKU availability constraints.
result Demonstrates enhanced realism in simulated transactions.
A new method classifies vertices in hypergraphs for biological network analysis.
problem Information loss in graph models of biological systems.
method A novel kernel method on vertex- and edge-labeled hypergraphs using hypergraphlets.
result Potential to estimate missing and false positive links in protein-protein interaction networks.
Characterizes invariant and equivariant linear layers for graphs.
problem Maximal collection of invariant and equivariant linear layers for graphs.
method Characterization of all permutation invariant and equivariant linear layers for graphs.
result Dimension of linear layers for edge-value graph data is 2 and for k-tuples of nodes, it is the k-th and 2k-th Bell numbers.
Study combines intra-risk and contagion risk for SME bankruptcy prediction.
problem Predicting bankruptcy risk of SMEs considering both intra-risk and contagion risk.
method Proposes a novel model using Graph Neural Networks to combine intra-risk and contagion risk.
result Model outperforms state-of-the-art methods in bankruptcy prediction.
New graph-based discriminators improve sample complexity and expressiveness in learning theory.
problem Identifying if two distributions are identical with limited samples.
method Introducing k-ary based discriminators, which use families of Boolean k-ary functions to distinguish between distributions.
result Having k-ary functions (k ≥ 2) improves distinguishability and sample complexity compared to classical hypothesis classes.
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.
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.
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.
FLAME efficiently matches high-dimensional categorical datasets for causal inference.
problem Matching treatment and control units based on covariate information in causal inference.
method FLAME learns a distance metric using a hold-out training set and uses query processing techniques for large datasets.
result FLAME achieves significantly better performance than other matching methods, scaling to huge datasets.
Efficiently learns matching rewards in two-sided markets with matrix completion.
problem Learning high-dimensional matching rewards in matching markets with limited data.
method Utilizes matrix completion with a novel approach to handle matching interference.
result Near-optimal guarantees for reward learning under matching interference.
A new matching method for causal inference that handles irrelevant variables and missing data.
problem Creating high-quality treatment-control matches for categorical data in social sciences.
method A weighted Hamming distance matching method that considers covariate importance and creates a hierarchy of covariate combinations.
result The method produces high-quality matches and handles irrelevant variables and missing data.
Proposes a dynamic matching algorithm for two-sided online markets.
problem Dynamic preferences in two-sided online matching platforms.
method Dynamic Matching Bandit Algorithm with statistical preference ranking estimation.
result Agent-optimal stable matching result with logarithmic regret bound.
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect…
Methods for creating matchings in triangulated manifolds.
problem Creating matchings in triangulated manifolds.
method Several methods for constructing matchings.
result Constructing matchings in triangulated manifolds.
Unified framework learns matching from noisy data.
problem Learning adaptive interaction costs from incomplete data.
method Inverse optimal transport with marginal relaxation.
result Efficiently predicts new matching in various contexts.
Proposes a non-adversarial method for distribution matching.
problem Stability and optimization challenges in adversarial matching methods.
method Non-adversarial VAE-based matching method with alignment upper bounds.
result Demonstrates applicability of non-adversarial matching methods without modifying original architectures.
The paper addresses statistical inference in matching markets with dependent missingness.
problem Statistical inference for two-sided matching markets with matching-induced dependence.
method Non-convex algorithm based on Grassmannian gradient descent, debiasing and projection framework.
result Near-optimal entrywise convergence rates for various matching mechanisms.
Study of Lagrangian dynamics on matched Lie groups.
problem Understanding dynamics on matched Lie groups.
method Isomorphic tangent bundle and Euler-Lagrange/Poincaré equations.
result Covering semi-direct product theory and explicit equations.
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.
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.
Method finds multiple noisy graph templates in large graphs.
problem Finding multiple graph templates in noisy large graphs.
method Iteratively penalizes node-pair similarity matrix in matched filter algorithm.
result Method can sequentially discover multiple templates under mild model conditions.
Bayesian algorithm detects image matches and fraud.
problem Detecting identity matches and fraud in image databases.
method Generative model of image graph trained with matching algorithm.
result Bayesian approach improves detection accuracy.
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.
Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been completely resolved for score matching. First, we provide a formal link between maxim…
Polynomial time algorithm matches correlated Gaussian matrices without vanishing correlation.
problem Matching vertices in two correlated Erdős-Rényi graphs.
method Iterative matching algorithm for correlated Gaussian Wigner matrices.
result First polynomial time algorithm for graph matching with arbitrarily small constant correlation.
Efficiently matches subgraphs in noisy data without node labels.
problem Subgraph isomorphism in noisy, real-valued graphs.
method Two-step approach: extract topology, then expand matches.
result Realistically sub-linear computational efficiency, robustness to noise.
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated …
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.
Improved score matching methods for estimating score functions and Hessians without high dimensionality.
problem Estimating score functions and Hessians efficiently in high-dimensional data.
method Implicit score matching and denoising score matching, leveraging Gagliardo-Nirenberg inequalities.
result Achieves convergence rates similar to denoising score matching and estimates Hessians without dimensionality issues.
Paper proposes a new method for population-wise matching of sulcal graphs.
problem Challenges in matching cortical fold variations across individuals.
method Population-wise multi-graph matching of sulcal graphs.
result Effectiveness of multi-graph matching in obtaining consistent labeling of sulcal basins.
Submodular functions have many applications. Matchings have many applications. The bitext word alignment problem can be modeled as the problem of maximizing a nonnegative, monotone, submodular function constrained to matchings in a complete bipartite graph where each vertex corresponds to a word in the two input senten…
In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the equilibrium price. We compare the two algorithms through experimental analyses, …
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.
MREC efficiently matches and aligns point clouds, useful for single cell molecular data.
problem Comparing and aligning large datasets across various domains.
method Recursive decomposition algorithm for matching data sets, optimizing over partitioning and matching algorithms.
result Demonstrates flexibility and power in applying MREC to single cell molecular data alignment problems.
Transformations studied in graphs with edges and vertices of degree zero or one.
problem Transformations between partial matchings.
method Introducing a method of presenting transformations and lattice presentations.
result Investigation of transformations with minimal area.
SDE Matching eliminates simulation for training Latent SDEs, achieving similar performance.
problem Training Latent SDEs with adjoint sensitivity methods is computationally expensive and limited.
method SDE Matching, inspired by Score- and Flow Matching, eliminates simulation for training Latent SDEs.
result SDE Matching achieves performance comparable to adjoint sensitivity methods while reducing computational complexity.
Topological Flow Matching: A Generative Modeling Framework for Structured Spaces
problem Handling structured spaces in generative modeling
method Introducing topological flow matching
result Captures the structure of the underlying domain while preserving desirable properties
Efficient algorithm for matching graphs with community structure.
problem Graph matching between correlated stochastic block models with constant correlation.
method Partition trees rooted from each vertex, comparing edge statistics to different communities.
result First low-order polynomial-time algorithm achieving exact matching with high probability in dense graphs.
New method matches curves using varifolds and Sobolev metrics.
problem Matching unparametrized curves efficiently.
method Combines varifold-based inexact matching with second order Sobolev metrics.
result Shows improved shape analysis of mosquito wings.
Algorithm identifies optimal stable matching in uncertain two-sided markets.
problem Sequential learning in two-sided markets with unknown preferences.
method Pure exploration approach with elimination-based algorithms exploiting partial preference information.
result Identification of pervasive stable matching for optimal stable matching identification.
Matched Machine Learning combines machine learning and matching for causal inference.
problem Non-interpretable methods for causal inference.
method Combines machine learning and matching for interpretable causal inference.
result Performs as well as black-box machine learning methods and better than existing matching methods.
New deep learning model for matching sets of items, preserving exchangeability.
problem Matching two different sets of items while preserving exchangeability.
method Exchangeable deep neural networks architecture and efficient training framework.
result Significant improvements in fashion set recommendation and group re-identification.
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.