Elsewhere: [math people] [google] [google scholar]

- I-LAMM for sparse learning: Simultaneous control of algorithmic complexity and statistical error. The Annals of Statistics 2018. 46:814-841 .
- Pathwise coordinate optimization for sparse learning: Algorithm and theory. The Annals of Statistics 2018. 46:180-218 .
- Aggregation of affine estimators. Electronic Journal of Statistics 2014. 8:302-327 .
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems. The Annals of Statistics 2014. 42:2164-2201 .
- Multi-stage convex relaxation for feature selection. Bernoulli 2013. 2013-11:- .
- Effective bound of linear series on arithmetic surfaces. Duke Mathematical Journal 2013. 162:1723-1770 .
- Introduction to the Special Issue on Sparsity and Regularization Methods. Statistical Science 2012. 27:447-449 .
- Deviation optimal learning using greedy $Q$-aggregation. The Annals of Statistics 2012. 40:1878-1905 .
- Tail inequalities for sums of random matrices that depend on the intrinsic dimension. Electronic Communications in Probability 2012. 17:1-13 .
- Stabilized Multiscale Nonconforming Finite Element Method for the Stationary Navier-Stokes Equations. Abstract and Applied Analysis 2012. 2012:- .
- A General Theory of Concave Regularization for High-Dimensional Sparse Estimation Problems. Statistical Science 2012. 27:576-593 .
- Deviation optimal learning using greedy Q-aggregation. The Annals of Statistics 2012. 40:1878-1905 .
- Tail inequalities for sums of random matrices that depend on the intrinsic dimension. Electronic Communications in Probability 2012. 2012:- .
- A tail inequality for quadratic forms of subgaussian random vectors. Electronic Communications in Probability 2012. 17:1-6 .
- A tail inequality for quadratic forms of subgaussian random vectors. Electronic Communications in Probability 2012. 2012:- .
- Discussion of “Is Bayes Posterior just Quick and Dirty Confidence?” by D. A. S. Fraser. Statistical Science 2011. 26:326-328 .
- Comment on ``Is Bayes Posterior just Quick and Dirty Confidence?'' (Pkg: p299-331). Statistical Science 2011. 26:326-328 .
- The benefit of group sparsity. The Annals of Statistics 2010. 38:1978-2004 .
- Some sharp performance bounds for least squares regression with L<sub>1</sub> regularization. The Annals of Statistics 2009. 2009:- .
- Some sharp performance bounds for least squares regression with $L_1$ regularization. The Annals of Statistics 2009. 37:2109-2144 .
- From ɛ-entropy to KL-entropy: Analysis of minimum information complexity density estimation. The Annals of Statistics 2006. 34:2180-2210 .
- Boosting with early stopping: Convergence and consistency. The Annals of Statistics 2005. 33:1538-1579 .
- Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics 2004. 32:56-134 .
- Discussions of boosting papers, and rejoinders. The Annals of Statistics 2004. 32:85-134 .
- Statistical behavior and consistency of classification methods based on convex risk minimization. The Annals of Statistics 2004. 32:56-85 .
- Leave-one-out bounds for kernel methods. Neural Computation 2003. 15:1397-1437 .
- Densities of self-similar measures on the line. Experimental Mathematics 1995. 1995:- .