00:00:00 / 00:00:00

Appears in collection : Schlumberger workshop - Computational and statistical trade-offs in learning

Renegar's condition number is a data-driven computational complexity measure for convex programs, generalizing classical condition numbers in linear systems. We provide evidence that for a broad class of compressed sensing problems, the worst case value of this algorithmic complexity measure taken over all signals matches the restricted eigenvalue of the observation matrix, which controls compressed sensing performance. This means that, in these problems, a single parameter directly controls computational complexity and recovery performance. Joint work with Vincent Roulet and Nicolas Boumal. Preprint: http://arxiv.org/abs/1506.03295

Information about the video

  • Date of recording 22/03/2016
  • Date of publication 26/03/2016
  • Institution IHES
  • Format MP4

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback