This study addresses a case involving a mixture of two product distributions over binary vectors. A polynomial time algorithm is given that computes a mixture distribution which is close to the target distribution. The algorithm is efficient both in its sample complexity and its computational complexity.
|Number of pages||10|
|State||Published - 1999|
|Event||Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) - Santa Cruz, CA, USA|
Duration: 6 Jul 1999 → 9 Jul 1999
|Conference||Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99)|
|City||Santa Cruz, CA, USA|
|Period||6/07/99 → 9/07/99|