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

0.3%0.5%0.8%0.5% · May 202419922001200920172026
48 results for multiple-source

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.

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 ↗

This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in several directions. We extend previous multiple source loss guarantees based on distri…

2012-05-09abs ↗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.

The paper proposes a method to integrate prior information into penalized regression.

problem Improving predictive performance in high-dimensional tasks with prior information.
method Integrating multiple sources of prior information into penalized regression.
result The method improves predictive performance, as shown by simulations and applications.

The paper develops methods to identify stable associations across multiple studies.

problem Identifying stable associations across multiple studies with possible distributional shifts.
method Modeling heterogeneous multi-source data with multiple high-dimensional regressions and devising a novel sampling method for valid confidence intervals of maximin effects.
result Significant maximin effects indicate stable associations that can be generalized to target populations.

Transfer knowledge from multiple sources to improve matrix completion.

problem Matrix completion with noisy data.
method Aggregating singular subspaces information from multiple sources to solve a two-way PCA problem and transform into a low-dimensional linear regression.
result Guaranteed statistical efficiency in transforming the high-dimensional target matrix completion problem.

The paper proposes a method to infer user profiles from multiple sources of social media data.

problem Mining user profiles from social media data using a single type of information.
method Hinge-loss Markov Random Fields (HL-MRFs) integrated with multiple sources of UGC and social relations.
result HL-MRFs successfully incorporate multiple sources of information and outperform competing methods.

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.

The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.

problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.

Flexible framework for CMTF with ADMM for various constraints and couplings.

problem Challenges in data fusion from multiple sources with varying characteristics.
method Flexible algorithmic framework using AO and ADMM for various constraints, loss functions, and couplings.
result Accurate and computationally efficient results for various loss functions, including KL divergence.

We present in this paper a new premium computation principle based on the use of prior information from multiple sources for computing the premium charged to a policyholder. Under this framework, based on the use of Ordered Weighted Averaging (OWA) operators, we propose alternative collective and Bayes premiums and des…

2015-11-12abs ↗pdf ↗

Proposes using Wasserstein barycenters for robust optimization with multiple data sources.

problem Distributionally robust optimization with multiple heterogeneous data sources.
method Construct nominal distribution through Wasserstein barycenter of multiple data samples, reformulates as a finite convex program.
result Proposed scheme outperforms other estimators in sparse inverse covariance matrix estimation.

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.

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.

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

Proposes MDDA for multi-source domain adaptation.

problem Performance decay in deep neural networks due to domain shift between labeled and unlabeled data.
method Multi-source distilling domain adaptation (MDDA) network considering multiple source distributions and target similarities.
result Significantly outperforms state-of-the-art approaches on public DA benchmarks.

Deep learning helps remove secondary BB-mode polarization to detect primordial gravitational waves.

problem Removing secondary BB-mode polarization from CMB data to detect primordial gravitational waves.
method Applied deep learning (ResUNet-CMB) to estimate and remove multiple sources of secondary BB-mode polarization.
result Deep learning can produce nearly optimal, unbiased estimates of the amplitude of primordial gravitational waves.

Domain generalization (DG) aims to incorporate knowledge from multiple source domains into a single model that could generalize well on unseen target domains. This problem is ubiquitous in practice since the distributions of the target data may rarely be identical to those of the source data. In this paper, we propose …

2019-07-25abs ↗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 ↗

The task of clustering a set of objects based on multiple sources of data arises in several modern applications. We propose an integrative statistical model that permits a separate clustering of the objects for each data source. These separate clusterings adhere loosely to an overall consensus clustering, and hence the…

2013-02-28abs ↗pdf ↗

Domain adaptation (DA) is an important and emerging field of machine learning that tackles the problem occurring when the distributions of training (source domain) and test (target domain) data are similar but different. Current theoretical results show that the efficiency of DA algorithms depends on their capacity of …

2016-10-14abs ↗pdf ↗

Model integrates multi-view temporal data for better understanding of latent dynamics.

problem Understanding time-dependent heterogeneous properties from multi-view data.
method Generative model using variational autoencoder and recurrent neural network.
result Identifies disentangled latent embeddings across views while accounting for time factor.

The paper tackles robust policy learning from multiple data sources.

problem Learning a policy that generalizes across diverse settings from multiple heterogeneous data sources.
method Proposes a minimax regret optimization objective and a policy learning algorithm combining doubly robust offline policy evaluation and no-regret learning.
result Achieves minimal worst-case mixture regret up to a moderated vanishing rate of the total data across all sources.

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 ↗

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 ↗

Study optimal reinsurance pricing under model uncertainty for multiple insurers.

problem Optimal reinsurance pricing in the presence of multiple sources of model uncertainty.
method Solves a continuous-time Stackelberg game for general reinsurance contracts, considering entropy penalties and ambiguity in insurers' models.
result Reinsurer prices under a distortion of the barycentre of insurers' models, maximizing expected wealth with an entropy penalty.

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.

Combines multiple asset views with machine learning for better portfolio allocation.

problem Portfolio allocation with multiple uncertain asset views.
method Consistency-based data fusion techniques for combining Black-Litterman model with machine learning predictions.
result Improved portfolio allocation through fusion of multiple view estimates.

BayesIMP combines multiple causal graphs to estimate average treatment effects with uncertainty.

problem Uncertainty quantification in causal inference from multiple datasets.
method Bayesian Interventional Mean Processes (BayesIMP) integrating probabilistic integration and kernel mean embeddings.
result Improvements in average treatment effect estimation over state-of-the-art methods.

We present a new model, Predictive State Recurrent Neural Networks (PSRNNs), for filtering and prediction in dynamical systems. PSRNNs draw on insights from both Recurrent Neural Networks (RNNs) and Predictive State Representations (PSRs), and inherit advantages from both types of models. Like many successful RNN archi…

2017-05-25abs ↗pdf ↗