Machine-learning data generators use an additional objective to avoid generating data that is too similar to any previously known data example. This prevents plagiarism or simple copying of existing data examples, enhancing the ability of a generator to usefully generate novel data. A formulation of generative adversarial network (GAN) learning as the mixed strategy minimax solution of a zero-sum game solves the convergence and stability problem of GANs learning, without suffering mode collapse.