Beyond the low-degree algorithm: mixtures of subcubes and their applications
© 2019 Association for Computing Machinery. We introduce the problem of learning mixtures of k subcubes over (0,1)n, which contains many classic learning theory problems as a special case (and is itself a special case of others). We give a surprising nO(log k)-time learning algorithm based on higher...
Main Authors: | Chen, Sitan (Author), Moitra, Ankur (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
ACM,
2021-11-09T19:19:08Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Beyond the low-degree algorithm: mixtures of subcubes and their applications
by: Chen, Sitan, et al.
Published: (2022) -
Star Coloring of Subcubic Graphs
by: Karthick T., et al.
Published: (2013-05-01) -
On locally irregular decompositions of subcubic graphs
by: Olivier Baudon, et al.
Published: (2018-01-01) -
Interval Incidence Coloring of Subcubic Graphs
by: Małafiejska Anna, et al.
Published: (2017-05-01) -
Implementation for Subcube Based Query Processing
by: Cheng-Ling shiou, et al.
Published: (2004)