Method infers domain-specific models without domain semantic descriptors.
problem Poor performance of standard supervised learning methods in unseen domains.
method Introduces latent domain vectors and neural networks for optimization.
result Inference of appropriate domain-specific models without semantic descriptors.
Generative model connects physical properties to latent vectors for solar magnetic patches.
problem Disconnection between generative latent vectors and scientifically relevant quantities.
method Integrating GAN, SVM, and SSL to generate and retrieve physically interpretable solar magnetic patches.
result GAN-SVM combination enables smooth changes in physical parameters with generated patches.
A new model CDT improves cross-domain recommendation by learning translation vectors.
problem Improving cross-domain recommendation by transferring user preferences across different platforms.
method Translation-based learning approach with embedding space and factorization machines.
result The proposed CDT model outperforms other cross-domain strategies in six publicly available tasks.
New 2D maps improve image captioning models.
problem Captions generated by RNNs are often poor.
method Used 2D maps instead of vectors to represent latent states.
result 2D maps lead to better captioning performance.
TLR learns better latent representations for unsupervised domain adaptation.
problem Learning models in a target domain using data from a source domain.
method Designing a simple linear autoencoder objective function to derive robust latent representations.
result TLR reduces domain shift and preserves common properties of both domains.
Paper presents a semi-supervised grasp detection method using VQ-VAE.
problem Robotic grasp detection difficulty due to insufficient labelled data.
method Semi-supervised learning with VQ-VAE in a latent space.
result Model performs better than existing approaches using unlabelled images.
Proposes MD-LiNA for multi-domain latent factor causal discovery.
problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.
We tackle class imbalance in unsupervised domain adaptation using latent codes.
problem Class imbalance in unsupervised domain adaptation where target domain has under-represented classes.
method Adversarial domain adaptation framework with latent codes to identify and estimate target labels.
result Latent codes can disentangle target domain structure and identify under-represented classes.
A new method learns discrete representations for images and videos, improving upon previous models.
problem Learning discrete representations for images and videos to improve performance.
method Depthwise application of Vector Quantized Variational Autoencoders (VQVAE) to feature axis.
result 33% improvement in performance compared to previous discrete models.
Proposes a new approach to MSDA by introducing latent covariate shift to handle varying label distributions.
problem Challenges of conventional MSDA approaches in real-world settings where label distributions vary across domains.
method Introduces latent covariate shift (LCS) and a causal generative model with latent noises, latent content variable, and latent style variable.
result Identifies latent content variable up to block identifiability, enabling more nuanced label distribution recovery.
Investigates latent variable models for useful generative concept representations.
problem Creating latent representations that support various concepts and attributes.
method Latent variable modeling, including latent variable models, latent representations, and latent spaces.
result Hierarchical latent representations and latent space vectors and geometry are effective for generative concept representations.
RVGP learns vector fields over unknown manifolds, preserving singularities.
problem Learning vector fields over unknown non-Euclidean manifolds.
method RVGP uses positional encoding with eigenfunctions of the connection Laplacian.
result RVGP preserves singularities in vector fields over unknown manifolds.
Dynamic residual adapters improve performance across multiple latent domains without domain labels.
problem Overfitting to large domains and ignoring smaller ones in multi-domain learning.
method Dynamic residual adapters and augmentation strategies inspired by style transfer.
result Dynamic residual adapters significantly outperform standard models on multiple latent domains.
Proposes a new condition to estimate latent variable causal graphs from observed data.
problem Estimating causal structures when observed variables are not the underlying causal variables.
method Introduces Generalized Independent Noise (GIN) condition and a recursive learning algorithm.
result Shows that GIN helps locate latent variables and identify their causal structure.
Enhances image-to-image translation using adversarial latent space.
problem Image-to-image translation task in computer vision.
method Introduces an adversarial discriminator on the latent representation to enforce similar latent space distributions.
result Significantly outperforms competing approaches on MNIST and USPS domain adaptation tasks.
Researchers develop a method to trick deep generative models with adversarial inputs.
problem Deep generative models can be misled by attackers to produce arbitrary data.
method The study introduces an adversarial attack technique to manipulate pre-trained generative models.
result Adversarial latent vectors can be crafted to resemble genuine inputs and fool generative models.
Conditional domain generation is a good way to interactively control sample generation process of deep generative models. However, once a conditional generative model has been created, it is often expensive to allow it to adapt to new conditional controls, especially the network structure is relatively deep. We propose…
In a dynamic network, the neighborhood of the vertices evolve across different temporal snapshots of the network. Accurate modeling of this temporal evolution can help solve complex tasks involving real-life social and interaction networks. However, existing models for learning latent representation are inadequate for …
Domain adaptation framework identifies latent variables for target distribution identifiability.
problem Unsupervised domain adaptation without identifiable joint distribution of features and labels.
method Formulated latent variable model with invariant and changing components, constrained domain shift to influence only changing components.
result Joint distribution of data and labels in target domain is identifiable under mild conditions.
DMRL improves UDA by mixing source and target samples and enriching latent space structures.
problem Lack of class-aware information and insufficient samples for domain-invariant feature extraction.
method Dual Mixup Regularized Learning (DMRL) that conducts category and domain mixup regularizations.
result DMRL achieves state-of-the-art performance on domain adaptation benchmarks.
CGNP embeds functional processes into latent vectors using graph neural networks.
problem Embedding and sampling functional processes over arbitrary domains.
method CGNP employs graph neural networks to embed and decode functional processes.
result CGNP effectively samples encoded functions over any domain.
Cross-domain recommendation has been proposed to transfer user behavior pattern by pooling together the rating data from multiple domains to alleviate the sparsity problem appearing in single rating domains. However, previous models only assume that multiple domains share a latent common rating pattern based on the use…
Unsupervised method improves word vectors by suppressing high variance features.
problem Improving semantic information in word vectors.
method Using conceptors to suppress high variance features in word vectors.
result Post-processed word vectors outperform existing alternatives in lexical evaluation tasks.
New framework for multi-domain translation using autoencoders.
problem Learning probabilistic coupling between different domains.
method Learning multiple uncoupled autoencoders under shared latent distribution.
result New autoencoders can be added sequentially without retraining.
Exact inference possible without observing latent variables in unknown domains.
problem Can exact inference be done without knowing latent variables or their domain?
method Semidefinite programming (SDP) approach based on Karush-Kuhn-Tucker (KKT) conditions and matrix spectrum.
result Exact inference can be achieved without knowing latent variables or their domain.
Proposes a new approach for domain adaptation using latent representations.
problem Handling distribution shifts between source and target domains in high-dimensional data.
method Learn compact latent representations based on the label's Markov blanket, partitioning into parents, children, and spouses.
result General domain adaptation can be achieved by learning representations of the label's parents, children, and spouses.
Edge devices adapt pre-trained models to local data without backpropagation.
problem Adapting pre-trained models to edge devices' local data distributions.
method Feed-forward latent domain adaptation using cross-attention.
result Consistent improvements over ERM baselines and domain-supervised adaptation.
Proxy methods adapt to distribution shifts without explicitly modeling latent confounders.
problem Adapting to distribution shifts under latent variable confounding.
method Proximal causal learning, two-stage kernel estimation.
result Proxy methods outperform other methods in adapting to complex distribution shifts.
Paper establishes identifiability conditions for a model with two latent vectors and auxiliary data.
problem Identifying conditions for a statistical model with two latent vectors and auxiliary data.
method Proposes a statistical model with two latent vectors and auxiliary data, establishing various identifiability conditions.
result Identifiability conditions reveal a dimensionality relation and link model indeterminacies to maximum link weights.
Develops a new method to recover large latent tree models efficiently.
problem Inference of large latent tree structures from terminal node observations.
method Spectral Top-Down Recovery (STDR) using Fiedler vector partitioning.
result Proves statistical consistency and sample complexity for accurate tree recovery.
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.
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.
Enhances word embedding by transferring external knowledge.
problem Low-frequency words in semantic space.
method Latent Semantic Imputation (LSI) integrating graph theory and spectral embeddings.
result LSI generates reliable embedding vectors for low-frequency words.
SOM-VQ tokenizes discrete models with semantic structure and navigable topology.
problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.
Paper proposes a probabilistic alignment method for domain adaptation.
problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.
Learning multiple tasks across heterogeneous domains is a challenging problem since the feature space may not be the same for different tasks. We assume the data in multiple tasks are generated from a latent common domain via sparse domain transforms and propose a latent probit model (LPM) to jointly learn the domain t…
The paper predicts responses on out-of-sample nodes using latent positions on unknown curves.
problem Predicting responses on out-of-sample nodes with latent positions on unknown curves.
method Manifold learning and graph embedding technique using latent positions.
result Convergence guarantees for predicting responses on out-of-sample nodes.
Existing Bayesian models, especially nonparametric Bayesian methods, rely on specially conceived priors to incorporate domain knowledge for discovering improved latent representations. While priors can affect posterior distributions through Bayes' rule, imposing posterior regularization is arguably more direct and in s…
An essential problem in domain adaptation is to understand and make use of distribution changes across domains. For this purpose, we first propose a flexible Generative Domain Adaptation Network (G-DAN) with specific latent variables to capture changes in the generating process of features across domains. By explicitly…
New method identifies stable latent variables across different domains using weak distributional invariances.
problem Learning causal representations for multi-domain datasets.
method Autoencoders incorporating weak distributional invariances.
result Autoencoders can identify stable latent variables across different domains.
Adapts to shifts in latent subgroup distributions without labeled target data.
problem Adapting to domain shifts when latent subgroup distributions differ.
method Uses concept and proxy variables from source domain, and unlabeled target data.
result Optimal target predictor can be identified and estimated.
Improved recommendations using latent embeddings from user reviews.
problem Lack of consideration for latent embeddings in multi-criteria recommender systems.
method Utilized variational autoencoders to map user reviews into latent embeddings, which are then compressed into discrete vectors for multi-criteria recommendation.
result The proposed method significantly outperforms baselines across various datasets and evaluation measures.
LTMs use latent vectors for efficient autoregressive generation.
problem Efficient autoregressive generation in language models.
method Dual-rate optimization in variational Bayes framework.
result LTMs achieve superior sample and parameter efficiency.
A new method for math reasoning that allows for iterative correction.
problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.
We extend GAN latent space projection for Gaussian priors.
problem Non-trivial latent space projection for GANs with Gaussian priors.
method Extend previous techniques to Gaussian priors.
result Demonstrated effectiveness of extended technique.
New bounds for contrastive learning handle domain shifts and generalization.
problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.
A new model designs molecules with desired properties.
problem Finding molecules with optimal chemical or biological properties.
method A latent prompt Transformer model with three components: latent vector, molecule generation, and property prediction.
result The model achieves state-of-the-art performance on molecule design tasks.
We propose a nonparametric Bayesian probabilistic latent variable model for multi-view anomaly detection, which is the task of finding instances that have inconsistent views. With the proposed model, all views of a non-anomalous instance are assumed to be generated from a single latent vector. On the other hand, an ano…