c03 · E3

Open: How to Know a Claim Is True

c03.E3.1E3 · open

A report states: "For every input drawn from the deployment distribution, the classifier's error is below one per cent." Section 3.1 says that a universal claim promises every case at once, that one failing case ends it, and that no finite sample establishes it. Section 3.2 says a proof runs from stated assumptions to the conclusion. Section 3.4 says the sentence quantifies over a set of inputs together with a distribution over them.

The field has no general procedure that turns a finite test into that sentence, and papers print sentences of that shape. Take a position: what would you accept as establishing it, and what would you put in its place if you cannot establish it?

In your answer: write the quantifier structure of the claim and of its negation; say what a test on held-out rows establishes and what it does not; say what an argument would have to assume in order to reach the sentence, and whether those assumptions can be checked; state the replacement sentence you would publish, with its scope; and name one way a true instance of your replacement could still mislead a reader.

Rubric. Tick each criterion your answer meets, then save the self-assessment. The platform does not grade it.

Other tiers

E1 Practise · E2 Derive

Every hint opened, solution viewed and answer checked is recorded in this browser only. See Progress to export or delete it.