We illustrate basic inequality, noise complexity (e.g. Radamacher complexity, Gaussian complexity), and localization for the least square estimator in the simplest sequence model setting.
Consider the general constrained optimization problem $\eqref{P}$ shown below, where we have not assumed anything regarding the functions $f$, $h$, $l$ (like linearity or convexity).