We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We consider the problem of estimating the mean and covariance of a distribution from iid samples in $\mathbb{R}^n$, in the presence of an $η$ fraction of malicious noise; this is in contrast to much recent work where the noise itself is assumed to be from a distribution of known type. The agnostic problem includes many interesting special cases, e.g., learning the parameters of a single Gaussian (or finding the best-fit Gaussian) when $η$ fraction of data is adversarially corrupted, agnostically learning a mixture of Gaussians, agnostic ICA, etc. We present polynomial-time algorithms to estimate the mean and covariance with error guarantees in terms of information-theoretic lower bounds. As a corollary, we also obtain an agnostic algorithm for Singular Value Decomposition.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1604.06968")
get_code_for_paper("1604.06968")
have("1604.06968")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1604.06968.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1604.06968)
Connect an agent — have() is free.