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

Trend · papers per month

55110164219 · Jun 202019922001200920172026
48 results for noisy-input regression

The study examines denoising and noisy-input regression under distribution shift, revealing double descent behavior and insights for data augmentation.

problem Understanding denoising in machine learning, especially under noisy inputs and distribution shift.
method Theoretical analysis of supervised denoising and noisy-input regression, considering low-rank data and proportional regime.
result The test error exhibits double descent under general distribution shift, indicating that overfitting the noise can be benign, tempered, or catastrophic.

Improves magnetic field mapping using an array of magnetometers with noisy input.

problem Improving magnetic field maps in indoor environments with noisy magnetometer data.
method Uses Gaussian process regression with an array of magnetometers, incorporating known array positions and relative magnetometer locations.
result The method produces higher quality magnetic field maps compared to using a single magnetometer.

Optimal multiscale learning of linear operators

problem Statistical and computational limits of learning bounded linear operators between Sobolev spaces
method Reformulate as an infinite-dimensional matrix regression problem with heterogeneous multiscale structure
result Establish minimax rates and construct a finite-resolution blockwise least-squares estimator attaining these rates

We study the Gaussian Process regression model in the context of training data with noise in both input and output. The presence of two sources of noise makes the task of learning accurate predictive models extremely challenging. However, in some instances additional constraints may be available that can reduce the unc…

2015-06-30abs ↗pdf ↗

Student-teacher learning improves generalization with noisy inputs.

problem Transfer knowledge from clean inputs to noisy inputs.
method Analyzes student-teacher learning using deep linear networks and experiments with nonlinear networks.
result Three factors are vital for success: zero training loss, teacher knowledge, and feature decomposition.

We consider the problem of robust optimization within the well-established Bayesian optimization (BO) framework. While BO is intrinsically robust to noisy evaluations of the objective function, standard approaches do not consider the case of uncertainty about the input parameters. In this paper, we propose Noisy-Input …

2020-02-07abs ↗pdf ↗

Proposes a new method for robust uncertainty quantification in regression tasks.

problem Robust uncertainty estimation for deep neural networks in regression tasks.
method Generalized Auxiliary Uncertainty Estimator (AuxUE) scheme, considering both aleatoric and epistemic uncertainties.
result DIDO method provides robust uncertainty estimates in noisy inputs, scalable to image-level and pixel-wise tasks.

Algorithm identifies bilinear dynamical systems from noisy data.

problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.

A hybrid neural network improves robustness in estimating vehicle parameters from noisy data.

problem Estimating parameters of a mechanical vehicle model from noisy acceleration data.
method Introduced a convolutional neural network with two objective functions: naive and hybrid.
result The hybrid objective function outperforms the naive one in robustness on noisy input data.

Proposes a new model to handle noisy data in scientific research.

problem Measurement error in noisy data settings.
method Measurement error BART (meBART) integrates measurement error in Bayesian additive regression trees.
result meBART provides more accurate parameter estimation, robust uncertainty quantification, and superior predictive performance.

In recent years, impressive progress has been made in the design of implicit probabilistic models via Generative Adversarial Networks (GAN) and its extension, the Conditional GAN (CGAN). Excellent solutions have been demonstrated mostly in image processing applications which involve large, continuous output spaces. The…

2019-05-30abs ↗pdf ↗

CNNs achieve remarkable performance by leveraging deep, over-parametrized architectures, trained on large datasets. However, they have limited generalization ability to data outside the training domain, and a lack of robustness to noise and adversarial attacks. By building better inductive biases, we can improve robust…

2019-02-27abs ↗pdf ↗

In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different t…

2013-08-15abs ↗pdf ↗

Problems in machine learning (ML) can involve noisy input data, and ML classification methods have reached limiting accuracies when based on standard ML data sets consisting of feature vectors and their classes. Greater accuracy will require incorporation of prior structural information on data into learning. We study …

2012-12-19abs ↗pdf ↗

Recently deep neural networks have been successfully used for various classification tasks, especially for problems with massive perfectly labeled training data. However, it is often costly to have large-scale credible labels in real-world applications. One solution is to make supervised learning robust with imperfectl…

2018-11-09abs ↗pdf ↗

Graph convolutional networks (GCNs) are vulnerable to perturbations of the graph structure that are either random, or, adversarially designed. The perturbed links modify the graph neighborhoods, which critically affects the performance of GCNs in semi-supervised learning (SSL) tasks. Aiming at robustifying GCNs conditi…

2019-10-21abs ↗pdf ↗

Algorithms that fuse multiple input sources benefit from both complementary and shared information. Shared information may provide robustness against faulty or noisy inputs, which is indispensable for safety-critical applications like self-driving cars. We investigate learning fusion algorithms that are robust against …

2019-06-11abs ↗pdf ↗

We introduce and analyze stochastic optimization methods where the input to each gradient update is perturbed by bounded noise. We show that this framework forms the basis of a unified approach to analyze asynchronous implementations of stochastic optimization algorithms.In this framework, asynchronous stochastic optim…

2015-07-24abs ↗pdf ↗

Mathematical pipeline identifies structural homology of knotted proteins.

