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

115230344459 · Jun 202019922001200920172026
48 results for source condition

CWAN tackles multi-source heterogeneous domain adaptation with conditional weighting.

problem Learning cross-domain samples from multiple heterogeneous domains.
method CWAN uses a feature transformer, label classifier, and domain discriminator to learn from multiple sources.
result CWAN outperforms state-of-the-art methods on four real-world datasets.

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.

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 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.

This paper proposes a multichannel source separation technique called the multichannel variational autoencoder (MVAE) method, which uses a conditional VAE (CVAE) to model and estimate the power spectrograms of the sources in a mixture. By training the CVAE using the spectrograms of training examples with source-class l…

2018-08-02abs ↗pdf ↗

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

Study derives error decay rates for kernel classification under source and capacity conditions.

problem Understanding prediction error decay rates for real data sets.
method Derived decay rates for misclassification error under Gaussian design for SVM and ridge classification.
result Rates accurately describe learning curves for data sets satisfying source and capacity conditions.

HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.

problem Tackles heavy-tailed data in various domains with rare events.
method Proposes a framework using clock-conditioned Gaussian sources and truncated logsignature features.
result Improves mode coverage, sample quality, and tail-statistic recovery over Gaussian flow matching and baselines.

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 ↗

New method combines multiple data sources for optimal decision-making with limited outcomes.

problem Optimal decision-making with limited outcome data from multiple heterogeneous sources.
method Calibrated optimal decision-making method leveraging common intermediate outcomes.
result Proposed estimator of conditional mean outcome is asymptotically normal and more efficient.

Proposes a framework to fuse heterogeneous data sources for better modeling.

problem Heterogeneous data sources with different input parameter spaces.
method Input mapping calibration (IMC) and latent variable Gaussian process (LVGP).
result Improved predictive accuracy over single source models.

Gravitational wave memory increases faster than Brownian motion in early universe and astrophysical sources.

problem Detecting gravitational wave memory from early universe and astrophysical sources.
method Investigated gravitational wave sources in early universe and astrophysical settings, showing memory increases faster than Brownian motion.
result Gravitational wave memory increases following a power law, faster than the t\sqrt{t} scaling law of Brownian motion.

Separation of the sources and analysis of their connectivity have been an important topic in EEG/MEG analysis. To solve this problem in an automatic manner, we propose a two-layer model, in which the sources are conditionally uncorrelated from each other, but not independent; the dependence is caused by the causality i…

2012-03-15abs ↗pdf ↗

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 ↗

New method for estimating parameters in inverse problems using double robustness.

problem Estimating parameters defined as linear functionals of solutions to linear inverse problems.
method Source condition double robust inference method that uses iterated Tikhonov regularized adversarial estimators.
result Asymptotic normality of the parameter of interest as long as either the primal or dual inverse problem is sufficiently well-posed.

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source doma…

2019-01-27abs ↗pdf ↗

This work improves transferability by considering conditional distributions in feature representations.

problem Improving transferability across multiple domains by considering conditional distributions.
method Introducing von Neumann conditional divergence to quantify the functional dependence between features and desired response.
result Favorable performance in terms of smaller generalization error and less catastrophic forgetting.

The paper tackles uncertainty quantification in multi-source settings.

problem Uncertainty quantification under covariate shift is challenging in multi-source settings.
method The paper addresses this by proposing two extensions of weighted conformal prediction: merge-based aggregation and data-pooling.
result Theoretical guarantees are provided for the proposed approaches, and experiments validate their effectiveness.

New model for recovering unverifiable signals from observers in decentralized networks.

problem Verifying the level of service provided by untrusted parties in decentralized networks.
method Formal model of signal elicitation, source identifiability condition, and peer prediction techniques.
result Existence of a strictly truthful mechanism for unverifiable signal recovery.

In this paper, a new approach for classification of target task using limited labeled target data as well as enormous unlabeled source data is proposed which is called self-taught learning. The target and source data can be drawn from different distributions. In the previous approaches, covariate shift assumption is co…

2017-10-12abs ↗pdf ↗

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

Transductive Adversarial Networks (TAN) is a novel domain-adaptation machine learning framework that is designed for learning a conditional probability distribution on unlabelled input data in a target domain, while also only having access to: (1) easily obtained labelled data from a related source domain, which may ha…

2018-02-08abs ↗pdf ↗

The paper constructs optimal confidence bands for kernel gradient flow estimators.

problem Estimating generalization error and constructing confidence bands for kernel gradient flows.
method Established convergence rates and constructed optimal confidence bands under capacity-source condition.
result Optimal confidence bands for kernel gradient flows have shrinkage rates close to minimax optimal rates.

Neural machine translation models are used to automatically generate a document from given source code since this can be regarded as a machine translation task. Source code summarization is one of the components for automatic document generation, which generates a summary in natural language from given source code. Thi…

2019-06-19abs ↗pdf ↗

Domain adaptation algorithms are designed to minimize the misclassification risk of a discriminative model for a target domain with little training data by adapting a model from a source domain with a large amount of training data. Standard approaches measure the adaptation discrepancy based on distance measures betwee…

2020-02-19abs ↗pdf ↗

The paper tackles distribution-free prediction intervals for multi-source data.

problem Challenges in achieving valid inferences due to distribution shifts and privacy concerns.
method Derives efficient influence functions, incorporates machine learning, and proposes data-adaptive strategies.
result Achieves parametric rates of convergence to nominal coverage probabilities for prediction intervals.

New method uses correlation-ratio for transfer learning, improving target model inference.

problem Difficulty in meeting similarity condition for transfer learning.
method Introduces linear correlation-ratio for building accurate relationships between models.
result Improves inference on target model by transferring information from source models.

New methods generalize nonlinear ICA beyond structural sparsity.

problem Identify true latent sources from nonlinear mixtures without structural sparsity assumptions.
method Propose identifiability results for undercomplete, partial sparsity, and flexible grouping structures.
result Prove identifiability in general settings of undercompleteness, partial sparsity, and flexible grouping structures.

Study optimizes data collection from biased, costly sources to minimize risk.

problem Estimating population means and group-conditional means from multiple sources with varying costs and biases.
method Develops a sampling plan that maximizes effective sample size, paired with a post-stratification estimator.
result Achieves budgeted minimax optimal risk for estimating population means and group-conditional means.

This work includes a number of novel contributions for the multiple-source adaptation problem. We present new normalized solutions with strong theoretical guarantees for the cross-entropy loss and other similar losses. We also provide new guarantees that hold in the case where the conditional probabilities for the sour…

2018-05-20abs ↗pdf ↗

A number of modern learning tasks involve estimation from heterogeneous information sources. This includes classification with labeled and unlabeled data as well as other problems with analogous structure such as competitive (game theoretic) problems. The associated estimation problems can be typically reduced to solvi…

2012-12-12abs ↗pdf ↗

The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.

problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.