Analysis of algorithms in noisy high-dimensional probabilistic problems poses many current challenges. In a subclass of these problems the corresponding challenges can be overcome with the help of a method coming from statistical mechanics. I will review some of the related recent work together with progress on rigorous justification of the corresponding results.
Recording during the meeting "AofA: Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms" the June 26, 2019 at the Centre International de Rencontres Mathématiques (Marseille, France)
Filmmaker: Guillaume Hennenfent
Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities:
- Chapter markers and keywords to watch the parts of your choice in the video
- Videos enriched with abstracts, bibliographies, Mathematics Subject Classification
- Multi-criteria search by author, title, tags, mathematical area
Lenka Zdeborova: Algorithms in high-dimensional non-convex landscapes smflみらいパートナーズ | |
| 3 Likes | 3 Dislikes |
| 104 views views | 10K followers |
| Science & Technology | Upload TimePublished on 25 Jul 2019 |
Không có nhận xét nào:
Đăng nhận xét