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.

168,695 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for multiple domains

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

Paper proposes a new method to aggregate multiple sources with different label distributions.

problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.

Method generates intermediate domains to align source and target domains.

problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.

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.

In this work, we study the problem of learning a single model for multiple domains. Unlike the conventional machine learning scenario where each domain can have the corresponding model, multiple domains (i.e., applications/users) may share the same machine learning model due to maintenance loads in cloud computing serv…

2018-05-19abs ↗pdf ↗

EnMDAP aligns conditional distributions for multi-source domain adaptation using pseudolabels.

problem Training a target model with no labeled data in the absence of target data labels.
method EnMDAP uses label-wise moment matching and ensemble learning with multiple feature extractors.
result EnMDAP achieves state-of-the-art performance in multi-source domain adaptation tasks.

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…

2012-06-27abs ↗pdf ↗

Adversarial techniques learn invariant representations across multiple domains.

problem Domain generalization from diverse studies to unseen domains.
method Adversarial censoring techniques for invariant representation learning.
result Limiting behavior of adversarial loss function as the number of domains grows.

Multi-domain learning (MDL) aims at obtaining a model with minimal average risk across multiple domains. Our empirical motivation is automated microscopy data, where cultured cells are imaged after being exposed to known and unknown chemical perturbations, and each dataset displays significant experimental bias. This p…

2019-03-21abs ↗pdf ↗

A typical domain adaptation approach is to adapt models trained on the annotated data in a source domain (e.g., sunny weather) for achieving high performance on the test data in a target domain (e.g., rainy weather). Whether the target contains a single homogeneous domain or multiple heterogeneous domains, existing wor…

2019-09-08abs ↗pdf ↗

Multiple marginal matching problem aims at learning mappings to match a source domain to multiple target domains and it has attracted great attention in many applications, such as multi-domain image translation. However, addressing this problem has two critical challenges: (i) Measuring the multi-marginal distance amon…

2019-11-03abs ↗pdf ↗

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…

2012-06-04abs ↗pdf ↗

G-FuNK learns solutions for nonlinear PDEs on multiple domains and parameters.

problem Predicting time-dependent dynamics of complex systems governed by nonlinear PDEs with varying parameters and domains.
method Graph Fourier Neural Kernels combining domain-adapted and transferable components for non-diffusive and diffusive terms.
result G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions.

We propose a novel unsupervised domain adaptation framework based on domain-specific batch normalization in deep neural networks. We aim to adapt to both domains by specializing batch normalization layers in convolutional neural networks while allowing them to share all other model parameters, which is realized by a tw…

2019-05-27abs ↗pdf ↗

Distance metric learning (DML) plays a crucial role in diverse machine learning algorithms and applications. When the labeled information in target domain is limited, transfer metric learning (TML) helps to learn the metric by leveraging the sufficient information from other related domains. Multi-task metric learning …

2019-04-08abs ↗pdf ↗

We address the problem of tuning word embeddings for specific use cases and domains. We propose a new method that automatically combines multiple domain-specific embeddings, selected from a wide range of pre-trained domain-specific embeddings, to improve their combined expressive power. Our approach relies on two key c…

2019-09-05abs ↗pdf ↗

New PCGML approach generates novel game content across multiple platformer domains.

problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.

New method evaluates multiple social disparities using machine learning.

problem Reduction of educational disparities across multiple dimensions.
method Triply-Robust Machine Learning Approach for Causal Decomposition Analysis.
result Simultaneous interventions across multiple domains reduce disparities.

Unpaired multi-domain causal representation learning is possible with sufficient conditions.

problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.

A decentralized approach for multi-source domain adaptation.

problem Transfer knowledge from multiple related domains to an unlabeled target domain.
method Federated Dataset Dictionary Learning (FedDaDiL) framework, eliminating central server, using Wasserstein barycenters.
result Our decentralized approach effectively adapts source domains to an unlabeled target domain.

Survey explores methods to adapt deep learning models across multiple labeled domains.

problem Difficulty in obtaining labeled data for deep learning models.
method Multi-source domain adaptation (MDA) to transfer knowledge from labeled to unlabeled or sparsely labeled target domains.
result MDA methods improve performance by minimizing domain shift.

Introduces Cauchy-Schwarz divergence for domain adaptation.

problem Evaluating discrepancy between source and target domains in unsupervised domain adaptation.
method Introduces Cauchy-Schwarz divergence as a measure for evaluating discrepancy between marginal and conditional distributions.
result CS divergence offers a tighter generalization error bound than Kullback-Leibler divergence.

Nowadays, users open multiple accounts on social media platforms and e-commerce sites, expressing their personal preferences on different domains. However, users' behaviors change across domains, depending on the content that users interact with, such as movies, music, clothing and retail products. In this paper, we pr…

2019-06-29abs ↗pdf ↗

New method estimates individual treatment effects using domain generalization.

problem Estimating causal individual treatment effects from observational data with treatment bias.
method Invariant Risk Minimization (IRM) framework to learn predictors invariant to domain-dependent factors.
result IRM-based ITE estimator shows gains over classical regression approaches in settings with pronounced support mismatch.

Improves domain adaptation by combining multiple source domains and target domain data.

problem Poor performance of empirical risk minimization in distributionally shifted target domains.
method Distributionally robust model optimizing adversarial reward based on explained variance across multiple source domains.
result The robust model is a weighted average of conditional outcome models from source domains.

With the proliferation of social media platforms and e-commerce sites, several cross-domain collaborative filtering strategies have been recently introduced to transfer the knowledge of user preferences across domains. The main challenge of cross-domain recommendation is to weigh and learn users' different behaviors in…

2019-08-11abs ↗pdf ↗

Paper extends SI method for detecting CPs in complex systems' frequency domain.

problem Identifying change points in complex systems' frequency domain.
method Extends SI framework to frequency domain using DFT properties and develops valid p-values.
result Reliable detection of genuine CPs with strong statistical guarantees.

Many text classification tasks are known to be highly domain-dependent. Unfortunately, the availability of training data can vary drastically across domains. Worse still, for some domains there may not be any annotated data at all. In this work, we propose a multinomial adversarial network (MAN) to tackle the text clas…

2018-02-15abs ↗pdf ↗

Domain generalization aims to apply knowledge gained from multiple labeled source domains to unseen target domains. The main difficulty comes from the dataset bias: training data and test data have different distributions, and the training set contains heterogeneous samples from different distributions. Let XX denote …

2018-07-23abs ↗pdf ↗

Paper tackles adapting multiple domains to a target domain using distillation and dictionary learning.

problem Adapting multiple heterogeneous labeled source domains to an unlabeled target domain.
method Combines Multi-Source Domain Adaptation and Dataset Distillation with Dataset Dictionary Learning.
result Achieves state-of-the-art adaptation performance even with minimal labeled data.

Detailed proofs and extensions of eigenvalue multiplicity bounds for spheres and plane domains.

problem Bounding the multiplicity of eigenvalues for Riemannian surfaces.
method Detailed proofs, combinatorial analysis of nodal domains, and Euler's inequality.
result Upper bounds on eigenvalue multiplicities extended to Robin boundary conditions.

We present a novel method for obtaining high-quality, domain-targeted multiple choice questions from crowd workers. Generating these questions can be difficult without trading away originality, relevance or diversity in the answer options. Our method addresses these problems by leveraging a large corpus of domain-speci…

2017-07-19abs ↗pdf ↗