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.
Random forest model predicts tennis match outcomes with 80% accuracy.
problem Predicting tennis match outcomes before the game starts.
method Used a large database of tennis match information and a random forest model.
result Identified serve strength as a key predictor of match outcome.
RFM simplifies generative modeling on complex geometries without simulation.
problem Training generative models on non-Euclidean geometries is challenging.
method Riemannian Flow Matching (RFM) constructs a premetric for efficient vector field computation.
result RFM achieves state-of-the-art performance on various non-Euclidean datasets.
The study enhances financial rule matching using NLP without datasets.
problem Performing semantic matching between financial rules and policies.
method Outperforming pre-trained models with NLP techniques using free resources.
result Improved semantic matching between financial rules and policies.
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.
Simplifies denoising score matching for manifold learning.
problem Learning distributions on manifolds is computationally intensive.
method Modifies denoising score matching to implicitly account for the manifold.
result Reduces computational burden while maintaining efficiency.
A new method for fair classification using characteristic function distance.
problem Fairness in high-stakes decision-making with sensitive groups.
method Proposes a novel approach based on characteristic function distance to ensure minimal sensitive information in learned representations.
result Consistently matches or achieves better fairness and predictive accuracy than existing methods.
Flow Matching improves statistical guarantees through kernel density estimation.
problem Improving statistical guarantees for generative models.
method Connecting Flow Matching to kernel density estimation and verifying optimal rates of convergence.
result Flow Matching achieves optimal rates up to logarithmic factors for large networks and on lower-dimensional manifolds.
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…
A simple method for counterfactual inference from observational data.
problem Learning representations for counterfactual inference from observational data.
method Augmenting samples with their propensity-matched nearest neighbours.
result PM outperforms state-of-the-art methods in inferring counterfactual outcomes.
A new method for estimating complex models and high-dimensional data.
problem Difficulty in computing Hessian of log-density functions for complex models and high-dimensional data.
method Sliced score matching, which projects scores onto random vectors before comparison.
result Sliced score matching can learn deep energy-based models and produce accurate score estimates.
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…
New method for comparing curves with flexible matching constraints.
problem Comparing plane curves with general elastic metrics.
method Combining transform for elastic metrics with parametrization-invariant fidelity metrics.
result Simple optimization problem for discretized curves.
Paper computes optimal matching between curves on manifolds.
problem Matching curves on infinite-dimensional manifolds.
method Geodesic computation using Riemannian metric and quotient structure.
result Algorithm for computing geodesics in shape space.
This work interprets diffusion score matching using normalizing flows for better model training and evaluations.
problem Limitations of diffusion score matching when dealing with certain types of distributions.
method The approach involves interpreting the diffusion matrix using normalizing flows to provide better interpretation and usage of diffusion score matching.
result Diffusion score matching is equivalent to the original score matching evaluated in the transformed space defined by the normalizing flow.
Community detection or clustering is a fundamental task in the analysis of network data. Many real networks have a bipartite structure which makes community detection challenging. In this paper, we consider a model which allows for matched communities in the bipartite setting, in addition to node covariates with inform…
Augmented bridge matching preserves coupling information between distributions.
problem Preserving the original empirical pairing in flow and bridge matching processes.
method Augmenting the velocity field with initial sample point information.
result Simple modification recovers coupling information without losing Markovian property.
Posterior Matching enables VAEs to model arbitrary conditional densities.
problem Modeling conditional dependencies in unsupervised learning.
method Posterior Matching framework for arbitrary conditioning.
result Posterior Matching enables VAEs to perform arbitrary conditioning without modification.
New method learns robot skills from data, matching or outperforming existing methods.
problem Learning robot skills from fixed datasets.
method Offline Reinforcement Learning via Supervised Learning using implicit models.
result Implicit models can match or outperform explicit models in acquiring robotic skills.
New method improves domain generalization by matching object representations.
problem Existing domain generalization methods fail to generalize to unseen domains.
method Proposes matching-based algorithms to match object representations across domains.
result MatchDG algorithm matches ground-truth object representations and improves out-of-domain accuracy.
We argue that the existing regret matchings for Nash equilibrium approximation conduct "jumpy" strategy updating when the probabilities of future plays are set to be proportional to positive regret measures. We propose a geometrical regret matching which features "smooth" strategy updating. Our approach is simple, intu…
AI can identify simple groups and match algebraic tables, even with limited training.
problem Can AI learn algebraic structures?
method Machine learning techniques (SVM, neural classifiers) applied to finite groups and rings.
result AI can correctly identify simple groups and match algebraic tables for small structures.
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.
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 optimizes best arm identification with minimal regret.
problem Best arm identification in multi-armed bandit problems.
method Characterized Bayesian simple regret with continuity conditions of prior, proposed a simple algorithm.
result Proposed algorithm achieves rate-optimal Bayesian simple regret.
In this paper, we propose deep learning techniques for econometrics, specifically for causal inference and for estimating individual as well as average treatment effects. The contribution of this paper is twofold: 1. For generalized neighbor matching to estimate individual and average treatment effects, we analyze the …
Improves score estimation for noised targets using known clean scores.
problem Poor score estimation at low noise levels in Denoising Score Matching.
method Introduces Target Score Identity and Target Score Matching loss.
result Score estimates are more accurate at low noise levels.
Unified framework for imitation learning via moment matching.
problem Closing the gap between imitation and real-world performance.
method Classifying imitation learning algorithms based on reward or action-value moment matching, considering adversarial divergences.
result Derivation of bounds on policy performance for all algorithms in each class, and introduction of moment recoverability.
We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be significantly easier than its worst case counterpart, well-known to be NP-hard, the …
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
A simple log-transform fixes heavy-tailed data for generative models.
problem Standard generative models struggle with heavy-tailed data.
method Apply the soft-log transform to data before training and exponentiate samples after generation.
result Log-FM outperforms specialized baselines on multivariate benchmarks.
Flow matching adapts to manifold structures without diffusion.
problem Theoretical understanding of flow matching in manifold-supported settings.
method Flow matching with linear interpolation on smooth manifolds, analyzing velocity field and density estimator.
result Non-asymptotic convergence guarantee and statistical consistency of flow matching on manifolds.
Flow Matching improves Wasserstein 1 distance convergence in high dimensions.
problem Improving Wasserstein 1 distance estimation for unbounded distributions.
method Flow Matching approach based on ODEs, controlling Lipschitz constant.
result Derives a convergence rate for Wasserstein 1 distance, improving previous results.
In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …
Homological blocks match Witten-Reshetikhin-Turaev invariants for Seifert fibered 3-spheres.
problem Matching homological blocks with WRT invariants for specific 3-manifolds.
method Developed an asymptotic formula and vanishing result of coefficients.
result Radial limits of homological blocks match Witten-Reshetikhin-Turaev invariants.
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…
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.
A scalable algorithm for sampling and fine-tuning models using Tilt Matching.
problem Efficient sampling and fine-tuning of generative models.
method Tilt Matching, arising from a dynamical equation, minimizes variance and inherits regularity from stochastic interpolants.
result Empirically verified to be efficient and highly scalable, providing state-of-the-art results.
Translating potential disease biomarkers between multi-species 'omics' experiments is a new direction in biomedical research. The existing methods are limited to simple experimental setups such as basic healthy-diseased comparisons. Most of these methods also require an a priori matching of the variables (e.g., genes o…
Agent-based model simulates market dynamics with real-time order matching.
problem Realistic simulation of market dynamics with realistic price impact.
method Agent-based model with asynchronous, event-time order matching.
result Realistic price impact curves and stylized facts presented.
Exact guidance for discrete data improves posterior sampling efficiency.
problem Inefficient guidance for discrete data in posterior sampling.
method Derive exact transition rate for desired distribution given learned discrete flow matching model.
result Significantly improved efficiency with single forward pass per sampling step.
A new method transfers knowledge without data, matching teacher's predictions closely.
problem Lack of access to training data for knowledge transfer.
method Adversarial training to match teacher's predictions without data.
result Zero-shot student performs well on CIFAR10, improving state-of-the-art.
EBIL simplifies IL by estimating expert energy as reward, achieving effective performance.
problem Recovering optimal policy from expert demonstrations without reward signals.
method EBIL uses a two-stage solution: first estimating expert energy as reward, then learning policy.
result EBIL achieves effective performance and interpretable reward signals.
CM algorithm improves MMI classifications for unseen instances.
problem Improving classification accuracy for unseen instances using MMI criterion.
method Introduces CM algorithm for MMI classifications, combining semantic and Shannon channels for matching.
result Achieves high mutual information (99%) with minimal iterations in low-dimensional feature spaces.
New algorithm guarantees domain generalization with few environments.
problem Performing well on unseen environments with limited training data.
method Iterative feature matching algorithm with theoretical guarantees.
result Guaranteed domain generalization with logarithmic environments.
New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.
problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.
Permutations and matchings are core building blocks in a variety of latent variable models, as they allow us to align, canonicalize, and sort data. Learning in such models is difficult, however, because exact marginalization over these combinatorial objects is intractable. In response, this paper introduces a collectio…
BM2 learns Schrödinger bridges using neural networks.
problem Learning dynamic transport maps between two distributions.
method Coupled Bridge Matching (BM2) with neural networks. result Preliminary theoretical analysis and numerical experiments show BM2's effectiveness.