摘要: |
The project team proposes to consider the mixed regression problem in high dimensions, under adversarial and stochastic noise. The team will consider convex optimization-based formulations with the aim of showing that it provably recovers the true solution. This agenda will seek to provide upper bounds on the recovery errors for both arbitrary noise and stochastic noise settings. The project team also will seek matching minimax lower bounds (up to log factors), showing that under certain assumptions, their algorithm is information-theoretically optimal. The team's preliminary results represent the first (and currently only known) tractable algorithm guaranteeing successful recovery with tight bounds on recovery errors and sample complexity.
Mixture models treat observed data as a superposition of simple statistical processes. Thus they are particularly relevant in the transportation setting, when city-wide phenomena are often mixtures of simple processes (cut-through traffic, intra-city movement, etc.). |