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

59117176234 · Jun 202019922001200920172026
48 results for Noise Sensitivity

Proposes a differentially private bandit algorithm reducing noise over time.

problem Privacy concerns in interactive recommendation systems.
method Tree-based mechanism to add Laplace or Gaussian noise to model parameters, focusing on dynamic global sensitivity.
result Demonstrates (ε,δ)(ε, δ)-differential privacy with reduced noise and improved regret.

Study examines noise sensitivity of DNNs for binary classification.

problem Understanding non-robustness of DNN classifiers under noise.
method Defined and extended noise sensitivity and stability concepts for Boolean functions, applied to DNN models.
result Sorted out the relation between definitions and properties of DNN architectures under noise.

New method for certified unlearning reduces noise injection.

problem Achieving formal unlearning guarantees with adaptive noise calibration.
method Adaptive per-instance noise calibration based on individual data point sensitivities.
result Derivation of high-probability per-instance sensitivity bounds for ridge regression.

Deep Convolutional Networks (DCNs) have been shown to be sensitive to Universal Adversarial Perturbations (UAPs): input-agnostic perturbations that fool a model on large portions of a dataset. These UAPs exhibit interesting visual patterns, but this phenomena is, as yet, poorly understood. Our work shows that visually …

2019-06-08abs ↗pdf ↗

In binary classification framework, we are interested in making cost sensitive label predictions in the presence of uniform/symmetric label noise. We first observe that 00-11 Bayes classifiers are not (uniform) noise robust in cost sensitive setting. To circumvent this impossibility result, we present two schemes; un…

2019-01-08abs ↗pdf ↗

Fairness-aware learning involves designing algorithms that do not discriminate with respect to some sensitive feature (e.g., race or gender). Existing work on the problem operates under the assumption that the sensitive feature available in one's training sample is perfectly reliable. This assumption may be violated in…

2019-01-30abs ↗pdf ↗

Diffusion models accurately recover mixture weights from generated samples despite score function insensitivity.

problem Score-based generative models often fail to learn correct relative mode amplitudes (mixture weights) from generated samples.
method Relate diffusion score matching (DSM) loss to mixture weight estimation error, define diffusion score sensitivity index (DSSI), and prove its governing role in mixture weight recovery.
result Generated samples can accurately recover mixture weights from the DSM loss, even when the target score is insensitive to mixture weights.

Noise Sensitivity Exponent controls statistical-computational gaps in learning.

problem Understanding when learning is statistically possible yet computationally hard in high-dimensional statistics.
method Investigating statistical-computational gaps in single- and multi-index models using Noise Sensitivity Exponent.
result Noise Sensitivity Exponent governs statistical-computational gaps in high-dimensional learning.

New method calibrates noise for attack risk, improving ML model accuracy.

problem Improving accuracy of privacy-preserving ML models while maintaining privacy.
method Directly calibrates noise scale to a desired attack risk level, bypassing the standard ε\varepsilon-calibration.
result Significantly decreases noise scale, leading to increased utility at the same risk level.

Privacy preserving machine learning algorithms are crucial for learning models over user data to protect sensitive information. Motivated by this, differentially private stochastic gradient descent (SGD) algorithms for training machine learning models have been proposed. At each step, these algorithms modify the gradie…

2019-08-20abs ↗pdf ↗

Study optimizes interbank lending and borrowing to reduce systemic risk.

problem Optimizing lending and borrowing in interbank markets to mitigate systemic risk.
method Risk-sensitive mean field games with common noise, convex analysis, Fokker-Planck equations, first hitting time method.
result Risk-averse behavior reduces individual and systemic bank risks.

Noise injection improves inference privacy in DNN models.

problem Malicious servers can infer sensitive attributes from input data.
method Adaptive Noise Injection (ANI) using a lightweight DNN on the client.
result Significant improvement in privacy (up to 48.5% degradation in sensitive-task accuracy with <1% degradation in primary accuracy).

Paper develops methods for fair insurance pricing without direct access to sensitive attributes.

problem Fairness in insurance pricing with restricted access to sensitive attributes.
method Develops statistical methods for estimating discrimination-free premiums using privatized sensitive attributes.
result The proposed methods enable fair insurance pricing while respecting privacy and regulatory constraints.

Proposes a text perturbation method using a Mahalanobis metric to balance privacy and utility.

problem Low utility of text analysis when using spherical noise for privacy-preserving text embedding.
method Regularized Mahalanobis metric to add elliptical noise, accounting for embedding space density.
result Improves privacy statistics while maintaining utility, outperforming Laplace mechanism.

Gradient-based methods introduce noise that penalizes models sensitive to weight perturbations.

problem Noise in gradient-based optimization methods.
method Analysis of Gradient Descent (GD) and Stochastic Gradient Descent (SGD) updating all parameters simultaneously.
result Noise introduced by simultaneous parameter updates penalizes models sensitive to weight perturbations.

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.

