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

66131197262 · Jun 202019922001200920172026
48 results for ensemble size

Ensembles of random-feature models can't outperform a single large model.

problem Finding the optimal balance between model size and ensemble size.
method Deterministic equivalent risk estimates and scaling laws analysis.
result Ensembles of random-feature models achieve near-optimal performance only under specific conditions.

Study ridge ensembles in proportional feature-to-sample size regime, proving risk equivalence and GCV consistency.

problem Characterizing and optimizing ridge ensembles in proportional feature-to-sample size regimes.
method Proportional asymptotics analysis, GCV for tuning, proving risk equivalence.
result Risk of optimal full ridgeless ensemble matches optimal ridge predictor's risk.

This work investigates power laws in deep neural network ensembles and predicts their performance.

problem Understanding the performance of deep neural network ensembles and their optimal structure.
method Investigated the behavior of negative log-likelihood (CNLL) of a deep ensemble as a function of ensemble size and member network size, identifying power law dependencies.
result One large network may perform worse than an ensemble of several medium-size networks, known as a memory split.

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.

The paper analyzes the risk of bagging regularized M-estimators under proportional asymptotics.

problem Characterizing the risk of ensemble estimators trained with subsamples and regularizers.
method Developed a consistent estimator for the risk of ensemble estimators under proportional asymptotics.
result Optimal subsample size kk^\star tends to be in the overparameterized regime for the full-ensemble estimator.

JUCAL jointly calibrates aleatoric and epistemic uncertainties in classifier ensembles.

problem Misrepresentation of predictive uncertainty due to unbalanced aleatoric and epistemic uncertainties.
method Joint Uncertainty Calibration (JUCAL) that jointly calibrates two constants to weight and scale uncertainties.
result Significantly outperforms state-of-the-art calibration methods across various text classification tasks.

Paper analyzes ensemble Kalman updates for effective dimension and localization.

problem Why small ensemble sizes work well in inverse problems and data assimilation.
method Non-asymptotic analysis of ensemble Kalman updates, focusing on effective dimension and localization.
result Rigorously explains why a small ensemble size is sufficient when prior covariance has moderate effective dimension.

ForestPrune optimizes tree ensemble pruning for compactness and speed.

problem Large tree ensembles in predictive models consume excessive memory and reduce interpretability.
method Developed a specialized optimization algorithm to efficiently prune tree ensembles by depth layers.
result ForestPrune produces compact, high-performing models that outperform existing post-processing methods.

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.

Ensemble++ uses shared-factor ensembles to scale Thompson Sampling for linear and nonlinear bandits.

problem Computational challenges in Thompson Sampling for large-scale or non-conjugate settings.
method Ensemble++ with shared-factor architecture and random linear combinations.
result Ensemble++ achieves comparable regret to exact Thompson Sampling with significantly smaller ensemble sizes.

The paper develops a stationary-distribution theory for Random Forest ensemble size selection.

problem Determining the optimal number of trees in Random Forests.
method Modeling the ensemble size as a birth-death Markov chain and deriving its stationary distribution.
result The stationary ensemble size BB_* scales as O(ε2)O(\varepsilon^{-2}) as ε0\varepsilon\downarrow 0.

A new ensemble learning method called Residual Likelihood Forests improves performance and reduces model size.

problem Improving machine learning classification performance with compact models.
method Sequential optimization of conditional likelihoods in a boosting-like framework, combining multiplicatively.
result Significant performance improvements and reduced model size compared to other ensemble methods.

Improved regret bound for linear ensemble sampling.

problem Closing the gap between theory and practice in linear ensemble sampling.
method General regret analysis framework for linear bandit algorithms, revealing a relationship with LinPHE.
result Achieves a frequentist regret bound of ildeO(d3/2T) ilde{O}(d^{3/2}\sqrt{T}) for linear ensemble sampling.

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.

Enhanced ensemble filters use machine learning to improve accuracy in filtering models.

problem Accuracy limitations of traditional ensemble Kalman filters.
method Introduces a measure neural mapping (MNM) to map joint predicted state and observation to updated state estimates.
result Superior root-mean-square-error performance compared to leading methods in filtering models.

Analog methods improve forecast accuracy in complex models.

