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

57114170227 · Jun 202019922001200920172026
48 results for Noise Augmentation

PiNGDA learns beneficial noise for graph augmentation stability.

problem Challenges in generating effective and stable graph augmentations.
method PiNGDA uses positive-incentive noise to scientifically analyze and generate beneficial graph augmentations.
result PiNGDA improves GCL performance by learning beneficial noise on graph topology and attributes.

SapAugment learns adaptive augmentation policies for better model training.

problem Fixed data augmentation methods often apply the same augmentation to all samples, ignoring sample difficulty.
method SapAugment adapts augmentation parameters based on training loss, learning a sample-adaptive policy.
result SapAugment achieves up to 21% relative reduction in word error rate on LibriSpeech dataset.

PANDA augments data to regularize GLM estimation and inference.

problem Regularizing estimation and inference in GLMs with noisy data.
method Iteratively optimizes augmented noise data to converge to regularized model estimates.
result Established convergence and asymptotic distributions for regularized parameters.

Enhanced financial forecasting using supervised autoencoders with noise augmentation and triple labeling.

problem Improving investment strategy performance on noisy financial data.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced noise augmentation and bottleneck size significantly boost strategy effectiveness.

Dropout is typically interpreted as bagging a large number of models sharing parameters. We show that using dropout in a network can also be interpreted as a kind of data augmentation in the input space without domain knowledge. We present an approach to projecting the dropout noise within a network back into the input…

2015-06-29abs ↗pdf ↗

Theoretical framework for data augmentation in finance improves portfolio construction.

problem Improving portfolio construction in speculative markets.
method Developed a theoretical framework for data augmentation and regularization in deep learning for finance.
result A simple noise injection algorithm improves portfolio construction over no noise.

The ability to detect sparse signals from noisy high-dimensional data is a top priority in modern science and engineering. A sparse solution of the linear system Aρ=b0A ρ= b_0 can be found efficiently with an l1l_1-norm minimization approach if the data is noiseless. Detection of the signal's support from data corrupted b…

2019-08-05abs ↗pdf ↗

The paper examines how adversarial training and noise affect neural network performance.

problem Overfitting in adversarial training and data augmentation.
method Adversarial training and data augmentation with noise in the context of regularized regression in RKHS.
result Appropriate regularization can prevent overfitting and improve performance.

CutMix enhances feature learning in neural networks, improving test accuracy.

problem Understanding and improving feature learning in neural networks using patch-level augmentation.
method Three distinct methods: vanilla training, Cutout training, and CutMix training were studied.
result CutMix training yields the highest test accuracy and learns all features and noise vectors evenly.

Diffusion models optimize objectives similar to ELBO with Gaussian noise augmentation.

problem Optimizing diffusion models for high perceptual quality.
method Showed diffusion objectives are weighted ELBOs over noise levels, with Gaussian noise augmentation.
result Diffusion objectives equate to ELBO with Gaussian noise augmentation under monotonic weighting.

Large datasets often have unreliable labels-such as those obtained from Amazon's Mechanical Turk or social media platforms-and classifiers trained on mislabeled datasets often exhibit poor performance. We present a simple, effective technique for accounting for label noise when training deep neural networks. We augment…

2017-05-09abs ↗pdf ↗

Introduces data augmentation for graph convolutional networks, proposing Monte Carlo Graph Learning.

problem Lack of transparency in graph convolutional networks.
method Data augmentation through graph structure, training traditional classifiers on expanded training set.
result MCGL shows better tolerance to graph structure noise than GCN on noisy graphs.

NA0_0CT2^2 improves tensor regression predictions with 0\ell_0 regularization.

problem Improving tensor regression predictions with structural information.
method Noise-Augmented 0\ell_0 regularization on Tucker decomposition.
result Achieves exact 0\ell_0 regularization on core tensor in linear and generalized linear tensor regression.

Researchers use human-in-the-loop to create counterfactually augmented data, improving model performance.

problem Creating ML models less reliant on spurious patterns in NLP datasets.
method A human-in-the-loop process to curate counterfactually augmented data (CAD), prohibiting unnecessary edits.
result Models trained on CAD appear to rely less on semantically irrelevant words and generalize better out of domain.

NAPP-ERM improves ERM with differential privacy guarantees by iteratively achieving target regularization and delivering strong convexity.

problem Over-regularization in privacy-preserving ERM approaches.
method Noise-Augmented Privacy-Preserving Empirical Risk Minimization (NAPP-ERM) with a dual-purpose l2 regularizer and privacy budget retrieval strategy.
result Mitigates over-regularization and achieves strong convexity through a single regularizer.

DACL tackles domain-specific contrastive learning by using Mixup noise.

problem Domain-specific contrastive learning methods rely on data augmentation techniques that require domain knowledge.
method DACL uses Mixup noise to create similar and dissimilar examples without domain-specific data augmentation.
result DACL outperforms other domain-agnostic noising methods and combines well with domain-specific methods.

Study examines how data augmentation impacts optimization in linear regression.

problem Understanding how data augmentation schedules affect optimization in linear regression.
method Analyzed the effect of augmentation on optimization in linear regression with MSE loss, using classical convex optimization and recent work on implicit bias.
result Proved that under certain joint schedules for learning rate and augmentation scheme, augmented gradient descent converges and characterized the resulting minimum.

Real-time speech enhancement model removes various noises and reverb.

problem Real-time speech enhancement in noisy environments.
method Causal speech enhancement model using encoder-decoder architecture with skip-connections, optimized in time and frequency domains.
result The model matches state-of-the-art performance while working directly on raw waveform.

