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

3697381,1071,476 · Jun 202019922001200920172026
48 results for nonparametric noise models

Bayesian neural networks with nonparametric noise models for system identification.

problem Estimating parameters and noise processes in stochastic dynamic systems.
method Bayesian nonparametric approach using neural networks and Gibbs sampler.
result The method converges to full nonparametric Bayesian regression model.

Study on deep learning for speckle noise reduction in imaging modalities.

problem Multiplicative speckle noise challenges conventional deep learning methods for speckle denoising.
method Likelihood-based deep neural network (DNN) estimators for nonparametric regression under speckle noise.
result Established minimax rates for speckle denoising, matching those for additive Gaussian noise alone.

We develop a framework for learning sparse nonparametric directed acyclic graphs (DAGs) from data. Our approach is based on a recent algebraic characterization of DAGs that led to a fully continuous program for score-based learning of DAG models parametrized by a linear structural equation model (SEM). We extend this a…

2019-09-29abs ↗pdf ↗

Paper tackles label noise in large datasets, purifying noisy data with a nonparametric framework.

problem Label noise in large-scale datasets with coarse labels.
method Develops a model-agnostic nonparametric framework for classification.
result Framework purifies noisy data using a small clean dataset and manages ambiguous samples.

The paper creates nonparametric confidence bands for band-limited functions.

problem Estimating confidence bands for band-limited functions with finite samples and unknown noise.
method Uses Paley-Wiener reproducing kernel Hilbert spaces and gradient-perturbation methods.
result Non-asymptotic guarantees for confidence regions without assuming a parametric model.

Alternative hypothesis tests for class-conditional noise using local maximum likelihood.

problem Assessing label noise in supervised learning datasets.
method Proposes hypothesis tests based on local maximum likelihood estimation for nonparametric logistic regression.
result Shows improved applicability and flexibility of the proposed tests compared to parametric approaches.

GD with early stopping trains shallow neural nets for nonparametric regression robustly.

problem Learning Lipschitz regression functions with noisy labels.
method Overparameterized shallow neural networks trained by GD with early stopping.
result Optimal rates of convergence for nonparametric regression.

This work addresses various open questions in the theory of active learning for nonparametric classification. Our contributions are both statistical and algorithmic: -We establish new minimax-rates for active learning under common \textit{noise conditions}. These rates display interesting transitions -- due to the inte…

2017-03-16abs ↗pdf ↗

We analyze a family of methods for statistical causal inference from sample under the so-called Additive Noise Model. While most work on the subject has concentrated on establishing the soundness of the Additive Noise Model, the statistical consistency of the resulting inference methods has received little attention. W…

2013-12-19abs ↗pdf ↗

We study statistical detection of grayscale objects in noisy images. The object of interest is of unknown shape and has an unknown intensity, that can be varying over the object and can be negative. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required…

2011-02-23abs ↗pdf ↗

We present the Causal Gaussian Process Convolution Model (CGPCM), a doubly nonparametric model for causal, spectrally complex dynamical phenomena. The CGPCM is a generative model in which white noise is passed through a causal, nonparametric-window moving-average filter, a construction that we show to be equivalent to …

2018-02-22abs ↗pdf ↗

New method recovers causal DAGs from general environments without strict assumptions.

problem Recovering causal DAGs from real-world data with varying distributions.
method Formalizes desiderata for causal representation learning in general environments, leveraging sufficient change conditions up to third-order derivatives.
result Fully recovers latent DAG and identifies latent variables up to minor indeterminacies under nonparametric mixing.

Paper studies federated nonparametric testing with privacy constraints, achieving optimal rates and adaptive testing.

problem Federated nonparametric goodness-of-fit testing under distributed differential privacy constraints.
method Establishes matching lower and upper bounds on minimax separation rate, constructs adaptive testing procedure.
result Achieves optimal rates and demonstrates phase transition phenomena in federated testing.

In this work, we study the problem of learning the volatility under market microstructure noise. Specifically, we consider noisy discrete time observations from a stochastic differential equation and develop a novel computational method to learn the diffusion coefficient of the equation. We take a nonparametric Bayesia…

2018-05-15abs ↗pdf ↗

We investigate and compare the fundamental performance of several distributed learning methods that have been proposed recently. We do this in the context of a distributed version of the classical signal-in-Gaussian-white-noise model, which serves as a benchmark model for studying performance in this setting. The resul…

2017-11-08abs ↗pdf ↗

Ensemble learning is a standard approach to building machine learning systems that capture complex phenomena in real-world data. An important aspect of these systems is the complete and valid quantification of model uncertainty. We introduce a Bayesian nonparametric ensemble (BNE) approach that augments an existing ens…

2019-11-11abs ↗pdf ↗

