Research
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

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for cross-domain mapping

JSCN improves cross-domain recommendation by learning domain-invariant user representations.

problem Cross-domain recommendation data sparsity and domain-incompatibility issues.
method JSCN uses multi-layer spectral convolutions on different graphs to learn domain-invariant user representations and domain adaptive user mappings.
result Significant improvement in cross-domain recommendation performance (9.2% recall, 36.4% MAP improvements).

Framework translates unlabeled images between domains.

problem Translating unlabeled images between domains with no supervision.
method Skip-connected encoder-generator structure trained with GAN, cycle, and semantic consistency losses.
result Framework can learn semantic mappings for face images without supervised one-to-one mapping.

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

MWGAN tackles multi-marginal matching problem with Wasserstein GAN.

problem Learning mappings to match a source domain to multiple target domains with cross-domain correlations.
method Develops a novel Multi-marginal Wasserstein GAN (MWGAN) with inner- and inter-domain constraints to minimize Wasserstein distance.
result Theoretical and empirical evaluations show MWGAN's effectiveness on balanced and imbalanced translation tasks.

Proposes a new method for manifold alignment using geometry-regularized twin autoencoders.

problem Traditional MA methods lack out-of-sample extension and real-world applicability.
method Guided representation learning with geometry-regularized twin autoencoders.
result Improves cross-domain generalization and robustness while maintaining alignment fidelity.

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.

Sparse coding has shown its power as an effective data representation method. However, up to now, all the sparse coding approaches are limited within the single domain learning problem. In this paper, we extend the sparse coding to cross domain learning problem, which tries to learn from a source domain to a target dom…

2013-11-27abs ↗pdf ↗

Proposes ADC for cross-domain recommendation balancing user preferences.

problem Users' preferences change across different domains (e.g., social media, e-commerce).
method Designs a neural architecture and cross-domain loss function to adaptively balance user preferences.
result ADC model effectively balances the impact of domains with different complexities.

A new method improves cross-domain sentiment analysis by learning weighted domain-invariant representations.

problem Label distribution changes across domains harm domain adaptation in DIRL.
method Proposes WDIRL, a modification to DIRL that learns weighted domain-invariant representations.
result Empirical studies show the effectiveness of WDIRL in cross-domain sentiment analysis.

ADGAN improves risk tolerance prediction by aligning cross-domain data.

problem Lack of professional knowledge and domain-specific models in risk tolerance studies.
method Asymmetric cross-Domain Generative Adversarial Network (ADGAN) for domain scale inequality.
result ADGAN better handles class imbalance and unqualified data than state-of-the-art methods.

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…

2010-12-07abs ↗pdf ↗

NeuCDCF combines matrix factorization and deep learning for cross-domain recommendation.

problem Data sparsity and cold-start problems in recommendation systems.
method Wide and deep framework combining matrix factorization and deep neural networks.
result NeuCDCF outperforms state-of-the-art models on real-world datasets.

Text2Node maps medical phrases to a taxonomy, overcoming coding standard limitations.

problem Limited data interchangeability between EHR systems due to different coding standards.
method Text2Node uses word and node embeddings, along with mapping functions, to generalize from limited training data.
result Text2Node achieves high accuracy in mapping phrases to a taxonomy, even for unseen concepts.

AdaFlow adapts DNN density estimators to new distributions for anomaly detection and cross-domain translation.

problem Unsupervised anomaly detection and cross-domain translation with limited paired data.
method AdaFlow combines Normalizing Flows and Adaptive Batch-Normalizations for domain adaptation.
result AdaFlow efficiently adapts to new distributions with minimal computational resources.

HAGAN uses hierarchical attention to improve cross-domain sentiment classification.

problem Cross-domain sentiment classification with domain discrepancy.
method Hierarchical attention in GANs to produce domain-indistinguishable document representations.
result HAGAN outperforms existing methods on Amazon review dataset.

GWIL uses Gromov-Wasserstein distance to align expert and imitation agent states.

problem Cross-domain imitation learning challenges due to different system dimensions and stationary distributions.
method Gromov-Wasserstein Imitation Learning (GWIL) using Gromov-Wasserstein distance.
result GWIL effectively aligns expert and imitation agent states in various continuous control domains.

DMGE learns cross-domain user behavior embeddings using multi-graphs and GNNs.

problem Data sparsity in learning large-scale item embedding from individual domain data.
method Construct multi-graphs from users' behaviors across domains, use multi-graph neural networks to learn cross-domain representation.
result DMGE outperforms state-of-the-art embedding methods in various tasks.

