# Does learning conjunctions with malicious noise reduce to learning conjunctions with random noise?

In Feldman-Gopalan-Khot-Ponnuswami 06 the authors show that agnostically learning parities reduces to learning parities with random classification noise. They also remark (among other things) that learning conjunctions in this model is NP-hard.

Though I can't remember the source right now, I also recall that a random projection argument gives a reduction from learning parities with malicious noise to learning parities with uniform random noise.

Is there a reduction from learning conjunctions with malicious noise to learning conjunctions with random noise?