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

Trend · papers per month

191381572762 · Jun 202019922001200920172026
48 results for noise rate estimation

Paper introduces ρρ-Perfect to estimate model-human correlation in subjective datasets.

problem Inherent noise in subjective ratings limits model-human correlation quantification.
method Defines ρρ-Perfect as highest achievable correlation between perfect predictor and human ratings. Estimates based on heteroscedastic noise scenarios.
result Demonstrates ρρ-Perfect can distinguish model limitations from data quality issues.

New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.

problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.

Nonlinear SGD achieves high-probability rates in non-convex optimization with heavy-tailed noise.

problem Optimization in non-convex problems with heavy-tailed noise.
method General nonlinear framework for SGD, including symmetrization techniques.
result Achieves O~(t1/2)\widetilde{\mathcal{O}}(t^{-1/2}) rate for heavy-tailed noise.

Paper estimates noise covariance in correlated multi-task linear models.

problem Estimating noise covariance in multi-task high-dimensional linear models with correlated noise.
method Uses multi-task elastic-net and lasso estimators to estimate noise covariance, correcting bias in squared residual matrix.
result Develops a novel estimator of noise covariance that converges at rate n1/2n^{-1/2}, matching oracle estimator under suitable conditions.

For binary classification we establish learning rates up to the order of n1n^{-1} for support vector machines (SVMs) with hinge loss and Gaussian RBF kernels. These rates are in terms of two assumptions on the considered distributions: Tsybakov's noise assumption to establish a small estimation error, and a new geometr…

2007-08-14abs ↗pdf ↗

Paper derives convergence rates and confidence intervals for LSA with Markovian noise.

problem Analyzing convergence rates and constructing confidence intervals for LSA with Markovian noise.
method Derives non-asymptotic Berry-Esseen bounds and multiplier block bootstrap procedure.
result Provides O(n1/4)\mathcal{O}(n^{-1/4}) convergence rates and guarantees consistent inference.

The paper proves the consistency and efficiency of a volatility estimator in noisy data.

problem Proving the consistency and efficiency of a volatility estimator in the presence of microstructure noise.
method Proves asymptotic normality using Central Limit Theorem for Fourier spot volatility estimator.
result Proves consistency and asymptotic efficiency of the Fourier spot volatility estimator in noisy data.

New methods improve estimation accuracy in noisy settings.

problem Estimating treatment effects in the presence of treatment noise.
method Developed new structure-agnostic cumulant estimators and practical procedures for higher-order robustness.
result Demonstrated that existing DML estimator is suboptimal for non-Gaussian treatment noise and introduced ACE procedures for improved accuracy.

Efficiently estimates linear models robust to corrupted data.

problem Learning linear models under adversarial corruption and minimal distributional assumptions.
method Develops a polynomial relaxation of independence to achieve optimal convergence rate.
result Achieves optimal convergence rate of ε22/kε^{2-2/k} for kk-hypercontractive distributions.

Adapts SGD to noise and problem specifics for faster convergence.

problem Minimizing smooth, strongly-convex functions with varying noise and problem constants.
method Adaptive SGD with exponentially decreasing step-sizes, Nesterov acceleration, and stochastic line-search.
result Achieves near-optimal convergence rates without knowing noise or problem specifics.

We formulate and study a general family of (continuous-time) stochastic dynamics for accelerated first-order minimization of smooth convex functions. Building on an averaging formulation of accelerated mirror descent, we propose a stochastic variant in which the gradient is contaminated by noise, and study the resultin…

2017-07-19abs ↗pdf ↗

Differential privacy is a cryptographically-motivated definition of privacy which has gained significant attention over the past few years. Differentially private solutions enforce privacy by adding random noise to a function computed over the data, and the challenge in designing such algorithms is to control the added…

2012-06-27abs ↗pdf ↗

Paper tackles noisy bandit feedback for multiclass classification.

problem Learning multiclass classifier with corrupted feedback.
method Proposes an unbiased estimator technique to estimate noise rates and an end-to-end framework.
result Algorithm achieves mistake bounds of O(T)O(\sqrt{T}) in high noise and O(Ticefrac23)O(T^{ icefrac{2}{3}}) in worst case.

The study investigates noise effects on parameter estimation for Ornstein-Uhlenbeck processes.

problem Impact of noise on parameter fitting for Ornstein-Uhlenbeck processes.
method Proposed algorithms to distinguish between thermal and multiplicative noise.
result Effective methods to estimate parameters even when multiplicative noise dominates.

