Skip to content
Open access

Ensemble Extreme Learning Machines for Uncertainty Quantification in Ordinary Differential Equations

Jul 2026 · Mathematics · Vol 14, pp. 2527 · 0 citations · 13 references

Abstract

This paper proposes an uncertainty-quantified surrogate framework for ordinary differential equations (ODEs) based on ensembles of extreme learning machines (ELMs). The method constructs M=100 independently randomized ELM surrogates for a given ODE trajectory, uses the ensemble mean as the predictor, and defines a pointwise ensemble spread as a preliminary uncertainty measure. To obtain statistically valid prediction intervals, a split-conformal calibration procedure is applied to the ensemble spread, yielding finite-sample marginal coverage under exchangeability while preserving computational efficiency, since each ELM is trained via a single ridge-regression solve. Theoretical results establish exact satisfaction of the prescribed initial condition, stability of the ensemble mean and variance with respect to perturbations in the training data, and almost-sure convergence of the empirical ensemble variance to the corresponding random-feature prediction variance. The hidden-layer sampling hypothesis is made explicit: the experiments use bounded hyperbolic-tangent features with independent uniform draws as the default and independent normal draws in sensitivity tests, both of which satisfy the finite-moment assumptions required by the convergence theorem. Comparisons with capacity-matched Bayesian random-feature neural surrogates and Monte Carlo dropout clarify differences in uncertainty representation. Numerical experiments on exponential, logistic, and damped oscillator dynamics demonstrate accurate reconstruction and calibrated uncertainty quantification in sparse and noisy regimes. Additional ablation studies quantify the effect of the denominator safeguard, calibration-sample size, ensemble size, training time, noise level, and hidden-parameter distribution.

Read PDF

Similar papers

Preprint Sep 2026

Prediction with Five Experts and Geometric Stopping: A Probabilistic Construction and Analytic Verification

We present a solution of the limiting five-expert prediction problem with geometric stopping, based on stochastic calculus and partial differential equations. If $\delta$ is the stopping probability, the minimax expected regret from tied initial scores is $45\pi^2/(512\sqrt{2\delta})+o(\delta^{-1/2})$ as $\delta\downar...

Erhan Bayraktar, Ibrahim Ekren, N. Kolliopoulos · 3 citations
2026

Nonparametric Stochastic Subspaces via the Bootstrap Method for Characterizing Model Error

Reliable forward uncertainty quantification in engineering requires methods that account for aleatory and epistemic uncertainties. In many applications, epistemic effects arising from uncertain parameters and model form dominate prediction error and strongly influence engineering decisions. Because distinguishing and...

Akash Yadav, Ruda Zhang · 0 citations
#machine learning Preprint Oct 2026

Moment-Accurate Gaussian Mixtures for Constant-Step Stochastic Approximation

Local Gaussian models of constant-step learning predict output variability and expected losses, but weak convergence alone does not justify these moment predictions. We establish moment-accurate Gaussian mixtures by matching stationary energy with local Ornstein--Uhlenbeck limits, ruling out quadratic tail mass invisib...

Xiao-Lin Li, Wei-Biao Wu · 0 citations
#machine learning Preprint Sep 2026

Weighted Empirical Risk Minimization for Machine Learning under Long-Range Dependence: Exact Pathwise Rates and Learning-Error Geometry

We develop an exact almost-sure learning theory for smooth parametric models trained by regularly weighted empirical risk minimization on long-range dependent data. The training observations are generated from a fixed finite window of a stationary Gaussian sequence, and the sample weights are regularly varying. If the...

E. Moldavskaya · 1 citation
#machine learning Preprint Aug 2026

A Unified Perspective on Conformal Prediction and Wasserstein Distributionally Robust Optimization for Uncertainty Quantification

A unified probabilistic perspective on CP and DRO is developed by viewing both as ways to turn finite calibration data into a data-dependent quantile estimator that a test score falls below with high probability.

Kehan Long, Yi-Qi Zhao, Pol Mestres et al. · 0 citations
Preprint Sep 2026

An Adaptive Projected-Gradient Algorithm for Sample-Average Approximations of Stochastic Multi-Objective Optimization

A line-search-free and function-value-free adaptive projected-gradient algorithm for the sample-average approximation (SAA) problem that transfers vanishing SAA residuals to Pareto stationarity for the population problem, while an additional concentration argument gives a finite-sample residual bound on compact sets.

Yi-Yang Li, Lei Wang, Xiaojun Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.