“…If all that we care about is attaining the minimax bound for a single specic ball F C , a great deal is known. For example, over certain L 2 Sobolev balls, special spline smoothers, with appropriate smoothness penalty terms chosen based on F C are asymptotically minimax [36,35]; over certain H older balls, Kernel methods with appropriate bandwidth, chosen with knowledge of F C are nearly minimax [40]; and it is known that no such linear methods can be nearly minimax over certain L p Sobolev balls, p < 2 [33,12]. However, nonlinear methods, such as the nonparametric method of maximum likelihood, are able to behave in a near-minimax way for L p Sobolev balls [32,19], but they require solution of a general n-dimensional nonlinear programming problem in general.…”