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

81161242322 · Jun 202019922001200920172026
48 results for Gaussian noise

Noise in SGD affects overparameterized models, favoring sparse solutions.

problem Understanding and mitigating implicit bias in SGD with parameter-dependent noise.
method Theoretical analysis of a quadratically-parameterized model with label noise and Gaussian noise.
result SGD with label noise recovers sparse ground-truth solutions, while SGD with Gaussian noise overfits dense solutions.

We revisit the Bayesian online inference problems for the linear dynamic systems (LDS) under non- Gaussian environment. The noises can naturally be non-Gaussian (skewed and/or heavy tailed) or to accommodate spurious observations, noises can be modeled as heavy tailed. However, at the cost of such noise robustness, the…

2015-04-22abs ↗pdf ↗

The chapter compares Gaussian process models for stochastic simulators with varying noise.

problem Modeling stochastic simulators with varying noise.
method Various Gaussian process models are compared, including input varying noise variance, non-Gaussian noise, and quantile modeling.
result Sequential design procedures are adapted for these models.

WS diffusion models handle anisotropic Gaussian noise better than conventional methods.

problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.

Real-world measurement noise in applications like robotics is often correlated in time, but we typically assume i.i.d. Gaussian noise for filtering. We propose general Gaussian Processes as a non-parametric model for correlated measurement noise that is flexible enough to accurately reflect correlation in time, yet sim…

2019-09-23abs ↗pdf ↗

Develops a new method to discover stochastic systems with non-Gaussian noise.

problem Discovering governing laws from complex systems with non-Gaussian noise.
method Theoretical framework and numerical algorithm to extract stochastic differential equations with Gaussian and non-Gaussian noise.
result Demonstrated the efficacy and accuracy of the approach on various systems.

Discrete Gaussian noise preserves privacy and accuracy in differential privacy.

problem Finite computers cannot represent continuous Gaussian noise, leading to privacy breaches and loss of interpretability.
method Introduced and analyzed discrete Gaussian noise, providing privacy and accuracy guarantees similar to continuous Gaussian noise.
result Discrete Gaussian noise offers the same privacy and accuracy as continuous Gaussian noise, with efficient sampling algorithms.

Optimal Gaussian noise mechanisms achieve nearly optimal error in unbiased mean estimation.

problem Efficiently estimating the mean of high-dimensional data while preserving privacy.
method Differential privacy mechanisms with Gaussian noise, focusing on optimal covariance.
result Gaussian noise mechanisms achieve nearly optimal error among all private unbiased mean estimation mechanisms.

Improved BO algorithms reduce prediction error under Gaussian noise.

problem Reducing prediction error in Bayesian optimization with Gaussian noise.
method Established new prediction error bounds for Gaussian process under frequentist setting.
result Proved improved convergence rates of cumulative regret for GP-UCB and GP-TS.

Paper uses VAEs to detect radar targets in complex noise.

problem Detecting radar targets in compound clutter and thermal noise.
method Proposes a VAE architecture to distinguish radar targets from various noise types.
result The VAE outperforms classical detectors in challenging noise conditions.

Using integration by parts on Gaussian space we construct a Stein Unbiased Risk Estimator (SURE) for the drift of Gaussian processes using their local and occupation times. By almost-sure minimization of the SURE risk of shrinkage estimators we derive an estimation and de-noising procedure for an input signal perturbed…

2008-09-09abs ↗pdf ↗

GNIs induce asymmetric heavy-tailed noise in SGD, affecting network performance.

problem The effect of Gaussian noise injections on SGD dynamics and network performance.
method Developed a Langevin-like SDE driven by asymmetric heavy-tailed noise to model the modified SGD dynamics.
result GNIs induce an implicit bias that varies with noise heaviness and asymmetry, affecting network performance.

DLPM replaces Gaussian noise with α-stable noise in DDPM, improving data distribution coverage and robustness.

problem Handling mode collapse and class imbalance in datasets with heavy-tailed noise.
method Extending DDPM to use α-stable noise, simplifying the process with elementary proof techniques.
result DLPM yields better coverage of data distribution tails, improved robustness to unbalanced datasets, and faster computation times.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

This work extracts stochastic dynamical systems with α\alpha-stable Lévy noise.

problem Extracting data-driven governing laws of dynamical systems with non-Gaussian noise.
method End-to-end deep learning approach for learning drift and diffusion coefficients for α\alpha-stable Lévy noise.
result Effectiveness of the method confirmed by numerical experiments.

