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

Trend · papers per month

17345168 · Jun 202019922001200920182026
48 results for Grand-Canonical Ensemble

Paper models stock price formation using Gibbs Grand-Canonical Ensemble.

problem Modeling stock price formation and temperature differences.
method Using Gibbs Grand-Canonical Ensemble, defining temperatures for bid and ask orders.
result Temperature difference between bid and ask orders correlates with VAO indicator.

Self-regularizing RBMs learn optimal hidden units efficiently.

problem Learning optimal number of hidden units in RBMs.
method Grand-canonical extension of RBMs with varying hidden units, using chemical potential to control size.
result Efficiently deduces optimal number of hidden units with small generalization error.

In this paper we study the continuum time dynamics of a stock in a market where agents behavior is modeled by a Minority Game and a Grand Canonical Minority Game. The dynamics derived is a generalized geometric Brownian motion; from the Black & Scholes formula the calibration of both the Minority Game and the Grand Can…

2012-05-11abs ↗pdf ↗

Bayesian inference reconstructs external potentials in DFT for many-particle systems.

problem Reconstructing external potentials in classical density-functional theory (DFT) for many-particle systems.
method Combines Bayesian inference with classical DFT to probabilistically reconstruct external potentials.
result Accurately infers external potentials and density profiles with uncertainty quantification.

We study analytically and numerically Minority Games in which agents may invest in different assets (or markets), considering both the canonical and the grand-canonical versions. We find that the likelihood of agents trading in a given asset depends on the relative amount of information available in that market. More s…

2006-03-19abs ↗pdf ↗

We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.

problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.

In this paper the extended model of Minority game (MG), incorporating variable number of agents and therefore called Grand Canonical, is used for prediction. We proved that the best MG-based predictor is constituted by a tremendously degenerated system, when only one agent is involved. The prediction is the most effici…

2013-09-13abs ↗pdf ↗

Bayesian inference learns free energy landscapes from experimental data.

problem Characterize the free energy landscape of classical many-body systems from experimental data.
method Combines non-parametric Bayesian inference with physically-motivated constraints to automate the construction of approximate free energy functionals.
result Inference algorithms yield a probability distribution over free energy functionals, leading to highly accurate analytic expressions.

The existence of a phase transition with diverging susceptibility in batch Minority Games (MGs) is the mark of informationally efficient regimes and is linked to the specifics of the agents' learning rules. Here we study how the standard scenario is affected in a mixed population game in which agents with the `optimal'…

2007-12-03abs ↗pdf ↗

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.

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.

New method creates diverse neural ensembles for better uncertainty estimation and robustness.

problem Creating more robust neural networks for uncertainty estimation and dataset shift.
method Automatically constructing ensembles with varying architectures.
result Ensembles with varying architectures outperform deep ensembles in accuracy, uncertainty calibration, and robustness.

New method certifies joint adversarial robustness of model ensembles.

problem Ensuring robustness of model ensembles against adversarial attacks.
method Proposes a novel technique to certify joint robustness, building on prior work on single-model robustness certification.
result Demonstrates the effectiveness of certifying joint robustness of ensembles, improving understanding of ensemble defenses.

Embedded ensembles improve neural network performance efficiently.

problem Improving neural network performance with fewer resources.
method Analyzing the wide network limit of gradient descent dynamics using Neural-Tangent-Kernel.
result Embedded ensembles exhibit two regimes: independent and collective, affecting performance.

New algorithms improve ensemble diversity, leading to more accurate and smaller models.

problem Building accurate predictive models with diverse base predictors.
method Integrates ensemble diversity into a reinforcement learning framework for ensemble selection.
result Diversity-incorporating ensembles are more accurate and smaller in size.

Study pitfalls of deep learning ensembles in uncertainty estimation.

problem Pitfalls in in-domain uncertainty estimation and ensembling in deep learning.
method Exploration of standards for uncertainty quantification and broad study of ensembling techniques.
result Many sophisticated ensembling techniques are equivalent to a simple ensemble of few networks.

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.

InfiniteBoost builds an infinite ensemble using gradient descent.

problem Building high accuracy ensembles for various machine learning tasks.
method Combines gradient boosting and random forests properties using gradient descent to create an infinite ensemble.
result InfiniteBoost achieves high accuracy on regression, classification, and ranking tasks.

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.

