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…
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
48 results for “data matching”
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.
New method extracts joint and individual signals from multi-view data.
problem Extract joint and individual signals from multi-view data.
method Double-matched matrix decomposition with optimization and iterative algorithm.
result Superior signal estimation performance compared to single-matching methods.
Generalizes moment-matching for exponential families with conditioning or hidden data.
problem Generalizing moment-matching conditions for exponential families with conditioning or hidden data.
method First-principles explanation and self-contained derivation of generalized moment-matching conditions.
result Derives generalized moment-matching conditions for conditional exponential families and hidden data.
We propose a unified data-driven framework based on inverse optimal transport that can learn adaptive, nonlinear interaction cost function from noisy and incomplete empirical matching matrix and predict new matching in various matching contexts. We emphasize that the discrete optimal transport plays the role of a varia…
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…
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 …
We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are …
CFMI improves missing data imputation across various data types and dimensions.
problem Imputing missing data in complex, high-dimensional datasets.
method Combines normalising flows, flow-matching, and shared conditional modelling.
result Outperforms traditional and modern imputation methods across multiple metrics.
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.
Paper learns data-driven organ matching rules from observational data.
problem Tackles organ transplantation compatibility using observational data.
method Representation learning to cluster donors and apply recipient transformations.
result Model outperforms human experts in predicting transplant outcomes.
Feature Matching Intervention: Leveraging Observational Data for Causal Representation Learningstat.ML
FMI uses matching to mimic interventions for causal feature learning.
problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.
Adapts score matching for missing data in flexible settings.
problem Learning data distribution with missing data.
method Adapted score matching to handle missing data, providing two approaches: importance weighting and variational.
result Variational approach performs best in high-dimensional settings.
Maximum Likelihood Training for Score-Based Diffusion ODEs by High-Order Denoising Score Matchingstat.ML
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.
New method for partial matching of shapes with Varifolds.
problem Matching structures with topological or shape differences.
method Varifold shape representation and LDDMM framework.
result Effective partial matching despite topological differences.
This paper explores combinatorial optimization for problems of max-weight graph matching on multi-partite graphs, which arise in integrating multiple data sources. Entity resolution-the data integration problem of performing noisy joins on structured data-typically proceeds by first hashing each record into zero or mor…
RealUID distills matching models using real data without GANs.
problem Slow inference in matching models like diffusion and flow.
method RealUID is a universal distillation framework that incorporates real data into the distillation procedure without using GANs.
result RealUID offers a simple theoretical foundation that covers previous distillation methods for Flow Matching and Diffusion models.
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.
Correctly detecting the semantic type of data columns is crucial for data science tasks such as automated data cleaning, schema matching, and data discovery. Existing data preparation and analysis systems rely on dictionary lookups and regular expression matching to detect semantic types. However, these matching-based …
FSRM method improves treatment effect estimation from observational data.
problem Estimating treatment effects from observational data with missing counterfactual outcomes and selection bias.
method FSRM method based on deep representation learning and matching, which maps covariate space into a selective, nonlinear, and balanced representation space.
result FSRM method outperforms state-of-the-art methods in estimating treatment effects.
Flow matching improves synthetic data generation for tabular data.
problem Generating synthetic tabular data while preserving privacy.
method Flow matching (FM) and Variational FM for tabular data synthesis.
result FM outperforms diffusion baselines in tabular data synthesis.
Score matching method improves density estimation for truncated data on manifolds.
problem Density estimation for truncated data on manifolds with intractable normalising constant.
method Truncated score matching extended to Riemannian manifolds with boundary.
result Score matching estimator approximates true parameter values with low error.
Robust Score Matchingstat.ML
Robust score matching improves parameter estimation in contaminated data.
problem Parameter estimation in data contaminated by outliers.
method Geometric median of means to develop a robust score matching procedure.
result Consistent parameter estimates in contaminated data settings.
Flow matching KL divergence bound derived for smooth distributions.
problem Estimating smooth distributions efficiently.
method Deterministic upper bound on KL divergence derived from flow-matching loss.
result Flow matching achieves nearly minimax-optimal efficiency under TV distance.
Increasing availability of vehicle GPS data has created potentially transformative opportunities for traffic management, route planning and other location-based services. Critical to the utility of the data is their accuracy. Map-matching is the process of improving the accuracy by aligning GPS data with the road netwo…
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.
LSDM uses unpaired data to match latent space distributions for generative modeling.
problem Generating high-quality images with limited paired data.
method Two-stage approach: latent space learning from paired and unpaired data, followed by joint distribution matching.
result LSDM enhances geometric fidelity in generated outputs and provides theoretical insights into LDMs.
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.
Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random…
PropEn uses matching to create a larger dataset for efficient design optimization.
problem Limited data and complex landscapes in scientific applications.
method PropEn uses a matching approach to implicitly guide design without a discriminator.
result PropEn efficiently approximates the gradient of property improvement within the data distribution.
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.
CatFlow uses variational flow matching for efficient graph generation.
problem Graph generation tasks, especially for categorical data.
method Variational flow matching for categorical data, computationally efficient.
result CatFlow achieves strong results on graph generation tasks.
New method improves sampling from noisy energy models.
problem Training and sampling challenges in Energy-Based Models.
method Pseudo-Gibbs sampling with moment matching.
result Effective sampling from clean model using noisy DSM-trained model.
New research shows semantic data matching can degrade SSDL performance.
problem The limits of semantic data set matching in semi-supervised learning.
method Demonstrated through simulations and a new dissimilarity measure.
result Semantic data matching can degrade SSDL performance under non-IID data.
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.
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.
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.
LFM learns a sequence of smaller models to generate data from noise.
problem Learning continuous, invertible flows between distributions.
method Stepwise Local Flow Matching (LFM) model, matching diffusion processes up to time-step size.
result LFM achieves competitive generative performance compared to Flow Matching.
When pre-processing observational data via matching, we seek to approximate each unit with maximally similar peers that had an alternative treatment status--essentially replicating a randomized block design. However, as one considers a growing number of continuous features, a curse of dimensionality applies making asym…
This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.
problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.
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.
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic blo…
Novel framework combines tree-based discretization and ILP matching for causal inference.
problem Challenges in identifying causal relationships from observational data.
method Combines tree-based discretization and ILP matching for causal inference.
result Yields computational efficiency and less biased ATT estimates.
Score matching fails for general point processes, a new estimator improves accuracy.
problem Score matching estimators fail for general point processes.
method Introduced a weighted score matching estimator for point processes.
result The weighted score matching estimator accurately estimates model parameters on synthetic and real data.
Learning to Generate Synthetic Training Data using Gradient Matching and Implicit Differentiationcs.LG
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.
Statistical Inference for Matching Decisions via Matrix Completion under Dependent Missingnessstat.ME
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.
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.
A classical problem in causal inference is that of matching, where treatment units need to be matched to control units based on covariate information. In this work, we propose a method that computes high quality almost-exact matches for high-dimensional categorical datasets. This method, called FLAME (Fast Large-scale …