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,742 papers · 148 categories

Trend · papers per month

336598130 · Jun 202019922001200920172026
48 results for ensemble aggregation

Researchers improve deep ensemble forecast aggregation methods.

problem Aggregating forecast distributions from deep ensembles for better predictive performance.
method Comprehensive analysis of twelve benchmark data sets, comparing probability- and quantile-based aggregation methods for three neural network-based approaches.
result A general quantile aggregation framework for deep ensembles improves predictive performance in various settings.

This work studies a unified approach to ensemble aggregation using likelihood perspective.

problem Density aggregation in machine learning, focusing on improving ensemble predictions.
method Normalized generalized mean of order r in the log-likelihood framework.
result The optimal range for r is [0,1], providing a principled justification for linear and geometric pooling.

This paper explores methods for combining predictions in multilabel classification.

problem Lack of formal framework for aggregation in multilabel ensembles.
method Introduces two approaches: 'predict then combine' (PTC) and 'combine then predict' (CTP).
result Standard voting techniques are outperformed by tailored instantiations of CTP and PTC.

Partial fusion combines neural networks to balance accuracy and efficiency.

problem Balancing accuracy and computational cost in neural networks.
method Extending weight aggregation methods based on neuron-level similarity, using partial optimal transport to match similar neurons.
result Achieves a flexible tradeoff between computational cost and performance.

Paper introduces WWAggr for ensemble CPD, improving accuracy and decision threshold selection.

problem Challenges in detecting abrupt distribution shifts in high-dimensional data streams.
method Introduces WWAggr, a novel task-specific ensemble aggregation method based on Wasserstein distance.
result Demonstrates WWAggr outperforms standard aggregation techniques and decision threshold selection.

A new method improves efficiency of conformal prediction for ensemble models.

problem Efficiently estimating uncertainty for ensemble models without distributional assumptions.
method Proposes a multivariate score function to merge prediction regions of individual models, reducing conservatism.
result Demonstrates more efficient prediction regions compared to existing methods.

Learning algorithms that aggregate predictions from an ensemble of diverse base classifiers consistently outperform individual methods. Many of these strategies have been developed in a supervised setting, where the accuracy of each base classifier can be empirically measured and this information is incorporated in the…

2018-02-13abs ↗pdf ↗

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 ↗

FedBE aggregates local models into a robust global model via Bayesian inference.

problem Challenges in aggregating non-i.i.d. local models into a global model in federated learning.
method FedBE uses Bayesian inference to sample and combine higher-quality global models from local models.
result FedBE leads to more robust aggregation of local models into a global model, especially when data is non-i.i.d.

The Wisdom of Crowds is a phenomenon described in social science that suggests four criteria applicable to groups of people. It is claimed that, if these criteria are satisfied, then the aggregate decisions made by a group will often be better than those of its individual members. Inspired by this concept, we present a…

2016-05-13abs ↗pdf ↗

The paper presents a method for generating well-calibrated prediction intervals using quality-driven deep ensembles.

problem Generating reliable prediction intervals for regression analysis.
method A multi-objective loss function combining quality measures for prediction intervals and point estimates, with a penalty function to ensure semantic integrity and stability.
result The method produces well-calibrated prediction intervals and point estimates, capturing both aleatoric and epistemic uncertainty.

MNIST-NET10 fusion improves MNIST classification to 0.1% error rate.

problem Improving MNIST classification accuracy.
method Complex heterogeneous fusion architecture using degree of certainty aggregation.
result MNIST-NET10 achieves 0.1% error rate with 10 misclassifications.

A new method aggregates generative classifiers to resist adversarial attacks.

problem Adversarial attacks on deep neural networks.
method Rank-aggregating ensemble of generative classifiers trained on intermediate layer responses.
result The ensemble of generative classifiers shows robustness to adversarial attacks.

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.

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.

Probabilistic graphical models are graphical representations of probability distributions. Graphical models have applications in many fields including biology, social sciences, linguistic, neuroscience. In this paper, we propose directed acyclic graphs (DAGs) learning via bootstrap aggregating. The proposed procedure i…

2014-06-09abs ↗pdf ↗

WildWood improves Random Forest predictions using bootstrap out-of-bag samples.

problem Improving Random Forest predictions for supervised learning.
method Uses bootstrap out-of-bag samples to compute improved predictions by aggregating all possible subtrees with exponential weights.
result WildWood produces faster and more competitive predictions compared to other ensemble methods.

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.

Improved sales forecasting at various levels using ensemble methods.

problem Enhancing sales forecasting accuracy at different levels of e-commerce data.
method Hierarchical robust aggregation of sales forecasts using exponential smoothing and Holt's linear trend method.
result Better forecasts at subsubfamily, subfamily, and family levels compared to individual techniques.

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 ↗

The rapid adoption of machine learning has increased concerns about the privacy implications of machine learning models trained on sensitive data, such as medical records or other personal information. To address those concerns, one promising approach is Private Aggregation of Teacher Ensembles, or PATE, which transfer…

2018-02-24abs ↗pdf ↗

Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In t…

2018-03-29abs ↗pdf ↗

This paper adapts PATE for semantic segmentation while maintaining privacy.

problem Preserving privacy in medical machine learning, especially for sensitive information.
method Adapting PATE for semantic segmentation using low-dimensional representations and low-sensitivity queries.
result An Autoencoder-based PATE variant achieves a higher Dice coefficient for the same privacy guarantee.

Ensemble model predicts AD progression from CN status with high accuracy.

problem Early prediction of clinical progression from cognitively normal to mild cognitive impairment or Alzheimer's disease.
method Ensemble survival analysis combining penalized Cox regression, advanced survival models, and aggregation techniques.
result Ensemble model achieved peak C-index of 0.907 and integrated time-dependent AUC of 0.904, outperforming baseline models.

Different types of training data have led to numerous schemes for supervised classification. Current learning techniques are tailored to one specific scheme and cannot handle general ensembles of training data. This paper presents a unifying framework for supervised classification with general ensembles of training dat…

2019-01-24abs ↗pdf ↗

New research shows deep models learn sparse features, limiting transfer learning; ensembling improves performance.

problem Sparse feature learning in deep models limits transfer learning performance.
method Developed a theoretical framework and proposed an ensembling strategy to aggregate multiple models.
result Ensembling yields a 9% improvement in transfer accuracy without extra pretraining cost.