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

99199298397 · Jun 202019922001200920172026
48 results for stochastic ensemble intelligence

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.

Paper proposes a multi-phase pruning pipeline for deep ensemble learning on IIoT devices.

problem Computational limitations of IoT devices for deep learning models.
method Generates diverse pruned models, applies integer quantization, and uses clustering-based pruning.
result Significant reduction in model size (up to 90%) and improved performance (up to 7%) on IIoT devices.

Meta-learning predicts optimal ensemble size and methods for time series forecasting.

problem Finding the best ensemble of time series forecasting methods.
method Two-step approach using meta-learning to predict ensemble size and methods.
result Meta-learning outperformed benchmarks in forecasting errors for all data types and horizons.

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.

The paper solves optimal bounds for separating data points in high dimensions.

problem Correcting AI errors and analyzing vulnerabilities in high-dimensional data.
method General stochastic separation theorems with optimal probability estimates.
result Explicit and optimal estimates of separation probabilities for important classes of distributions.

In this article, we advocate the ensemble approach for variable selection. We point out that the stochastic mechanism used to generate the variable-selection ensemble (VSE) must be picked with care. We construct a VSE using a stochastic stepwise algorithm, and compare its performance with numerous state-of-the-art algo…

2010-03-30abs ↗pdf ↗

New method reduces ensemble size for linear bandits, achieving near optimal regret.

problem Achieving near optimal regret in linear bandits with limited ensemble size.
method Ensemble sampling with a size of order dlogTd \log T for a dd-dimensional stochastic linear bandit.
result Regret is at most (dlogT)5/2T(d \log T)^{5/2} \sqrt{T}, improving over linear scaling with TT.

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.

Deep ensembles effectively capture epistemic uncertainty through training stochasticity, providing a frequentist perspective.

problem Understanding and quantifying epistemic uncertainty in machine learning models.
method Bootstrap-based estimator and decomposition of deep ensembles into data variability and training stochasticity.
result Deep ensembles primarily capture training stochasticity, explaining their effectiveness in quantifying epistemic uncertainty.

Proposes a new method to enhance neural learning by maximizing information gain.

problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.

ES reduces high-probability regret in stochastic linear bandits.

problem High-probability regret in stochastic linear bandits.
method Linear ensemble sampling with standard Gaussian perturbations, analyzing m=Θ(dlogn)m=Θ(d\log n) ensemble size.
result ES achieves ildeO(d3/2n) ilde O(d^{3/2}\sqrt n) high-probability regret, closing the gap to Thompson sampling.

Extracting actionable intelligence from distributed, heterogeneous, correlated and high-dimensional data sources requires run-time processing and learning both locally and globally. In the last decade, a large number of meta-learning techniques have been proposed in which local learners make online predictions based on…

2015-12-23abs ↗pdf ↗

Computational Intelligence (CI) is a sub-branch of Artificial Intelligence paradigm focusing on the study of adaptive mechanisms to enable or facilitate intelligent behavior in complex and changing environments. There are several paradigms of CI [like artificial neural networks, evolutionary computations, swarm intelli…

2010-06-09abs ↗pdf ↗

Stochastic mirror descent improves performance on ensemble models.

problem Improving performance of ensemble models using stochastic mirror descent.
method Utilizes mirror potential to influence training algorithm's implicit bias, mapping evolution to continuous time process.
result Converges to a nonlinear PDE in asymptotic regime of large networks, with mirror potential affecting gradient flow.

Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…

2013-09-01abs ↗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.

SETrLUSI combines diverse knowledge from multiple domains for faster convergence.

problem Handling diverse knowledge from multiple domains in transfer learning.
method Stochastic Ensemble Multi-Source Transfer Learning Using Statistical Invariant (SETrLUSI).
result SETrLUSI accelerates convergence and outperforms related methods.

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.

SPEQ improves quantized neural networks by stochastic precision sharing and cosine similarity loss.

problem Improving quantized deep neural networks for edge devices.
method SPEQ combines stochastic precision sharing and cosine similarity loss for knowledge distillation.
result SPEQ outperforms existing methods in various tasks.

Ensemble models provide more accurate feature importance estimates than single models.

problem Inaccurate variable importance estimates due to model instability and stochasticity.
method Theoretical analysis and validation on benchmarks and real data.
result Ensembling at the model level reduces excess risk and provides more accurate variable-importance estimates.

Paper uses ensemble learning for IoT cybersecurity anomaly detection.

problem Anomaly detection in IoT data is challenging due to heterogeneous device types.
method Bayesian hyperparameter optimisation for ensemble learning.
result Ensemble learning with Bayesian optimisation improves anomaly detection accuracy.

Recent advances in machine learning and artificial intelligence are now being considered in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains are currently unable to provide convincing arguments that their systems are saf…

2019-05-10abs ↗pdf ↗

This paper uses Bayesian optimization to efficiently identify stochastic dynamical systems.

problem Efficiently identifying linear stochastic dynamical systems with unknown coefficients and noise variances.
method Adaptive Bayesian optimization with ensemble Gaussian processes (EGP) and Kalman filter recursion.
result BO-based estimator achieves RMSE below the Cramer-Rao bound, improving robustness and consistency.

The superior performance of ensemble methods with infinite models are well known. Most of these methods are based on optimization problems in infinite-dimensional spaces with some regularization, for instance, boosting methods and convex neural networks use L1L^1-regularization with the non-negative constraint. However…

2017-12-14abs ↗pdf ↗

EnsLoss combines multiple loss functions to prevent overfitting in classification.

problem Preventing overfitting in classification models.
method EnsLoss is an ensemble method that combines loss functions, ensuring calibration and consistency.
result EnsLoss improves classification accuracy compared to fixed loss methods.

In this study, an efficient stochastic gradient-free method, the ensemble neural networks (ENN), is developed. In the ENN, the optimization process relies on covariance matrices rather than derivatives. The covariance matrices are calculated by the ensemble randomized maximum likelihood algorithm (EnRML), which is an i…

2019-08-03abs ↗pdf ↗