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

61122183244 · Jun 202019922001200920172026
48 results for unknown sources

Paper tackles open set domain adaptation by detecting unknown classes.

problem Adapting to target domains with unknown classes when label spaces partially overlap.
method Instance-level reweighting strategy combined with Extreme Value Theory for unknown class detection.
result Proposed method outperforms state-of-the-art models on conventional datasets.

Bayesian method mitigates negative transfer in unknown source data.

problem Negative transfer in transfer learning where target performance worsens after source data consideration.
method Proxy-informed robust method for probabilistic transfer learning (PROMPT).
result Negative transfer can be mitigated without prior knowledge of source data.

New method uses PINNs to solve complex PDEs with sparse measurements.

problem Joint estimation of source and parameters in advection-diffusion equations with limited data.
method Weighted adaptive approach based on neural tangent kernel of PINNs.
result Successful estimation of source function, velocity, and diffusion parameters.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…

2009-08-31abs ↗pdf ↗

Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…

2018-11-02abs ↗pdf ↗

Bayesian method improves EEG source localization and estimates skull conductivity.

problem Improving EEG source localization accuracy with unknown skull conductivity.
method Bayesian Approximation Error approach using conditional Gaussian regression, iterative optimization, and physics-informed learning.
result Clear improvements in EEG source localization accuracy and feasible estimates for unknown skull conductivity.

Proposes a transfer learning framework for sparse SIMs without raw source data.

problem Lack of direct access to raw source data and known link functions in transfer learning.
method Source-data-free framework based on SIM, using summary statistics and a multilayer perceptron.
result Consistent improvements over existing approaches in synthetic and real-world data.

Blind Source Separation is a widely used technique to analyze multichannel data. In many real-world applications, its results can be significantly hampered by the presence of unknown outliers. In this paper, a novel algorithm coined rGMCA (robust Generalized Morphological Component Analysis) is introduced to retrieve s…

2015-07-08abs ↗pdf ↗

The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain -- the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle uns…

2019-07-19abs ↗pdf ↗

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 ↗

PhICNet combines physics and deep learning for forecasting and source identification in dynamical systems.

problem Forecasting and identifying unobservable external sources in spatio-temporal dynamical systems.
method Physics-Incorporated Convolutional Recurrent Neural Network (PhICNet).
result PhICNet can forecast dynamics and identify sources for relatively long periods.

A new method trains deep neural networks for open set domain adaptation without negative open set difference.

problem Training deep neural networks for open set domain adaptation without negative open set difference.
method Proposes a new upper bound of target-domain risk, including source-domain risk, ε-open set difference (ΔεΔ_ε), distributional discrepancy, and constant. Uses gradient descent for source-domain risk and ΔεΔ_ε, and adversarial training for distributional discrepancy. Trains DNNs via minimizing the new upper bound.
result Shows state-of-the-art performance on benchmark datasets.

This paper improves kernel-based regression using transfer learning.

problem Improving generalization performance in kernel-based regression.
method Two-step kernel-based estimator for known transferable sources and novel aggregation algorithm for unknown sources.
result Established statistical properties and validated effectiveness of proposed methods.

Paper tackles moment estimation under covariate shift with a two-stage algorithm.

problem Estimating moments under covariate shift when source and target distributions differ.
method Proposes a two-stage algorithm: first, an optimal estimator for the source distribution; second, likelihood ratio reweighting for calibration.
result Achieves minimax optimal bound for moment estimation.

Paper tackles transfer learning for contextual multi-armed bandits under covariate shift.

problem Nonparametric contextual multi-armed bandits with covariate shift.
method Established minimax rate of convergence, proposed transfer learning algorithm.
result Achieved near-optimal statistical guarantees for learning in target domain.

Improves neural network performance by dynamically adjusting model weights based on source reliability.

problem Training neural networks on data from unreliable sources leads to poor performance.
method Dynamic re-weighting strategy using likelihood tempering to adjust model weights based on estimated source reliability.
result Significant improvement in model performance when trained on mixtures of reliable and unreliable data sources.

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 ↗

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.

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.

