arXiv Statistics ML By Ebrahim Khaled Ebrahim, Ahmed El-Kotory

EDGE: a closed-form directed test for the calibration of probabilistic binary classifiers

Read the original on arXiv Statistics ML →

The paper introduces EDGE, a closed‑form statistical test for assessing the calibration of probabilistic binary classifiers, specifically logistic regression. EDGE uses the same binned predicted‑versus‑observed table as a reliability diagram, projects standardized bin residuals onto a small basis of smooth calibration‑distortion shapes, and yields a null distribution that is a weighted sum of chi‑square variables. The method requires only a single pass over the data and a small eigendecomposition, avoiding refitting, resampling, or tuning, and remains robust in sparse or misspecified settings where other binned tests fail.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Sep 18

Interpretable and Calibrated Classification of Clinical Data Using Supervised Feature Binarization

The paper introduces a statistically grounded framework for interpretable, rule-based clinical classification using Bernoulli Naïve Bayes (BNB). It employs supervised chi‑square‑guided binarization to convert continuous medical variables into binary indicators, enabling BNB to handle continuous data while maintaining transparency. On three benchmark datasets—Pima Indians Diabetes, Wisconsin Breast Cancer, and Heart Failure Prediction—the method achieved AUCs of 0.800, 0.984, and 0.919, respectively, and demonstrated reliable probability calibration through cross‑validated analysis and post‑hoc beta calibration.

By Antony Garcia, Adrian Noriega, Gabrielle Britton, Xinming Huang
arXiv Machine Learning
Jul 1

Calibration, Not Compilation: Detecting and Repairing Misspecified Probabilistic Programs Written by Language Models

arXiv:2606. 31630v1 Announce Type: new Abstract: Language models increasingly write probabilistic programs (in NumPyro, Stan, or Pyro), but a program that compiles, runs, and passes every unit test can still be \emph{statistically} wrong -- a Gaussian likelihood for heavy-tailed data, a Poisson for over-dispersed counts, an invalid prior support, or a pathological parameterization.

By Jian Xu, Delu Zeng, John Paisley, Qibin Zhao