research product . Other ORP type . 2009

Convex relaxation of mixture regression with efficient algorithms

Quadrianto, Novi; Caetano, Tiberio S; Lim, John; Schuurmans, Dale;
Open Access English
  • Published: 01 Jan 2009
  • Publisher: Curran
  • Country: United Kingdom
Abstract
We develop a convex relaxation of maximum a posteriori estimation of a mixture of regression models. Although our relaxation involves a semidefinite matrix variable, we reformulate the problem to eliminate the need for general semidefinite programming. In particular, we provide two reformulations that admit fast algorithms. The first is a max-min spectral reformulation exploiting quasi-Newton descent. The second is a min-min reformulation consisting of fast alternating steps of closed-form updates. We evaluate the methods against Expectation-Maximization in a real problem of motion segmentation from video data.
Subjects
ACM Computing Classification System: MathematicsofComputing_NUMERICALANALYSIS
free text keywords: Q1
Download from
Any information missing or wrong?Report an Issue