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

4998147196 · Jun 202019922001200920172026
48 results for ensemble reduction

This paper develops a new theory for ensemble learning beyond variance reduction.

problem Ensemble learning's effectiveness for stable estimators is not fully explained by variance reduction.
method Develops a general weighting theory for ensemble learning, formalizing ensembles as linear operators and introducing geometric and spectral constraints.
result Structured weights can outperform uniform averaging by reshaping approximation geometry and redistributing spectral complexity.

Ensemble learning has had many successes in supervised learning, but it has been rare in unsupervised learning and dimensionality reduction. This study explores dimensionality reduction ensembles, using principal component analysis and manifold learning techniques to capture linear, nonlinear, local, and global feature…

2017-10-11abs ↗pdf ↗

A new method using energy distance for ensemble and scenario reduction.

problem Solving complex dynamic and stochastic programs, especially in energy systems.
method Proposes a new method based on energy distance for ensemble and scenario reduction.
result Reduced scenario sets exhibit better statistical properties for energy distance than Wasserstein distance.

Ensembles improve classifier performance by reducing bias, not variance.

problem Improving classifier performance through ensemble methods.
method Extended bias-variance decomposition for classification tasks, introducing dual reparameterization.
result Ensembling reduces bias in classifiers, contrary to the traditional view.

Ant colonies and boosting algorithms both reduce bias and variance through adaptive mechanisms.

problem Understanding the mathematical principles behind ensemble learning and ant colony behavior.
method Developed a formal mapping between AdaBoost's adaptive reweighting and ant recruitment dynamics.
result Proved that the fundamental theorem of weak learnability has a direct analog in colony decision-making.

Bayesian Neural Networks improve geophysical model ensembles with reduced uncertainty.

problem Improving geophysical model projections and uncertainty quantification.
method Developed a Bayesian Neural Network ensemble strategy for geophysical models.
result Bayesian Neural Network ensemble outperforms existing methods in ozone prediction.

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…

2019-06-07abs ↗pdf ↗

IENs reduce neural network variance without increasing complexity.

problem Reducing variance in neural networks without increasing model complexity.
method IENs use ensemble parameters during training to reduce variance, removing them during testing.
result IENs reduce network variance by a factor of 1/mL11/m^{L-1}, leading to significant error rate decreases.

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.

BatchEnsemble reduces ensemble costs by 3X in training and testing.

problem High costs for training and testing ensembles of neural networks.
method Defines each weight matrix as a Hadamard product of a shared matrix and a rank-one matrix per member.
result Achieves 3X speedup and 3X memory reduction in test time for ensembles of size 4.

New theory shows how multi-head attention reduces variance and decorrelates outputs.

problem Understanding and optimizing multi-head attention in neural networks.
method Developed a statistical theory linking multi-head attention to ensemble Nadaraya-Watson estimators.
result MHA variance reduction depends on head decorrelation, not just head count.

A new framework for dimension reduction using ensemble of random projections.

problem High-dimensional regression problems with limited data.
method Aggregating an ensemble of carefully chosen random projections, retaining based on empirical performance, and selecting singular vectors.
result The proposed method stabilizes error as the number of projection groups increases.

Data assimilation for subsurface flow using latent diffusion models shows that ensemble Kalman methods may overestimate posterior uncertainty, while Monte Carlo sampling is more reliable.

problem Data assimilation for subsurface flow
method Ensemble Kalman smoother and Markov chain Monte Carlo sampling
result Monte Carlo sampling is more reliable than ensemble Kalman methods

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.

Random forests reduce bias and variance, especially in low SNR settings.

problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtrymtry tuning.
result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.

Fibonacci Ensembles use Fibonacci weights to improve ensemble learning, inspired by natural growth patterns.

problem Improving ensemble learning methods to enhance model performance and interpretability.
method Introduces Fibonacci weights and a recursive ensemble dynamic to reduce variance and enrich representational depth.
result Fibonacci weighting can match or improve upon uniform averaging in ensemble learning experiments.

A new method reduces memory usage for deep neural networks ensembles.

problem Reducing memory footprint of ensemble methods for deep learning.
method Extract multiple sub-networks from a single neural network through end-to-end optimization.
result Achieves higher or comparable accuracy with significantly less memory usage.

Ensembling smaller models can outperform larger models in terms of accuracy and efficiency.

problem The inefficiency of training larger models for boosting performance.
method Training ensembles of smaller models and comparing their performance to single larger models.
result Ensembles of smaller models outperform single larger models in accuracy and efficiency, especially as models grow large.

Improved signal classification using multiple wavelets and their smooth coefficients.

