5 votes

Adversarial Machine Learning, Learning with (Malicious) noise

In the proof of the positive result in [2] you are referring to, namely Theorem 2, the argument goes as follows. For every possible concept $L_i$ of the hypothesis class $\mathcal{H} = \{L_1,\dots, ...
  • 4,361
2 votes

Partitioning a square for optimal queries

A good idea seems to be to use nonoverlapping circles in the densest circle packing in 2d. Please check the corresponding Wiki-page: https://en.wikipedia.org/wiki/Circle_packing. This way you reach up ...
2 votes

What is the connection between adversarial learning in machine learning and program synthesis?

I don't think they're very similar, once you look under the hood at the techniques that are used. GANs are typically about continuous optimization; program sketches are discrete combinatorial ...
  • 10.5k

Only top scored, non community-wiki answers of a minimum length are eligible