We investigate the non-identifiability issues associated with bidirectional adversarial training for joint distribution matching. Within a framework of conditional entropy, we propose both adversarial and non-adversarial approaches to learn desirable matched joint distributions for unsupervised and supervised tasks. We…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “unsupervised matching”
Unsupervised ensemble classification for dependent data.
problem Classifying data with dependencies using multiple classifiers.
method Developed algorithms for sequential and networked data dependencies, using moment matching and Expectation Maximization.
result Improved classification performance on synthetic and real datasets.
Algorithm uses RBM to solve matching problems on weighted graphs.
problem Perfect matching problem on bipartite weighted graphs.
method Iterative RBM algorithm to maximize energy function and assignment.
result Algorithm successfully solves real-world matching problems.
Unsupervised matching method for relational data without alignment info.
problem Matching objects in different relational datasets without correspondence info.
method Model latent vectors, estimate by likelihood, project onto shared space.
result Preserves structural information in latent vectors across datasets.
New method learns domain-invariant local feature patterns for unsupervised domain adaptation.
problem Performance degradation due to domain-shift in unsupervised domain adaptation.
method Jointly learns domain-invariant local feature patterns and holistic feature distributions.
result Superior performance on benchmark datasets compared to state-of-the-art methods.
UPM clusters product titles for efficient unsupervised matching.
problem Matching product titles accurately in e-commerce.
method Clustering-based approach using title combinations.
result UPM outperforms state-of-the-art methods in efficiency and effectiveness.
Bayesian method matches uncertainty to adapt across domains.
problem Label distribution shift across domains degrades model performance.
method Bayesian neural network quantifies uncertainty; joint feature and label distribution matching.
result Improves model performance on domain adaptation tasks.
Unsupervised speech recognition without labeled data using novel cost function and MAP refinement.
problem Training speech recognition systems without labeled data.
method Alternates between phoneme classifier learning and boundary refinement using Segmental Empirical Output Distribution Matching and MAP approach.
result Achieves phone error rate (PER) of 41.6% on TIMIT dataset.
A new method for aligning datasets without known correspondences.
problem Aligning datasets from different domains without labeled correspondences.
method Integrates MDS and Wasserstein Procrustes for joint optimization of embeddings and correspondences.
result Maps datasets to a common low-dimensional space without labeled correspondences.
Paper proposes a novel method for aligning hierarchical data using optimal transport in hyperbolic spaces.
problem Aligning hierarchical data like ontologies without external supervision.
method Optimal transport over hyperbolic spaces.
result The method outperforms standard embedding alignment techniques.
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.
Domain adaptation (DA) addresses the real-world image classification problem of discrepancy between training (source) and testing (target) data distributions. We propose an unsupervised DA method that considers the presence of only unlabelled data in the target domain. Our approach centers on finding matches between sa…
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.
Improves domain adaptation by clustering target representations.
problem Learning invariant and discriminative representations for unlabeled target domains.
method Simultaneously learns tightly clustered target representations and assigns each cluster to a unique class from the source.
result Achieves state-of-the-art performance in balanced, imbalanced, and partial domain adaptation.
An unsupervised deep learning method solves PIDEs for option pricing.
problem Solving partial integro-differential equations for financial option pricing.
method Employing unsupervised deep learning to directly solve PIDEs without requiring labeled data.
result An unsupervised neural network accurately solves PIDEs and calculates derivatives and integrals.
Unsupervised Domain Adaptation for Binary Classification with an Unobservable Source Subpopulationstat.ML
New method recovers predictions from unobservable source subpopulation in binary classification.
problem Challenging binary classification with unobservable subpopulation in source domain.
method Distribution matching method to estimate subpopulation proportions, rigorous derivation of prediction models.
result Our method outperforms naive benchmarks in synthetic and real-world datasets.
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…
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.
Improves unsupervised domain adaptation by enforcing feature extractor to focus on task-relevant information.
problem Leveraging label information from source domain for accurate target domain models without labels.
method Variational Information Bottleneck (VBDA) method that explicitly enforces feature extractor to ignore irrelevant task factors.
result Significantly outperforms state-of-the-art methods across three domain adaptation benchmark datasets.
Improves unsupervised domain adaptation methods by aligning class conditional distributions.
problem Domain shift between source and target domains makes supervised learning models fail to generalize.
method Co-regularized domain alignment, creating multiple feature spaces and aligning them individually while encouraging agreement across class predictions.
result Significant performance improvements on domain adaptation benchmarks.
We show that the Bregman divergence provides a rich framework to estimate unnormalized statistical models for continuous or discrete random variables, that is, models which do not integrate or sum to one, respectively. We prove that recent estimation methods such as noise-contrastive estimation, ratio matching, and sco…
The assumption that training and testing samples are generated from the same distribution does not always hold for real-world machine-learning applications. The procedure of tackling this discrepancy between the training (source) and testing (target) domains is known as domain adaptation. We propose an unsupervised ver…
Paper explores unsupervised transfer learning for SLU, improving model performance with unlabeled data.
problem Improving SLU model performance with limited labeled data.
method Uses ELMo embeddings for unsupervised pre-training and ELMo-Light for faster pre-training. Combines unsupervised and supervised transfer techniques.
result Unsupervised pre-training on unlabeled data significantly improves SLU performance, even outperforming conventional supervised transfer.
In this work, we perform unsupervised learning of representations by maximizing mutual information between an input and the output of a deep neural network encoder. Importantly, we show that structure matters: incorporating knowledge about locality of the input to the objective can greatly influence a representation's …
Generating versatile and appropriate synthetic speech requires control over the output expression separate from the spoken text. Important non-textual speech variation is seldom annotated, in which case output control must be learned in an unsupervised fashion. In this paper, we perform an in-depth study of methods for…
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…
Deep learning for TOF-MRA without matched training data.
problem High-quality reconstruction from undersampled TOF-MRA.
method Two-stage unsupervised deep learning approach using cycleGAN theory.
result Exceeds performance of state-of-the-art CS-based methods.
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.
DFM simplifies CNF training without interpolants.
problem Efficiently training CNFs with computationally expensive ODE solving.
method DFM optimizes dual vector fields for bijective transformations.
result DFM outperforms CNF trained with FM or ML objectives.
We describe the 1st place winning approach for the CIKM Cup 2016 Challenge. In this paper, we provide an approach to reasonably identify same users across multiple devices based on browsing logs. Our approach regards a candidate ranking problem as pairwise classification and utilizes an unsupervised neural feature ense…
The task of matching co-referent records is known among other names as rocord linkage. For large record-linkage problems, often there is little or no labeled data available, but unlabeled data shows a reasonable clear structure. For such problems, unsupervised or semi-supervised methods are preferable to supervised met…
Paper explores unsupervised learning for ultrasound image artifact removal.
problem Improving visual quality of ultrasound images from various artifacts.
method Inspired by optimal transport cycleGAN, unsupervised deep learning for artifact removal.
result Unsupervised learning method provides comparable results to supervised learning.
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.
FSBM improves matching efficiency with minimal supervision.
problem Scalability vs. minimal supervision in matching frameworks.
method FSBM uses a small portion of pre-aligned pairs as state feedback to guide non-coupled samples.
result FSBM accelerates training and enhances generalization.
LCBM model improves image classification without human supervision.
problem Improving interpretability and generalization of unsupervised concept-based models.
method LCBM models concepts as random variables in a Bernoulli latent space, reducing the number of concepts without sacrificing performance.
result LCBM outperforms existing models in generalization and interpretability.
SUOD accelerates unsupervised outlier detection for large datasets.
problem Scalability issues in unsupervised outlier detection for high-dimensional datasets.
method Three-module acceleration framework: Random Projection, Balanced Parallel Scheduling, Pseudo-supervised Approximation.
result SUOD significantly improves efficiency and scalability in outlier detection.
New method improves text classification without labeled target data.
problem Improving text classification under domain shift without labeled target data.
method Diversity-based generalization using multi-head attention with diversity constraints.
result Method matches state-of-the-art performance without labeled target data.
The paper challenges the validity of cluster validity measures in unsupervised learning.
problem The validity of cluster validity measures in selecting optimal clusterings.
method The authors investigate the use of cluster validity measures as objective functions in unsupervised learning and introduce a new variant of the Dunn index.
result Many cluster validity measures promote clusterings that do not match expert knowledge well.
Optimal transport aligns source and target distributions for domain adaptation.
problem Unsupervised domain adaptation with joint class-conditional and label shifts.
method Minimizes importance weighted loss and Wasserstein distance for aligned marginals and class-conditional distributions.
result Our method outperforms competitors on various domain adaptation tasks.
CoSCA improves unsupervised domain adaptation by better aligning ambiguous target samples.
problem Missing alignment of ambiguous target samples in unsupervised domain adaptation.
method CoSCA explicitly incorporates intra- and inter-class domain discrepancy, estimating label hypotheses and optimizing a contrastive loss with MMD for better global alignment.
result CoSCA outperforms state-of-the-art approaches in producing more discriminative features.
A new unsupervised method removes CT metal artifacts using beta-CycleGAN and attention.
problem Metal artifact reduction in computed tomography (CT) images.
method Unsupervised learning using a beta-CycleGAN architecture with attention mechanism.
result Improved metal artifact removal that preserves image details.
The problem of learning a correspondence relationship between nodes of two networks has drawn much attention of the computer science community and recently that of statisticians. The unseeded version of this problem, in which we do not know any part of the true correspondence, is a long-standing challenge. For low-rank…
The paper provides a framework for weakly supervised disentanglement guarantees.
problem Learning disentangled representations in real-world data.
method Theoretical framework for analyzing disentanglement guarantees with weak supervision.
result Empirical verification of weak supervision methods' predictive power and usefulness.
The goal of cross-domain object matching (CDOM) is to find correspondence between two sets of objects in different domains in an unsupervised way. Photo album summarization is a typical application of CDOM, where photos are automatically aligned into a designed frame expressed in the Cartesian coordinate system. CDOM i…
Proposes batch-weight method to correct mode imbalance in domain adaptation.
problem Mode imbalance between source and target distributions affects unsupervised domain transfer.
method Proposes batch-weight method to re-weight training samples.
result Effective in several image-to-image translation tasks.
New algorithms select and rank features from MTS without feature extraction.
problem Feature extraction step for MTS classification.
method Directly computes similarity between time series and assesses cluster structure matching labels.
result Techniques match labels well without feature extraction.
Proposes DC3-GAN for diverse unsupervised conditional generation.
problem Low diversity in unsupervised conditional generation.
method Integrates encoder-generator pair with generator-encoder pair to enhance diversity.
result Improves clustering performance and disentanglement of latent variables.
Paper proposes a new unsupervised method for cross-modality data translation without requiring direct mappings.
problem Tackles the challenge of zero-shot cross-modality data translation with fidelity.
method Mutual Information guided Diffusion cross-modality data translation Model (MIDiffusion) using score-matching and stochastic diffusion.
result Empirically shows advanced performance compared to other generative models.