2017 - T3 -  WS3 - Quantum information theory

Collection 2017 - T3 - WS3 - Quantum information theory

Organizer(s) Fawzi, Omar ; Harrow, Aram ; Kerenidis, Iordanis ; Szarek, Stanislaw ; Winter, Andreas
Date(s) 11/12/2017 - 15/12/2017
linked URL https://web.archive.org/web/20201010200040/https://sites.google.com/site/analysisqit2017/
00:00:00 / 00:00:00
3 19

We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. This is joint work with T. Sutter, P. Esfahani, and J. Lygeros (arXiv:1708. 07311).

Information about the video

  • Date of recording 11/12/2017
  • Date of publication 12/12/2017
  • Institution IHP
  • Licence CC BY-NC-ND
  • Language English
  • 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