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

Trend · papers per month

1122 · Jan 201819922001200920182026
7 results for Query-by-Committee

Study evaluates SVM active learning for imbalanced datasets.

problem Imbalanced datasets in text classification and relation extraction.
method Combines SVM with closest-to-hyperplane and query-by-committee selection methods for imbalance.
result ClosestPA algorithm consistently outperforms other methods.

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.

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.

A cost-effective approach to label acquisition using active learning markets.

problem Improving model fitting and training for predictive analytics.
method Formalizing market clearing as an optimisation problem, integrating budget constraints and improvement thresholds, using two active learning strategies with distinct pricing mechanisms.
result Superior performance with fewer labels acquired compared to conventional methods.

Automated AL improves ML potentials for organic molecules, reducing training data by 90%.

problem Developing accurate and transferable ML potentials for molecular energetics.
method Active learning via Query by Committee (QBC) to sample chemical space.
result AL-based potentials achieve similar accuracy with 10-25% of data, outperforming ANI-1.