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

98196294392 · Jun 202019922001200920172026
48 results for Ensemble Noise Simulation

New method handles uncertainty in adversarial attacks using ensemble noise simulation.

problem Uncertainty in adversarial attacks on neural networks.
method Simulates attacker's noisy perturbation using various gradient-based attack algorithms and a pre-processing Denoising Autoencoder (DAE) defense.
result Significant improvements in post-attack accuracy with the proposed ensemble-trained defense.

We describe parallel Markov chain Monte Carlo methods that propagate a collective ensemble of paths, with local covariance information calculated from neighboring replicas. The use of collective dynamics eliminates multiplicative noise and stabilizes the dynamics thus providing a practical approach to difficult anisotr…

2016-07-13abs ↗pdf ↗

SIMPGEN improves SWOT SSH data interpretation by removing noise and preserving fine-scale features.

problem Noisy data and limited fine-scale observations in oceanic processes.
method Simulation-Informed Metric and Prior for Generative Ensemble Networks (SIMPGEN) combining real SWOT observations with simulated reference data.
result SIMPGEN effectively removes noise, preserving fine-scale features better than existing neural methods.

Bayesian tree ensemble model for estimating treatment effects in high-dimensional survival data.

problem Estimating heterogeneous treatment effects in censored survival data with many covariates.
method Developed a Bayesian tree ensemble model with a horseshoe prior for adaptive shrinkage.
result Accurately estimates treatment effects in high-dimensional covariate spaces and non-linear functions.

New approach uses under-trained deep ensembles to learn from noisy labels.

problem Improper labelling hinders reliable generalization in supervised learning.
method Under-trained deep ensembles, each trained on a subset of data, combine to form better labels.
result Significant performance improvement in accuracy and kappa for noisy label tasks.

Vote-boosting is a sequential ensemble learning method in which the individual classifiers are built on different weighted versions of the training data. To build a new classifier, the weight of each training instance is determined in terms of the degree of disagreement among the current ensemble predictions for that i…

2016-06-30abs ↗pdf ↗

Theory and method for reducing prediction variance in noisy feature-subsampled ridge ensembles.

problem Reduction of prediction variance in noisy data with feature bagging.
method Developed analytical learning curves for noisy ridge ensembles, introduced heterogeneous feature ensembling.
result Subsampling shifts the double-descent peak, leading to improved performance over a single linear predictor.

VGE provides a practical approach to uncertainty estimation in ensemble models.

problem Uncertainty estimation in ensemble models using additive decomposition breaks down.
method Variance-Gated Ensembles (VGE) introduces a differentiable framework with a signal-to-noise gate.
result VGE provides a Variance-Gated Margin Uncertainty (VGMU) score and Variance-Gated Normalization (VGN) layer.

We formalize the notion of a pseudo-ensemble, a (possibly infinite) collection of child models spawned from a parent model by perturbing it according to some noise process. E.g., dropout (Hinton et. al, 2012) in a deep neural network trains a pseudo-ensemble of child subnetworks generated by randomly masking nodes in t…

2014-12-16abs ↗pdf ↗

ConfEviSurrogate improves surrogate model accuracy and uncertainty quantification.

problem Uncertainty in surrogate models hinders reliable analysis.
method Introduces ConfEviSurrogate, a novel model that learns evidential distributions, separates uncertainty sources, and provides reliable prediction intervals.
result Demonstrates accurate predictions and robust uncertainty estimates in various simulations.

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 ↗

HD algorithm simulates dynamics on random matrix ensembles without generating full matrices.

problem Simulating dynamics on dense random matrix ensembles with high space and time complexity.
method Householder reflectors for adaptive and recursive construction, deferring decisions.
result Significant reductions in runtime and memory footprint for practical TnT \ll n.

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.

Paper tackles noisy and expensive likelihoods in complex models.

problem Calibrating parameters in complex models with noisy and expensive evaluations.
method Ensemble Kalman methods and Langevin-based methods for inverse problems.
result Ensemble Kalman methods perform well in noisy conditions, while Langevin methods are adversely affected.

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.

Recent studies have revealed the vulnerability of deep neural networks: A small adversarial perturbation that is imperceptible to human can easily make a well-trained deep neural network misclassify. This makes it unsafe to apply neural networks in security-critical applications. In this paper, we propose a new defense…

2017-12-02abs ↗pdf ↗

