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,742 papers · 148 categories

Trend · papers per month

147295442589 · Jun 202019922001200920172026
48 results for Domain Classification

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.

The paper improves classification accuracy by leveraging a shared signal across domains in high-dimensional classification.

problem Improving classification accuracy in high-dimensional data with shared signals across domains.
method Transfer learning for linear discriminant analysis, decomposing mean differences into common and domain-specific components.
result Deterministic limits for transfer performance, leading to optimal weights and corrections for bias.

Domain classification is the task of mapping spoken language utterances to one of the natural language understanding domains in intelligent personal digital assistants (IPDAs). This is a major component in mainstream IPDAs in industry. Apart from official domains, thousands of third-party domains are also created by ex…

2019-05-02abs ↗pdf ↗

MetFA aligns source and target domains for cross-device image classification.

problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.

URT layer improves few-shot image classification across diverse domains.

problem Few-shot image classification in multi-domain settings.
method Meta-learns to dynamically re-weight and compose domain-specific representations.
result Sets new state-of-the-art on Meta-Dataset.

A two-layer classifier improves smartphone transportation mode recognition.

problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.

In this paper we propose a novel dual adversarial co-learning approach for multi-domain text classification (MDTC). The approach learns shared-private networks for feature extraction and deploys dual adversarial regularizations to align features across different domains and between labeled and unlabeled data simultaneo…

2019-09-18abs ↗pdf ↗

I prove three classification results about harmonic morphisms whose fibers have dimension one. All are valid when the domain is at least of dimension 4. (The character of this overdetermined problem is very different when the dimension of the domain is 3 or less.) The first result is a local classification for such har…

1997-01-03abs ↗pdf ↗

The primary objective of domain adaptation methods is to transfer knowledge from a source domain to a target domain that has similar but different data distributions. Thus, in order to correctly classify the unlabeled target domain samples, the standard approach is to learn a common representation for both source and t…

2018-11-17abs ↗pdf ↗

Automated sentiment classification (SC) on short text fragments has received increasing attention in recent years. Performing SC on unseen domains with few or no labeled samples can significantly affect the classification performance due to different expression of sentiment in source and target domain. In this study, w…

2018-08-28abs ↗pdf ↗

Out-of-domain (OOD) detection for low-resource text classification is a realistic but understudied task. The goal is to detect the OOD cases with limited in-domain (ID) training data, since we observe that training data is often insufficient in machine learning applications. In this work, we propose an OOD-resistant Pr…

2019-08-31abs ↗pdf ↗

Benchmark for UDA in time series classification.

problem Lack of benchmarks for unsupervised domain adaptation in time series.
method Introduces a comprehensive benchmark with new datasets and state-of-the-art neural network backbones.
result Insights into strengths and limitations of UDA methods for time series data.

FrequentNet uses frequency domain basis vectors for image classification, making models more interpretable and efficient.

problem Image classification models are often complex and hard to interpret.
method FrequentNet selects filter vectors from frequency domain basis vectors instead of training them with back propagation.
result The method improves interpretability and efficiency of image classification models.

Improves text classification on new domains using distance-based measures and dynamic domain selection.

problem Improving text classification performance on new domains with limited labeled data.
method Develops DistanceNet and DistanceNet-Bandit models using distance measures to adapt to new domains.
result DistanceNet and DistanceNet-Bandit models outperform baseline methods in unsupervised domain adaptation.

Adversarial domain adaptation reduces sample bias in high energy physics classifier.

problem Sample bias in high energy physics classifier training.
method Adversarial domain adaptation using neural networks with gradient reversal layer.
result Successful bias removal on simulated events at the LHC.

Domain knowledge helps detect adversarial examples in multi-label classification.

problem Detecting adversarial examples in multi-label classification.
method Convert domain knowledge into constraints and inject them into a semi-supervised learning problem.
result Domain-knowledge constraints help detect adversarial examples effectively.

The paper proposes a method to create domain-invariant representations using Wasserstein distance.

problem Domain shifts in training data affect machine learning model performance across different domains.
method The method combines classification/regression losses with a GAN-type discriminator to minimize the Wasserstein distance between domains.
result The approach produces the highest minimum classification accuracy and most invariant representation across domains.

New metric and method for sEMG-based gesture recognition under domain shifts.

problem Measuring and adapting to domain divergence in sEMG-based gesture recognition.
method Probability distribution-based metric, 2-stage autoregressive RNN architecture.
result Improved autoregressive, RNN-based architecture enhances performance.

In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is…

2018-10-03abs ↗pdf ↗

In this paper, we study the problem of transfer learning with the attribute data. In the transfer learning problem, we want to leverage the data of the auxiliary and the target domains to build an effective model for the classification problem in the target domain. Meanwhile, the attributes are naturally stable cross d…

2018-03-26abs ↗pdf ↗

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 ↗

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.

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.

Paper tackles robust classification under class-dependent domain shift.

problem Class-dependent domain shift in machine learning.
method Defined a simple optimization problem with an information theoretic constraint and solved it using neural networks.
result Demonstrated that the proposed method can learn robust classifiers that generalize well to unseen domains.

A new method uses normalizing flows for gradual domain adaptation.

problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.

Proposes DFDG for robust domain generalization without source domain labels.

problem Robustness of deep learning models in real-world applications where train and test distributions differ.
method Model-agnostic, class-aware alignment of class relationships through saliency maps.
result Competitive performance on time series sensor and image classification datasets.

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.

The study reveals a linear relationship between source and target domain classification errors based on disagreement.

problem Evaluating model performance under distribution shift with limited labeled data.
method Developed a theoretical foundation for analyzing disagreement in high-dimensional random features regression.
result The disagreement-on-the-line phenomenon occurs when classification error under the source domain is a linear function of the target domain.

Unique domain found in Einstein universe, simplifying manifold classification.

problem Classifying closed conformally flat manifolds with proper development.
method Identifying and analyzing almost-homogeneous domains in the Einstein universe.
result Found a unique domain (diamond) in the Einstein universe that simplifies manifold classification.

We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predict…

2014-12-15abs ↗pdf ↗

Deep learning has been successfully applied to a variety of image classification tasks. There has been keen interest to apply deep learning in the medical domain, particularly specialties that heavily utilize imaging, such as ophthalmology. One issue that may hinder application of deep learning to the medical domain is…

2019-01-26abs ↗pdf ↗

Defines explanations for classifier outcomes using causal concepts.

problem Understanding classifier outcomes in a causal context.
method Proposes a new definition of explanation based on causality, compares it with existing notions, and evaluates it experimentally.
result Experimental evaluation shows the new definition's effectiveness on financial datasets.

Current supervised learning models cannot generalize well across domain boundaries, which is a known problem in many applications, such as robotics or visual classification. Domain adaptation methods are used to improve these generalization properties. However, these techniques suffer either from being restricted to a …

2019-07-02abs ↗pdf ↗

In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain…

2019-09-08abs ↗pdf ↗

Enhances adversarial robustness with unlabeled out-of-domain data.

problem Improving robustness of models against adversarial attacks.
method Leveraging unlabeled data from multiple domains to bridge the sample complexity gap in adversarial robustness.
result Better adversarial robustness achieved when unlabeled data comes from a shifted domain.