problem Improving forecast accuracy in complex models like Lorenz-96.
method Constructing analogs using variational autoencoders for ensemble data assimilation.
result Constructed analogs perform as well as a full ensemble square root filter.

Ensembles of deep neural networks significantly improve generalization accuracy. However, training neural network ensembles requires a large amount of computational resources and time. State-of-the-art approaches either train all networks from scratch leading to prohibitive training cost that allows only very small ens…

2018-09-12abs ↗pdf ↗

Ensembles of neural networks improve training dynamics and performance.

problem Improving neural network performance through model size increase.
method Defining collegial ensembles (CE) as multiple independent models trained as a single model, and using theoretical results on NTK to optimize architecture search.
result CE dynamics simplify and scale favorably, resembling wide models, and can be efficiently implemented using group convolutions and block diagonal layers.

Memory split advantage: thinner networks outperform a single wide network.

problem Optimizing deep learning models with limited memory.
method Investigated training a single wide network vs. an ensemble of thinner networks with the same total number of parameters.
result An ensemble of several thinner networks outperforms a single wide network for large memory budgets.

Jointly tuning ensemble models improves performance and uncertainty calibration.

problem Improving both predictive performance and uncertainty calibration in deep ensembles.
method Investigated the impact of jointly tuning weight decay, temperature scaling, and early stopping.
result Jointly tuning ensemble models generally matches or improves performance, with significant variation across tasks.

Optimal number of voters for a voting ensemble can be estimated from the distribution of classifier errors.

problem Finding the optimal number of voters for a voting ensemble to minimize error rate.
method Estimate the distribution of classifier errors and infer error rates for different numbers of voters.
result Lower-variance estimates of error rates can be obtained by inferring them for different numbers of voters.

Ensemble models refer to methods that combine a typically large number of classifiers into a compound prediction. The output of an ensemble method is the result of fitting a base-learning algorithm to a given data set, and obtaining diverse answers by reweighting the observations or by resampling them using a given pro…

2019-06-07abs ↗pdf ↗

Study on how intraclass variability affects Temporal Ensembling accuracy.

problem Effect of intraclass variability on Temporal Ensembling accuracy.
method Investigated through experiments with varying seed sizes and types on different datasets.
result Significant drop in accuracy with high intraclass variability datasets, more seed images improve accuracy, and seed type impacts overall efficiency.

Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.

problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.

In ensemble methods, the outputs of a collection of diverse classifiers are combined in the expectation that the global prediction be more accurate than the individual ones. Heterogeneous ensembles consist of predictors of different types, which are likely to have different biases. If these biases are complementary, th…

2018-02-21abs ↗pdf ↗

Neural architecture search (NAS) is gaining more and more attention in recent years due to its flexibility and remarkable capability to reduce the burden of neural network design. To achieve better performance, however, the searching process usually costs massive computations that might not be affordable for researcher…

2019-10-01abs ↗pdf ↗

Ensembles of neural networks learn better by sharing information.

problem Improving performance of neural networks through collective learning.
method Modeling neural networks as socially interacting agents aiming to maximize their own performance and functional relations to others.
result Optimal collective performance emerges from local interactions between networks, leading to specialization and higher confidence.

Ensembles, as a widely used and effective technique in the machine learning community, succeed within a key element -- "diversity." The relationship between diversity and generalization, unfortunately, is not entirely understood and remains an open research issue. To reveal the effect of diversity on the generalization…

2019-10-30abs ↗pdf ↗

Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) …

2013-12-17abs ↗pdf ↗

A new method creates simpler, more interpretable decision trees from complex ensembles.

problem Complex tree ensembles reduce interpretability and control over machine learning models.
method Dynamic-programming based algorithm for finding a minimum-size decision tree.
result Optimal born-again trees are simpler and more interpretable than original ensembles.

E-CIT framework reduces CITs' computational burden and improves causal discovery performance.

problem High computational cost of traditional CITs in causal discovery.
method E-CIT framework using divide-and-aggregate strategy with stable distribution p-value combination.
result Significant reduction in computational burden and competitive performance in causal discovery.

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.

New metrics improve quantum ensemble learning efficiency and power.

problem Quantum ensembles' distances poorly understood due to measurement constraints.
method Introduce MMD-kk hierarchy of integral probability metrics for quantum ensembles.
result MMD-kk requires fewer samples for full discriminative power at higher kk.