A new ensemble technique improves power forecasting for renewable energy.

problem Improving accuracy in power forecasting for renewable energy.
method Coopetitive soft-gating in a multi-scheme ensemble.
result The technique outperforms other models on publicly available data sets.

Bayesian deep ensembles improve prediction accuracy in various settings.

problem Improving prediction accuracy of deep ensembles in out-of-distribution settings.
method Introducing a randomised, untrainable function to each ensemble member, enabling a posterior predictive distribution interpretation.
result Bayesian deep ensembles make more conservative predictions and outperform standard ensembles in various tasks.

RCAM-based ensemble combines binary classifiers using similarity and vote scheme.

problem Improving binary classification accuracy through ensemble methods.
method RCAM-based ensemble combining classifiers using similarity and recurrent consult-vote scheme.
result RCAM-based ensemble outperforms individual classifiers and majority voting.

The paper simplifies complex tree ensembles for better interpretability.

problem Limited interpretability of tree ensembles like random forest and boosted trees.
method A post-processing method that approximates complex tree ensembles with a simpler, interpretable model using the EM algorithm.
result Complex tree ensembles can be approximated reasonably by simpler, interpretable models.

High-capacity neural network ensembles often benefit more from high-capacity models than from increased diversity.

problem The performance of high-capacity neural network ensembles is often harmed by interventions that promote predictive diversity.
method A large-scale study of nearly 600 neural network classification ensembles, examining various interventions and architectures.
result Discouraging predictive diversity can be benign in large-network ensembles, and higher-capacity models often yield better performance than diverse architectures.

MotherNets speed up deep ensemble learning with shared costs.

problem Training deep neural network ensembles is computationally expensive and time-consuming.
method MotherNets train a single or small set of MotherNets to share data movement and computation costs across ensembles, generating target ensembles by transferring function from MotherNets.
result MotherNets provide a new Pareto frontier for accuracy vs. training cost, scaling improvements as ensemble size increases.

Combines classifiers from different types to improve ensemble accuracy.

problem Improving ensemble accuracy by combining classifiers of different types.
method Builds heterogeneous ensembles by pooling classifiers from multiple homogeneous ensembles, using cross-validation or out-of-bag data for optimal composition.
result Optimal heterogeneous ensemble compositions can be determined using cross-validation or out-of-bag data.

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.

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.

Paper analyzes uncertainty metrics in ensemble learning for healthcare AI.

problem Selecting appropriate uncertainty metrics for ensemble learners in healthcare AI.
method Rigorous analysis of two uncertainty metrics: ensemble mean and variance.
result Ensemble mean is preferable to ensemble variance for decision making in healthcare AI.

Hydra distills ensemble models into a single model while preserving diversity and uncertainty.

problem Loss of ensemble diversity and uncertainty in distilled models.
method Single multi-headed neural network with shared body network.
result Hydra improves distillation performance and preserves ensemble diversity and uncertainty.

We propose and evaluate alternative ensemble schemes for a new instance based learning classifier, the Randomised Sphere Cover (RSC) classifier. RSC fuses instances into spheres, then bases classification on distance to spheres rather than distance to instances. The randomised nature of RSC makes it ideal for use in en…

2014-09-17abs ↗pdf ↗

A new method balances accuracy and diversity in ensemble pruning.

problem Balancing accuracy and diversity in ensemble learning.
method Formalizing ensemble pruning as an objection maximization problem based on information entropy, proposing a distributed framework.
result Achieves less time-consuming execution with minimal accuracy degradation.

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.

Ensemble unsupervised anomaly detection using IRT for hidden ground truth.

problem Challenges in constructing an ensemble from unsupervised anomaly detection methods.
method Use Item Response Theory to compute latent traits and construct an ensemble that downplays noisy methods.
result Demonstrated effectiveness of IRT ensemble on extensive data repository.

Efficient neural network ensembles improve image classification reliability and uncertainty quantification.

problem Uncertainty in neural network predictions for industrial image classification.
method Investigated efficient neural network ensembles (snapshot, batch, multi-input multi-output) for image classification reliability and uncertainty quantification.
result Batch ensemble is a cost-effective and competitive alternative to deep ensembles, offering savings in training and test time.