Transfer learning and data augmentation improve stock classification performance.

problem Challenges in stock classification due to noise and volatility.
method Pre-trained model on S&P500 index features, transfer learning to new models, data augmentation on feature space.
result Augmentation on feature space leads to 20% increase in risk-adjusted returns.

Novel bio-inspired masking for robust speech emotion recognition.

problem Noise degradation in speech emotion recognition.
method Cochlear cepstrogram-based contrastive learning with temporal and frequency masking.
result Improved speech emotion recognition performance on K-EmoCon benchmark.

Optimistic RL algorithms are simplified for deep RL with competitive performance.

problem Achieving accurate optimism in model-based RL for large-scale problems.
method Interpreting scalable optimistic model-based algorithms as solving a tractable noise augmented MDP.
result Competitive regret bound of ildeO(SHAT) ilde{\mathcal{O}}( |\mathcal{S}|H\sqrt{|\mathcal{A}| T } ) for Gaussian noise augmentation.

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 ↗

The paper provides theoretical guarantees for behavior cloning using generative models.

problem Behavior cloning of complex expert demonstrations using generative models.
method The paper proposes a theoretical framework invoking low-level controllers to stabilize imitation around expert demonstrations. It shows that with suitable low-level stability guarantees and powerful generative models, pure supervised behavior cloning can match expert trajectories.
result The paper proves that with a suitable low-level stability guarantee and a powerful enough generative model, pure supervised behavior cloning can generate trajectories matching the per-time step distribution of essentially arbitrary expert trajectories in an optimal transport cost.

This paper improves generative models by using data scaling and theoretical analysis.

problem Challenges in selecting noise distributions for stable learning in generative models.
method Introduces Scale-GAN, which uses data scaling and variance-based regularization.
result Data scaling controls the bias-variance trade-off and improves stability and accuracy.

Bayesian classification improves with explicit aleatoric uncertainty.

problem Lack of aleatoric uncertainty representation in Bayesian classification.
method Explicitly account for aleatoric uncertainty using a Dirichlet observation model.
result Explicit aleatoric uncertainty improves performance of Bayesian neural networks.

Heavy Lasso improves robustness in high-dimensional linear regression with heavy-tailed errors.

problem Challenges of classical Lasso in handling heavy-tailed noise and outliers.
method Data-augmented soft-thresholding with Student's t-distribution loss.
result Heavy Lasso achieves comparable rates to Huber loss under theoretical bounds.

Recently, deep models have had considerable success in several tasks, especially with low-level representations. However, effective learning from sparse noisy samples is a major challenge in most deep models, especially in domains with structured representations. Inspired by the proven success of human guided machine l…

2019-05-31abs ↗pdf ↗

Unified theory explains how data augmentation improves deep learning models.

problem Understanding why data augmentation improves model generalization.
method Unified theoretical framework explaining two key effects: partial semantic feature removal and feature mixing.
result Data augmentation enhances generalization through partial semantic feature removal and feature mixing.

Enhances robustness of AT frameworks to multiple perturbations without increasing training complexity.

problem Defending against the union of multiple perturbations in adversarial training.
method SNAP technique that augments a network with shaped noise to enhance robustness.
result 14%-to-20% improvement in adversarial accuracy for ResNet-18 on CIFAR-10.

We propose regularization strategies for learning discriminative models that are robust to in-class variations of the input data. We use the Wasserstein-2 geometry to capture semantically meaningful neighborhoods in the space of images, and define a corresponding input-dependent additive noise data augmentation model. …

2019-09-15abs ↗pdf ↗

Synthetic augmentation improves financial machine learning performance in variance-dominant regimes.

problem Data scarcity in financial machine learning.
method Formalized synthetic augmentation, introduced size-matched null augmentation, and developed a non-parametric block permutation test.
result Synthetic augmentation is beneficial only in variance-dominant regimes, such as persistent volatility forecasting.

Achieving robustness to distributional shift is a longstanding and challenging goal of computer vision. Data augmentation is a commonly used approach for improving robustness, however robustness gains are typically not uniform across corruption types. Indeed increasing performance in the presence of random noise is oft…

2019-06-21abs ↗pdf ↗

Graph neural networks (GNNs) are an emerging model for learning graph embeddings and making predictions on graph structured data. However, robustness of graph neural networks is not yet well-understood. In this work, we focus on node structural identity predictions, where a representative GNN model is able to achieve n…

2019-12-21abs ↗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 ↗

Enhanced financial forecasting with supervised autoencoders for S&P 500 and cryptocurrencies.

problem Improving investment strategy performance in financial markets.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced parameters significantly boost strategy effectiveness.

Boomerang generates nonidentical images similar to input on image manifolds.

problem Generating nonidentical images similar to input on image manifolds.
method Adding noise to input image, moving closer to latent space, and mapping back through partial reverse diffusion.
result Boomerang generates nonidentical images similar to input on image manifolds.

Framework adds invariance to pretrained networks without fine-tuning.

problem Adding invariance to pretrained networks without altering original behavior.
method Post-training augmentation invariance framework with Markov-Wasserstein minimization and Wasserstein correlation maximization losses.
result Adapter networks improve classification accuracy on rotated and noisy images.

Data augmentation (DA) is commonly used during model training, as it significantly improves test error and model robustness. DA artificially expands the training set by applying random noise, rotations, crops, or even adversarial perturbations to the input data. Although DA is widely used, its capacity to provably impr…

2019-05-08abs ↗pdf ↗