1. Agarwal, A., Negahban, S., & Wainwright, M. (2011). Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions. In Proceedings of the 28th international conference on machine learning (pp. 1129–1136).
2. Recovering time-varying networks of dependencies in social and biological studies;Ahmed;Proceedings of the National Academy of Sciences,2009
3. Consistency of the group lasso and multiple kernel learning;Bach;The Journal of Machine Learning Research,2008
4. Common stochastic trends in a system of exchange rates;Baillie;The Journal of Finance,1989
5. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data;Banerjee;The Journal of Machine Learning Research,2008