New methods lift weak supervision to structured prediction, providing robustness guarantees.

problem Applying weak supervision techniques to structured prediction problems.
method Introducing pseudo-Euclidean embeddings, tensor decompositions, and invariants for consistent noise rate estimation.
result Generalization guarantees nearly identical to those for models trained on clean data.

Paper analyzes faster convergence rates for reinforcement learning from offline data.

problem Analyzing faster convergence rates for reinforcement learning from offline data.
method Fine analysis of reinforcement learning from offline data, providing fast rates for regret convergence.
result The paper provides fast rates for the regret convergence, showing that the level of exponentiation depends on the noise in the decision-making problem.

New algorithms reduce communication for sparse mean estimation in noisy distributed systems.

problem Sparse normal means estimation with limited communication in a distributed setting.
method Two distributed algorithms for estimating a sparse mean vector with sublinear communication.
result Correct support of the sparse mean can be recovered with significantly less communication than previously required.

The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where …

2015-02-24abs ↗pdf ↗

CWGD measures gradient diversity weighted by curvature, improving SGD convergence.

problem Gradient noise in high-curvature directions is underestimated by standard methods.
method CWGD weights gradient diversity by the inverse square root of the Hessian.
result CWGD-Cosine reduces optimization error by up to 20% compared to standard cosine annealing.

We address noisy Euclidean distances in high dimensions, estimating noise levels and correcting distances.

problem Distorted pairwise Euclidean distances due to heteroskedastic noise.
method Developed a hyperparameter-free approach to jointly estimate noise magnitudes and correct distances.
result Our method provides accurate noise magnitude estimates and corrected distances in high-dimensional settings.

Noise affects the effectiveness of interpolating models, especially those with strong inductive biases.

problem The impact of noise on interpolating models with strong inductive biases.
method Analyzing linear and classification models with sparse ground truths, proving fast rates for interpolators.
result Strong inductive biases can lead to faster but noisier interpolators, contrary to intuition.

We find the minimax rate of convergence in Hausdorff distance for estimating a manifold M of dimension d embedded in R^D given a noisy sample from the manifold. We assume that the manifold satisfies a smoothness condition and that the noise distribution has compact support. We show that the optimal rate of convergence …

2010-07-04abs ↗pdf ↗

In this paper, we study a classification problem in which sample labels are randomly corrupted. In this scenario, there is an unobservable sample with noise-free labels. However, before being observed, the true labels are independently flipped with a probability ρ[0,0.5)ρ\in[0,0.5), and the random label noise can be class-co…

2014-11-27abs ↗pdf ↗

We consider the dynamic linear regression problem, where the predictor vector may vary with time. This problem can be modeled as a linear dynamical system, with non-constant observation operator, where the parameters that need to be learned are the variance of both the process noise and the observation noise. While var…

2019-06-13abs ↗pdf ↗

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.

A new framework for PPLS combines noise estimation, optimization, and calibration.

problem Probabilistic PLS models need interpretable latent factors and calibrated uncertainty.
method End-to-end pipeline combining noise estimation, constrained optimization, and prediction calibration.
result Achieves near-nominal coverage and native calibrated uncertainty across benchmarks.

The study tackles rough noise in high-frequency financial data using fractional Brownian motion.

problem Impediments to analyzing high-frequency financial data due to noise.
method Assuming an efficient price process as a continuous Itô semimartingale, the study derives consistent estimators and confidence intervals for roughness parameters and volatilities.
result The rough noise model explains divergence rates in volatility signature plots over time and between assets.

We analyze a simple prefiltered variation of the least squares estimator for the problem of estimation with biased, semi-parametric noise, an error model studied more broadly in causal statistics and active learning. We prove an oracle inequality which demonstrates that this procedure provably mitigates the variance in…

2019-02-02abs ↗pdf ↗

Paper presents a deep learning method for estimating asset return precision matrices in noisy financial markets.

problem Estimating precision matrices of asset returns in low signal-to-noise ratio environments.
method Non-linear factor model within deep learning framework, consistent estimator with error covariance estimator.
result Superior accuracy in simulations and empirical data.

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.

New averaging technique speeds up Newton method convergence.

problem Superlinear convergence of stochastic Newton methods with noisy Hessians.
method Hessian averaging to reduce noise and maintain superlinear convergence.
result Hessian averaging achieves superlinear convergence with a non-asymptotic rate.