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

120240359479 · Jun 202019922001200920172026
48 results for committee machines

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.

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.

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.

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.

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 ↗

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 ↗

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.

Paper proposes machine learning models for more accurate road inspection.

problem Traditional road inspection systems have safety, energy, and cost issues.
method Hybrid machine learning models using surface deflection data from FWD tests.
result CMIS model outperforms other models with APRE=2.3303, AAPRE=11.6768, RMSE=12.0056, and SD=0.0210.

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.

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 ↗

Study predicts shear stress in compound channels using data mining and machine learning.

problem Predicting shear stress distribution in symmetric compound channels.
method Conducted experiments to measure shear stress. Used data mining and machine learning models (RF, M5P, RC, KStar, AR) to predict.
result Random Forest (RF) model showed highest accuracy with R2=0.9.

Boosting is known to be sensitive to label noise. We studied two approaches to improve AdaBoost's robustness against labelling errors. One is to employ a label-noise robust classifier as a base learner, while the other is to modify the AdaBoost algorithm to be more robust. Empirical evaluation shows that a committee of…

2013-09-26abs ↗pdf ↗

DIAL learns embeddings to maximize recall and accuracy for entity resolution.

problem Low resource settings for entity resolution with large Cartesian product search space.
method DIAL uses an Index-By-Committee framework with pre-trained transformer language models to jointly learn embeddings for recall and accuracy.
result DIAL achieves high precision, recall, and efficiency on benchmark datasets.

New algorithm mitigates affinity bias in hiring feedback loops.

problem Mitigating affinity bias in hiring decisions to avoid unconscious favoritism.
method Introducing affinity bandits, a new bandit variant that accounts for evolving biased feedback.
result Elimination-style algorithm nearly matches the derived regret bound, outperforming classical algorithms.

Wisdom of the crowd, the collective intelligence derived from responses of multiple human or machine individuals to the same questions, can be more accurate than each individual, and improve social decision-making and prediction accuracy. This can also integrate multiple programs or datasets, each as an individual, for…

2017-11-28abs ↗pdf ↗

We test the hypothesis that interconnections across financial institutions can be explained by a diversification motive. This idea stems from the empirical evidence of the existence of long-term exposures that cannot be explained by a liquidity motive (maturity or currency mismatch). We model endogenous interconnection…

2014-08-20abs ↗pdf ↗

We present a computational method for measuring financial risk by estimating the Value at Risk and Expected Shortfall from financial series. We have made two assumptions: First, that the predictive distributions of the values of an asset are conditioned by information on the way in which the variable evolves from simil…

2011-12-13abs ↗pdf ↗

Optimizes neural networks for solving problems with pruning and ensembles of minimal structures.

problem Improving neural network performance and interpretability.
method Pruning neural networks based on the principle of controlling training and pruning, using sensitivity indicators and logically transparent NN.
result Ensemble of minimal neural networks provides diverse forecasting algorithms and identifies areas for further data collection.

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.

Paper proposes a human-algorithm approach to reduce medical device recall risk and workload.

problem High recall rate and regulatory workload in FDA's 510(k) pathway.
method Developed machine learning models to estimate recall risk and proposed a data-driven clearance policy.
result Conservative evaluation of policy shows a 32.9% improvement in recall rate and 40.5% reduction in workload.

MuML models predict molecular dipole moments using atomic partial charges and dipoles.

problem Predicting molecular dipole moments accurately and efficiently.
method Combining atomic partial charges and atomic dipoles within a physically inspired ML model.
result MuML models achieve excellent transferability and accuracy, approaching DFT results at a fraction of the computational cost.

Improving cancer treatment decisions requires considering causal effects, not just model accuracy.

problem Cancer outcome prediction models may cause harm when used for treatment decisions.
method Explains the importance of considering causal effects in model validation and provides guidelines.
result Building and validating models that are useful for decision making requires considering causal effects.

Large financial dataset tracks FOMC communications and their impact.

problem Understanding how FOMC communications influence financial markets.
method Constructed a large annotated dataset of FOMC speeches, minutes, and transcripts. Developed a hawk-dove classification task. Evaluated various models on the dataset and used RoBERTa-large for monetary policy stance measurement.
result Monetary policy stance measures derived from FOMC documents predict market performance.

Improved neural network capacity analysis using simplified RDT.

problem Analyzing the memorization capabilities of sign perceptron neural networks.
method Developed a simplified, partially lifted Random Duality Theory (fl RDT) approach.
result Concrete capacity bounds universally improve over previous best known ones.