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

Trend · papers per month

183367550733 · Jun 202019922001200920172026
48 results for noisy demonstrations

Novel framework learns policies from noisy expert demonstrations.

problem Learning effective policies with noisy expert demonstrations.
method Adaptive learning framework that jointly interacts with the environment and expert demonstrations, assigning weights to filter out noisy demonstrations.
result The proposed approach learns robustly with noisy demonstrations and achieves higher performance in fewer iterations.

Paper improves 0\ell^{0}-SSC for noisy data by proving SDP and proposing Noisy-DR-0\ell^{0}-SSC.

problem Noisy data and less restrictive subspace affinity in sparse subspace clustering.
method Proposes Noisy-DR-0\ell^{0}-SSC, which projects data onto a lower dimensional space and then applies noisy 0\ell^{0}-SSC.
result Theoretical guarantee on the correctness of noisy 0\ell^{0}-SSC in terms of SDP on noisy data.

In this paper we demonstrate continuous noisy speech recognition using connectionist temporal classification (CTC) model on limited Chinese vocabulary using electroencephalography (EEG) features with no speech signal as input and we further demonstrate single CTC model based continuous noisy speech recognition on limit…

2019-06-17abs ↗pdf ↗

In this paper we demonstrate end-to-end continuous speech recognition (CSR) using electroencephalography (EEG) signals with no speech signal as input. An attention model based automatic speech recognition (ASR) and connectionist temporal classification (CTC) based ASR systems were implemented for performing recognition…

2019-06-17abs ↗pdf ↗

New algorithm optimizes matrix reordering for noisy disordered matrices.

problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.

Thompson Sampling tackles noisy context in stochastic bandits.

problem Designing an action policy for noisy, corrupted contexts in stochastic bandits.
method Introducing a Thompson Sampling algorithm for Gaussian bandits with Gaussian context noise, adopting an information-theoretic analysis.
result Demonstrates the Bayesian regret of the proposed algorithm concerning the oracle's action policy.

Deep neural networks solve noisy, complex problems accurately.

problem Reconstructing solutions from noisy, high-dimensional, non-linear inverse problems.
method Restricting infinite-dimensional forward operators to finite-dimensional spaces, training neural networks to approximate these operators robustly to noise.
result Deep neural networks can accurately solve high-dimensional, noisy, non-linear inverse problems.

We present a principled framework to address resource allocation for realizing boosting algorithms on substrates with communication or computation noise. Boosting classifiers (e.g., AdaBoost) make a final decision via a weighted vote from the outputs of many base classifiers (weak classifiers). Suppose that the base cl…

2019-09-10abs ↗pdf ↗

A comprehensive methodology is provided for smoothing noisy, irregularly sampled data with non-Gaussian noise using smoothing splines. We demonstrate how the spline order and tension parameter can be chosen a priori from physical reasoning. We also show how to allow for non-Gaussian noise and outliers which are typical…

2019-04-26abs ↗pdf ↗

The paper analyzes generalization of noisy iterative algorithms using communication theory.

problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.

The performance of automatic speech recognition systems(ASR) degrades in the presence of noisy speech. This paper demonstrates that using electroencephalography (EEG) can help automatic speech recognition systems overcome performance loss in the presence of noise. The paper also shows that distillation training of auto…

2019-03-02abs ↗pdf ↗

The ability of learning from noisy labels is very useful in many visual recognition tasks, as a vast amount of data with noisy labels are relatively easy to obtain. Traditionally, the label noises have been treated as statistical outliers, and approaches such as importance re-weighting and bootstrap have been proposed …

2017-03-07abs ↗pdf ↗

Optimization with noisy gradients has become ubiquitous in statistics and machine learning. Reparameterization gradients, or gradient estimates computed via the "reparameterization trick," represent a class of noisy gradients often used in Monte Carlo variational inference (MCVI). However, when these gradient estimator…

2017-05-22abs ↗pdf ↗

Datasets with significant proportions of noisy (incorrect) class labels present challenges for training accurate Deep Neural Networks (DNNs). We propose a new perspective for understanding DNN generalization for such datasets, by investigating the dimensionality of the deep representation subspace of training samples. …

2018-06-07abs ↗pdf ↗

New metric compares noisy neural trajectories using optimal transport.

problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.

A fast method approximates likelihood scores for noisy linear inverse problems.

problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.

Large-scale datasets may contain significant proportions of noisy (incorrect) class labels, and it is well-known that modern deep neural networks (DNNs) poorly generalize from such noisy training datasets. To mitigate the issue, we propose a novel inference method, termed Robust Generative classifier (RoG), applicable …

2019-01-31abs ↗pdf ↗

A corrected EI acquisition function handles noisy observations in Bayesian optimization.

problem Noisy observations in Bayesian optimization.
method Proposes a modified expected improvement (EI) acquisition function that incorporates covariance information from the Gaussian Process model.
result Achieves a sublinear convergence rate on cumulative regret bound under heteroscedastic observation noise.

Paper proposes an alternative to anchor points for learning with noisy labels.

problem Learning with noisy labels is challenging due to inaccurate labels.
method Estimates transition matrix using clusterability condition and noisy labels.
result Estimation of transition matrix is more accurate and efficient than anchor points.

Despite the success of deep neural networks (DNNs) in image classification tasks, the human-level performance relies on massive training data with high-quality manual annotations, which are expensive and time-consuming to collect. There exist many inexpensive data sources on the web, but they tend to contain inaccurate…

2018-12-13abs ↗pdf ↗

Paper tackles noisy labels for non-decomposable performance measures.

problem Learning from noisy labels for non-decomposable performance measures.
method Designs algorithms for multiclass non-decomposable performance measures using Frank-Wolfe and Bisection methods, corrected for class-conditional noise.
result Noise-corrected algorithms are Bayes consistent, converging to optimal performance.

JoCoR improves deep learning with noisy labels by reducing network diversity.

problem Learning with noisy labels in deep learning.
method JoCoR uses two networks to make predictions, calculates a joint loss with Co-Regularization, and updates both networks simultaneously.
result JoCoR outperforms state-of-the-art approaches in learning with noisy labels.

Randomized experiments are the gold standard for evaluating the effects of changes to real-world systems. Data in these tests may be difficult to collect and outcomes may have high variance, resulting in potentially large measurement error. Bayesian optimization is a promising technique for efficiently optimizing multi…

2017-06-21abs ↗pdf ↗

Proposes a new model for noisy labels considering multiple labelers and adversarial attacks.

problem Real-world noisy label models with multiple labelers and adversarial attacks.
method Labeler-dependent noise model with adversarial attack vectors.
result State-of-the-art approaches for learning from noisy labels are defeated by adversarial label attacks.

Noisy labeled data represent a rich source of information that often are easily accessible and cheap to obtain, but label noise might also have many negative consequences if not accounted for. How to fully utilize noisy labels has been studied extensively within the framework of standard supervised machine learning ove…

2019-02-20abs ↗pdf ↗

This paper improves loss functions for deep learning with noisy labels.

problem Training deep neural networks with noisy labels.
method The paper introduces a normalization technique to make any loss function robust to noisy labels and proposes a framework called Active Passive Loss (APL) to combine robust loss functions.
result The proposed APL framework consistently outperforms state-of-the-art methods, especially under high noise rates.

The abundance of data produced daily from large variety of sources has boosted the need of novel approaches on causal inference analysis from observational data. Observational data often contain noisy or missing entries. Moreover, causal inference studies may require unobserved high-level information which needs to be …

2017-03-13abs ↗pdf ↗