OpenViewer tackles multi-view learning challenges with interpretability and generalization.

problem Lack of interpretability and insufficient generalization in multi-view learning models.
method OpenViewer introduces a Pseudo-Unknown Sample Generation Mechanism, Expression-Enhanced Deep Unfolding Network, and Perception-Augmented Open-Set Training Regime.
result OpenViewer effectively addresses openness challenges and enhances recognition performance for both known and unknown samples.

Independent component analysis (ICA) is the most popular method for blind source separation (BSS) with a diverse set of applications, such as biomedical signal processing, video and image analysis, and communications. Maximum likelihood (ML), an optimal theoretical framework for ICA, requires knowledge of the true unde…

2016-10-22abs ↗pdf ↗

New algorithm identifies best target arm with known additive relationship between source and target MAB instances.

problem Identifying the best arm in a target MAB instance when only source arms can be pulled and there's a known additive relationship between the two.
method Proposes an LUCB-style algorithm to identify an ε-optimal target arm with high probability.
result Theoretical analysis highlights aspects of the transfer learning problem and recovers the LUCB algorithm for single domain BAI as a special case.

New algorithm reduces age of information in wireless networks with unknown channel reliability.

problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1)O(1) AoI regret, improving upon Θ(logT)Θ(\log T).

Framework for domain adaptation using pseudo-labels from unlabeled data.

problem Improving prediction accuracy in target domain with covariate shift.
method Kernel GLMs with labeled and pseudo-labeled data, using imputation model for target data.
result Non-asymptotic excess-risk bounds for effective labeled sample size.

In this paper we propose a domain adaptation algorithm designed for graph domains. Given a source graph with many labeled nodes and a target graph with few or no labeled nodes, we aim to estimate the target labels by making use of the similarity between the characteristics of the variation of the label functions on the…

2019-11-07abs ↗pdf ↗

Limbo is an open-source C++11 library for Bayesian optimization which is designed to be both highly flexible and very fast. It can be used to optimize functions for which the gradient is unknown, evaluations are expensive, and runtime cost matters (e.g., on embedded systems or robots). Benchmarks on standard functions …

2016-11-22abs ↗pdf ↗

Since manually labeling training data is slow and expensive, recent industrial and scientific research efforts have turned to weaker or noisier forms of supervision sources. However, existing weak supervision approaches fail to model multi-resolution sources for sequential data, like video, that can assign labels to in…

2019-10-21abs ↗pdf ↗

Method learns feature map between source and target domains for high-dimensional regression with missing features.

problem High-dimensional regression with differing feature sets in target and source domains.
method First learns a feature map between missing and observed features using source data, then imputes missing features in target domain, and performs two-step transfer learning for penalized regression.
result Developed upper bounds on estimation and prediction errors for HTL, showing dependence on model complexity, sample size, feature map quality, and domain differences.

End-to-end analysis of SGD for STL with adaptive sub-sampling.

problem Designing SGD for STL with statistical guarantees without prior knowledge of source quality.
method Mixed-sample SGD procedure that alternates between source and target data, maintaining transfer guarantees.
result Mixed-sample SGD converges to a target-adaptive solution with 1/T1/\sqrt{T} rate.

Results of the application of pattern recognition techniques to the problem of identifying Giant Radio Sources (GRS) from the data in the NVSS catalog are presented and issues affecting the process are explored. Decision-tree pattern recognition software was applied to training set source pairs developed from known NVS…

2016-03-22abs ↗pdf ↗

The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.

problem Sampling biases in training data lead to algorithmic biases in machine learning systems.
method The paper presents adaptive sampling methods to determine if it's possible to assemble a representative dataset from given data sources.
result The methods presented can determine with high confidence if a representative dataset can be assembled from given data sources.

Separating mixed distributions is a long standing challenge for machine learning and signal processing. Most current methods either rely on making strong assumptions on the source distributions or rely on having training samples of each source in the mixture. In this work, we introduce a new method---Neural Egg Separat…

2018-11-30abs ↗pdf ↗