research
∙
12/06/2022
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning
The Forster transform is a method of regularizing a dataset by placing i...
share
research
∙
06/14/2021
Boosting in the Presence of Massart Noise
We study the problem of boosting the accuracy of a weak learner in the (...
research
∙
02/10/2021
Agnostic Proper Learning of Halfspaces under Gaussian Marginals
We study the problem of agnostically learning halfspaces under the Gauss...
research
∙
11/12/2020
Optimal Private Median Estimation under Minimal Distributional Assumptions
We study the fundamental task of estimating the median of an underlying ...
research
∙
08/24/2020
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
research
∙
06/11/2020
Learning Halfspaces with Tsybakov Noise
We study the efficient PAC learnability of halfspaces in the presence of...
research
∙
11/05/2019
Learning Optimal Search Algorithms from Data
Classical algorithm design is geared towards worst case instances and fa...
research
∙
07/12/2018
