Learning exponential families in high-dimensions: Strong convexity and sparsity

Citation:

S. M. Kakade, 1 1, O. Shamir, K. Sridharan, and A. Tewari, Learning exponential families in high-dimensions: Strong convexity and sparsity. AISTAT: ArXiv Report, 2010.

Abstract:

The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these models in high-dimensions, such as when there is some sparsity pattern of the optimal parameter. This work characterizes a certain strong convexity property of general exponential families, which allow their generalization ability to be quantified. In particular, we show how this property can be used to analyze generic exponential families under L_1 regularization.

Publisher's Version

See also: 2010
Last updated on 10/11/2021