In this work, we show that the class of multivariate degree-d polynomials mapping \{0,1\}^{n} to any Abelian group G is locally correctable with \widetilde{O}_{d}((\log n)^{d}) queries for up to a fraction of errors approaching half the minimum distance of the underlying code. In particular, this result holds even for polynomials ... more >>>