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.

169,051 papers · 148 categories

Trend · papers per month

2635267891,052 · Jun 202019922001200920182026
48 results for general ensembles

Overparameterized ensembles don't offer generalization benefits over single large models.

problem Theoretical limitations of ensembles in overparameterized settings.
method Using ensembles of random feature (RF) regressors, the paper clarifies how modern ensembles differ from underparameterized counterparts.
result Infinite ensembles of overparameterized RF regressors become pointwise equivalent to single infinite-width RF regressors, and finite width ensembles converge to single models with the same parameter budget.

Research reveals how diversity impacts ensemble generalization in classification tasks.

problem Understanding the relationship between diversity and generalization in classification ensembles.
method Investigated diversity measurement, its relationship with generalization error, and pruning methods.
result Generalization error is reduced effectively only when diversity is increased in specific ranges, not in others.

Proposes a method to reduce ensemble size while maintaining accuracy.

problem Complexity and computational burden of ensemble models in large-scale data.
method Optimizes margin distribution to reduce ensemble size while increasing diversity.
result Pruned ensemble uses only a fraction of original classifiers with improved or similar generalization performance.

This paper explores how diverse neural network ensembles improve prediction accuracy and robustness against deception.

problem Improving prediction accuracy and robustness of neural networks against adversarial attacks.
method Examines and measures ensemble diversity, develops algorithms for creating and combining diverse ensembles.
result Greater diversity in neural network ensembles leads to higher accuracy and robustness against deception.

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 ↗

DASH improves ensemble generalizability by encouraging diverse, flat loss landscapes.

problem Improving generalization and robustness of deep ensembles.
method DASH promotes diversity and flatness in deep ensembles by encouraging base learners to move towards low-loss regions of minimal sharpness.
result DASH improves ensemble generalizability, as demonstrated by extensive empirical evidence.

New method improves ensemble diversity and generalization.

problem Ensemble diversity does not guarantee practical generalization.
method Introduced a new diversity metric and training method for extrapolating differently on local data patches.
result Improves generalization and diversity in practical settings, especially under data limits and covariate shift.

Paper proposes a new method for probabilistic electricity price forecasting.

problem Accurate estimation of forecast uncertainties for optimal decision making.
method Implicit generative ensemble post-processing using an ensemble of point forecasting models.
result Method outperforms well-established model combination benchmarks.

GNCL algorithm controls diversity in deep ensembles.

problem Managing bias and variance in deep ensembles.
method Generalized bias-variance decomposition for arbitrary loss functions, leading to GNCL algorithm.
result Explicit control over ensemble diversity and smooth interpolation between independent and joint training.

Ensemble GP improves genetic programming by achieving better results with smaller models.

problem Improving genetic programming for binary classification problems.
method Ensemble GP uses an evolved population structure, fitness evaluation, and genetic operators inspired by ensemble learning methods.
result Ensemble GP outperformed standard GP on eight binary classification problems, achieving better results with smaller models.

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.

The motivation of this work is to improve the performance of standard stacking approaches or ensembles, which are composed of simple, heterogeneous base models, through the integration of the generation and selection stages for regression problems. We propose two extensions to the standard stacking approach. In the fir…

2014-03-28abs ↗pdf ↗

SharpBalance improves deep ensemble performance by balancing sharpness and diversity.

problem Improving deep ensemble performance in both in-distribution and out-of-distribution scenarios.
method Introducing SharpBalance, a novel training approach that balances sharpness and diversity within ensembles.
result SharpBalance effectively improves the sharpness-diversity trade-off and ensemble performance in ID and OOD scenarios.

Optimizes ensemble weights and hyperparameters for better machine learning model predictions.

problem Improving ensemble model performance through optimal weights and hyperparameters tuning.
method Designing a nested optimization algorithm that tunes hyperparameters and finds optimal ensemble weights, using Bayesian search and a heuristic for diverse base learners.
result The algorithm (GEM-ITH) produces better ensemble model performance across various datasets.

