Individually calibrated predictors become collectively miscalibrated under Brier-optimal strategic responses with positive belief correlations, but VCG aggregation restores dominant-strategy incentive compatibility and near-optimal performance.
A decision-theoretic generalization of on-line learning and an appli- cation to boosting,
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
method 3
citation-polarity summary
roles
method 3polarities
use method 3representative citing papers
Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches.
Presents MBFC-2025 dataset and multi-view embeddings with fusion methods for media bias and factuality, reporting SOTA results on ACL-2020 and new benchmarks on MBFC-2025.
One-pass algorithms achieve Õ(M²/ε) space for regression splits and Õ(1/ε) space for Gini splits with matching Ω lower bounds.
AgentGA optimizes agent seeds with genetic algorithms and parent-archive inheritance to improve autonomous code generation, beating a baseline on 15 of 16 Kaggle competitions.
LHCb reports first searches and the most stringent limits to date on rare decays such as b to s tau+ tau- and tau to three muons.
Graph neural network achieves AUC of 0.883 for up versus anti-up quark jet charge discrimination in controlled QCD simulations.
Nested cross-validation reveals optimistic bias in standard validation for EEG alcoholism classification, with AdaBoost reaching 78.3% accuracy and most model differences not statistically significant per McNemar's test.
NLP-derived attributes from construction incident reports remain strongly predictive of independently labeled safety outcomes even after removing potential label leakage, with injury severity now well predicted on a dataset of more than 90,000 reports.
citing papers explorer
-
AgentGA: Evolving Code Solutions in Agent-Seed Space
AgentGA optimizes agent seeds with genetic algorithms and parent-archive inheritance to improve autonomous code generation, beating a baseline on 15 of 16 Kaggle competitions.