New methods for calculating credit valuation adjustment with reduced noise and faster computation.

problem High statistical noise in computing sensitivities of CVA due to non-differentiable default intensities.
method Ad hoc analytical estimators to overcome non-differentiability and finite differences.
result Low statistical noise and fast computation of sensitivities to market quotes.

Bayesian approach improves AdaLoRA's performance and efficiency.

problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.

Boosting is known to be sensitive to label noise. We studied two approaches to improve AdaBoost's robustness against labelling errors. One is to employ a label-noise robust classifier as a base learner, while the other is to modify the AdaBoost algorithm to be more robust. Empirical evaluation shows that a committee of…

2013-09-26abs ↗pdf ↗

Noise can affect the overparametrization of QNNs, enabling new directions but also suppressing sensitivity.

problem The overparametrization of QNNs in the presence of noise.
method Analyzing the Quantum Fisher Information Matrix (QFIM) to understand how noise affects the rank of QFIM.
result Noise can turn previously-zero eigenvalues of the QFIM to non-zero, enabling exploration of new directions.

The Gradient Boosting Decision Tree (GBDT) is a popular machine learning model for various tasks in recent years. In this paper, we study how to improve model accuracy of GBDT while preserving the strong guarantee of differential privacy. Sensitivity and privacy budget are two key design aspects for the effectiveness o…

2019-11-11abs ↗pdf ↗

Explaining the output of a deep network remains a challenge. In the case of an image classifier, one type of explanation is to identify pixels that strongly influence the final decision. A starting point for this strategy is the gradient of the class score function with respect to the input image. This gradient can be …

2017-06-12abs ↗pdf ↗

Study examines robustness of NPI effectiveness models against COVID-19.

problem How do NPI effectiveness estimates vary with model assumptions and data?
method Investigated 2 NPI effectiveness models and 6 variants, evaluated robustness to unseen countries, parameters, and data.
result NPI effectiveness estimates are remarkably robust to different variables.

FCNv2 robustness tested under noise and random initial conditions.

problem Assessing AI weather forecasting model robustness to input noise.
method Two experiments with varying noise levels and random initial conditions.
result FCNv2 preserves hurricane features under low to moderate noise, but underestimates intensity and persistence.

Adaptive truncation improves privacy in online Bayesian estimation.

problem Ensuring privacy in online Bayesian estimation of a static parameter.
method Sequential Monte Carlo, adaptive truncation, Thompson sampling.
result Adaptive truncation reduces privacy-preserving noise, enabling more accurate estimation.

The paper proposes a method to learn differentially private variational autoencoders with term-wise gradient aggregation.

problem Learning variational autoencoders with differential privacy constraints and multiple divergences.
method Term-wise Differentially Private SGD (DP-SGD) that crafts randomized gradients for each loss term, keeping sensitivity at O(1).
result The method reduces the amount of noise needed for differential privacy, allowing better learning.

TSLANet improves time series models by capturing long-term and short-term interactions.

problem Noise sensitivity, computational efficiency, and overfitting in Transformer-based models for time series data.
method Adaptive Spectral Block and Interactive Convolution Block for robust feature representation and noise mitigation.
result TSLANet outperforms state-of-the-art models in various time series tasks.

Study uses Bayesian Optimization to analyze noise effects in materials research.

problem Optimizing materials with many variables and experimental noise.
method Batch Bayesian Optimization with synthetic data analysis.
result Noise sensitivity varies by problem landscape, impacting optimization outcomes.

Optimal AFs minimize RFR test error and sensitivity.

problem Finding optimal AFs for RFR to minimize test error and sensitivity.
method Closed-form solution for AFs minimizing test error and sensitivity under different functional parsimony.
result Optimal AFs can be linear, saturated linear, or Hermite polynomial expressions.

RDP-GAN improves GAN privacy by adding random noises to loss function.

problem Protecting sensitive information in GANs while maintaining quality of generated samples.
method Integrates Rényi-differential privacy into GAN training process by adding random noises to loss function.
result Achieves better privacy protection with high-quality samples compared to existing methods.

Iteratively reweighted least squares (IRLS) is a widely-used method in machine learning to estimate the parameters in the generalised linear models. In particular, IRLS for L1 minimisation under the linear model provides a closed-form solution in each step, which is a simple multiplication between the inverse of the we…

2016-05-24abs ↗pdf ↗

The study sets lower bounds on MMSE for inferring sensitive features from noisy data.

problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.

Unified approach improves accuracy in private estimation.

problem Protecting sensitive information in statistical estimation.
method Unified Bayes Private Point (UBaPP) approach to Bayes point estimation under differential privacy constraints.
result Achieves better accuracy-privacy trade-off than traditional methods.