no code implementations • 2 Jul 2020 • Kyung-Su Kim, Aurélie C. Lozano, Eunho Yang
(2) A generalization error bound invariant of network size was derived by using a data-dependent complexity measure (CMD).
no code implementations • 4 Oct 2017 • Ming Yu, Addie M. Thompson, Karthikeyan Natesan Ramamurthy, Eunho Yang, Aurélie C. Lozano
Inferring predictive maps between multiple input and multiple output variables or tasks has innumerable applications in data science.
no code implementations • ICML 2017 • Eunho Yang, Aurélie C. Lozano
Imposing sparse + group-sparse superposition structures in high-dimensional parameter estimation is known to provide flexible regularization that is more realistic for many real-world problems.
1 code implementation • 13 May 2017 • Meghana Kshirsagar, Eunho Yang, Aurélie C. Lozano
We further demonstrate that our proposed method recovers groups and the sparsity patterns in the task parameters accurately by extensive experiments.
no code implementations • NeurIPS 2015 • Eunho Yang, Aurélie C. Lozano
In this paper, we propose the Trimmed Graphical Lasso for robust estimation of sparse GGMs.
no code implementations • 11 Jul 2013 • Aurélie C. Lozano, Nicolai Meinshausen
We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings.