165 citations · 950 across the 71 of their papers we have counts for
Showing 2021 · cs.DSShow all
3 papers · 2 filters
cs.DS2021
Robust Voting Rules from Algorithmic Robust Statistics
Allen Liu, Ankur Moitra
Maximum likelihood estimation furnishes powerful insights into voting theory, and the design of voting rules. However the MLE can usually be badly corrupted by a single outlying sa…
cs.DS2021★ 1 cited
Robust Model Selection and Nearly-Proper Learning for GMMs
Jerry Li, Allen Liu, Ankur Moitra
In learning theory, a standard assumption is that the data is generated from a finite mixture model. But what happens when the number of components is not known in advance? The pro…
cs.DS2021★ 1 cited
Algorithms from Invariants: Smoothed Analysis of Orbit Recovery over
Allen Liu, Ankur Moitra
In this work we study orbit recovery over , where the goal is to recover a function on the sphere from noisy, randomly rotated copies of it. We assume that the function is a…