activity
20182026
most citedImproved Hardness Results for Learning Intersections of Halfspaces

1 citations · 5 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG2024

Robust Mixture Learning when Outliers Overwhelm Small Groups

Daniil Dmitriev, Rares-Darius Buhai, Stefan Tiegel +5

We study the problem of estimating the means of well-separated mixtures when an adversary may add arbitrary outliers. While strong guarantees are available when the outlier fractio…

cs.LG2024

Testably Learning Polynomial Threshold Functions

Lucas Slot, Stefan Tiegel, Manuel Wiedmer

Rubinfeld & Vasilyan recently introduced the framework of testable learning as an extension of the classical agnostic model. It relaxes distributional assumptions which are difficu…

cs.LG2024

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression

Rares-Darius Buhai, Jingqiu Ding, Stefan Tiegel

We study computational-statistical gaps for improper learning in sparse linear regression. More specifically, given samples from a -sparse linear model in dimension , we…

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…

cs.LG2021★ 1 cited

Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers

Tommaso d'Orsi, Chih-Hung Liu, Rajai Nasser +3

We develop machinery to design efficiently computable and consistent estimators, achieving estimation error approaching zero as the number of observations grows, when facing an obl…