A historically important paper which I believe first demonstrated that biasing estimators can result in improved estimates for ordinary linear models:
- Stein, C., 1956, January. Inadmissibility of the usual estimator for
the mean of a multivariate normal distribution. In Proceedings of the
Third Berkeley symposium on mathematical statistics and probability
(Vol. 1, No. 399, pp. 197-206).
A few more modern and important penalties include SCAD and MCP:
- Fan, J. and Li, R., 2001. Variable selection via nonconcave penalized
likelihood and its oracle properties. Journal of the American
statistical Association, 96(456), pp.1348-1360.
- Zhang, C.H., 2010. Nearly unbiased variable selection under minimax
concave penalty. The Annals of statistics, 38(2), pp.894-942.
And some more on very good algorithms for obtaining estimates using these methods:
- Breheny, P. and Huang, J., 2011. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. The annals of applied statistics, 5(1), p.232.
- Mazumder, R., Friedman, J.H. and Hastie, T., 2011. Sparsenet:
Coordinate descent with nonconvex penalties. Journal of the American
Statistical Association, 106(495), pp.1125-1138.
Also worth looking at is this paper on the Dantzig selector which is very closely related to the LASSO, but (i believe) it introduces the idea of oracle inequalities for statistical estimators which are a pretty powerful idea
- Candes, E. and Tao, T., 2007. The Dantzig selector: Statistical estimation when p is much larger than n. The Annals of Statistics, pp.2313-2351.