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

Trend · papers per month

56112168224 · Jun 202019922001200920172026
48 results for advancing noise

Study examines the training process of an unsupervised learning model for detecting gravitational-wave transient noise.

problem Transient noise in gravitational-wave detector data causes instability and signal overlap.
method Unsupervised deep learning with variational autoencoder and invariant information clustering applied to the Gravity Spy dataset.
result Training process of the unsupervised learning architecture is examined and reported.

Introduces CCR for constructing confidence regions from conformal predictions.

problem Challenges in constructing confidence regions for model parameters.
method Combines conformal prediction intervals for model outputs to establish confidence regions for parameters under minimal assumptions.
result Valid coverage guarantees for finite sample regime, applicable to various model types.

BeGIN benchmarks GNNs for instance-dependent label noise in graphs.

problem Instance-dependent label noise in graph data.
method BeGIN introduces a benchmark with various noise types and evaluates noise-handling strategies across GNN architectures.
result Challenges of instance-dependent noise, especially LLM-based corruption, and the importance of node-specific parameterization.

Semi-supervised learning lately has shown much promise in improving deep learning models when labeled data is scarce. Common among recent approaches is the use of consistency training on a large amount of unlabeled data to constrain model predictions to be invariant to input noise. In this work, we present a new perspe…

2019-04-29abs ↗pdf ↗

New insights on robust learning under strong noise models.

problem Challenging label-noise models in robust learning.
method Extending statistical query framework to more general noise models and using evolutionary algorithms.
result First polynomial time algorithm for learning linear threshold functions with arbitrarily small excess error in presence of Tsybakov noise.

Noise can stabilize systemic risk models with uncertain robustness.

problem Understanding systemic risk in financial systems with uncertain parameters.
method Analyzing a mean-field model of systemic risk with uncertain coefficients and noise.
result Noise can induce stability in systemic risk models, contrary to intuition.

We introduce NoisyNet, a deep reinforcement learning agent with parametric noise added to its weights, and show that the induced stochasticity of the agent's policy can be used to aid efficient exploration. The parameters of the noise are learned with gradient descent along with the remaining network weights. NoisyNet …

2017-06-30abs ↗pdf ↗

In this paper, benefiting from the strong ability of deep neural network in estimating non-linear functions, we propose a discriminative embedding function to be used as a feature extractor for clustering tasks. The trained embedding function transfers knowledge from the domain of a labeled set of morphologically-disti…

2018-05-07abs ↗pdf ↗

Enhances deep learning robustness to noise without sacrificing clean data accuracy.

problem Robustness of deep neural networks to input noise.
method Discriminative loss at penultimate layer and class-wise feature alignment with Gaussian noise.
result Improves robustness to various perturbations without degrading clean data accuracy.

This paper explores BDL hyperparameters for robust polynomial mapping with noise.

problem Designing BDL hyperparameters for robust function mapping with uncertainty quantification.
method Mapping Bayesian connectionist representations to polynomials of varying orders and noise types.
result Optimal network depth and ensemble size for prediction and uncertainty quantification.

ANT improves TS diffusion models by automatically determining noise schedules.

problem Suboptimal performance of TS diffusion models due to lack of domain-specific noise schedules.
method ANT proposes an adaptive noise schedule that automatically determines proper noise schedules for TS datasets based on their statistics.
result ANT achieves state-of-the-art performance on various TS tasks, including forecasting, refinement, and generation.

SymNoise improves language model fine-tuning by 6.7% over NEFTune, using symmetric noise.

problem Improving performance of language models through noise-based fine-tuning.
method Introducing SymNoise, a new fine-tuning method using symmetric noise in embeddings.
result SymNoise increases model performance by 69.04% on AlpacaEval compared to NEFTune's 64.69%.

This paper analyzes bias-variance trade-off for clipped SFOMs, improving complexity guarantees for heavy-tailed noise.

problem Improving complexity guarantees for stochastic optimization methods with heavy-tailed noise.
method Novel analysis of bias-variance trade-off in gradient clipping for clipped SFOMs.
result Improved complexity guarantees for clipped SFOMs across various tail indices, including infinite mean 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.

We study the problem of recovering an incomplete m×nm\times n matrix of rank rr with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer vision, system identification, etc. The challenge is to design provable algorithms…

2016-12-01abs ↗pdf ↗

New method identifies causal graphs with limited data and noise.

problem Identifying causal graphs from observational data is generally impossible.
method Using additional data from two environments with different noise statistics, and assuming Gaussian noise.
result The entire causal graph can be uniquely identified with a constant number of environments.

The paper analyzes the statistical cost of tuning kernel hyperparameters in robust regression.

problem Finding the best interpolant from a class of kernels with unknown hyperparameters under adversarial noise.
method Finite-sample guarantees, subsampling guarantee for linear regression, ε-net argument for discretizing kernel parameterizations.
result Hyperparameter optimization increases sample complexity by just a logarithmic factor, compared to known parameters.

The paper gives picture of enrichment to economic and financial system analysis using agent-based models as a form of advanced study for financial economic data post-statistical-data analysis and micro-simulation analysis. Theoretical exploration is carried out by using comparisons of some usual financial economy syste…

2004-03-21abs ↗pdf ↗

We present a theoretical analysis of the training process for a single-layer GAN fed by high-dimensional input data. The training dynamics of the proposed model at both microscopic and macroscopic scales can be exactly analyzed in the high-dimensional limit. In particular, we prove that the macroscopic quantities measu…

2018-05-22abs ↗pdf ↗

Study analyzes accuracy of tensor deflation in noisy conditions.

problem Analyzing accuracy of tensor deflation in noisy conditions.
method Asymptotic study of Hotelling-type tensor deflation in large tensor dimensions.
result Characterization of estimated singular values and singular vector alignments.

Study analyzes Hotelling-type tensor deflation for spiked tensors, providing insights into signal and noise.

problem Characterizing singular values and alignments in Hotelling-type tensor deflation.
method Asymptotic study of Hotelling-type tensor deflation in large dimensional regime using random tensor theory.
result Characterization of singular values and alignments at each step of the deflation procedure.

Bayesian methods detect clusters in noisy data more reliably.

problem Noisy data distorts traditional clustering methods, leading to unreliable results.
method Bayesian community detection using Minimum Description Length principle.
result Bayesian methods identify more robust clusters in noisy data.

Improved diffusion models achieve state-of-the-art likelihoods in image density estimation.

problem Improving likelihood-based performance of diffusion models.
method Joint optimization of noise schedule and model parameters, using signal-to-noise ratio simplification.
result State-of-the-art likelihoods on image density estimation benchmarks, faster optimization.

New methods learn DAGs from noisy data, adapting to noise levels.

problem Inferring causal relationships from observational data with noise and confounding.
method Reformulate DAG learning as a continuous optimization problem over adjacency matrices, jointly inferring structure and noise levels.
result Improved robustness to heteroscedasticity and distribution shifts.

Randomized smoothing reduces accuracy in ML models, especially at higher noise levels.

problem Adversarial attacks on ML models, especially randomized smoothing's accuracy drop.
method Theoretical and empirical analysis of randomized smoothing's effect on feasible hypotheses space.
result For some noise levels, randomized smoothing shrinks the set of feasible hypotheses, leading to accuracy drops.

A two-stage optimization framework reduces label noise in federated learning.

problem Label noise from noisy clients degrades federated learning model performance.
method MaskedOptim framework: detects noisy clients, corrects labels, and aggregates models robustly.
result Our framework improves model robustness and data quality in federated learning.