This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.

problem The vulnerability of ensemble stumps and trees to small input perturbations under the ℓ_∞ norm.
method Developed dynamic programming algorithms for robustness verification and certified defense under general ℓ_p norm perturbations.
result First certified defense method for ensemble stumps and trees under ℓ_p norm perturbations.

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.

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.

Proposes using Wasserstein barycenters for model ensembling in multiclass/multilabel learning.

problem Finding consensus between models in multiclass/multilabel learning settings.
method Uses Wasserstein (W.) barycenters to find consensus between models, incorporating semantic side information.
result Wasserstein ensembling balances confidence and semantics in model agreement.

This study examines ensembling of diffusion models for improved generative quality.

problem Improving generative quality with ensembling of score-based diffusion models.
method Investigated ensembling of scores from multiple diffusion models on image and tabular data.
result Ensembling scores generally improves model likelihood and score-matching loss but not perceptual quality metrics.

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 paper improves prediction rule ensembles using model-based data generation.

problem Improving the sparsity and predictive accuracy of prediction rule ensembles.
method The authors use surrogate models to train Lasso regression with data generated by a boosted decision tree ensemble, improving PRE performance.
result The use of surrogacy models can substantially improve the sparsity of PRE while retaining predictive accuracy.

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 ↗

Shallow trees in ensemble models make models more interpretable and sometimes better.

problem Lack of transparency in high-performing tree ensemble models.
method Developed an interpretation algorithm to convert tree ensembles into functional ANOVA representations. Proposed strategies to enhance interpretability.
result Shallow trees in ensemble models can lead to better generalization performance and improved interpretability.

CE improves climate uncertainty quantification using GCM ensembles and observational data.

problem Uncertainty in climate projections due to model inadequacies and variability.
method Conformal ensembles integrating GCM ensembles and observational data.
result CE generates statistically rigorous, easy-to-interpret uncertainty estimates.

Researchers test if larger margins lead to lower generalization error in ensemble methods.

problem Explaining why ensembles perform better than individual classifiers.
method Empirical testing of techniques to evaluate the relationship between margins and generalization error.
result Current research holds true: larger margins generally lead to lower generalization error.

Efficient facial feature learning with shared representations reduces redundancy and improves accuracy.

problem Redundancy and high computational load in training deep ensemble models.
method Wide Ensemble-based Convolutional Neural Networks (ESRs) with varying branching levels.
result ESRs reduce residual generalization error and outperform state-of-the-art methods on facial expression recognition.

Random Hyperboxes is a simple yet effective ensemble classifier.

problem Improving classification accuracy using ensemble methods.
method Random subsets of sample and feature spaces are used to train individual hyperbox-based classifiers, which are then combined into an ensemble.
result The proposed classifier outperforms other fuzzy min-max neural networks and ensemble methods on 20 datasets.

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.

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.

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.

Proposes a method to generate counterfactuals for ensemble models using entropic risk measures.

problem Finding a single counterfactual explanation for an ensemble of models.
method Incorporates entropic risk measure into a constrained optimization to generate counterfactuals valid for an adjustable fraction of models.
result Entropic risk measure allows generation of counterfactuals valid for all models in the ensemble under a limiting case.

Corrects GCV for inconsistent risk estimation in finite ensembles of penalized estimators.

problem Inconsistent risk estimation of GCV for finite ensembles of penalized estimators.
method Identifies a correction involving an additional scalar correction based on degrees of freedom adjusted training errors from each ensemble component.
result CGCV maintains computational advantages of GCV and is model-free uniformly consistent for ridge regression.

In this paper, we propose to provide a general ensemble learning framework based on deep learning models. Given a group of unit models, the proposed deep ensemble learning framework will effectively combine their learning results via a multilayered ensemble model. In the case when the unit model mathematical mappings a…

2018-05-19abs ↗pdf ↗