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.
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.
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.
It is widely believed that learning good representations is one of the main reasons for the success of deep neural networks. Although highly intuitive, there is a lack of theory and systematic approach quantitatively characterizing what representations do deep neural networks learn. In this work, we move a tiny step to…
In general, recommendation can be viewed as a matching problem, i.e., match proper items for proper users. However, due to the huge semantic gap between users and items, it's almost impossible to directly match users and items in their initial representation spaces. To solve this problem, many methods have been studied…
Learning informative representations of data is one of the primary goals of deep learning, but there is still little understanding as to what representations a neural network actually learns. To better understand this, subspace match was recently proposed as a method for assessing the similarity of the representations …
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.
Enhances DIM to match learned representations to a specific distribution.
problem Learning representations conforming to a specific distribution.
method Injecting noise into normalized outputs of the encoder while keeping the InfoMax training objective.
result Learning uniformly and normally distributed representations, as well as representations of other absolutely continuous distributions.
ScoreMatchingRiesz improves debiased machine learning and policy effects estimation.
problem Improving debiased machine learning and policy effects estimation.
method Score matching and Riesz representer estimation.
result Estimates policy path for continuous treatments, improving interpretability.
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.
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.
Proposes DWMD for better matching of hidden representations across domains.
problem Measuring data distribution discrepancy between semantically related domains for feature representation matching.
method DWMD, a moment-based probability distribution metric that explicitly orders and weights higher-order moments.
result DWMD is error-free and can strictly reflect distribution differences without feature distribution assumptions.
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs whic…
Unified framework for self-supervised learning via latent distribution matching.
problem Lack of a unifying theoretical framework for diverse SSL methods.
method Casting SSL as latent distribution matching (LDM): maximizing alignment and uniformity.
result Derives a Bayesian filtering model and proves identifiable latent representations.
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.
Li-Bland's correspondence between linear Courant algebroids and Lie 2-algebroids is explained and shown to be an equivalence of categories. Decomposed VB-Courant algebroids are shown to be equivalent to split Lie 2-algebroids in the same manner as decomposed VB-algebroids are equivalent to 2-term representations up t…
New deep learning method preserves orientation in shape matching.
problem Symmetry issues in shape matching.
method Orientation-aware functional maps using complex functional representations and DiffusionNet.
result Stable correspondence predictions with robust orientation preservation.
New metric captures individual neuron tuning across neural networks.
problem Need a metric that respects individual neuron tuning across different neural networks.
method Derived a 'soft' permutation-based metric using optimal transport theory.
result Metric avoids counter-intuitive outcomes and captures geometric insights.
Automates investor/company matching with AI, explaining decisions.
problem Matching companies and investors is hard due to limited data and need for explanations.
method Representation learning for small datasets + parameterized explanation generation.
result System performs well on matching task and explains decisions.
New algorithm learns invariant representations for robust neural networks.
problem Learning robust neural network representations that are invariant to certain factors.
method Causal perspective and distribution matching approach.
result Empirically, the algorithm achieves state-of-the-art performance on domain generalization.
Unified framework for human motion generation on Riemannian manifolds.
problem Learning valid human motion in Euclidean spaces.
method Riemannian Motion Generation (RMG) on product manifolds, Riemannian flow matching.
result Achieves state-of-the-art FID (0.043) on HumanML3D and surpasses strong baselines on MotionMillion.
New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
Federated learning is a distributed, privacy-aware learning scenario which trains a single model on data belonging to several clients. Each client trains a local model on its data and the local models are then aggregated by a central party. Current federated learning methods struggle in cases with heterogeneous client-…
DM improves self-supervised transfer learning by matching target distributions.
problem Improving self-supervised transfer learning performance.
method Distribution Matching (DM) method that drives representation distribution towards a predefined reference distribution.
result DM outperforms existing methods on target classification tasks.
Unified framework for continuous-state discrete flow matching models.
problem Discrete generative modeling with continuous probabilities.
method Introducing α-Flow, a family of CS-DFM models based on information geometry. result Optimal flow matching loss for α-flow minimizes generalized kinetic energy. 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.
We propose a novel biologically-plausible solution to the credit assignment problem motivated by observations in the ventral visual pathway and trained deep neural networks. In both, representations of objects in the same category become progressively more similar, while objects belonging to different categories become…
A geometric theory explains loss functions for robust representation learning.
problem Treats robustness, domain adaptation, and sensor drift as separate literatures.
method Estimates covariance Sigma_task and uses it to pin Jacobian penalties.
result Proves optimality and necessity of range coverage for penalty matrices.
The learning of domain-invariant representations in the context of domain adaptation with neural networks is considered. We propose a new regularization method that minimizes the discrepancy between domain-specific latent feature representations directly in the hidden activation space. Although some standard distributi…
We show that double Lie algebroids, together with a chosen linear splitting, are equivalent to pairs of 2-term representations up to homotopy satisfying compatibility conditions which extend the notion of matched pair of Lie algebroids. We discuss in detail the tangent of a Lie algebroid.
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.
Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…
Reprogram deep models to resist adversarial attacks without changing parameters.
problem Improving deep learning models' robustness against adversarial and noisy inputs.
method Proposes a non-linear robust pattern matching technique and three reprogramming paradigms.
result Demonstrates effective reprogramming of deep models for robustness without altering parameters.
A new method improves model generalization by recognizing representations.
problem Generalization issues in existing Information Bottlenecks.
method Recognizable Information Bottleneck (RIB) using f-CMI and density ratio matching.
result Improves model generalization through recognizability regularization.
FlowLLM uses LLMs and flow matching to efficiently generate novel materials.
problem Challenging material discovery due to vast chemical space.
method Combines LLMs and Riemannian flow matching to design novel crystalline materials.
result Significantly increases generation rate of stable materials and unique crystals.
Paper presents a method to align unpaired samples across different modalities.
problem Challenges in collecting paired samples for multimodal representation learning.
method Uses propensity score alignment based on Rubin's framework to estimate a common space for unpaired samples.
result Optimal transport matching significantly improves alignment in real-world data.
Learning representations for counterfactual inference from observational data is of high practical relevance for many domains, such as healthcare, public policy and economics. Counterfactual inference enables one to answer "What if...?" questions, such as "What would be the outcome if we gave this patient treatment $t_…
Poly-view contrastive learning improves image representation learning.
problem Learning representations from multiple related views in image data.
method Developed new representation learning objectives for poly-view tasks using information maximization and sufficient statistics.
result Poly-view contrastive models trained for fewer epochs and with smaller batch sizes outperform models trained for more epochs and with larger batch sizes.
A latent-variable model is introduced for text matching, inferring sentence representations by jointly optimizing generative and discriminative objectives. To alleviate typical optimization challenges in latent-variable models for text, we employ deconvolutional networks as the sequence decoder (generator), providing l…
Many problems at the intersection of combinatorics and computer science require solving for a permutation that optimally matches, ranks, or sorts some data. These problems usually have a task-specific, often non-differentiable objective function that data-driven algorithms can use as a learning signal. In this paper, w…
This paper introduces a new approach for the automated reconstruction - reassembly of fragmented objects having one surface near to plane, on the basis of the 3D representation of their constituent fragments. The whole process starts by 3D scanning of the available fragments. The obtained representations are properly p…
Learning disentangled representations that correspond to factors of variation in real-world data is critical to interpretable and human-controllable machine learning. Recently, concerns about the viability of learning disentangled representations in a purely unsupervised manner has spurred a shift toward the incorporat…
Study proves NN matching is equivalent to Riesz regression for debiased machine learning.
problem Addressing bias in machine learning models.
method Interprets NN matching as Riesz regression and derives it from LSIF.
result NN matching is shown to be equivalent to Riesz regression.
Increasingly many real world tasks involve data in multiple modalities or views. This has motivated the development of many effective algorithms for learning a common latent space to relate multiple domains. However, most existing cross-view learning algorithms assume access to paired data for training. Their applicabi…
Empirical Bayes improves causal representation learning across multiple domains.
problem Estimating causal representations from data across multiple domains.
method Developed an EB f-modeling algorithm for linearly-mixed causal representations. result Our method achieves more accurate estimation of causal variables than other methods.
DeepMP improves non-negative sparse recovery performance.
problem Recovering non-negative sparse signals with high coherence.
method Reformulated non-negative matching pursuit as a deep neural network.
result DeepMP yields significant improvement in exact recovery performance.
New method simulates diffusion bridges using score matching.
problem Simulating diffusion bridges for statistical inference.
method Backward time representation, variational formulation, score matching.
result Effective approximation of diffusion bridges.
Method learns representation invariant to subgroup support using adversarial matching.
problem Representational bias in training data leads to spurious correlations.
method Adversarial support-matching using semi-supervised clustering.
result Improves generalizability to unseen sources.