Conceptregularity lemma

Regularity Lemma

A lemma in complexity theory used to give efficient oracle reductions, reducing an indistinguishability task to a distinguishing task. Its style resembles that of boosting algorithms.

Timeline (last 90 days)

Nov 4

The regularity lemma can yield an efficient oracle reduction that reduces the indistinguishable task (multi-accuracy) to the distinguishing task (agnostic learning).

Unverified50%

All Facts (1)

Unverified

The regularity lemma can yield an efficient oracle reduction that reduces the indistinguishable task (multi-accuracy) to the distinguishing task (agnostic learning).

50%

Source Articles

Imitation as Learning: On the Complexity Equivalence of Generative and Discriminative ModelsNov 4