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

Trend · papers per month

147294441588 · Jun 202019922001200920172026
48 results for Bayesian committee machine

Committee neural network models improve accuracy and enable active learning for interatomic potentials.

problem Improving accuracy and generalization error in interatomic potentials.
method Adapting committee models to neural networks, using multiple models with shared descriptors, and applying active learning to select configurations.
result Committee disagreement provides a measure of generalization error and guides active learning to minimize it.

REALITrees uses a Rashomon ensemble approach for active learning in sparse decision trees.

problem Active learning reduces labeling costs by selecting informative samples, but current methods often sacrifice model diversity and direct characterization of the hypothesis space.
method REALITrees constructs a committee of all near-optimal sparse decision tree models using a Rashomon Set and a Gibbs posterior to weight them by empirical risk.
result REALITrees outperforms randomized ensembles, especially in noisy environments, by leveraging expanded model multiplicity.

New voting strategies show committee-based consensus can scale efficiently.

problem Ensuring honest committees in committee-based consensus protocols.
method Empirical analysis of simpler voting strategies and their convergence to optimality.
result Simpler voting strategies converge to optimality exponentially quickly, ensuring robustness and efficiency.

Heteroscedastic regression considering the varying noises among observations has many applications in the fields like machine learning and statistics. Here we focus on the heteroscedastic Gaussian process (HGP) regression which integrates the latent function and the noise function together in a unified non-parametric B…

2018-11-03abs ↗pdf ↗

To scale Gaussian processes (GPs) to large data sets we introduce the robust Bayesian Committee Machine (rBCM), a practical and scalable product-of-experts model for large-scale distributed GP regression. Unlike state-of-the-art sparse GP approximations, the rBCM is conceptually simple and does not rely on inducing or …

2015-02-10abs ↗pdf ↗

This research tackles image classification with noise, proposing committees of CNNs.

problem Image classification with concurrent feature and label noise.
method Committees of Convolutional Neural Networks (CNNs) for MNIST, CIFAR-10, and CIFAR-100 datasets.
result Committees outperform single models in noisy conditions, especially on difficult datasets.

The study examines how board diversity and CSR committee composition affect corporate governance and financial performance.

problem The relationship between corporate social responsibility (CSR) and corporate governance.
method Theoretical model development based on management and corporate governance theories, focusing on board diversity and CSR committee composition.
result Cognitive and demographic characteristics of board members provide more insights into the link between corporate governance and CSR.

This paper improves active learning by using robust divergences for committee disagreement.

problem Active learning with high measurement costs.
method Query by committee with Bregman divergence (including Kullback-Leibler divergence as a special case).
result The proposed method is more robust and performs as well as or better than conventional methods.

This paper considers a portfolio trading strategy formulated by algorithms in the field of machine learning. The profitability of the strategy is measured by the algorithm's capability to consistently and accurately identify stock indices with positive or negative returns, and to generate a preferred portfolio allocati…

2014-04-05abs ↗pdf ↗

In this work, we describe a framework that unifies many different interactive learning tasks. We present a generalization of the {\it query-by-committee} active learning algorithm for this setting, and we study its consistency and rate of convergence, both theoretically and empirically, with and without noise.

2018-03-17abs ↗pdf ↗

Active learning is a powerful approach to analyzing data effectively. We show that the feasibility of active learning depends crucially on the choice of measure with respect to which the query is being optimized. The standard information gain, for example, does not permit an accurate evaluation with a small committee, …

2012-12-12abs ↗pdf ↗

Active learning improves SR by proposing experiments in data-limited settings.

problem Efficiently gathering data for symbolic regression with physical constraints.
method Query by committee using the Pareto frontier of equations, with physical constraints.
result Reduces data required for SR and achieves state-of-the-art results.

Machine learning (ML) techniques are enjoying rapidly increasing adoption. However, designing and implementing the systems that support ML models in real-world deployments remains a significant obstacle, in large part due to the radically different development and deployment profile of modern ML methods, and the range …

2019-03-29abs ↗pdf ↗

This paper critiques the Standardized Measurement Approach (SMA) for operational risk and recommends maintaining Advanced Measurement Approach (AMA).

