A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise.
Ilias DiakonikolasDaniel M. KaneVasilis KontonisChristos TzamosNikos ZarifisPublished in: CoRR (2020)
Keyphrases
- learning algorithm
- dynamic programming
- np hard
- computational complexity
- worst case
- preprocessing
- noisy data
- detection algorithm
- supervised learning
- strongly polynomial
- learning phase
- segmentation algorithm
- theoretical analysis
- input data
- upper bound
- neural network
- k means
- learning process
- lower bound
- objective function
- bayesian networks
- search space
- gaussian noise
- search algorithm
- statistical queries
- read once formulas
- optimal solution