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

126252377503 · May 202619922001200920172026
48 results for Structured Ensemble

Paper proposes ensemble distillation for well-calibrated structured prediction.

problem Well-calibrated predictions are hard to achieve in structured prediction.
method Ensemble distillation framework for structured prediction.
result Ensemble distillation produces well-calibrated models with similar performance and calibration benefits to ensembles.

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.

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 reduces memory usage for deep neural networks ensembles.

problem Reducing memory footprint of ensemble methods for deep learning.
method Extract multiple sub-networks from a single neural network through end-to-end optimization.
result Achieves higher or comparable accuracy with significantly less memory usage.

GEnBP combines EnKF and GaBP for efficient high-dimensional inference.

problem Efficient inference in high-dimensional models.
method Gaussian Ensemble Belief Propagation algorithm combining EnKF and GaBP.
result GEnBP outperforms existing methods in accuracy and efficiency.

Proposes a new method to enhance neural learning by maximizing information gain.

problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.

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.

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.

Compact Gaussian model approximates deep ensemble predictions.

problem Efficiently approximating deep ensemble models for image prediction.
method Sparse-structured multivariate Gaussian with Cholesky parameterization trained to match pre-trained ensemble outputs.
result Compact representation captures uncertainty and structured correlations explicitly.

New method models aptamer libraries as Boltzmann-weighted graph ensembles for better affinity predictions.

problem Anomalous candidates in SELEX datasets obscure true aptamer-ligand affinity.
method Boltzmann graph ensemble embeddings for thermodynamically parameterized exponential-family random graphs.
result Proposed embedding enables robust community detection and subgraph-level explanations for aptamer ligand affinity.

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.

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 ↗

s-RBFN integrates multiple hypotheses for efficient and diverse prediction.

problem Integrating multiple hypotheses into learning models for regression.
method Structured Radial Basis Function Network (s-RBFN) using Voronoi tessellations and least-squares training.
result s-RBFN achieves superior generalization and efficiency compared to other 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.

Several real problems ranging from text classification to computational biology are characterized by hierarchical multi-label classification tasks. Most of the methods presented in literature focused on tree-structured taxonomies, but only few on taxonomies structured according to a Directed Acyclic Graph (DAG). In thi…

2014-06-17abs ↗pdf ↗

Packed-Ensembles improve uncertainty estimation in constrained hardware.

problem Hardware limitations restrict the size of ensembles and network capacity, degrading performance.
method Packed-Ensembles (PE) design and train lightweight structured ensembles by modulating encoding space and parallelizing into a single backbone.
result PE accurately preserves diversity and maintains performance on key metrics like accuracy, calibration, and out-of-distribution detection.

We propose an ensemble clustering algorithm for graphs (ECG), which is based on the Louvain algorithm and the concept of consensus clustering. We validate our approach by replicating a recently published study comparing graph clustering algorithms over artificial networks, showing that ECG outperforms the leading algor…

2018-09-14abs ↗pdf ↗

We generalize the recently discovered relationship between JT gravity and double-scaled random matrix theory to the case that the boundary theory may have time-reversal symmetry and may have fermions with or without supersymmetry. The matching between variants of JT gravity and matrix ensembles depends on the assumed s…

2019-07-07abs ↗pdf ↗

Ensemble learning is a powerful paradigm that has been usedin the top state-of-the-art machine learning methods like Random Forestsand XGBoost. Inspired by the success of such methods, we have devel-oped a new Genetic Programming method called Ensemble GP. The evo-lutionary cycle of Ensemble GP follows the same steps a…

2020-01-21abs ↗pdf ↗

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.

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.

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.

An ensemble of neural networks is known to be more robust and accurate than an individual network, however usually with linearly-increased cost in both training and testing. In this work, we propose a two-stage method to learn Sparse Structured Ensembles (SSEs) for neural networks. In the first stage, we run SG-MCMC wi…

2018-03-01abs ↗pdf ↗

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 ↗

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.

Study on ensemble, distillation, and self-distillation in deep learning models.

problem Improving test accuracy in deep learning models using ensemble and distillation methods.
method Formal study of ensemble and distillation, considering multi-view data structure.
result Proven that ensemble and distillation can improve test accuracy in deep learning models, and the superior performance can be distilled into a single model.

Deep ensembles outperform deep ensembles of Bayesian neural networks on in-distribution data.

problem Improving model calibration and uncertainty quantification in Bayesian Neural Networks.
method Systematic investigation of deep ensembles of Bayesian Neural Networks across various datasets and architectures.
result Deep ensembles consistently outperform deep ensembles of Bayesian neural networks on in-distribution data.

TREX explains tree ensembles by identifying key training examples.

problem Identifying which training examples most influence tree ensemble predictions.
method TREX builds a surrogate model using a kernel that captures tree ensemble structure, approximating the original model.
result TREX provides accurate and effective explanations for tree ensembles.

ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.

problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.

Develops an empirical likelihood framework for random forests and ensembles.

problem Quantifying the statistical uncertainty of random forests and ensembles.
method Empirical likelihood framework exploiting the incomplete UU-statistic structure of ensemble predictions.
result Modified empirical likelihood statistic achieves accurate coverage and practical reliability.

Deep learning ensemble improves Alzheimer vs. Mild Cognitive Impairment diagnosis.

problem Differentiating Alzheimer Disease from Mild Cognitive Impairment.
method Hybrid deep learning ensemble framework using MRI slices, pretrained models, and stacked ensemble learning.
result State-of-the-art accuracy (99.21%) for Alzheimer vs. Mild Cognitive Impairment classification.

An ensemble technique is characterized by the mechanism that generates the components and by the mechanism that combines them. A common way to achieve the consensus is to enable each component to equally participate in the aggregation process. A problem with this approach is that poor components are likely to negativel…

2018-04-17abs ↗pdf ↗

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.

Spectral analysis detects structural changes in financial networks.

problem Detecting structural transitions in financial networks to assess systemic risk.
method Ensemble properties of spectral radius of random graph models calibrated on real-world evolving networks.
result The spectral deviation captures ongoing topological changes in financial networks.

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.

A graph neural network improves multivariate post-processing of ensemble forecasts.

problem Systematic biases in ensemble forecasts and loss of dependencies across forecast dimensions.
method A composite-Loss Graph Neural Network (dualGNN) trained with a composite loss function combining ES and VS.
result The dualGNN outperforms traditional methods in multivariate verification metrics and captures spatial relationships.