problem Weaknesses and failures of the Standardized Measurement Approach (SMA) in operational risk.
method Critical review and analysis of SMA and AMA approaches.
result SMA is unstable, insensitive to risk, and implicitly related to systemic risk in the banking sector.

Current Neural Architecture Search techniques can suffer from a few shortcomings, including high computational cost, excessive bias from the search space, conceptual complexity or uncertain empirical benefits over random search. In this paper, we present ImmuNeCS, an attempt at addressing these issues with a method tha…

2019-11-18abs ↗pdf ↗

Statistical mechanics explains learning in large neural networks near interpolation.

problem Understanding the learning dynamics of large neural networks near interpolation.
method Statistical physics analysis of a two-layer network with generic weight distribution and activation function.
result Learning transitions and feature learning emerge as the number of data increases.

FedSight AI predicts federal funds rate using LLMs and multi-agent reasoning.

problem Predicting Federal Open Market Committee's decisions on federal funds rate.
method Multi-agent framework with large language models, structured and unstructured inputs, and CoD extension for efficient reasoning.
result Achieved 93.75% accuracy and 93.33% stability in predicting FOMC outcomes.

The paper introduces a new method to improve model generalization by routing model copies through permutations.

problem Improving model generalization in machine learning.
method The method replicates a model \(M\) times and rewire the contexts in which local learning messages are computed using permutations.
result The method improves generalization by structured message sharing rather than coupling parameters.

This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.

problem Understanding the reliability and performance of advanced nuclear fuels using DTs.
method Introduces ML-based uncertainty quantification and sensitivity analysis methods applied to BISON fuel performance code.
result Demonstrates the effectiveness of DTs in multi-criteria decision-making for nuclear fuel performance.

A novel Laplace-approximated Bayesian Tensor Network Kernel Machine (LA-TNKM) provides principled uncertainty estimates.

problem How to provide principled uncertainty estimates for tensor network kernel machines.
method Employing a linearized Laplace approximation for Bayesian inference.
result Consistently matches or surpasses Gaussian Processes and BNNs across diverse UCI regression benchmarks.

Bayesian nonparametric machine learning improves instrumental variable inference.

problem Estimating causal effects with nonlinear relationships.
method Bayesian Additive Regression Trees (BART) for estimating functions and Dirichlet Process mixtures for error terms.
result Dramatic improvements in inference with nonlinear data, no manual tuning required.

The paper revisits and improves on a Bayesian relevance vector machine method for small sample sizes.

problem Statistical modeling with small sample sizes relative to the number of covariates.
method Introduces a new class of global-local priors and provides theoretical properties.
result Results on posterior consistency and contraction rates are provided.

Unified Bayesian Optimization framework for model selection balancing effectiveness and training efficiency.

problem Balancing model effectiveness and training efficiency in machine learning model selection.
method Proposes a unified Bayesian Optimization framework to jointly optimize model effectiveness and training efficiency.
result Models selected using the proposed framework significantly improve training efficiency while maintaining strong effectiveness.

Product Kanerva Machines dynamically combine smaller models for better memory organization.

problem Limited organization in the Kanerva Machine.
method Introducing Product Kanerva Machines that dynamically combine multiple smaller Kanerva Machines.
result Product Kanerva Machines can discover spatial tunings that approximately factorize simple images by object.

The paper connects three machine learning methods to reduce generalization errors.

problem Reducing generalization errors in machine learning models.
method Distributionally robust optimization, Bayesian methods, and regularization.
result Machine learning models can be characterized using distributional uncertainty and robustness measures.

Bayesian Optimization improves machine learning for detecting network attacks.

problem Detecting network attacks to secure critical information.
method Bayesian Optimization for tuning machine learning algorithms (SVM-RBF, RF, k-NN).
result The proposed framework achieves high accuracy and low false alarms.

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

Bayesian uncertainty quantification is flawed, according to new research.

problem Flawed interpretation of Bayesian uncertainty quantification.
method Discussion of Bayesian updating and optimization-based perspective, proposing measures of quality.
result Bayesian uncertainty quantification is not coherent with optimization-based perspective.