1 citations · 5 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LG2022★ 1 cited
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
Stefan Tiegel
We show hardness of improperly learning halfspaces in the agnostic model, both in the distribution-independent as well as the distribution-specific setting, based on the assumption…
cs.LG2022★ 1 cited
Fast algorithm for overcomplete order-3 tensor decomposition
Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu +2
We develop the first fast spectral algorithm to decompose a random third-order tensor over of rank up to . Our algorithm only involves…
cs.LG2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise
Rajai Nasser, Stefan Tiegel
We give tight statistical query (SQ) lower bounds for learnining halfspaces in the presence of Massart noise. In particular, suppose that all labels are corrupted with probability…