Pith. sign in

REVIEW 3 cited by

Cold Case: The Lost MNIST Digits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.10498 v2 pith:W6HX2J6F submitted 2019-05-25 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords mnistalthoughdatasetdigitsidentifierlostnistaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Although the popular MNIST dataset [LeCun et al., 1994] is derived from the NIST database [Grother and Hanaoka, 1995], the precise processing steps for this derivation have been lost to time. We propose a reconstruction that is accurate enough to serve as a replacement for the MNIST dataset, with insignificant changes in accuracy. We trace each MNIST digit to its NIST source and its rich metadata such as writer identifier, partition identifier, etc. We also reconstruct the complete MNIST test set with 60,000 samples instead of the usual 10,000. Since the balance 50,000 were never distributed, they enable us to investigate the impact of twenty-five years of MNIST experiments on the reported testing performances. Our results unambiguously confirm the trends observed by Recht et al. [2018, 2019]: although the misclassification rates are slightly off, classifier ordering and model selection remain broadly reliable. We attribute this phenomenon to the pairing benefits of comparing classifiers on the same digits.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal multiclass overfitting by sequence reconstruction from Hamming queries

    cs.LG 2019-08 accept novelty 8.0 of 10

    The optimal overfitting bias for multiclass classification with k accuracy queries is Theta_tilde(max(sqrt(k/(mn)), k/n)), and the paper gives polynomial-time algorithms achieving it.

  2. That which we call private

    cs.LG 2019-08 conditional novelty 6.0 of 10

    Newer 'relaxed' differential privacy analyses yield tighter upper-bound guarantees without changing actual privacy loss, and attack success can be translated into a lower bound on that loss.

  3. Kannada-MNIST: A new handwritten digits dataset for the Kannada language

    cs.CV 2019-08 conditional novelty 6.0 of 10

    A new, fully open-source handwritten Kannada digits dataset with MNIST-compatible format and baseline CNN accuracies of about 97% in-domain and 76% out-of-domain.

Pith tools