Study improves robust nonparametric regression in heavy-tailed noise.

problem Robust nonparametric regression with heavy-tailed noise and unbounded functions.
method Huber regression in reproducing kernel Hilbert spaces (RKHS), probabilistic effective hypothesis space, new comparison theorems.
result Explicit finite-sample error bounds and convergence rates for Huber regression in RKHS under heavy-tailed noise.

Study on distributed nonparametric function estimation with optimal rate and cost of adaptation.

problem Optimal rate of convergence and cost of adaptation in distributed nonparametric function estimation.
method Distributed minimax estimation and adaptive estimation under communication constraints for Gaussian sequence model and white noise model.
result Established minimax rate of convergence and exact communication cost for adaptation.

Wavelet-based online learning adapts to noisy Besov spaces with high probability.

problem Minimizing integrated squared error in Besov spaces with noisy observations.
method Adaptive wavelet-based online learning algorithm that dynamically adjusts to gradient noise.
result Achieves minimax-optimal integrated squared error with high probability.

This paper examines how noise affects deep neural networks and improves their performance.

problem The impact of noise on the stability of deep ReLU neural networks for nonparametric regression.
method Investigates the optimal rate of convergence for deep ReLU neural networks under Huber loss, considering the p-th moment of noise and the smoothness of the function.
result The optimal rate of convergence cannot be achieved by ordinary least squares but can be by Huber loss with a properly chosen parameter.

A new graph-based approach for estimating complex data with manifold structure.

problem Regression of large-scale, complex data with underlying geometric structure and noises.
method Constructing a skeleton graph to capture geometric structure, defining metrics, and applying nonparametric regression.
result Statistical guarantees and effectiveness demonstrated through simulations and real data examples.

Proposes a robust clustering method using the Median-of-Means estimator.

problem Noise and outliers in data affect clustering quality and require specifying the number of clusters.
method Integrates model-based and centroid-based clustering methods using the Median-of-Means estimator.
result Mitigates noise effects and estimates the number of clusters automatically.

PAN+SR tackles scalable symbolic regression for large pp datasets.

problem Symbolic regression struggles with large number of input variables and measurement error.
method Combines ab initio nonparametric variable selection with SR to pre-screen and reduce search complexity.
result PAN+SR consistently enhances 19 SR methods' performance on challenging datasets.

We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectra…

2015-04-20abs ↗pdf ↗

Kernel embeddings of distributions and the Maximum Mean Discrepancy (MMD), the resulting distance between distributions, are useful tools for fully nonparametric two-sample testing and learning on distributions. However, it is rarely that all possible differences between samples are of interest -- discovered difference…

2017-03-22abs ↗pdf ↗

We consider the non-parametric regression problem under Huber's εε-contamination model, in which an εε fraction of observations are subject to arbitrary adversarial noise. We first show that a simple local binning median step can effectively remove the adversary noise and this median estimator is minimax optimal up t…

2018-05-26abs ↗pdf ↗

Improved likelihood estimation for singular distributions using deep models.

problem Estimating singular distributions using deep generative models.
method Data perturbation to avoid singularity issues in likelihood estimation.
result Consistent estimation of target distribution with desirable rates.

A nonparametric Bayesian sparse graph linear dynamical system (SGLDS) is proposed to model sequentially observed multivariate data. SGLDS uses the Bernoulli-Poisson link together with a gamma process to generate an infinite dimensional sparse random graph to model state transitions. Depending on the sparsity pattern of…

2018-02-21abs ↗pdf ↗

Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…

2016-01-13abs ↗pdf ↗

Regularization helps resolve ambiguity in mean-variance models, improving predictive uncertainty quantification.

problem Signal-to-noise ambiguity in overparameterized mean-variance models.
method Statistical field theory framework to explain phase transition.
result Regularization reduces variability and improves predictive uncertainty quantification.

A new method for learning function parameters in operators using data-adaptive RKHS.

problem Learning function parameters in operators with robustness to noise and numerical error.
method Data Adaptive RKHS Tikhonov Regularization (DARTR) method.
result DARTR leads to an accurate estimator robust to noise and numerical error, converging at a consistent rate as data refines.

The paper improves nonparametric confidence bands for band-limited functions.

problem Constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees.
method Based on Paley-Wiener reproducing kernel Hilbert spaces, the paper relaxes assumptions, improves noise estimation, and tightens constraints.
result Enhanced confidence bands with improved efficiency and tighter constraints.

Optimal distributed testing under communication constraints with shared randomness.

problem Signal detection in a distributed system with limited communication.
method Derivation of minimax testing errors, distributed testing algorithms, and theoretical lower bounds.
result Consistent nonparametric distributed testing is possible even with minimal communication.