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

4793140186 · Jun 202019922001200920172026
48 results for ensemble interactions

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.

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.

problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.

Enhanced ensemble filters use machine learning to improve accuracy in filtering models.

problem Accuracy limitations of traditional ensemble Kalman filters.
method Introduces a measure neural mapping (MNM) to map joint predicted state and observation to updated state estimates.
result Superior root-mean-square-error performance compared to leading methods in filtering models.

A new machine learning framework called machine collaboration improves prediction accuracy.

problem Improving prediction accuracy in machine learning.
method Machine Collaboration (MaC) framework, which uses a circular and interactive learning approach.
result Machine Collaboration framework significantly outperforms other state-of-the-art methods in most cases.

Bayesian inference for neural networks improves uncertainty quantification.

problem Improving predictive uncertainty in neural networks.
method Ensemble Kalman filter extensions and interacting particle systems.
result Effective methods for quantifying predictive uncertainty in neural networks.

Unified theory linking Bayesian and ensemble methods in deep learning.

problem Uncertainty quantification in deep learning.
method Reformulating optimisation as convex optimisation in probability measures, studying Wasserstein gradient flows.
result Unified theory explaining success of deep ensembles over variational inference.

Though deep neural networks have achieved significant progress on various tasks, often enhanced by model ensemble, existing high-performance models can be vulnerable to adversarial attacks. Many efforts have been devoted to enhancing the robustness of individual networks and then constructing a straightforward ensemble…

2019-01-25abs ↗pdf ↗

This paper describes structuring data and constructing plots to explore forest classification models interactively. A forest classifier is an example of an ensemble, produced by bagging multiple trees. The process of bagging and combining results from multiple trees, produces numerous diagnostics which, with interactiv…

2017-04-08abs ↗pdf ↗

GER learns particle dynamics from unpaired snapshots using physics-informed GANs.

problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.

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 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.

Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based le…

2014-08-23abs ↗pdf ↗

We propose a method to extract interpretable rules from tree ensembles.

problem Tree ensembles are accurate but hard to interpret.
method Propose an estimator to extract compact sets of decision rules from tree ensembles.
result Our estimator improves accuracy and reveals useful relationships in the data.

The paper addresses interpretability issues in EBM models by improving feature selection and reducing spurious interactions.

problem Interpretability issues in EBM models, especially spurious interactions and single feature dominance.
method Alternate Cross-feature selection, ensemble features, and model configuration alteration techniques.
result Our approach improves interpretability and predictive performance of EBM models, reducing spurious interactions and single feature dominance.

A framework detects nonlinear and interaction effects in epidemiological data with uncertainty quantification.

problem Lack of reliable inference for ML-discovered nonlinearities and interactions in epidemiological data.
method Combines Bayesian sparse regression, tree ensembles, and Shapley values.
result Valid uncertainty quantification for feature effects at the individual level.

New ensemble models classify mouse movement trajectories to assess survey question difficulty.

problem Assessing survey question difficulty based on respondents' interaction data.
method Ensemble models combining semi-metric-based weak learners to classify multivariate functional data.
result Improved survey data quality through better identification of respondent difficulty.

Paper tackles noisy and expensive likelihoods in complex models.

problem Calibrating parameters in complex models with noisy and expensive evaluations.
method Ensemble Kalman methods and Langevin-based methods for inverse problems.
result Ensemble Kalman methods perform well in noisy conditions, while Langevin methods are adversely affected.

Fibonacci Ensembles use Fibonacci weights to improve ensemble learning, inspired by natural growth patterns.

problem Improving ensemble learning methods to enhance model performance and interpretability.
method Introduces Fibonacci weights and a recursive ensemble dynamic to reduce variance and enrich representational depth.
result Fibonacci weighting can match or improve upon uniform averaging in ensemble learning experiments.

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 ↗

We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural langu…

2018-01-20abs ↗pdf ↗

We build a statistical ensemble representation of two economic models describing respectively, in simplified terms, a payment system and a credit market. To this purpose we adopt the Boltzmann-Gibbs distribution where the role of the Hamiltonian is taken by the total money supply (i.e. including money created from debt…

2011-09-02abs ↗pdf ↗

Tree ensembles are flexible predictive models that can capture relevant variables and to some extent their interactions in a compact and interpretable manner. Most algorithms for obtaining tree ensembles are based on versions of boosting or Random Forest. Previous work showed that boosting algorithms exhibit a cyclic b…

2017-09-16abs ↗pdf ↗

Estimates network structure and interaction rules from multiple agent trajectories.

problem Modeling multi-agent systems on networks from data.
method Jointly infers network topology and interaction kernels using non-convex optimization.
result ORALS estimator is consistent and asymptotically normal under coercivity conditions.

We present an extension of the ergodic, mixing, and Bernoulli levels of the ergodic hierarchy for statistical models on curved manifolds, making use of elements of the information geometry. This extension focuses on the notion of statistical independence between the microscopical variables of the system. Moreover, we e…

2017-03-10abs ↗pdf ↗

AdaEnsemble learns adaptive feature interactions for CTR prediction.

problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.

Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…

2018-02-12abs ↗pdf ↗

This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences and interactions. Our problem formulation accordingly trades off rule set comple…

2019-06-05abs ↗pdf ↗