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

211423634845 · Jun 202019922001200920172026
48 results for ensemble optimization

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.

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.

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.

Enhances optimization and sampling methods using ensemble-based gradient inference.

problem Improving ensemble-based methods for optimization and sampling.
method Ensemble-based gradient inference (EGI) to extract higher-order derivatives from particle ensembles.
result Augmented algorithms outperform gradient-free variants, especially in multimodal and non-Gaussian settings.

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.

We propose an algorithm to enhance certified robustness of a deep model ensemble by optimally weighting each base model. Unlike previous works on using ensembles to empirically improve robustness, our algorithm is based on optimizing a guaranteed robustness certificate of neural networks. Our proposed ensemble framewor…

2019-10-31abs ↗pdf ↗

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

Optimal survival trees ensemble reduces tree count and improves predictive performance.

problem Improving predictive performance in survival analysis.
method Grows a forest of optimal survival trees by ranking and selecting the best trees based on out-of-bag error.
result Reduces the number of trees in the ensemble while improving predictive performance.

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.

Tree ensemble kernels improve Bayesian optimization for mixed features and constraints.

problem Optimizing over mixed-feature spaces with known constraints.
method Kernel interpretation of tree ensembles as Gaussian Process prior, compatible optimization formulation for acquisition function, integration of known constraints.
result Framework outperforms state-of-the-art methods for mixed-feature spaces and constraints.

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.

Unified framework for portfolio optimization using multiple hypotheses.

problem Risk diversification in portfolio allocation.
method Structured ensemble learning approach with diversity control.
result Structured ensembles link predictor diversity to risk diversification.

Optimal allocation between explainable and black box models for high performance and explainability.

problem Balancing explainability and performance in model ensembles.
method Optimal allocation of observations between explainable and black box models to maximize ensemble performance and explainability.
result Learned allocations maintain high ensemble performance and explainability, sometimes outperforming individual models.

We consider the problem of learning decision rules for prediction with feature budget constraint. In particular, we are interested in pruning an ensemble of decision trees to reduce expected feature cost while maintaining high prediction accuracy for any test example. We propose a novel 0-1 integer program formulation …

2016-01-05abs ↗pdf ↗

EDRBO optimizes Bayesian optimization with continuous contexts using ensemble models and robust methods.

problem Bayesian optimization with unknown and continuous contextual distributions leads to suboptimal results.
method EDRBO uses ensemble surrogate models and Wasserstein ball ambiguity sets to handle uncertainty and maintain computational tractability.
result EDRBO achieves sublinear cumulative regret guarantees of order O(γTT)\mathcal{O}(γ_T \sqrt{T}).

DSL uses supervised learning to optimize portfolios, improving stability and performance.

problem Optimizing robust portfolios in financial markets.
method DSL reframes portfolio construction as a supervised learning problem, using cross-entropy loss and optimizing Sharpe or Sortino ratios. Deep Ensemble methods are employed to reduce variance.
result DSL outperforms traditional and machine learning methods, achieving higher median returns and more stable risk-adjusted performance.

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.

Proposes a meta-learning method for robust portfolio optimization.

problem Optimizing a robust portfolio ensemble with diverse sub-portfolios.
method Uses a deep generative model with convolutional, LSTM, and dense layers to generate diverse sub-portfolios.
result The ensemble portfolio is robust and generalizes well, balancing performance and diversity.

A new ensemble filter uses transport maps and MMD optimization for high-dimensional data assimilation.

problem High-dimensional data assimilation challenges in ensemble filtering.
method Optimized Maximum Mean Discrepancy (MMD) for transport map construction.
result Significant improvement in robustness and posterior approximation.

Optimal ensemble construction improves prediction accuracy for multi-study tasks, especially in pandemic scenarios.

problem Poor out-of-study prediction performance due to heterogeneous datasets.
method Optimal ensemble construction using a two-stage stacking strategy that jointly estimates ensemble weights and study-specific model parameters.
result Our method outperforms multi-study stacking and other standard methods in predicting excess mortality during the pandemic.

New hyperparameter ensembles boost neural network performance and uncertainty.

problem Improving neural network robustness and uncertainty quantification.
method Designing ensembles over both weights and hyperparameters, stratified across random initializations.
result Hyper-deep and hyper-batch ensembles outperform deep and batch ensembles on various architectures.

Tree ensemble method tackles multi-objective constrained optimization in energy systems.

problem Complex, multi-objective, and constrained optimization problems in energy systems.
method Data-driven tree ensemble approach for black-box problems with heterogeneous variable spaces.
result Competitive performance and sampling efficiency compared to state-of-the-art tools.

POETS optimizes LLMs by combining policy ensembles and KL regularization.

problem Balancing exploration and exploitation in decision-making and optimization.
method POETS uses policy ensembles and KL regularization to optimize LLMs efficiently.
result POETS achieves state-of-the-art sample efficiency across various domains.

One of the most tedious tasks in the application of machine learning is model selection, i.e. hyperparameter selection. Fortunately, recent progress has been made in the automation of this process, through the use of sequential model-based optimization (SMBO) methods. This can be used to optimize a cross-validation per…

2014-02-04abs ↗pdf ↗

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.

Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for networks based on finding an optimal trade-off between the information content of a…

2019-08-10abs ↗pdf ↗

In this paper we propose to perform model ensembling in a multiclass or a multilabel learning setting using Wasserstein (W.) barycenters. Optimal transport metrics, such as the Wasserstein distance, allow incorporating semantic side information such as word embeddings. Using W. barycenters to find the consensus between…

2019-02-13abs ↗pdf ↗

Best-of-\infty improves LLM performance by efficiently allocating inference-time computation.

problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.

We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-conv…

2015-10-01abs ↗pdf ↗

A new ensemble method improves kNN performance by extending the neighborhood rule.

problem Traditional kNN's limitations when test points are outside the spherical region and ensemble's high errors.
method Determines neighbors in k steps, using bootstrap samples and optimal models selection.
result The proposed ensemble method outperforms state-of-the-art methods on 17 benchmark datasets.

Ensemble techniques are powerful approaches that combine several weak learners to build a stronger one. As a meta-learning framework, ensemble techniques can easily be applied to many machine learning methods. Inspired by ensemble techniques, in this paper we propose an ensemble loss functions applied to a simple regre…

2018-10-25abs ↗pdf ↗