problem Quantification and classification of protein structures, especially knotted proteins, require noise-free and complete data.
method Developed a geometric framework using persistent homology to analyze protein structures.
result Persistent homology accurately represents structural homology of knotted proteins and identifies geometric features of protein entanglement.

This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the i…

2017-10-30abs ↗pdf ↗

Reprogram deep models to resist adversarial attacks without changing parameters.

problem Improving deep learning models' robustness against adversarial and noisy inputs.
method Proposes a non-linear robust pattern matching technique and three reprogramming paradigms.
result Demonstrates effective reprogramming of deep models for robustness without altering parameters.

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

problem Constructing reliable confidence regions for band-limited functions from noisy data.
method Improved norm bounds using Hoeffding's inequality and empirical Bernstein bound, majority voting to aggregate intervals.
result Confidence intervals retain their simultaneous coverage guarantee even when aggregated from random subsamples.

Exact bounds derived for neural network outputs with noisy inputs.

problem Bounding the output distribution of neural networks with random inputs.
method Applying ReLU NNs to derive bounds for general NNs, then using these to find exact error guarantees.
result Exact upper and lower bounds for the output distribution of neural networks with random inputs.

Generative adversarial networks (GAN) have recently been shown to be efficient for speech enhancement. However, most, if not all, existing speech enhancement GANs (SEGAN) make use of a single generator to perform one-stage enhancement mapping. In this work, we propose to use multiple generators that are chained to perf…

2020-01-15abs ↗pdf ↗

Sum-Product Networks (SPNs) are hierarchical, graphical models that combine benefits of deep learning and probabilistic modeling. SPNs offer unique advantages to applications demanding exact probabilistic inference over high-dimensional, noisy inputs. Yet, compared to convolutional neural nets, they struggle with captu…

2019-02-16abs ↗pdf ↗

S2MAM improves semi-supervised learning by selecting relevant variables and updating similarity metrics.

problem Joint learning from labeled and unlabeled data with geometric structure.
method Bilevel optimization scheme for automatic variable selection and similarity matrix update.
result The proposed S2MAM achieves robust and interpretable predictions.

Attention-only transformers learn from context via two stages of inference.

problem Learning from corrupted token sequences in minimal transformers.
method Two-stage empirical Bayes interpretation: kernel-weighted posterior mean and particle dynamics.
result Effective denoising without explicit noise schedules, showing posterior-mean recovery under asymptotic conditions.

The study establishes minimax bounds for estimating operators from noisy samples.

problem Estimating unknown operators between Hilbert spaces from noisy data.
method Developed a minimax theory for uniformly bounded Lipschitz operators, proving lower and upper bounds.
result Sharp characterizations of minimax risk for generic Lipschitz operators, showing a curse of sample complexity.

Noise is an inherent issue of low-light image capture, one which is exacerbated on mobile devices due to their narrow apertures and small sensors. One strategy for mitigating noise in a low-light situation is to increase the shutter time of the camera, thus allowing each photosite to integrate more light and decrease n…

2017-12-15abs ↗pdf ↗

Unified empirical and variational Bayes for unnormalized densities.

problem Approximating unnormalized densities using latent variable models.
method Formulate a latent variable model for Y=X+N(0,σ2Id)Y=X+N(0,σ^2 I_d), use ELBO as parametrization of YY's energy function, and estimate XX with empirical Bayes least-squares.
result UVB has higher capacity to approximate energy functions than MLPs in DEEN.

The Perona-Malik model has been very successful at restoring images from noisy input. In this paper, we reinterpret the Perona-Malik model in the language of Gaussian scale mixtures and derive some extensions of the model. Specifically, we show that the expectation-maximization (EM) algorithm applied to Gaussian scale …

2016-12-19abs ↗pdf ↗

Unified Bayesian framework for LTV system identification using neural networks and Gaussian Processes.

problem Identifying Linear Time-Varying systems from input-output data.
method Bayesian modeling of impulse response as a stochastic process, using neural networks and Gaussian Processes for inference.
result Framework can infer LTI system properties from a single noisy input-output pair, achieving lower error than classical methods.

M2M tackles zero-shot structured noise suppression in images.

problem Structured noise with strong anisotropic correlations in real-world images.
method M2M introduces a novel sampling strategy that generates pseudo-independent sub-image pairs from a single noisy input, using directional interpolation and generalized median filtering.
result M2M consistently outperforms state-of-the-art zero-shot methods under correlated noise.

Enhances robustness of deep neural networks with randomized smoothing.

problem Improving robustness of deep neural networks against noisy inputs and adversarial attacks.
method Introduces a variance-margin trade-off approach to increase certified robust radius using pre-trained models.
result Significant improvement in certified accuracy compared to state-of-the-art methods.

It is a common practice in the machine learning community to assume that the observed data are noise-free in the input attributes. Nevertheless, scenarios with input noise are common in real problems, as measurements are never perfectly accurate. If this input noise is not taken into account, a supervised machine learn…

2020-01-28abs ↗pdf ↗

This paper explains how batch normalization auto-tunes the regularization parameter based on data statistics.

problem Batch normalization accelerates deep learning training but the exact relationship to regularization is unclear.
method Theoretical analysis and empirical validation of batch normalization's role in auto-tuning the regularization parameter.
result Batch normalization auto-tunes the regularization parameter based on data statistics.

Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.

problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.