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

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for Domain Relevance

In machine learning, the choice of a learning algorithm that is suitable for the application domain is critical. The performance metric used to compare different algorithms must also reflect the concerns of users in the application domain under consideration. In this work, we propose a novel probability-based performan…

2013-03-28abs ↗pdf ↗

Self-taught learning is a technique that uses a large number of unlabeled data as source samples to improve the task performance on target samples. Compared with other transfer learning techniques, self-taught learning can be applied to a broader set of scenarios due to the loose restrictions on the source data. Howeve…

2018-08-05abs ↗pdf ↗

We present a representation for describing transition models in complex uncertain domains using relational rules. For any action, a rule selects a set of relevant objects and computes a distribution over properties of just those objects in the resulting state given their properties in the previous state. An iterative g…

2018-10-26abs ↗pdf ↗

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.

Proposes a new framework for EEG-based BCIs without adversarial learning.

problem High intra- and inter-subject variabilities in EEG data.
method Mutual information-driven deep learning approach to learn class-relevant and subject-invariant feature representations.
result Effective in learning class-relevant and subject-invariant feature representations without adversarial learning.

Profiling cellular phenotypes from microscopic imaging can provide meaningful biological information resulting from various factors affecting the cells. One motivating application is drug development: morphological cell features can be captured from images, from which similarities between different drug compounds appli…

2017-11-02abs ↗pdf ↗

Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separa…

2017-11-09abs ↗pdf ↗

Bayesian priors improve neural network performance on weak signals.

problem Challenges in encoding domain knowledge for weak signals in neural networks.
method Proposed a new joint prior over local scale parameters for feature sparsity and signal-to-noise ratio, optimized with Stein gradient.
result Improved prediction accuracy on various datasets, including genetics applications with weak and sparse signals.

Liouville domains have become central objects in symplectic and contact geometry. However, the auxiliary data they involve --- namely, Liouville forms --- and the non-compactness of their completions generate some inconvenience. The notion of ideal Liouville domains is designed to suppress these awkward aspects and to …

2017-08-29abs ↗pdf ↗

This study combines two different learning paradigms, k-nearest neighbor (k-NN) rule, as memory-based learning paradigm and relevance vector machines (RVM), as statistical learning paradigm. This combination is performed in kernel space and is called k-relevance vector (k-RV). The purpose is to improve the performance …

2019-09-18abs ↗pdf ↗

Improves unsupervised domain adaptation by mixing source and target domains.

problem Improves unsupervised domain adaptation by mixing source and target domains.
method Enforces training constraints across domains using mixup formulation and feature-level consistency regularizer.
result Significantly improves state-of-the-art performance on image classification and human activity recognition tasks.

Study reveals XAI methods fail in neuroimaging, suggesting domain-specific adaptation.

problem Systematic failures of XAI methods in neuroimaging applications.
method Systematic comparison of XAI methods on 45,000 structural brain MRIs using a novel validation framework.
result Two widely used XAI methods (GradCAM and Layer-wise Relevance Propagation) fail to accurately explain neuroimaging data.

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 ↗

This paper addresses unsupervised domain adaptation, the setting where labeled training data is available on a source domain, but the goal is to have good performance on a target domain with only unlabeled data. Like much of previous work, we seek to align the learned representations of the source and target domains wh…

2019-09-26abs ↗pdf ↗

In many real-world applications, we want to exploit multiple source datasets of similar tasks to learn a model for a different but related target dataset -- e.g., recognizing characters of a new font using a set of different fonts. While most recent research has considered ad-hoc combination rules to address this probl…

2019-09-11abs ↗pdf ↗

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.

Domain adaptation provides a powerful set of model training techniques given domain-specific training data and supplemental data with unknown relevance. The techniques are useful when users need to develop models with data from varying sources, of varying quality, or from different time ranges. We build CrossTrainer, a…

2019-05-07abs ↗pdf ↗

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.

In this paper, we provide a new neural-network based perspective on multi-task learning (MTL) and multi-domain learning (MDL). By introducing the concept of a semantic descriptor, this framework unifies MDL and MTL as well as encompassing various classic and recent MTL/MDL algorithms by interpreting them as different w…

2014-12-23abs ↗pdf ↗

Introduces Gaussian Processes and Relevance Vector Machines, connecting them to Kalman filtering.

problem Regression, smoothing, interpolation, and filtering problems.
method Bayesian kernel-based methods, Gaussian Processes, Relevance Vector Machines, connections to Kalman filtering.
result Developed a common framework for understanding these methods.

Unsupervised learning filters tweets for emergency services during crises.

problem Challenges in filtering relevant information from social web data during disasters.
method Multi-task domain adversarial attention network for unsupervised domain adaptation.
result The multi-task model outperforms single task models in filtering relevant tweets.

COLUMBUS discovers new features to improve domain generalization.

problem Improving machine learning models' ability to generalize to unseen domains.
method COLUMBUS uses targeted corruption of input and multi-level representations to discover new features.
result COLUMBUS achieves state-of-the-art performance on DG benchmarks.

The recent proliferation of publicly available graph-structured data has sparked an interest in machine learning algorithms for graph data. Since most traditional machine learning algorithms assume data to be tabular, embedding algorithms for mapping graph data to real-valued vector spaces has become an active area of …

2019-08-08abs ↗pdf ↗

Transfer learning has recently attracted significant research attention, as it simultaneously learns from different source domains, which have plenty of labeled data, and transfers the relevant knowledge to the target domain with limited labeled data to improve the prediction performance. We propose a Bayesian transfer…

2018-01-02abs ↗pdf ↗

The paper aims to define a benchmark for deep learning recommendation models.

problem Insufficient benchmarking for deep learning recommendation models.
method Synthesizes modeling strategies, defines desirable characteristics, and summarizes advice from the MLPerf Recommendation Advisory Board.
result Defines an industry-relevant benchmark for deep learning recommendation models.

This work tackles domain generalization by minimizing discrepancy between domains.

problem Domain generalization: learning to handle unseen domains with i.i.d. data assumptions violated.
method The approach involves minimizing discrepancy between domains using a lemma and deriving a generalization bound.
result Low risk over unseen domains can be achieved by representing data in a space where training distributions are indistinguishable and relevant information is preserved.