Fast agnostic classification

It is believed it is possible the KG algorithm runs in polynomial time when the inputs are normally distributed, and this algorithm would solve a notorious problem in computer science: learning logarithmically-sparse parities with noise.