We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the _p\ell\_p ball for p[1,]p \in [1, \infty] and Gaussian noise with an arbitrary covariance matrix. We characterize this robustness to random noise in terms of the distance to the decisio…

2018-02-22abs ↗pdf ↗

GaussDetect-LiNGAM eliminates Gaussianity tests for causal discovery.

problem Causal direction identification without Gaussianity assumptions.
method Leverages the equivalence between noise Gaussianity and residual independence in reverse regression.
result Gaussianity tests replaced with robust kernel-based independence tests.

Polynomial-time algorithm for learning halfspaces with Gaussian-distributed data and adversarial noise.

problem Learning halfspaces in the presence of adversarial label noise.
method Iterative soft localization technique enhanced with appropriate testers.
result Output a halfspace with misclassification error $O(\opt)+\eps$.

GNIs induce a regulariser that penalizes high-frequency components in neural network activations.

problem Understanding the regularizing effect of Gaussian noise injections on neural network activations.
method Deriving the explicit regularizer by marginalizing out injected noise and analyzing its effect in the Fourier domain.
result GNIs induce a regularizer that produces calibrated classifiers with large margins.

New findings on maximizing noise stability in partitions of Gaussian space.

problem Maximizing noise stability in partitions of Gaussian space.
method Analyzing the correlation between sets and their noise stability, proving conditional conjectures and hardness results.
result Hyperstable partitions maximize noise stability and have specific properties.

The Sampled Gaussian Mechanism's noise level decreases with larger subsampling rates, improving privacy-utility trade-offs.

problem Improving privacy-utility trade-offs in differentially private stochastic optimization.
method Proof of a conjecture about the Sampled Gaussian Mechanism's noise level and subsampling rate relationship.
result A rigorous proof of the conjecture, completing the proof of Theorem 6.2 in the original paper.

Study of asymmetric rank-one tensor models with non-Gaussian noise.

problem Analyzing maximum-likelihood estimators for asymmetric rank-one tensor models.
method Spectrally separated branch analysis, resolvent methods, cumulant expansions, Efron-Stein-type variance bounds.
result Asymptotic singular value and mode-wise alignments are robust to non-Gaussian noise.

Algorithm identifies and corrects noisy labels using Gaussian process regression.

problem Detecting and correcting real-valued noisy labels from mixed data.
method Gaussian process regression with heteroscedastic noise model and leave-one-out cross-validation.
result The method can pinpoint corrupted sample points and improve regression models.

Generative models improve for multiscale scientific data with new noise and interpolation techniques.

problem Numerical challenges in generating high-fidelity samples for multiscale scientific data.
method Design of noise distributions and interpolation schedules in function space to ensure Lipschitz regularity and finite noise roughness.
result Scale-adaptive noise and interpolation schedules improve numerical efficiency and fidelity of generated samples.

New method designs joint initial noises for diffusion models to improve diversity and alignment.

problem Independent initial noises limit diversity in generated images.
method Coupling of initial noises, maintaining Gaussian distribution while allowing dependence.
result Repulsive Gaussian coupling improves diversity without increasing sampling cost.

Method extracts stochastic systems with Lévy noise from data.

problem Identifying stochastic dynamical systems with Lévy noise from short data.
method Estimate Lévy jump measure and noise intensity, approximate drift coefficient.
result Accurate and effective method for discovering stochastic laws.

Exact recovery method for community detection in Gaussian mixtures with dependent noise.

problem Community detection in Gaussian mixtures with dependent and heterogeneous noise.
method Maximum likelihood estimator (MLE) for constrained quadratic optimization problem, using ΣΣ-whitened separation and local inequalities.
result Sharp exact-recovery threshold and no-gap mechanism in the unknown-size setting.

A new method for Gaussian filtering using gradient flows and Wasserstein metrics.

problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.

We study the statistical decision process of detecting the signal from a `signal+noise' type matrix model with an additive Wigner noise. We propose a hypothesis test based on the linear spectral statistics of the data matrix, which does not depend on the distribution of the signal or the noise. The test is optimal unde…

2020-01-16abs ↗pdf ↗

This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.

problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.

Polynomial-time tester-learner for general halfspaces with Gaussian adversarial noise.

problem Learning general halfspaces with adversarial label noise.
method Reduction to testable learning of nearly homogeneous halfspaces.
result First polynomial time tester-learner for general halfspaces with dimension-independent misclassification error.