Confound-matched controls for classifier claims: 1:1 matching, bootstrap AUROC, anchored verdicts, and a refusal when the control is vacuous.
-
Updated
Oct 14, 2026 - Python
Confound-matched controls for classifier claims: 1:1 matching, bootstrap AUROC, anchored verdicts, and a refusal when the control is vacuous.
Built a university Pattern Recognition project that compares classical and machine-learning classifiers through feature selection, PCA/LDA transformations, hyperparameter tuning, and cross-validated evaluation on a real binary classification dataset.
The project focuses on analyzing neural activity data to classify neuron types (spiny and aspiny). It integrates unsupervised learning methods (PCA, Autoencoders) and supervised learning models (Logistic Regression, MLP) to build accurate classifiers that effectively analyze neurons' electrical responses.
BigQuery SQL workflow for estimating classifier recall using stratified sampling and weighted evaluation.
A semantic cache is a classifier that is wrong silently. This is the safety gate (threshold AND deterministic vetoes) and the calibration harness that measures where its safety ends — which concluded the cache should not be turned on.
Agent-driven, independent reproduction of ICML 2026 paper "Instance-Level Costs for Nuanced Classifier Evaluation" (NEC metric) on public Jigsaw, Turkey and NHANES data. On Jigsaw (TF-IDF logistic regression), error rate is 2.92× NEC (paper ~3×).
To associate your repository with the classifier-evaluation topic, visit your repo's landing page and select "manage topics."