In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…

2012-05-21abs ↗pdf ↗

This research tackles image classification with noise, proposing committees of CNNs.

problem Image classification with concurrent feature and label noise.
method Committees of Convolutional Neural Networks (CNNs) for MNIST, CIFAR-10, and CIFAR-100 datasets.
result Committees outperform single models in noisy conditions, especially on difficult datasets.

Proposes a meta-learning method for robust portfolio optimization.

problem Optimizing a robust portfolio ensemble with diverse sub-portfolios.
method Uses a deep generative model with convolutional, LSTM, and dense layers to generate diverse sub-portfolios.
result The ensemble portfolio is robust and generalizes well, balancing performance and diversity.

Paper explains how tree ensembles improve predictions by smoothing and regulating smoothness.

problem Understanding why tree ensembles perform well despite their complexity.
method Interpreting tree ensembles as adaptive and self-regularizing smoothers.
result Ensemble trees make more smooth predictions than individual trees and adjust smoothness based on input dissimilarity.

The paper explores how prior functions and bootstrapping improve ensemble uncertainty estimation.

problem Improving uncertainty estimation in machine learning models.
method Investigates the benefits of prior functions and bootstrapping in ensemble models.
result Prior functions and bootstrapping enhance ensemble agents' uncertainty estimation across different inputs.

BODE enhances deep neural network predictions and uncertainty quantification in safety modeling.

problem Uncertainty in deep neural network predictions for safety-critical applications.
method Bayesian optimization combined with deep ensembles (BODE).
result BODE reduces total uncertainty by over 30% compared to a manually tuned baseline ensemble.

Deep neural networks (DNNs) have been shown to over-fit a dataset when being trained with noisy labels for a long enough time. To overcome this problem, we present a simple and effective method self-ensemble label filtering (SELF) to progressively filter out the wrong labels during training. Our method improves the tas…

2019-10-04abs ↗pdf ↗

Bayes-optimal limits in PCA with structured noise are determined.

problem Analyzing statistical dependencies in measurement noise for high-dimensional inference.
method Study of spiked matrix model with low-order polynomial orthogonal noise, providing Bayes-optimal limits and proposing a novel AMP.
result A novel AMP algorithm reaches the information-theoretic limits for more general priors.

A simple approach to obtaining uncertainty-aware neural networks for regression is to do Bayesian linear regression (BLR) on the representation from the last hidden layer. Recent work [Riquelme et al., 2018, Azizzadenesheli et al., 2018] indicates that the method is promising, though it has been limited to homoscedasti…

2019-12-14abs ↗pdf ↗

Tree ensembles like RF and GBT can be seen as kernels, improving regression and classification performance.

problem Improving kernel methods for tree ensemble based models.
method Investigation of RF and GBT kernels in simulation and real data.
result RF and GBT kernels are competitive to their respective ensembles in higher dimensions, particularly with noisy features.

Bayesian inference using stochastic neural networks ensembles.

problem Approximating Bayesian posterior distributions.
method Formulate stochastic ensembles of neural networks, train with variational inference, and evaluate using Monte Carlo dropout.
result Stochastic ensembles provide more accurate posterior estimates than other methods.

Efficient exploration is a long-standing problem in sensorimotor learning. Major advances have been demonstrated in noise-free, non-stochastic domains such as video games and simulation. However, most of these formulations either get stuck in environments with stochastic dynamics or are too inefficient to be scalable t…

2019-06-10abs ↗pdf ↗

The study investigates kernel-target alignment in tree ensemble kernels.

problem The degree of kernel-target alignment affects the performance of tree ensemble kernels in kernel learning.
method Eigenanalysis of the kernel matrix and sensitivity analysis via landmark learning.
result Good performance of tree ensemble kernels is associated with strong kernel-target alignment.

Recently, the binary expansion testing framework was introduced to test the independence of two continuous random variables by utilizing symmetry statistics that are complete sufficient statistics for dependence. We develop a new test based on an ensemble approach that uses the sum of squared symmetry statistics and di…

2019-12-08abs ↗pdf ↗

Paper improves financial trading models using GPU parallelism.

problem Challenges in policy instability and sampling bottlenecks in reinforcement learning for financial tasks.
method Revisits ensemble methods with massively parallel simulations on GPUs.
result Significantly improved computational efficiency and robustness of financial decision-making strategies.