problem Signal classification accuracy declines with reduced attributes.
method Transform data with multiple wavelets, combine outputs, apply ensemble classifiers.
result Proposed technique outperforms raw data and single wavelet approaches.

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.

CNN improves medium-range temperature forecasts with limited resources.

problem Limited computational resources for high-resolution temperature forecasts.
method CNN post-processing with ensemble NWP models for bias correction and spatial downscaling.
result High-resolution (5-km) surface temperature forecasts with lead times up to 5.5 days.

An ensemble of neural networks is known to be more robust and accurate than an individual network, however usually with linearly-increased cost in both training and testing. In this work, we propose a two-stage method to learn Sparse Structured Ensembles (SSEs) for neural networks. In the first stage, we run SG-MCMC wi…

2018-03-01abs ↗pdf ↗

EnEMF uses Epanechnikov kernel for high-dimensional filtering, improving accuracy and robustness.

problem Suboptimal Gaussian mixture kernel density estimates in high-dimensional settings.
method Ensemble Epanechnikov mixture filter (EnEMF) using optimal Epanechnikov kernel.
result EnEMF reduces error per particle on high-dimensional systems like Lorenz '96.

ELMV uses ensemble learning to handle missing values in EHR data.

problem Significant missing values in EHR data cause bias and unreliable conclusions.
method ELMV constructs multiple subsets with lower missing rates and uses a support set for ensemble learning.
result ELMV outperforms conventional methods in critical feature identification and outcome prediction.

Ensemble methods are arguably the most trustworthy techniques for boosting the performance of machine learning models. Popular independent ensembles (IE) relying on naive averaging/voting scheme have been of typical choice for most applications involving deep neural networks, but they do not consider advanced collabora…

2017-06-12abs ↗pdf ↗

Anti-Distillation improves reproducibility of deep networks by making ensemble predictions more diverse.

problem Deep networks are prone to high prediction differences, making them less reproducible.
method Anti-Distillation uses ensembles to force predictions to be more different and diverse.
result Anti-Distillation reduces prediction differences by making ensemble predictions more diverse.

Meta-ensemble scheme allocates queries to EC nodes for reduced latency.

problem Efficiently allocating queries to EC nodes to minimize latency.
method Combining ensemble models to decide query allocation based on node and query characteristics.
result Meta-ensemble scheme outperforms traditional allocation methods in reducing query processing latency.

This study shows how social insects and machine learning methods share a common mathematical framework.

problem Understanding how decentralized systems achieve optimal decision-making.
method Developed a rigorous mathematical framework to show isomorphism between ant colonies and ensemble machine learning.
result Demonstrated that ant colony decision-making and random forest learning implement identical variance reduction strategies through decorrelation of identical units.

Google's multilingual speech recognition system combines low-level acoustic signals with language-specific recognizer signals to better predict the language of an utterance. This paper presents our experience with different signal combination methods to improve overall language identification accuracy. We compare the p…

2019-10-21abs ↗pdf ↗

New method reduces bias in NLI models using ensemble adversarial training.

problem Spurious correlations between hypotheses and entailment classes in NLI datasets.
method Adversarial training with an ensemble of classifiers to reduce bias in sentence representations.
result Ensemble adversarial training produces more robust NLI models, outperforming previous methods.

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to the data. This dimension reduction procedure succeeds when it preserves certain …

2015-11-30abs ↗pdf ↗

Integrates differentiable decision trees into neural networks for faster training and inference.

problem Combining differentiability and conditional computation in tree ensembles for neural networks.
method Sparse activation function and specialized forward/backward propagation algorithms for efficient training and inference.
result 10x speed-ups and 20x reduction in parameters compared to existing methods, while maintaining performance.

New insights into how randomization affects greedy model selection.

problem Understanding the impact of feature subsampling on greedy model selection.
method Investigated greedy forward selection with feature subsampling, proving effects on bias and variance.
result Ensembling with feature subsampling reduces both bias and variance, unlike convex base learners.

This paper describes structuring data and constructing plots to explore forest classification models interactively. A forest classifier is an example of an ensemble, produced by bagging multiple trees. The process of bagging and combining results from multiple trees, produces numerous diagnostics which, with interactiv…

2017-04-08abs ↗pdf ↗

Combines deep generative models with ensemble methods for subsurface property estimation.

problem Estimating spatially distributed subsurface properties from sparse measurements.
method Wasserstein Generative Adversarial Network (WGAN-GP) and Ensemble Smoother with Multiple Data Assimilation (ES-MDA).
result The proposed method outperforms variational inversion methods, especially for channelized and fractured fields.