Timezone: »

 
Poster
Asymptotically Optimal Regularization in Smooth Parametric Models
Percy Liang · Francis Bach · Guillaume Bouchard · Michael Jordan

Mon Dec 07 07:00 PM -- 11:59 PM (PST) @
in Poster Session »

Many types of regularization schemes have been employed in statistical learning, each one motivated by some assumption about the problem domain. In this paper, we present a unified asymptotic analysis of smooth regularizers, which allows us to see how the validity of these assumptions impacts the success of a particular regularizer. In addition, our analysis motivates an algorithm for optimizing regularization parameters, which in turn can be analyzed within our framework. We apply our analysis to several examples, including hybrid generative-discriminative learning and multi-task learning.

[ PDF] 

Author Information

Percy Liang (Stanford University)
Percy Liang

Percy Liang is an Assistant Professor of Computer Science at Stanford University (B.S. from MIT, 2004; Ph.D. from UC Berkeley, 2011). His research spans machine learning and natural language processing, with the goal of developing trustworthy agents that can communicate effectively with people and improve over time through interaction. Specific topics include question answering, dialogue, program induction, interactive learning, and reliable machine learning. His awards include the IJCAI Computers and Thought Award (2016), an NSF CAREER Award (2016), a Sloan Research Fellowship (2015), and a Microsoft Research Faculty Fellowship (2014).

Francis Bach (INRIA - Ecole Normale Superieure)
Guillaume Bouchard (Xerox Research Center Europe)
Michael Jordan (UC Berkeley)

More from the Same Authors