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

Trend · papers per month

168336503671 · Jun 202019922001200920172026
48 results for source datasets

Bayesian transfer learning improves predictive performance with limited source data.

problem Improving statistical procedures with limited target and source datasets.
method Total risk prior for joint parameter distribution, Bayesian Lasso, model averaging, Gibbs sampling.
result Superior predictive performance compared to frequentist baseline, especially with limited source data.

A new method aligns source and target distributions by tuning their weights.

problem Domain adaptation on unlabeled target datasets using labeled source datasets.
method Weighted Joint Distribution Optimal Transport (WJDOT) method that finds alignment between source and target distributions and re-weighting of source distributions.
result Achieves state-of-the-art performance on simulated and real-life datasets.

AutoML serves as the bridge between varying levels of expertise when designing machine learning systems and expedites the data science process. A wide range of techniques is taken to address this, however there does not exist an objective comparison of these techniques. We present a benchmark of current open source Aut…

2018-08-17abs ↗pdf ↗

Study evaluates cross-validation methods for clinical ECG classification, finding leave-source-out more reliable.

problem Overoptimistic cross-validation estimates for new patient sources.
method Empirical evaluation of K-fold and leave-source-out cross-validation methods.
result Leave-source-out cross-validation provides more reliable performance estimates.

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.

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.

XMixup improves transfer learning accuracy by 1.9% with less training time.

problem Efficiently transfer knowledge from large source datasets to target tasks with small samples.
method Cross-domain Mixup technique that selects auxiliary samples from source datasets and augments training samples via mixup strategy.
result Improves accuracy by 1.9% on average over six real-world transfer learning datasets.

A new method reduces energy consumption in machine learning by using multiple, less costly data sources.

problem High computational and energy costs in machine learning model training.
method Augmented Gaussian Process (AGP-MISO) with multi-source optimization.
result The AGP-MISO method reduces computational time and energy consumption compared to traditional approaches.

Method transfers knowledge without label overlap, source data, or target architecture consistency.

problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.

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.

This paper benchmarks FinGPT for financial datasets using open-source large language models.

problem Challenges in integrating GPT-based models with financial datasets.
method Instruction Tuning paradigm for open-source large language models adapted for financial contexts.
result Demonstrates the effectiveness and adaptability of FinGPT in financial tasks.

Paper proposes a transfer learning method for improving matrix completion.

problem Improving estimation of a low-rank target matrix using auxiliary data.
method Transfer learning procedure leveraging prior information on favorable source datasets.
result Method outperforms traditional methods when source datasets are close to the target matrix.

Unsupervised domain adaptation techniques have been successful for a wide range of problems where supervised labels are limited. The task is to classify an unlabeled `target' dataset by leveraging a labeled `source' dataset that comes from a slightly similar distribution. We propose metric-based adversarial discriminat…

2018-07-06abs ↗pdf ↗

Paper tackles online multi-source domain adaptation using Gaussian mixtures and dictionary learning.

problem Adapting multiple, heterogeneous source domains to a target domain in a streaming fashion.
method Introduces a novel approach for online fitting of Gaussian Mixture Models based on Wasserstein geometry, combined with dataset dictionary learning.
result Demonstrates ability to adapt 'on the fly' to target domain data streams.

New method disentangles sources of different timescales in planetary seismic data.

problem Unsupervised source separation of multi-scale seismic data from planetary missions.
method Wavelet scattering spectra for multi-scale clustering and variational autoencoder for source separation.
result Disentangles sources with different timescales in InSight mission seismic data.

This study tackles offline RL with perturbed data sources, deriving a lower bound and proposing an optimal algorithm.

problem Understanding offline RL with multiple perturbed data sources.
method Derives an information-theoretic lower bound, proposes HetPEVI algorithm considering sample and source uncertainties.
result HetPEVI is optimal up to a polynomial factor of the horizon length and can solve offline RL tasks.

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 ↗

SYNC generates synthetic data from aggregated sources using Gaussian copulas.

problem Creating synthetic datasets from aggregated sources.
method SYNC uses Gaussian copula models to infer high-resolution data from low-resolution sources.
result SYNC successfully merges sampled subsets into a single synthetic dataset.

Canonical correlation analysis (CCA) is a powerful technique for discovering whether or not hidden sources are commonly present in two (or more) datasets. Its well-appreciated merits include dimensionality reduction, clustering, classification, feature selection, and data fusion. The standard CCA however, does not expl…

2018-03-27abs ↗pdf ↗

Transfer learning is a very important tool in deep learning as it allows propagating information from one "source dataset" to another "target dataset", especially in the case of a small number of training examples in the latter. Yet, discrepancies between the underlying distributions of the source and target data are c…

2019-04-02abs ↗pdf ↗

Adaptive source selection for positive transfer in linear models improves target dataset performance.

problem Limited task-specific labeled data in business settings.
method Greedily decides from which sources and how many samples to incorporate into the target dataset using an accept/reject rule based on a data-dependent estimate of the transfer gain.
result Consistent gains over classical and recent strong baselines while avoiding negative transfer.

Magnetoencephalography and electroencephalography (M/EEG) are non-invasive modalities that measure the weak electromagnetic fields generated by neural activity. Estimating the location and magnitude of the current sources that generated these electromagnetic fields is a challenging ill-posed regression problem known as…

2019-10-03abs ↗pdf ↗

Learning from multiple sources of information is an important problem in machine-learning research. The key challenges are learning representations and formulating inference methods that take into account the complementarity and redundancy of various information sources. In this paper we formulate a variational autoenc…

2018-11-11abs ↗pdf ↗

Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target …

2019-05-30abs ↗pdf ↗

Paper tackles offline RL with limited target samples using domain adaptation.

problem Limited samples in target dataset degrade offline RL performance.
method Proposes a framework to balance target and source datasets with theoretical guarantees.
result Establishes performance bounds and optimal weight for offline RL.

In recent years, an active field of research has developed around automated machine learning (AutoML). Unfortunately, comparing different AutoML systems is hard and often done incorrectly. We introduce an open, ongoing, and extensible benchmark framework which follows best practices and avoids common mistakes. The fram…

2019-07-01abs ↗pdf ↗

Study model selection in batch policy optimization with three error sources.

problem Learn a policy competitive with the best model class in batch policy optimization.
method Formalized in contextual bandit setting with linear model classes, addressing approximation error, statistical complexity, and dataset shift.
result No algorithm can optimally trade-off all three error sources, but relaxing any one enables near-oracle inequalities for the others.

Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…

2017-12-28abs ↗pdf ↗

Proposes robust ITRs integrating multiple datasets to handle posterior shift.

problem Posterior shift in conditional outcome distributions between source and target populations.
method Distributionally robust approach with closed-form solution and adaptive uncertainty tuning.
result Achieves superior performance compared to existing methods in simulations and real-data applications.

In recent years, supervised machine learning models have demonstrated tremendous success in a variety of application domains. Despite the promising results, these successful models are data hungry and their performance relies heavily on the size of training data. However, in many healthcare applications it is difficult…

2018-12-03abs ↗pdf ↗

MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.

problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.

Optimizes black-box functions with varying costs across multiple sources.

problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.

Multi-source transfer learning has been proven effective when within-target labeled data is scarce. Previous work focuses primarily on exploiting domain similarities and assumes that source domains are richly or at least comparably labeled. While this strong assumption is never true in practice, this paper relaxes it a…

2018-07-06abs ↗pdf ↗

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

Despite substantial progress in signal source separation, results for richly structured data continue to contain perceptible artifacts. In contrast, recent deep generative models can produce authentic samples in a variety of domains that are indistinguishable from samples of the data distribution. This paper introduces…

2020-02-19abs ↗pdf ↗