Study shows cross-domain X-ray prediction performance discrepancies and label shifts.

problem Quantifying generalization limits across different X-ray datasets.
method Large-scale study on multiple X-ray datasets, focusing on performance and label shifts.
result Interesting discrepancies found between model performance and agreement, and concept similarity across tasks.

CosML combines domain-specific meta-learners for cross-domain few-shot classification.

problem Generalizing to unseen domains while meta-learning on multiple seen domains.
method CosML trains domain-specific meta-learners and combines their meta-parameters in the parameter space.
result CosML outperforms state-of-the-art methods and achieves strong cross-domain generalization.

Ensuring the security of transactions is currently one of the major challenges that banking systems deal with. The usage of face for biometric authentication of users is attracting large investments from banks worldwide due to its convenience and acceptability by people, especially in cross-domain scenarios, in which f…

2018-06-20abs ↗pdf ↗

New approach improves cross-domain recommendation for sparse target domains.

problem Cross-domain recommendation challenges with sparse target domains.
method Guided neural collaborative filtering with domain-invariant components across dense and sparse domains.
result Effective and scalable approach demonstrated on public and Visa datasets.

A new model for imputing missing values in time series data across domains.

problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.

Improves speech separation by integrating time and frequency domains.

problem Speech separation using deep learning techniques.
method Proposes a framework that combines time and frequency domain features, using an embedding network and clustering.
result Obtained state-of-the-art results on WSJ0-2mix dataset.

Several methods were recently proposed for the task of translating images between domains without prior knowledge in the form of correspondences. The existing methods apply adversarial learning to ensure that the distribution of the mapped source domain is indistinguishable from the target domain, which suffers from kn…

2018-06-03abs ↗pdf ↗

A simple unsupervised approach for cross-domain person re-identification.

problem Challenges in domain adaptation for person re-identification.
method Self-similarity Grouping (SSG) approach to learn pseudo identities from unlabeled samples.
result Significant improvement in mAP performance compared to state-of-the-art methods.

SPID-GAN learns bidirectional mappings in subsurface models.

problem Challenges in identifying and approximating causal structures in high-dimensional parameter spaces.
method Generative adversarial networks (GANs) for learning cross-domain mappings.
result SPID-GAN achieves satisfactory performance in identifying bidirectional state-parameter mappings.

CDSPP learns domain-specific projections for heterogeneous domain adaptation.

problem Heterogeneous domain adaptation problems where source and target domains have different modalities or feature dimensions.
method Cross-Domain Structure Preserving Projection (CDSPP) algorithm that learns domain-specific projections to map features into a common subspace.
result CDSPP achieves superior performance in both supervised and semi-supervised HDA compared to state-of-the-art methods.

Proposes IFCDA framework to improve cross-domain adaptation.

problem Negative transfer and difficulty in handling category-irrelevant losses in DA.
method Importance filtered mechanism to generate filtered soft labels, combined with graph-based label propagation.
result Significantly improves performance in both Closed-Set and Open-Set DA scenarios.

VASE learns disentangled representations that generalize across domains.

problem Learning new knowledge from diverse data sources while preserving old knowledge.
method VASE uses shared embeddings and Minimum Description Length principle to disentangle representations.
result VASE achieves better cross-domain inference and disentangled representations.

Clustering consists of grouping together samples giving their similar properties. The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous Co-Clustering algorithm. ROCCO is a scalable, hyperparameter-free, easy and ready to use al…

2018-02-14abs ↗pdf ↗

A new framework pretrains a single GNN model for diverse graphs, overcoming domain-specific challenges.

problem Difficulty in generalizing across graphs from different domains using existing GNNs.
method Cross-domain pretraining framework with gating functions to choose experts for new graphs.
result Superior performance on link prediction and node classification tasks across various domains.

PyDCI improves DCI method, outperforming existing techniques on text classification benchmarks.

problem Cross-domain and cross-lingual text classification challenges.
method Reimplemented DCI method in Python, using scikit-learn and SciPy stack.
result PyDCI outperforms JaDCI and new high-performing methods on benchmarks.

Anomaly detection method using multimodal autoencoder and sparse optimization.

problem Interpreting anomalies detected by deep learning models in complex ICT systems.
method Proposes a sparse optimization algorithm to estimate contributing dimensions of anomalies detected by multimodal autoencoders.
result Superiority of the proposed estimation algorithm in specifying contributing dimensions of anomalous data and detecting anomalies in cross-domain data.