# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2015年10月15日
2015-T3 - Mathematical general relativity - CEB Trimester
COURSE: On The Mathematical Theory of Black Holes
Sergiu Klainerman
Department of Mathematics, Princeton University
COURSE: An Introduction to Self-Gravitating Matter
Philippe LeFloch
Laboratoire Jacques-Louis Lions
Centre National de la Recherche Scientifique & Université Pierre et Marie Curie
8/12/2015 - Sergiu Klainerman - Lecture 6 - On The Mathematical Theory of Black Holes 2:15:40
27/11/2015 - Philippe G LeFloch - Lec. 7 - Nonlinear stability of Minkowski space for massive fields 2:10:33
24/11/2015 - Sergiu Klainerman - Lecture 5 - On The Mathematical Theory of Black Holes 2:10:02
17/11/2015 - Jérémie Szeftel - Remarks on the nonlinear stability of Schwarzschild 55:24
19/11/2015 - Thibault Damour - The Structure of Cosmological Singularities 59:36
17/11/2015 - Qian Wang - Global Existence for the Einstein Equations with Massive Scalar Fields 1:03:41
20/11/2015 - Richard Schoen - Localizing Solutions of the Einstein Equations 1:00:19
19/11/2015 - Gustav Holzegel - The Linear Stability of the Schwarzschild Solution 1:02:00
19/11/2015 - Jacques Smulevici - Dynamics in asymptotically AdS spacetimes 47:28
20/11/2015 - Georges Ellis - The Steps Along The Way Whereby Einstein’s General Theory... 1:06:08
19/11/2015 - Demetrios Christodoulou - The Formulation of the Two-Body Problem in General Relativity 1:12:17
17/11/2015 - Mihalis Dafermos - The stability problem for black holes... 1:00:00
17/11/2015 - Jonathan Luk - Interior of Dynamical Vacuum Black Holes 1:04:53
16/11/2015 - Jean Philippe Uzan - Introduction 3:04
16/11/2015 - Roger Penrose - Palatial Twistor Theory: a Quantum Approach to Classical Space-Time 1:02:30
16/11/2015 - Jean-Pierre Bourguignon - General Relativity and Geometry 1:02:34
16/11/2015 - Robert Wald - Dynamic and Thermodynamic Stability of Black Holes and Black Branes 59:01
13/11/2015 - Philippe G. LeFloch - Lecture 6 - The geometry of weakly regular spacetimes 1:57:32
10/11/2015 - Sergiu Klainerman - Lecture 4 - On The Mathematical Theory of Black Holes 2:07:24
06/11/2015 - Philippe G. LeFloch - Lecture 5 - Self-gravitating fluids with bounded variation 2:09:45
03/11/2015 - Sergiu Klainerman - Lecture 3 - On The Mathematical Theory of Black Holes 2:00:14
30/10/2015 - Philippe G. LeFloch - Lecture 4 - Weakly regular Cauchy developments 1:56:50
23/10/2015 - Philippe G. LeFloch - Lecture 3 - Weak solutions to the Einstein equations 2:06:51
20/10/2015 - Sergiu Klainerman - Lecture 2 - On The Mathematical Theory of Black Holes 2:08:47
16/10/2015 - Philippe G. LeFloch - Lecture 2 - Modified gravity and weakly regular spacetimes 2:07:07
16/10/2015 - Sergiu Klainerman - Lecture 1 - On The Mathematical Theory of Black Holes 2:01:08
9/10/2015 - Philippe G. LeFloch - Lecture 1 - An Introduction to Self-Gravitating Matter 1:58:46
This course offers an introduction to some aspects of the dynamics of self-gravitating matter described by the Einstein equations of general relativity. The notion of "weakly regular spacetime" is introduced and the initial value problem for the Einstein equations is solved when the initial data set has solely weak regularity and enjoys T2 or spherical symmetry. The proposed theory allows for impulsive gravitational waves, as well as shock waves, and despite the presence of such singular waves propagating in the spacetime, its global causal geometry can be analyzed: geodesic completeness, crushing singularity property, formation of trapped surfaces, etc. This course also studies the dynamics of self-gravitating massive fields and provides a proof that Minkowski spacetime is nonlinearly stable in presence of massive fields with sufficiently small mass. A small perturbation of an asymptotically flat, spacelike hypersurface in Minkowski space is proven to disperse toward future timelike directions, so that the spacetime is future geodesically complete.
This course is part of the Trimester Program “Mathematical general relativity” which took place at the Institut Henri Poincaré in order to celebrate the 100th anniversary of general relativity.
See http://philippelefloch.org for further information.
Showing posts with label C. (main sources)-Institut Henri Poincaré. Show all posts
Showing posts with label C. (main sources)-Institut Henri Poincaré. Show all posts
2017-08-29
T1-2014 : Random walks and asymptopic geometry of groups.
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2014年4月14日
T1-2014 : Random walks and asymptopic geometry of groups.
March 24 - 28, 2014
Organizers: Emmanuel Breuillard, Indira Chatterji and Anna Erschler
Part of the IHP trimester on "random walks and asymptotic geometry of groups"
Organizers: Indira Chatterji, Anna Erschler, Vadim Kaimanovich and Laurent Saloff-Coste
Rostislav Grigorchuk - Invariant random subgroups of groups of the lamplighter type 41:54 Rostislav Grigorchuk (Texas A&M University, USA)
After a short introduction to invariant random subgroups (IRS) I will present some results obtained in collaboration with L.Bowen, R.Kravchenko and T.Nagnibeda and with M.Benli and T.Nagnibeda.
First I will talk about IRS of groups of lamplighter type. Then about IRS
of groups of intermediate growth. And finally, about IRS on hyperbolic groups, mapping class group and group of outer automorphisms of a free group. The latter results are based on study of characteristic random subgroups of a free abelian group of infinite rank and of a free non-commutative group.
Alex Lubotzky - Quantum error correcting codes... 47:00
Amos Nevo - On best possible rates of Diophantine approximation by lattice orbits. 53:51
Elon Lindenstrauss - Spectral gap, random walks on Euclidean isometry groups... 50:18
Elyahu Rips - Free Engel Groups and Similar Groups 49:58
Joel Friedman - Sheaves on Graphs, L^2 Betti Numbers, and Applications. 48:48
John s. Wilson - Metric ultraproducts of finite simple groups 43:44
Laurent Bartholdi - Imbeddings in groups of subexponential growth 50:38
Mark Sapir - The Tarski numbers of groups. 50:40
Martin Bridson - Profinite isomorphism problems. 50:50
Miklos Abert - Invariant random subgroups. 49:41
Mladen Bestvina - On the asymptotic dimension of a curve complex. 47:40
Nicolas Monod - Cutting and pasting: a group for Frankenstein 46:50
Nikolay Nikolov - Right angled cocompact lattices in higher rank simple Lie groups. 49:26
Thomas Delzant - Holomorphic families of Riemann surfaces from the pov of asymptotic group theory 40:37
Alexander Olshanskii - Relative growth of subgroups in finitely generated groups 44:13
Karen Vogtmann - Outer space for right-angled Artin groups 47:16
Leonid Potyagailo - Similar Relatively hyperbolic actions of a group 48:06
Yves Benoist - Random walk on p-adic flag varieties 50:35
Zlil Sela - Envelopes and equivalence relations in a free group 46:50
Gilbert Levitt - Vertex finiteness for relatively hyperbolic groups 48:30
source: Institut Henri Poincaré 2014年4月14日
T1-2014 : Random walks and asymptopic geometry of groups.
March 24 - 28, 2014
Organizers: Emmanuel Breuillard, Indira Chatterji and Anna Erschler
Part of the IHP trimester on "random walks and asymptotic geometry of groups"
Organizers: Indira Chatterji, Anna Erschler, Vadim Kaimanovich and Laurent Saloff-Coste
Rostislav Grigorchuk - Invariant random subgroups of groups of the lamplighter type 41:54 Rostislav Grigorchuk (Texas A&M University, USA)
After a short introduction to invariant random subgroups (IRS) I will present some results obtained in collaboration with L.Bowen, R.Kravchenko and T.Nagnibeda and with M.Benli and T.Nagnibeda.
First I will talk about IRS of groups of lamplighter type. Then about IRS
of groups of intermediate growth. And finally, about IRS on hyperbolic groups, mapping class group and group of outer automorphisms of a free group. The latter results are based on study of characteristic random subgroups of a free abelian group of infinite rank and of a free non-commutative group.
Alex Lubotzky - Quantum error correcting codes... 47:00
Amos Nevo - On best possible rates of Diophantine approximation by lattice orbits. 53:51
Elon Lindenstrauss - Spectral gap, random walks on Euclidean isometry groups... 50:18
Elyahu Rips - Free Engel Groups and Similar Groups 49:58
Joel Friedman - Sheaves on Graphs, L^2 Betti Numbers, and Applications. 48:48
John s. Wilson - Metric ultraproducts of finite simple groups 43:44
Laurent Bartholdi - Imbeddings in groups of subexponential growth 50:38
Mark Sapir - The Tarski numbers of groups. 50:40
Martin Bridson - Profinite isomorphism problems. 50:50
Miklos Abert - Invariant random subgroups. 49:41
Mladen Bestvina - On the asymptotic dimension of a curve complex. 47:40
Nicolas Monod - Cutting and pasting: a group for Frankenstein 46:50
Nikolay Nikolov - Right angled cocompact lattices in higher rank simple Lie groups. 49:26
Thomas Delzant - Holomorphic families of Riemann surfaces from the pov of asymptotic group theory 40:37
Alexander Olshanskii - Relative growth of subgroups in finitely generated groups 44:13
Karen Vogtmann - Outer space for right-angled Artin groups 47:16
Leonid Potyagailo - Similar Relatively hyperbolic actions of a group 48:06
Yves Benoist - Random walk on p-adic flag varieties 50:35
Zlil Sela - Envelopes and equivalence relations in a free group 46:50
Gilbert Levitt - Vertex finiteness for relatively hyperbolic groups 48:30
T2-2014 : Semantics of proofs and certified mathematics
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2014年4月22日
T2-2014 : Semantics of proofs and certified mathematics
Institut Henri Poincaré thematic trimester
Program and registration : https://ihp2014.pps.univ-paris-diderot.fr/
After years of steady development, the technology of proof assistants is currently coming to a mature state. As a matter of fact, it is possible today to formalize a non trivial mathematical proof inside a computer, and to check its correctness automatically. This "tour de force" has been recently achieved for the four color theorem, and a certified proof of the classification of finite groups and of the Kepler conjecture are on the way.
These achievements would not have been possible without the rich and active mathematics of formal proofs which emerged in the 1970s at the frontier of logic and computer science, along the Curry-Howard correspondence. This seminal correspondence enables us to understand a logical proof (of a given formula) as a well-behaved program (of a given type). Besides this by now traditional connection between logic and computer science, a number of unexpected connections are currently emerging with other fields of mathematics -- this including homotopy theory, higher dimensional algebra, quantum topology, topos theory, functional analysis and operator algebra. Finally, proof assistants have been successfully applied to certify properties of programs written in high-level languages as well as low-level languages, to implement certified compilers, or to establish important security properties of protocols.
The purpose of this thematic trimester is to provide a forum for the extended community of researchers and students in mathematics and in computer science interested in proof assistants, and more generally, in the mathematics of formal proofs. Much care will be devoted during the trimester to train the mathematicians interested to learn and to use the current proof assistants in their work.
1 - Kick-off afternoon : introduction and welcoming word by Cédric Villani 20:25
2 - Kick-off afternoon : Georges Gonthier, Digitizing the Group Theory of the Odd Order Theorem 40:32
3 - Kick-off afternoon : Thomas Hales, Formalizing the proof of the Kepler Conjecture 43:18
4 - Kick-off afternoon : Xavier Leroy, Proof assistants in computer science research 50:30
5 - Kick-off afternoon : Vladimir Voevodsky, Univalent Foundations 54:16
6 - Lectures - Gérard Berry, Constructive semantics, electricity propagation in circuits... 1/2 2:13:02
7 - Lectures - Gérard Berry, Constructive semantics, electricity propagation in circuits... 2/2 1:00:17
8 - Lectures : Jean-Yves Girard 1/3, Qu'est-ce qu'une réponse ? (l'analytique) 1:03:58
9 - Lectures : Jean-Yves Girard 2/3, Qu'est-ce qu'une question ? (le format) 1:04:53
10 - Lectures : Jean-Yves Girard 3/3, D'où vient la certitude ? (l'épidictique) 1:17:27
Jean Louis Krivine - 1/2 La correspondance de Curry-Howard donne de nouveaux modèles de ZF 1:35:58
Jean Louis Krivine - 2/2 Curry-Howard correspondence gives new models of ZF 1:44:15
François Potier - 1/2 The practice and theory of Mezzo 1:36:03
François Potier - 2/2 The practice and theory of Mezzo 1:35:44
Thorsten Altenkirch - 1/2 Towards a Syntax for Cubical Type Theory 1:17:33
Thorsten Altenkirch - 2/2 Towards a Syntax for Cubical Type Theory 59:32
source: Institut Henri Poincaré 2014年4月22日
T2-2014 : Semantics of proofs and certified mathematics
Institut Henri Poincaré thematic trimester
Program and registration : https://ihp2014.pps.univ-paris-diderot.fr/
After years of steady development, the technology of proof assistants is currently coming to a mature state. As a matter of fact, it is possible today to formalize a non trivial mathematical proof inside a computer, and to check its correctness automatically. This "tour de force" has been recently achieved for the four color theorem, and a certified proof of the classification of finite groups and of the Kepler conjecture are on the way.
These achievements would not have been possible without the rich and active mathematics of formal proofs which emerged in the 1970s at the frontier of logic and computer science, along the Curry-Howard correspondence. This seminal correspondence enables us to understand a logical proof (of a given formula) as a well-behaved program (of a given type). Besides this by now traditional connection between logic and computer science, a number of unexpected connections are currently emerging with other fields of mathematics -- this including homotopy theory, higher dimensional algebra, quantum topology, topos theory, functional analysis and operator algebra. Finally, proof assistants have been successfully applied to certify properties of programs written in high-level languages as well as low-level languages, to implement certified compilers, or to establish important security properties of protocols.
The purpose of this thematic trimester is to provide a forum for the extended community of researchers and students in mathematics and in computer science interested in proof assistants, and more generally, in the mathematics of formal proofs. Much care will be devoted during the trimester to train the mathematicians interested to learn and to use the current proof assistants in their work.
1 - Kick-off afternoon : introduction and welcoming word by Cédric Villani 20:25
2 - Kick-off afternoon : Georges Gonthier, Digitizing the Group Theory of the Odd Order Theorem 40:32
3 - Kick-off afternoon : Thomas Hales, Formalizing the proof of the Kepler Conjecture 43:18
4 - Kick-off afternoon : Xavier Leroy, Proof assistants in computer science research 50:30
5 - Kick-off afternoon : Vladimir Voevodsky, Univalent Foundations 54:16
6 - Lectures - Gérard Berry, Constructive semantics, electricity propagation in circuits... 1/2 2:13:02
7 - Lectures - Gérard Berry, Constructive semantics, electricity propagation in circuits... 2/2 1:00:17
8 - Lectures : Jean-Yves Girard 1/3, Qu'est-ce qu'une réponse ? (l'analytique) 1:03:58
9 - Lectures : Jean-Yves Girard 2/3, Qu'est-ce qu'une question ? (le format) 1:04:53
10 - Lectures : Jean-Yves Girard 3/3, D'où vient la certitude ? (l'épidictique) 1:17:27
Jean Louis Krivine - 1/2 La correspondance de Curry-Howard donne de nouveaux modèles de ZF 1:35:58
Jean Louis Krivine - 2/2 Curry-Howard correspondence gives new models of ZF 1:44:15
François Potier - 1/2 The practice and theory of Mezzo 1:36:03
François Potier - 2/2 The practice and theory of Mezzo 1:35:44
Thorsten Altenkirch - 1/2 Towards a Syntax for Cubical Type Theory 1:17:33
Thorsten Altenkirch - 2/2 Towards a Syntax for Cubical Type Theory 59:32
2017-08-26
T1-2015 : Disordered systems, random spatial processes and some applications
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2015年2月19日
T1-2015 : Disordered systems, random spatial processes and some applications
The trimester aims at bringing together scientists working on the following three topical areas, with strong common cultural roots and wide research interest intersections:
- probabilistic methods on random spatial processes, for instance on growth models, percolation, coalescence, non-equilibrium phase transitions.
- statistical mechanics of interacting particle systems, especially disordered models like spin glasses, diluted systems, directed and pinned polymers.
- “complex systems” approached with mathematical and physical methods, in particular agent based models applied to socio-economic problems, inverse problems, multi-fractal models.
The program, anchored around those three main topics and subtopics, will be built on a school, three one-week workshops, various mini-symposia, research group meetings and three open lectures for a wide public audience.
Workshop 1 - M. Fedele “Interacting Models in Social Sciences and Health Screening Campaigns” 50:52
Imitation and social pressure are usually observed in the aggregate behavior of populations, and they are responsible for the appearance of trends, herd effects, discontinuities and crashes. To account for these phenomena, interactions networks must be included in the modeling of social systems, and measured from data. We present a recent analysis on an extensive dataset from adhesion to cancer screening campaigns, where a modeling, based on statistical mechanics and multi-species mean field spin models, allows for a quantitive estimate of average interaction effects through an inverse problem and leads to a forecast of effective social policies to enhance participation.
Public lecture 1 - Jean-Philippe Bouchaud “Crises économiques et financières : un point de vue... 1:12:43
Courses - F. Guerra “Equilibrium and off equilibrium properties of ferromagnetic...” 2:01:21
Public Lecture 2 - Andrea Cavagna “The seventh Starling: the Wonders of Collective Animal... 1:16:54
Courses - Chuck Newman “Riemann Hypothesis and Statistical Mechanics” 1:42:55
Public Lecture 3 - Frank den Hollander “Comment mieux comprendre le comportement... 1:10:14
Courses - T. Sasamoto “The one-dimensional KPZ equation... 1:47:16
Courses - R. SUN "Brownian web, Brownian net, and their universality" 1:00:22
Courses - E. PRESUTTI "Phase transitions in systems with spatially non homogeneous interactions” 1:00:22
Courses - G. JONA LASINIO “Macroscopic Fluctuation Theory” 1:35:32
Courses - A. Kupiainen “Quantum Field Theory for Probabilists” 1:35:32
source: Institut Henri Poincaré 2015年2月19日
T1-2015 : Disordered systems, random spatial processes and some applications
The trimester aims at bringing together scientists working on the following three topical areas, with strong common cultural roots and wide research interest intersections:
- probabilistic methods on random spatial processes, for instance on growth models, percolation, coalescence, non-equilibrium phase transitions.
- statistical mechanics of interacting particle systems, especially disordered models like spin glasses, diluted systems, directed and pinned polymers.
- “complex systems” approached with mathematical and physical methods, in particular agent based models applied to socio-economic problems, inverse problems, multi-fractal models.
The program, anchored around those three main topics and subtopics, will be built on a school, three one-week workshops, various mini-symposia, research group meetings and three open lectures for a wide public audience.
Workshop 1 - M. Fedele “Interacting Models in Social Sciences and Health Screening Campaigns” 50:52
Imitation and social pressure are usually observed in the aggregate behavior of populations, and they are responsible for the appearance of trends, herd effects, discontinuities and crashes. To account for these phenomena, interactions networks must be included in the modeling of social systems, and measured from data. We present a recent analysis on an extensive dataset from adhesion to cancer screening campaigns, where a modeling, based on statistical mechanics and multi-species mean field spin models, allows for a quantitive estimate of average interaction effects through an inverse problem and leads to a forecast of effective social policies to enhance participation.
Public lecture 1 - Jean-Philippe Bouchaud “Crises économiques et financières : un point de vue... 1:12:43
Courses - F. Guerra “Equilibrium and off equilibrium properties of ferromagnetic...” 2:01:21
Public Lecture 2 - Andrea Cavagna “The seventh Starling: the Wonders of Collective Animal... 1:16:54
Courses - Chuck Newman “Riemann Hypothesis and Statistical Mechanics” 1:42:55
Public Lecture 3 - Frank den Hollander “Comment mieux comprendre le comportement... 1:10:14
Courses - T. Sasamoto “The one-dimensional KPZ equation... 1:47:16
Courses - R. SUN "Brownian web, Brownian net, and their universality" 1:00:22
Courses - E. PRESUTTI "Phase transitions in systems with spatially non homogeneous interactions” 1:00:22
Courses - G. JONA LASINIO “Macroscopic Fluctuation Theory” 1:35:32
Courses - A. Kupiainen “Quantum Field Theory for Probabilists” 1:35:32
Michel Hénon Memoriam
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2014年3月10日
Michel Hénon Memoriam
organized by Jérôme Perez and Roya Moyahaee, Uriel Frisch, Jacques Féjoz, Alain Chenciner, Jean-Michel Alimi
Michel Hénon was a French mathematician and astronomer born in 1931 in Paris. He spent his career initially at the Institute d'Astrophysique de Paris and then at the Observatoire de Nice.
In astronomy, Michel Hénon was a leading figure in the field of stellar dynamics, galactic dynamics, and the evolution of the rings of Saturn. In mathematics, he is known for the so-called Hénon maps and attractor, which is one of the most studied chaotic systems.
In the late 1960s and early 70s, he worked on the star clusters and by using Monte Carlo methods, he developed numerical techniques to follow the dynamics of globular clusters. His probabilistic method proved to be much faster than usual N-body methods.
He published a two volume book on restricted three-body problem.
He died on April 2013 in Nice.
A special tribute shall be made to Michel Hénon during the Gravasco program at the Institut Henri Poincare:
A series of seminars, given by renowned scientists, will be held every Wednesday afternoons during the month of October 2013 on the works of Michel Hénon,
Two exceptional days on 4th and 5th of December, dedicatted entirely to the life and the scientific works of Michel Hénon, shall close the Gravasco trimestre at IHP. 較少資訊
Seminar H1 - October 9th : Daniel Pfenniger 1:16:49 Michel Hénon Numerical studies of hamiltonian systems and application to galactic potentials
Daniel Pfenniger, Geneva observatory, Switzerland
Seminar H2 - October 16th : Scott Tremaine 58:38
Seminar H3 - October 23th : Douglas Heggie 1:21:33
Seminar H4 - October 30th : James Binney 1:02:08
Journées Hénon - 1/21 - Jacques Colin 13:22
Journées Hénon - 2/21 - Jean-Christophe Yoccoz 33:17
Journées Hénon - 3/21 - Carles Simò 38:40
Journées Hénon - 4/21 - Yves Pommeau 30:19
Journées Hénon - 5/21 - François Mignard 29:31
[私人影片]
Journées Hénon - 7/21 - Jérôme Perez 38:22
Journées Hénon - 8/21 - Uriel Frisch 32:07
Journées Hénon - 9/21 - Alexander Batkhin 32:09
Journées Hénon - 10/21 - Thibault Damour 40:30
Journées Hénon - 11/21 - Fathi Namouni 30:48
Journées Hénon - 12/21 - Jean-Marc Petit 39:46
Journées Hénon - 13/21 - Jacques Laskar 31:00
Journées Hénon - 14/21 - Donald Lynden-Bell 33:27
Journées Hénon - 15/21 - Alessandro Morbidelli 32:06
Journées Hénon - 16/21 - Sverre Aarseth 9:45
Journées Hénon - 17/21 - Ed Spiegel 39:24
Journées Hénon - 18/21 - Claude Froschlé 22:40
Journées Hénon - 19/21 - Pierre Hénon 16:03
Journées Hénon - 20/21 - André Brahic 26:46
Journées Hénon - 21/21 - Michèle Hénon 20:50
source: Institut Henri Poincaré 2014年3月10日
Michel Hénon Memoriam
organized by Jérôme Perez and Roya Moyahaee, Uriel Frisch, Jacques Féjoz, Alain Chenciner, Jean-Michel Alimi
Michel Hénon was a French mathematician and astronomer born in 1931 in Paris. He spent his career initially at the Institute d'Astrophysique de Paris and then at the Observatoire de Nice.
In astronomy, Michel Hénon was a leading figure in the field of stellar dynamics, galactic dynamics, and the evolution of the rings of Saturn. In mathematics, he is known for the so-called Hénon maps and attractor, which is one of the most studied chaotic systems.
In the late 1960s and early 70s, he worked on the star clusters and by using Monte Carlo methods, he developed numerical techniques to follow the dynamics of globular clusters. His probabilistic method proved to be much faster than usual N-body methods.
He published a two volume book on restricted three-body problem.
He died on April 2013 in Nice.
A special tribute shall be made to Michel Hénon during the Gravasco program at the Institut Henri Poincare:
A series of seminars, given by renowned scientists, will be held every Wednesday afternoons during the month of October 2013 on the works of Michel Hénon,
Two exceptional days on 4th and 5th of December, dedicatted entirely to the life and the scientific works of Michel Hénon, shall close the Gravasco trimestre at IHP. 較少資訊
Seminar H1 - October 9th : Daniel Pfenniger 1:16:49 Michel Hénon Numerical studies of hamiltonian systems and application to galactic potentials
Daniel Pfenniger, Geneva observatory, Switzerland
Seminar H2 - October 16th : Scott Tremaine 58:38
Seminar H3 - October 23th : Douglas Heggie 1:21:33
Seminar H4 - October 30th : James Binney 1:02:08
Journées Hénon - 1/21 - Jacques Colin 13:22
Journées Hénon - 2/21 - Jean-Christophe Yoccoz 33:17
Journées Hénon - 3/21 - Carles Simò 38:40
Journées Hénon - 4/21 - Yves Pommeau 30:19
Journées Hénon - 5/21 - François Mignard 29:31
[私人影片]
Journées Hénon - 7/21 - Jérôme Perez 38:22
Journées Hénon - 8/21 - Uriel Frisch 32:07
Journées Hénon - 9/21 - Alexander Batkhin 32:09
Journées Hénon - 10/21 - Thibault Damour 40:30
Journées Hénon - 11/21 - Fathi Namouni 30:48
Journées Hénon - 12/21 - Jean-Marc Petit 39:46
Journées Hénon - 13/21 - Jacques Laskar 31:00
Journées Hénon - 14/21 - Donald Lynden-Bell 33:27
Journées Hénon - 15/21 - Alessandro Morbidelli 32:06
Journées Hénon - 16/21 - Sverre Aarseth 9:45
Journées Hénon - 17/21 - Ed Spiegel 39:24
Journées Hénon - 18/21 - Claude Froschlé 22:40
Journées Hénon - 19/21 - Pierre Hénon 16:03
Journées Hénon - 20/21 - André Brahic 26:46
Journées Hénon - 21/21 - Michèle Hénon 20:50
2016-T1 - Nexus of Information and Computation Theory - CEB Trimester
# playlist (click the video's upper-left icon)
source: Institut Henri Poincaré 2016年2月1日
2016-T1 - Nexus of Information and Computation Theory - CEB Trimester
About the Program
Recently, a number of advances in the theory of computation have been made by using information-theoretic arguments. Conversely, some of the most exciting ongoing work in information theory has focused on problems with a computational component. The primary goal of this three-month IHP thematic program is to explore the rich interplay between information theory and the theory of computation, and ultimately create new connections and collaborations between both scientific communities.
The program will begin with a tutorial week at the Centre International de Recontres Mathématiques in Marseille, France. The goal is to provide sufficient background for the primary themes of the program.
The bulk of the program will be hosted at IHP in Paris, France and is organized around four primary themes, each spanning two weeks. The themes are Distributed Computation and Communication, Fundamental Inequalities and Lower Bounds, Inference Problems, and Secrecy and Privacy. Each theme is separately organized by a dedicated committee.
Finally, there will be a week-long workshop at IHP in Paris, France. The workshop will consist of talks that are aimed towards a broad audience and designed to foster discussion and interaction between the CS and IT communities.
Program Organizers
Mark Braverman (Princeton University)
Bobak Nazer (Boston University)
Anup Rao (University of Washington)
Aslan Tchamkerten, General Chair (Telecom Paristech)
Alexander Shen (LIRMM, Montpellier) 1/2 1:02:20 Different versions of Kolmogorov complexity and a priori probability: a gentle introduction 1/2
Alexander Shen (LIRMM, Montpellier)
February 01, 2016
Abstract: The informal idea – the complexity is the minimal number of bits needed to describe the object – has several different implementations. They are not only technical differences, but all they are there for a reason: we may consider binary strings (both as objects and descriptions) as self-contained objects or as partial information about infinite objects (that fixes some prefix of an infinite sequences). We will try to explain basic results about different versions of complexity and their relation to the notion of the a priori probability.
Alexander Shen (LIRMM, Montpellier) 2/2 51:36
George Giakkoupis (INRIA) 58:00
Andrei Romashchenko (LIRMM) 56:14
Yoram Moses (Technion) 1/2 58:10
Yoram Moses (Technion) 2/2 56:17
Marius Zimand (Towson University) 1:01:54
Péter Gács (Boston University) 50:40
Suresh Venkatasubramanian (University of Utah) 1/3 50:27
Suresh Venkatasubramanian (University of Utah) 2/3 43:40
Suresh Venkatasubramanian (University of Utah) 3/3 50:11
John Walsh (Drexel University) 48:46
Salim El Rouayheb (Illinois Institute of Technology) 48:43
Qin Zhang (Indiana University Bloomington) 48:45
Qi Chen (The Chinese University of Hong Kong) 52:00
Yael Kalai (Microsoft Research) 48:20
Boaz Patt-Shamir (Tel Aviv University) 45:18
Prakash Ishwar (Boston University) 58:20
Paris Koutris (University of Wisconsin) 53:23
Leonard Schulman (Caltech) 1:01:54
Klim Efremenko (Tel-Aviv University) 1/2 52:43
Klim Efremenko (Tel-Aviv University) 2/2 49:29
Yael Kalai (Microsoft Research) 55:02
Thomas Courtade (UC-Berkeley) 53:30
Ofer Feinerman (Weizmann Institute) 52:06
Anup Rao (University of Washington) 1/3 55:16
Anup Rao (University of Washington) 2/3 56:46
Anup Rao (University of Washington) 3/3 54:02
Amos Korman (CNRS/LIAFA) 42:00
Ran Gelles (Princeton University) 1/2 55:42
Ran Gelles (Princeton University) 2/2 51:37
Omri Weinstein (Courant Institute (NYU)) 2/6 55:41
Omri Weinstein (Courant Institute (NYU)) 3/6 49:36
Omri Weinstein (Courant Institute (NYU)) 4/6 1:12:42
Omri Weinstein (Courant Institute (NYU)) 5/6 56:45
Omri Weinstein (Courant Institute (NYU)) 6/6 50:56
Badih Ghazi (MIT) 55:08
Alex Sprintson (Texas A&M) 43:33
Young Han Kim (UCSD) 53:23
Michael Langberg (SUNY at Buffalo) 53:42
Allison Bishop (Columbia) 46:5
Stephan Sebastian Holzer (MIT) 50:40
János Körner (Sapienza University of Rome) 55:23
Chandra Nair (Chinese University of Hong Kong) 1/2 46:30
Chandra Nair (Chinese University of Hong Kong) 2/2 51:22
Dan Suciu (University of Washington) 51:26
Cédric Villani (Université de Lyon / Institut Henri Poincaré) 1:06:49
Péter Gács (Boston University) 2/2 51:31
Randall Dougherty (Center for Communications Research) 52:31
László Csirmaz (Central European University, Budapest) 1/3 44:10
László Csirmaz (Central European University, Budapest) 2/3 45:56
László Csirmaz (Central European University, Budapest) 3/3 38:01
Arkadev Chattopadhyay (Tata Institute of Fundamental Research) 50:09
Thathatchar.S. Jayram (IBM Almaden) 51:42
Amin Aminzadeh Gohari (Sharif University of Technology) 48:45
P. Vijay Kumar (Indian Institute of Science, University of Southern California) 42:52
František Matúš (Institute of Information Theory and Automation) 1/3 50:39
František Matúš (Institute of Information Theory and Automation) 2/3 51:47
František Matúš (Institute of Information Theory and Automation) 3/3 38:33
19 02 16 Fan Cheng (National University of Singapore) 52:44
Raymond Yeung (The Chinese University of Hong Kong) 3/3 31:34
Raymond Yeung (The Chinese University of Hong Kong) 2/3 51:01
Raymond Yeung (The Chinese University of Hong Kong) 1/3 44:59
John Walsh (Drexel University) 49:16
Sidharth Jaggi (CUHK) 38:17
Petr Kuznetsov (Télécom Paristech) 43:52
Omar Fawzi (ENS Lyon) 34:49
Ofer Shayevitz (Tel Aviv University) 34:39
Maxim Raginsky (University of Illinois) 36:50
David Woodruff (IBM Almaden) 38:48
Ankit Garg (Princeton) 35:42
Ran Gelles (Princeton) 36:54
Amir Yehudayoff (Technion) 33:16
Iordanis Kerenidis (Université Paris Diderot 7) 37:37
Ayfer Özgür (Stanford) 33:13
Rajesh Sundaresan 37:11
Sidharth Jaggi (CUHK) 34:48
Michelle Effros (California Institute of Technology) 36:15
Aaron Wagner (Cornell) 47:16
Shlomo Shamai (Technion) 38:51
Shay Moran (Technion) 24:27
Giacomo Como (Lund University) 42:28
Bruno Bauwens (Higher School of Economics) 29:06
Stephen Chestnut (ETH Zurich) 34:03
Paul Beame (University of Washington) - 1 57:40
Yuchong Hu (Huazhong University of Science and Technology) 45:26
Paul Beame (University of Washington) - 3 47:03
Paul Beame (University of Washington) - 1 47:25
David Woodruff (IBM Almaden) 52:25
Benjamin Sach (University of Bristol) 47:37
Udi Wieder (VMware Research) 49:06
Terence Chan (University of South Australia) - 3 47:29
Terence Chan (University of South Australia) - 2 47:20
Terence Chan (University of South Australia) - 1 48:34
Mokshay Madiman (University of Delaware) 47:49
Frédérique Oggier (Nanyang Technological University) 44:25
Tarik Kaced (Université de Paris-Est, LACL, UPEC) 44:05
Salman Avestimehr (USC) 49:57
Raphael Clifford (University of Bristol) - 3 39:59
Raphael Clifford (University of Bristol) - 2 50:53
Raphael Clifford (University of Bristol) - 1 40:38
Chao Tian (The University of Tennessee Knoxville) 36:27
Yitong Yin (Nanjing University) 51:36
Søren Riis (Queen Mary University of London) -2B 35:43
Søren Riis (Queen Mary University of London) 40:28
Søren Riis (Queen Mary University of London) 42:28
Babak Hassibi (Caltech) 55:06
Kasper Green Larsen (Aarhus University) - 3 38:59
Nigel Boston (University of Wisconsin) 46:18
Kasper Green Larsen (Aarhus University) - 2 35:33
Kasper Green Larsen (Aarhus University) - 1 40:56
Kenneth Shum (The Chinese University of Hong Kong) 46:01
Alex Andoni (Columbia) 1/2 47:29
Yue Lu (Harvard University) 40:14
Eric Moulines (Télécom Paristech) 56:03
Alex Andoni (Columbia) 2/2 1:02:28
Ronitt Rubinfeld (MIT and Tel Aviv University) 2/2 8:15
Ronitt Rubinfeld (MIT and Tel Aviv University) 1/2 43:00
Sudipto Guha (University of Pennsylvania) 47:05
David Woodruff (IBM Almaden) 2/2 49:51
David Woodruff (IBM Almaden) 1/2 50:07
Christian Konrad (Reykjavik University) 33:38
Michael Kapralov (EPFL) 50:53
Krzysztof Onak (IBM T. J. Watson) 42:31
Harry Lang (Johns Hopkins University) 40:56
Graham Cormode (University of Warwick) 2/2 46:40
Graham Cormode (University of Warwick) 1/2 49:14
Christian Sohler (TU Dortmund) 42:02
Arnak Dalalyan (ENSAE / CREST, GENES) 45:26
Amit Chakrabarti (Dartmouth College) 1/2 43:15
Amit Chakrabarti (Dartmouth College) 2/2 56:17
Stephen Chestnut (ETH Zurich) 46:15
Nicolas Macris (EPFL) 56:46
Pascal Vontobel (Chinese University of Hong Kong) 1:20:39
Ruediger Urbanke (EPFL) 1/2 49:26
Alexandre d'Aspremont (École Normale Supérieure) 52:44
David Gamarnik (MIT) 50:24
Ruediger Urbanke (EPFL) 2/2 38:36
Ioannis Kontoyiannis (Athens U of Econ & Business) 38:53
Mehdi Molkaraie (UPF) 41:57
Sewoong Oh (UIUC) 58:04
Galen Reeves (Duke University) 48:24
Andrew McGregor (University of Massachusetts) 2/2 39:25
Iryna Andriyanova (ETIS Lab, ENSEA/University of Cergy-Pontoise/CNRS) 51:24
Sidharth Jaggi (The Chinese University of Hong Kong) 46:52
Henry Pfister (Duke University) 1/2 54:23
Henry Pfister (Duke University) 2/2 53:21
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
Gregory Valiant (Stanford) 1/2 56:01
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 2/2 56:17
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Andrew McGregor (University of Massachusetts) 1/2 1:02:39
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 2/2 56:17
Gregory Valiant (Stanford) 1/2 56:01
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Negar Kiyavash (UIUC) 1:03:01
Sennur Ulukus (University of Maryland) 58:11
Stephanie Wehner (Delft University of Technology) 56:17
Krzysztof Pietrzak (IST Austria) 58:57
Andreas Winter (Universitat Autonoma de Barcelona) 51:31
Yingbin Liang (Syracuse University) 49:39
Sirin Nitinawarat (Qualcomm Technologies, Inc.) 26:49
Matthieu Bloch (Georgia Tech) 55:53
Alex Vardy (University of California, San Diego) 54:34
Stefano Tessaro (University of California, Santa Barbara) 54:49
Stefan Dziembowski (University of Warsaw) 48:26
Imre Csiszár (Renyi Institute, Budapest) 58:46
Shun Watanabe (Tokyo University of Agriculture and Technology) 3/3 57:35
H. Tyagi - S. Watanabe 2/3 52:12
Himanshu Tyagi (Indian Institute of Science, Bangalore) 1/3 52:53
Yevgeniy Dodis (NYU) 59:20
Luca Trevisan (University of California, Berkeley) 50:48
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 3/3 54:24
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 2/3 48:19
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 1/3 50:02
Daniel Wichs (Northeastern) 56:56
Huijia Lin (University of California, Santa Barbara) 57:00
Yuval Ishai (Technion) 1/2 50:19
Yuval Ishai (Technion) - 2/2 31:49
Manoj Prabhakaran (University of Illinois) - 1/2 22:14
Manoj Prabhakaran (University of Illinois) - 2/2 52:15
Hoeteck Wee (ENS, Paris) 52:09
Manoj Prabhakaran (University of Illinois at Urbana-Champaign) 58:12
Ye Wang (Mitsubishi Electric Research Laboratories) 47:00
Adam Smith (Penn State) - 1/3 59:30
Adam Smith (Penn State) - 2/3 56:54
Cynthia Dwork (Microsoft Research) 50:38
Adam Smith (Penn State) - 3/3 51:23
Joerg Kliewer (New Jersey Institute of Technology) 57:02
Sewoong Oh (University of Illinois) 49:13
Moni Naor (Wezimann Institute of Science) 46:12
Kobbi Nissim (CRCS at Harvard and Ben-Gurion University) 53:08
Delaram Kahrobaei (City University of New York) 46:33
Lalitha Sankar (Arizona State University) 1:00:41
Jonathan Ullman (Northeastern University) 51:57
Kamalika Chaudhuri (UC San Diego) 52:26
Arkadev Chattopadhyay (TIFR) 57:06
source: Institut Henri Poincaré 2016年2月1日
2016-T1 - Nexus of Information and Computation Theory - CEB Trimester
About the Program
Recently, a number of advances in the theory of computation have been made by using information-theoretic arguments. Conversely, some of the most exciting ongoing work in information theory has focused on problems with a computational component. The primary goal of this three-month IHP thematic program is to explore the rich interplay between information theory and the theory of computation, and ultimately create new connections and collaborations between both scientific communities.
The program will begin with a tutorial week at the Centre International de Recontres Mathématiques in Marseille, France. The goal is to provide sufficient background for the primary themes of the program.
The bulk of the program will be hosted at IHP in Paris, France and is organized around four primary themes, each spanning two weeks. The themes are Distributed Computation and Communication, Fundamental Inequalities and Lower Bounds, Inference Problems, and Secrecy and Privacy. Each theme is separately organized by a dedicated committee.
Finally, there will be a week-long workshop at IHP in Paris, France. The workshop will consist of talks that are aimed towards a broad audience and designed to foster discussion and interaction between the CS and IT communities.
Program Organizers
Mark Braverman (Princeton University)
Bobak Nazer (Boston University)
Anup Rao (University of Washington)
Aslan Tchamkerten, General Chair (Telecom Paristech)
Alexander Shen (LIRMM, Montpellier) 1/2 1:02:20 Different versions of Kolmogorov complexity and a priori probability: a gentle introduction 1/2
Alexander Shen (LIRMM, Montpellier)
February 01, 2016
Abstract: The informal idea – the complexity is the minimal number of bits needed to describe the object – has several different implementations. They are not only technical differences, but all they are there for a reason: we may consider binary strings (both as objects and descriptions) as self-contained objects or as partial information about infinite objects (that fixes some prefix of an infinite sequences). We will try to explain basic results about different versions of complexity and their relation to the notion of the a priori probability.
Alexander Shen (LIRMM, Montpellier) 2/2 51:36
George Giakkoupis (INRIA) 58:00
Andrei Romashchenko (LIRMM) 56:14
Yoram Moses (Technion) 1/2 58:10
Yoram Moses (Technion) 2/2 56:17
Marius Zimand (Towson University) 1:01:54
Péter Gács (Boston University) 50:40
Suresh Venkatasubramanian (University of Utah) 1/3 50:27
Suresh Venkatasubramanian (University of Utah) 2/3 43:40
Suresh Venkatasubramanian (University of Utah) 3/3 50:11
John Walsh (Drexel University) 48:46
Salim El Rouayheb (Illinois Institute of Technology) 48:43
Qin Zhang (Indiana University Bloomington) 48:45
Qi Chen (The Chinese University of Hong Kong) 52:00
Yael Kalai (Microsoft Research) 48:20
Boaz Patt-Shamir (Tel Aviv University) 45:18
Prakash Ishwar (Boston University) 58:20
Paris Koutris (University of Wisconsin) 53:23
Leonard Schulman (Caltech) 1:01:54
Klim Efremenko (Tel-Aviv University) 1/2 52:43
Klim Efremenko (Tel-Aviv University) 2/2 49:29
Yael Kalai (Microsoft Research) 55:02
Thomas Courtade (UC-Berkeley) 53:30
Ofer Feinerman (Weizmann Institute) 52:06
Anup Rao (University of Washington) 1/3 55:16
Anup Rao (University of Washington) 2/3 56:46
Anup Rao (University of Washington) 3/3 54:02
Amos Korman (CNRS/LIAFA) 42:00
Ran Gelles (Princeton University) 1/2 55:42
Ran Gelles (Princeton University) 2/2 51:37
Omri Weinstein (Courant Institute (NYU)) 2/6 55:41
Omri Weinstein (Courant Institute (NYU)) 3/6 49:36
Omri Weinstein (Courant Institute (NYU)) 4/6 1:12:42
Omri Weinstein (Courant Institute (NYU)) 5/6 56:45
Omri Weinstein (Courant Institute (NYU)) 6/6 50:56
Badih Ghazi (MIT) 55:08
Alex Sprintson (Texas A&M) 43:33
Young Han Kim (UCSD) 53:23
Michael Langberg (SUNY at Buffalo) 53:42
Allison Bishop (Columbia) 46:5
Stephan Sebastian Holzer (MIT) 50:40
János Körner (Sapienza University of Rome) 55:23
Chandra Nair (Chinese University of Hong Kong) 1/2 46:30
Chandra Nair (Chinese University of Hong Kong) 2/2 51:22
Dan Suciu (University of Washington) 51:26
Cédric Villani (Université de Lyon / Institut Henri Poincaré) 1:06:49
Péter Gács (Boston University) 2/2 51:31
Randall Dougherty (Center for Communications Research) 52:31
László Csirmaz (Central European University, Budapest) 1/3 44:10
László Csirmaz (Central European University, Budapest) 2/3 45:56
László Csirmaz (Central European University, Budapest) 3/3 38:01
Arkadev Chattopadhyay (Tata Institute of Fundamental Research) 50:09
Thathatchar.S. Jayram (IBM Almaden) 51:42
Amin Aminzadeh Gohari (Sharif University of Technology) 48:45
P. Vijay Kumar (Indian Institute of Science, University of Southern California) 42:52
František Matúš (Institute of Information Theory and Automation) 1/3 50:39
František Matúš (Institute of Information Theory and Automation) 2/3 51:47
František Matúš (Institute of Information Theory and Automation) 3/3 38:33
19 02 16 Fan Cheng (National University of Singapore) 52:44
Raymond Yeung (The Chinese University of Hong Kong) 3/3 31:34
Raymond Yeung (The Chinese University of Hong Kong) 2/3 51:01
Raymond Yeung (The Chinese University of Hong Kong) 1/3 44:59
John Walsh (Drexel University) 49:16
Sidharth Jaggi (CUHK) 38:17
Petr Kuznetsov (Télécom Paristech) 43:52
Omar Fawzi (ENS Lyon) 34:49
Ofer Shayevitz (Tel Aviv University) 34:39
Maxim Raginsky (University of Illinois) 36:50
David Woodruff (IBM Almaden) 38:48
Ankit Garg (Princeton) 35:42
Ran Gelles (Princeton) 36:54
Amir Yehudayoff (Technion) 33:16
Iordanis Kerenidis (Université Paris Diderot 7) 37:37
Ayfer Özgür (Stanford) 33:13
Rajesh Sundaresan 37:11
Sidharth Jaggi (CUHK) 34:48
Michelle Effros (California Institute of Technology) 36:15
Aaron Wagner (Cornell) 47:16
Shlomo Shamai (Technion) 38:51
Shay Moran (Technion) 24:27
Giacomo Como (Lund University) 42:28
Bruno Bauwens (Higher School of Economics) 29:06
Stephen Chestnut (ETH Zurich) 34:03
Paul Beame (University of Washington) - 1 57:40
Yuchong Hu (Huazhong University of Science and Technology) 45:26
Paul Beame (University of Washington) - 3 47:03
Paul Beame (University of Washington) - 1 47:25
David Woodruff (IBM Almaden) 52:25
Benjamin Sach (University of Bristol) 47:37
Udi Wieder (VMware Research) 49:06
Terence Chan (University of South Australia) - 3 47:29
Terence Chan (University of South Australia) - 2 47:20
Terence Chan (University of South Australia) - 1 48:34
Mokshay Madiman (University of Delaware) 47:49
Frédérique Oggier (Nanyang Technological University) 44:25
Tarik Kaced (Université de Paris-Est, LACL, UPEC) 44:05
Salman Avestimehr (USC) 49:57
Raphael Clifford (University of Bristol) - 3 39:59
Raphael Clifford (University of Bristol) - 2 50:53
Raphael Clifford (University of Bristol) - 1 40:38
Chao Tian (The University of Tennessee Knoxville) 36:27
Yitong Yin (Nanjing University) 51:36
Søren Riis (Queen Mary University of London) -2B 35:43
Søren Riis (Queen Mary University of London) 40:28
Søren Riis (Queen Mary University of London) 42:28
Babak Hassibi (Caltech) 55:06
Kasper Green Larsen (Aarhus University) - 3 38:59
Nigel Boston (University of Wisconsin) 46:18
Kasper Green Larsen (Aarhus University) - 2 35:33
Kasper Green Larsen (Aarhus University) - 1 40:56
Kenneth Shum (The Chinese University of Hong Kong) 46:01
Alex Andoni (Columbia) 1/2 47:29
Yue Lu (Harvard University) 40:14
Eric Moulines (Télécom Paristech) 56:03
Alex Andoni (Columbia) 2/2 1:02:28
Ronitt Rubinfeld (MIT and Tel Aviv University) 2/2 8:15
Ronitt Rubinfeld (MIT and Tel Aviv University) 1/2 43:00
Sudipto Guha (University of Pennsylvania) 47:05
David Woodruff (IBM Almaden) 2/2 49:51
David Woodruff (IBM Almaden) 1/2 50:07
Christian Konrad (Reykjavik University) 33:38
Michael Kapralov (EPFL) 50:53
Krzysztof Onak (IBM T. J. Watson) 42:31
Harry Lang (Johns Hopkins University) 40:56
Graham Cormode (University of Warwick) 2/2 46:40
Graham Cormode (University of Warwick) 1/2 49:14
Christian Sohler (TU Dortmund) 42:02
Arnak Dalalyan (ENSAE / CREST, GENES) 45:26
Amit Chakrabarti (Dartmouth College) 1/2 43:15
Amit Chakrabarti (Dartmouth College) 2/2 56:17
Stephen Chestnut (ETH Zurich) 46:15
Nicolas Macris (EPFL) 56:46
Pascal Vontobel (Chinese University of Hong Kong) 1:20:39
Ruediger Urbanke (EPFL) 1/2 49:26
Alexandre d'Aspremont (École Normale Supérieure) 52:44
David Gamarnik (MIT) 50:24
Ruediger Urbanke (EPFL) 2/2 38:36
Ioannis Kontoyiannis (Athens U of Econ & Business) 38:53
Mehdi Molkaraie (UPF) 41:57
Sewoong Oh (UIUC) 58:04
Galen Reeves (Duke University) 48:24
Andrew McGregor (University of Massachusetts) 2/2 39:25
Iryna Andriyanova (ETIS Lab, ENSEA/University of Cergy-Pontoise/CNRS) 51:24
Sidharth Jaggi (The Chinese University of Hong Kong) 46:52
Henry Pfister (Duke University) 1/2 54:23
Henry Pfister (Duke University) 2/2 53:21
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
Gregory Valiant (Stanford) 1/2 56:01
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 2/2 56:17
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Andrew McGregor (University of Massachusetts) 1/2 1:02:39
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 2/2 56:17
Gregory Valiant (Stanford) 1/2 56:01
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Negar Kiyavash (UIUC) 1:03:01
Sennur Ulukus (University of Maryland) 58:11
Stephanie Wehner (Delft University of Technology) 56:17
Krzysztof Pietrzak (IST Austria) 58:57
Andreas Winter (Universitat Autonoma de Barcelona) 51:31
Yingbin Liang (Syracuse University) 49:39
Sirin Nitinawarat (Qualcomm Technologies, Inc.) 26:49
Matthieu Bloch (Georgia Tech) 55:53
Alex Vardy (University of California, San Diego) 54:34
Stefano Tessaro (University of California, Santa Barbara) 54:49
Stefan Dziembowski (University of Warsaw) 48:26
Imre Csiszár (Renyi Institute, Budapest) 58:46
Shun Watanabe (Tokyo University of Agriculture and Technology) 3/3 57:35
H. Tyagi - S. Watanabe 2/3 52:12
Himanshu Tyagi (Indian Institute of Science, Bangalore) 1/3 52:53
Yevgeniy Dodis (NYU) 59:20
Luca Trevisan (University of California, Berkeley) 50:48
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 3/3 54:24
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 2/3 48:19
Iftach Haitner (Tel Aviv University) - Leo Reyzin (Boston University) 1/3 50:02
Daniel Wichs (Northeastern) 56:56
Huijia Lin (University of California, Santa Barbara) 57:00
Yuval Ishai (Technion) 1/2 50:19
Yuval Ishai (Technion) - 2/2 31:49
Manoj Prabhakaran (University of Illinois) - 1/2 22:14
Manoj Prabhakaran (University of Illinois) - 2/2 52:15
Hoeteck Wee (ENS, Paris) 52:09
Manoj Prabhakaran (University of Illinois at Urbana-Champaign) 58:12
Ye Wang (Mitsubishi Electric Research Laboratories) 47:00
Adam Smith (Penn State) - 1/3 59:30
Adam Smith (Penn State) - 2/3 56:54
Cynthia Dwork (Microsoft Research) 50:38
Adam Smith (Penn State) - 3/3 51:23
Joerg Kliewer (New Jersey Institute of Technology) 57:02
Sewoong Oh (University of Illinois) 49:13
Moni Naor (Wezimann Institute of Science) 46:12
Kobbi Nissim (CRCS at Harvard and Ben-Gurion University) 53:08
Delaram Kahrobaei (City University of New York) 46:33
Lalitha Sankar (Arizona State University) 1:00:41
Jonathan Ullman (Northeastern University) 51:57
Kamalika Chaudhuri (UC San Diego) 52:26
Arkadev Chattopadhyay (TIFR) 57:06
2017-08-25
Nexus Trimester - 2016 - Distributed Computation and Communication Theme
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2016年2月25日
Amin Aminzadeh Gohari (Sharif University of Technology) 48:45
High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory
Amin Aminzadeh Gohari (Sharif University of Technology)
February 05, 2016
Abstract: We introduce a “high probability” framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any payoff that can be guaranteed with high probability can be guaranteed in expectation, but the reverse is not true. Hence, unlike the average payoff case where the payoff guaranteed by each player is the negative of the payoff by the other player, the two guaranteed payoffs would differ in the high probability framework. One motivation for this framework comes from information transmission systems, where it is customary to formulate problems in terms of asymptotically vanishing probability of error. An application of our results to a class of compound arbitrarily varying channels is given.
Péter Gács (Boston University) 2/2 51:31
Yael Kalai (Microsoft Research) 48:20
Boaz Patt-Shamir (Tel Aviv University) 45:18
Prakash Ishwar (Boston University) 58:20
Paris Koutris (University of Wisconsin) 53:23
Leonard Schulman (Caltech) 1:01:54
Klim Efremenko (Tel-Aviv University) 2/2 49:29
Klim Efremenko (Tel-Aviv University) 1/2 52:43
Yael Kalai (Microsoft Research) 55:02
Thomas Courtade (UC-Berkeley) 53:30
Ofer Feinerman (Weizmann Institute) 52:06
Anup Rao (University of Washington) 3/3 54:02
Anup Rao (University of Washington) 2/3 56:46
Amos Korman (CNRS/LIAFA) 42:00
Ran Gelles (Princeton University) 2/2 51:37
Ran Gelles (Princeton University) 1/2 55:42
Omri Weinstein (Courant Institute (NYU)) 6/6 50:56
Omri Weinstein (Courant Institute (NYU)) 5/6 56:45
Badih Ghazi (MIT) 55:08
Alex Sprintson (Texas A&M) 43:33
Omri Weinstein (Courant Institute (NYU)) 4/6 1:12:42
Omri Weinstein (Courant Institute (NYU)) 3/6 49:36
Michael Langberg (SUNY at Buffalo) 53:42
Allison Bishop (Columbia) 46:55
Stephan Sebastian Holzer (MIT) 50:40
János Körner (Sapienza University of Rome) 55:23
Chandra Nair (Chinese University of Hong Kong) 2/2 51:22
Anup Rao (University of Washington) 1/3 55:16
Omri Weinstein (Courant Institute (NYU)) 2/6 55:41
Dan Suciu (University of Washington) 51:26
Chandra Nair (Chinese University of Hong Kong) 1/2 46:30
Cédric Villani (Université de Lyon / Institut Henri Poincaré) 1:06:49
Péter Gács (Boston University) 50:40
Marius Zimand (Towson University) 1:01:54
Yoram Moses (Technion) 2/2 56:17
Yoram Moses (Technion) 1/2 58:10
Andrei Romashchenko (LIRMM) 56:14
George Giakkoupis (INRIA) 58:00
Alexander Shen (LIRMM, Montpellier) 2/2 51:36
Alexander Shen (LIRMM, Montpellier) 1/2 1:02:20
Arkadev Chattopadhyay (TIFR) 57:06
source: Institut Henri Poincaré 2016年2月25日
Amin Aminzadeh Gohari (Sharif University of Technology) 48:45
High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory
Amin Aminzadeh Gohari (Sharif University of Technology)
February 05, 2016
Abstract: We introduce a “high probability” framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any payoff that can be guaranteed with high probability can be guaranteed in expectation, but the reverse is not true. Hence, unlike the average payoff case where the payoff guaranteed by each player is the negative of the payoff by the other player, the two guaranteed payoffs would differ in the high probability framework. One motivation for this framework comes from information transmission systems, where it is customary to formulate problems in terms of asymptotically vanishing probability of error. An application of our results to a class of compound arbitrarily varying channels is given.
Péter Gács (Boston University) 2/2 51:31
Yael Kalai (Microsoft Research) 48:20
Boaz Patt-Shamir (Tel Aviv University) 45:18
Prakash Ishwar (Boston University) 58:20
Paris Koutris (University of Wisconsin) 53:23
Leonard Schulman (Caltech) 1:01:54
Klim Efremenko (Tel-Aviv University) 2/2 49:29
Klim Efremenko (Tel-Aviv University) 1/2 52:43
Yael Kalai (Microsoft Research) 55:02
Thomas Courtade (UC-Berkeley) 53:30
Ofer Feinerman (Weizmann Institute) 52:06
Anup Rao (University of Washington) 3/3 54:02
Anup Rao (University of Washington) 2/3 56:46
Amos Korman (CNRS/LIAFA) 42:00
Ran Gelles (Princeton University) 2/2 51:37
Ran Gelles (Princeton University) 1/2 55:42
Omri Weinstein (Courant Institute (NYU)) 6/6 50:56
Omri Weinstein (Courant Institute (NYU)) 5/6 56:45
Badih Ghazi (MIT) 55:08
Alex Sprintson (Texas A&M) 43:33
Omri Weinstein (Courant Institute (NYU)) 4/6 1:12:42
Omri Weinstein (Courant Institute (NYU)) 3/6 49:36
Michael Langberg (SUNY at Buffalo) 53:42
Allison Bishop (Columbia) 46:55
Stephan Sebastian Holzer (MIT) 50:40
János Körner (Sapienza University of Rome) 55:23
Chandra Nair (Chinese University of Hong Kong) 2/2 51:22
Anup Rao (University of Washington) 1/3 55:16
Omri Weinstein (Courant Institute (NYU)) 2/6 55:41
Dan Suciu (University of Washington) 51:26
Chandra Nair (Chinese University of Hong Kong) 1/2 46:30
Cédric Villani (Université de Lyon / Institut Henri Poincaré) 1:06:49
Péter Gács (Boston University) 50:40
Marius Zimand (Towson University) 1:01:54
Yoram Moses (Technion) 2/2 56:17
Yoram Moses (Technion) 1/2 58:10
Andrei Romashchenko (LIRMM) 56:14
George Giakkoupis (INRIA) 58:00
Alexander Shen (LIRMM, Montpellier) 2/2 51:36
Alexander Shen (LIRMM, Montpellier) 1/2 1:02:20
Arkadev Chattopadhyay (TIFR) 57:06
Nexus Trimester - 2016 - Fundamental Inequalities and Lower Bounds Theme
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2016年2月25日
Randall Dougherty (Center for Communications Research) 52:31
Entropy inequalities and linear rank inequalities
Randall Dougherty (Center for Communications Research)
February 16, 2016
Abstract: Entropy inequalities (Shannon and non-Shannon) have been used to obtain bounds on the solutions to a number of problems. When the problems are restricted to the linear case, these bounds can sometimes be improved using linear rank inequalities such as the Ingleton inequality, which hold for entropy vectors coming from linear variables (also known as representable polymatroids) but not necessarily for all entropy vectors. This talk will describe methods for producing linear rank inequalities, or finding counterexamples to putative linear rank inequalities, comparing them to the methods for proving non-Shannon entropy inequalities, and show the differences between known results for the entropy region and for its linear analogue (actually analogues, since one has to divide into cases based on the characteristic of the underlying field).
László Csirmaz (Central European University, Budapest) 1/3 44:10
László Csirmaz (Central European University, Budapest) 3/3 38:01
László Csirmaz (Central European University, Budapest) 2/3 45:56
Arkadev Chattopadhyay (Tata Institute of Fundamental Research) 50:09
Thathatchar.S. Jayram (IBM Almaden) 51:42
Young Han Kim (UCSD) 53:23
Suresh Venkatasubramanian (University of Utah) 1/3 50:27
Suresh Venkatasubramanian (University of Utah) 2/3 43:40
Suresh Venkatasubramanian (University of Utah) 3/3 50:11
John Walsh (Drexel University) 48:46
Salim El Rouayheb (Illinois Institute of Technology) 48:43
Qin Zhang (Indiana University Bloomington) 48:45
Qi Chen (The Chinese University of Hong Kong) 52:00
František Matúš (Institute of Information Theory and Automation) 2/3 51:47
P. Vijay Kumar (Indian Institute of Science, University of Southern California) 42:52
František Matúš (Institute of Information Theory and Automation) 3/3 38:33
František Matúš (Institute of Information Theory and Automation) 1/3 50:39
19 02 16 Fan Cheng (National University of Singapore) 52:44
Raymond Yeung (The Chinese University of Hong Kong) 3/3 31:34
Raymond Yeung (The Chinese University of Hong Kong) 2/3 51:01
Raymond Yeung (The Chinese University of Hong Kong) 1/3 44:59
John Walsh (Drexel University) 49:16
Paul Beame (University of Washington) - 1 57:40
Yuchong Hu (Huazhong University of Science and Technology) 45:26
Paul Beame (University of Washington) - 3 47:03
Paul Beame (University of Washington) - 1 47:25
David Woodruff (IBM Almaden) 52:25
Benjamin Sach (University of Bristol) 47:37
Udi Wieder (VMware Research) 49:06
Terence Chan (University of South Australia) - 3 47:29
Terence Chan (University of South Australia) - 2 47:20
Terence Chan (University of South Australia) - 1 48:34
Mokshay Madiman (University of Delaware) 47:49
Frédérique Oggier (Nanyang Technological University) 44:25
Tarik Kaced (Université de Paris-Est, LACL, UPEC) 44:05
Salman Avestimehr (USC) 49:57
Raphael Clifford (University of Bristol) - 3 39:59
Raphael Clifford (University of Bristol) - 2 50:53
Raphael Clifford (University of Bristol) - 1 40:38
Chao Tian (The University of Tennessee Knoxville) 36:27
Yitong Yin (Nanjing University) 51:36
Søren Riis (Queen Mary University of London) -2B 35:43
Søren Riis (Queen Mary University of London) 40:28
Søren Riis (Queen Mary University of London) 42:28
Babak Hassibi (Caltech) 55:06
Kasper Green Larsen (Aarhus University) - 3 38:59
Nigel Boston (University of Wisconsin) 46:18
Kasper Green Larsen (Aarhus University) - 2 35:33
Kasper Green Larsen (Aarhus University) - 1 40:56
Kenneth Shum (The Chinese University of Hong Kong) 46:01
source: Institut Henri Poincaré 2016年2月25日
Randall Dougherty (Center for Communications Research) 52:31
Entropy inequalities and linear rank inequalities
Randall Dougherty (Center for Communications Research)
February 16, 2016
Abstract: Entropy inequalities (Shannon and non-Shannon) have been used to obtain bounds on the solutions to a number of problems. When the problems are restricted to the linear case, these bounds can sometimes be improved using linear rank inequalities such as the Ingleton inequality, which hold for entropy vectors coming from linear variables (also known as representable polymatroids) but not necessarily for all entropy vectors. This talk will describe methods for producing linear rank inequalities, or finding counterexamples to putative linear rank inequalities, comparing them to the methods for proving non-Shannon entropy inequalities, and show the differences between known results for the entropy region and for its linear analogue (actually analogues, since one has to divide into cases based on the characteristic of the underlying field).
László Csirmaz (Central European University, Budapest) 1/3 44:10
László Csirmaz (Central European University, Budapest) 3/3 38:01
László Csirmaz (Central European University, Budapest) 2/3 45:56
Arkadev Chattopadhyay (Tata Institute of Fundamental Research) 50:09
Thathatchar.S. Jayram (IBM Almaden) 51:42
Young Han Kim (UCSD) 53:23
Suresh Venkatasubramanian (University of Utah) 1/3 50:27
Suresh Venkatasubramanian (University of Utah) 2/3 43:40
Suresh Venkatasubramanian (University of Utah) 3/3 50:11
John Walsh (Drexel University) 48:46
Salim El Rouayheb (Illinois Institute of Technology) 48:43
Qin Zhang (Indiana University Bloomington) 48:45
Qi Chen (The Chinese University of Hong Kong) 52:00
František Matúš (Institute of Information Theory and Automation) 2/3 51:47
P. Vijay Kumar (Indian Institute of Science, University of Southern California) 42:52
František Matúš (Institute of Information Theory and Automation) 3/3 38:33
František Matúš (Institute of Information Theory and Automation) 1/3 50:39
19 02 16 Fan Cheng (National University of Singapore) 52:44
Raymond Yeung (The Chinese University of Hong Kong) 3/3 31:34
Raymond Yeung (The Chinese University of Hong Kong) 2/3 51:01
Raymond Yeung (The Chinese University of Hong Kong) 1/3 44:59
John Walsh (Drexel University) 49:16
Paul Beame (University of Washington) - 1 57:40
Yuchong Hu (Huazhong University of Science and Technology) 45:26
Paul Beame (University of Washington) - 3 47:03
Paul Beame (University of Washington) - 1 47:25
David Woodruff (IBM Almaden) 52:25
Benjamin Sach (University of Bristol) 47:37
Udi Wieder (VMware Research) 49:06
Terence Chan (University of South Australia) - 3 47:29
Terence Chan (University of South Australia) - 2 47:20
Terence Chan (University of South Australia) - 1 48:34
Mokshay Madiman (University of Delaware) 47:49
Frédérique Oggier (Nanyang Technological University) 44:25
Tarik Kaced (Université de Paris-Est, LACL, UPEC) 44:05
Salman Avestimehr (USC) 49:57
Raphael Clifford (University of Bristol) - 3 39:59
Raphael Clifford (University of Bristol) - 2 50:53
Raphael Clifford (University of Bristol) - 1 40:38
Chao Tian (The University of Tennessee Knoxville) 36:27
Yitong Yin (Nanjing University) 51:36
Søren Riis (Queen Mary University of London) -2B 35:43
Søren Riis (Queen Mary University of London) 40:28
Søren Riis (Queen Mary University of London) 42:28
Babak Hassibi (Caltech) 55:06
Kasper Green Larsen (Aarhus University) - 3 38:59
Nigel Boston (University of Wisconsin) 46:18
Kasper Green Larsen (Aarhus University) - 2 35:33
Kasper Green Larsen (Aarhus University) - 1 40:56
Kenneth Shum (The Chinese University of Hong Kong) 46:01
Nexus Trimester - 2016 -Tutorial Week at CIRM
# You can also click the upper-left icon to select videos from the playlist.
source: Centre International de Rencontres Mathématiques 2016年2月16日
Ankur Moitra : Algorithmic Aspects of Inference 53:08
Abstract: Parametric inference is one of the cornerstones of statistics, but much of the classic theory revolves around asymptotic notions of convergence and relies on estimators that are hard to compute (particularly in high-dimensional problems).
In this tutorial, we will explore the following questions:
(1) For some of the fundamental problems in statistics, are there surrogates for the maximum likelihood estimator that also converge at an inverse polynomial rate to the true parameters, but in contrast can be computed efficiently?
(2) Can we establish tradeoffs between sample complexity and computational complexity? And what types of hardness assumptions allow us to explore this space?
We will cover topics such as the method of moments, learning mixture models, tensor decomposition, sparse PCA and matrix/tensor completion.
Recording during the thematic meeting: «Nexus of Information and Computation Theories » theJanuary 25, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France)
Filmmaker: Guillaume Hennenfent
Ankur Moitra : Tensor Decompositions and their Applications 57:54
Ankur Moitra : Linear Inverse Problems 1:01:25
Ankur Moitra : A Polynomial Time Algorithm for Lossy Population Recovery 54:02
Sudeep Kamath : Concentration of Measure - 1 1:00:28
Sudeep Kamath : Concentration of Measure - 2 1:06:02
Sudeep Kamath : Concentration of Measure - 3 53:50
Sudeep Kamath : Concentration of Measure - 4 1:02:46
Anup Rao : Communication Complexity and Information Complexity - 1 1:08:38
Anup Rao : Communication Complexity and Information Complexity - 2 1:08:15
Anup Rao : Communication Complexity and Information Complexity - 3 54:59
Anup Rao : Communication Complexity and Information Complexity - 4 1:00:52
Guy Rothblum : Privacy and Security via Randomized Methods - 1 1:02:23
Guy Rothblum : Privacy and Security via Randomized Methods - 2 1:10:52
Guy Rothblum : Privacy and Security via Randomized Methods - 3 1:04:51
Guy Rothblum : Privacy and Security via Randomized Methods - 4 1:04:42
source: Centre International de Rencontres Mathématiques 2016年2月16日
Ankur Moitra : Algorithmic Aspects of Inference 53:08
Abstract: Parametric inference is one of the cornerstones of statistics, but much of the classic theory revolves around asymptotic notions of convergence and relies on estimators that are hard to compute (particularly in high-dimensional problems).
In this tutorial, we will explore the following questions:
(1) For some of the fundamental problems in statistics, are there surrogates for the maximum likelihood estimator that also converge at an inverse polynomial rate to the true parameters, but in contrast can be computed efficiently?
(2) Can we establish tradeoffs between sample complexity and computational complexity? And what types of hardness assumptions allow us to explore this space?
We will cover topics such as the method of moments, learning mixture models, tensor decomposition, sparse PCA and matrix/tensor completion.
Recording during the thematic meeting: «Nexus of Information and Computation Theories » theJanuary 25, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France)
Filmmaker: Guillaume Hennenfent
Ankur Moitra : Tensor Decompositions and their Applications 57:54
Ankur Moitra : Linear Inverse Problems 1:01:25
Ankur Moitra : A Polynomial Time Algorithm for Lossy Population Recovery 54:02
Sudeep Kamath : Concentration of Measure - 1 1:00:28
Sudeep Kamath : Concentration of Measure - 2 1:06:02
Sudeep Kamath : Concentration of Measure - 3 53:50
Sudeep Kamath : Concentration of Measure - 4 1:02:46
Anup Rao : Communication Complexity and Information Complexity - 1 1:08:38
Anup Rao : Communication Complexity and Information Complexity - 2 1:08:15
Anup Rao : Communication Complexity and Information Complexity - 3 54:59
Anup Rao : Communication Complexity and Information Complexity - 4 1:00:52
Guy Rothblum : Privacy and Security via Randomized Methods - 1 1:02:23
Guy Rothblum : Privacy and Security via Randomized Methods - 2 1:10:52
Guy Rothblum : Privacy and Security via Randomized Methods - 3 1:04:51
Guy Rothblum : Privacy and Security via Randomized Methods - 4 1:04:42
2017-08-24
Nexus Trimester - 2016 - Central Workshop
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2016年3月14日
Sidharth Jaggi (CUHK) 38:17 Reliable communication in the presence of limited adversaires
Sidharth Jaggi (CUHK)
March 04, 2016
Abstract: An adversary wishes to corrupt stored (or transmitted) data, but operates in an information-limited manner. Examples of such limitations may include only viewing some subset of the data or some noisy version of it, viewing those subsets causally, or with the encoder getting feedback about the corruption. We determine the capacity of some classes of such channels, and computationally efficient schemes achieving these capacities in some models (in particular over “large alphabets”). This is an overview of a long line of classical results, and also work done over the last few years (with an emphasis on a flurry of recent results) in collaboration Bikash Kumar Dey, Anand Dilip Sarwate, Michael Langberg, Zitan Chen, Mayank Bakshi, Qiaosheng Zhang (Eric), Alex Sprintson, and Swanand Kadhe.Petr Kuznetsov (Télécom Paristech) 43:52
Omar Fawzi (ENS Lyon) 34:49
Ofer Shayevitz (Tel Aviv University) 34:39
Maxim Raginsky (University of Illinois) 36:50
David Woodruff (IBM Almaden) 38:48
Ankit Garg (Princeton) 35:42
Ran Gelles (Princeton) 36:54
Amir Yehudayoff (Technion) 33:16
Iordanis Kerenidis (Université Paris Diderot 7) 37:37
Ayfer Özgür (Stanford) 33:13
Rajesh Sundaresan 37:11
Sidharth Jaggi (CUHK) 34:48
Michelle Effros (California Institute of Technology) 36:15
Aaron Wagner (Cornell) 47:16
Shlomo Shamai (Technion) 38:51
Shay Moran (Technion) 24:27
Giacomo Como (Lund University) 42:28
Bruno Bauwens (Higher School of Economics) 29:06
Stephen Chestnut (ETH Zurich) 34:03
source: Institut Henri Poincaré 2016年3月14日
Sidharth Jaggi (CUHK) 38:17 Reliable communication in the presence of limited adversaires
Sidharth Jaggi (CUHK)
March 04, 2016
Abstract: An adversary wishes to corrupt stored (or transmitted) data, but operates in an information-limited manner. Examples of such limitations may include only viewing some subset of the data or some noisy version of it, viewing those subsets causally, or with the encoder getting feedback about the corruption. We determine the capacity of some classes of such channels, and computationally efficient schemes achieving these capacities in some models (in particular over “large alphabets”). This is an overview of a long line of classical results, and also work done over the last few years (with an emphasis on a flurry of recent results) in collaboration Bikash Kumar Dey, Anand Dilip Sarwate, Michael Langberg, Zitan Chen, Mayank Bakshi, Qiaosheng Zhang (Eric), Alex Sprintson, and Swanand Kadhe.Petr Kuznetsov (Télécom Paristech) 43:52
Omar Fawzi (ENS Lyon) 34:49
Ofer Shayevitz (Tel Aviv University) 34:39
Maxim Raginsky (University of Illinois) 36:50
David Woodruff (IBM Almaden) 38:48
Ankit Garg (Princeton) 35:42
Ran Gelles (Princeton) 36:54
Amir Yehudayoff (Technion) 33:16
Iordanis Kerenidis (Université Paris Diderot 7) 37:37
Ayfer Özgür (Stanford) 33:13
Rajesh Sundaresan 37:11
Sidharth Jaggi (CUHK) 34:48
Michelle Effros (California Institute of Technology) 36:15
Aaron Wagner (Cornell) 47:16
Shlomo Shamai (Technion) 38:51
Shay Moran (Technion) 24:27
Giacomo Como (Lund University) 42:28
Bruno Bauwens (Higher School of Economics) 29:06
Stephen Chestnut (ETH Zurich) 34:03
Nexus Trimester - 2016 - Inference Problems Theme
# You can also click the upper-left icon to select videos from the playlist.
source: Institut Henri Poincaré 2016年3月28日
Alex Andoni (Columbia) 1/2 47:29 Sketching and Embeddings 1/2
Alex Andoni (Columbia)
March 11, 2016
Abstract: Sketching for distance estimation is the problem where we need to design a possibly randomized function f from a metric space to short strings, such that from f(x) and f(y) we can estimate the distance between x and y. This problem is a core problem in both the streaming and nearest neighbor search areas. We will discuss this problem and its connections to the theory of metric embeddings. In particular, we will discuss when and why sketching is equivalent to embedding into normed space such as ℓ1.Alex Andoni (Columbia) 2/2 1:02:28
Yue Lu (Harvard University) 40:14
Eric Moulines (Télécom Paristech) 56:03
Ronitt Rubinfeld (MIT and Tel Aviv University) 1/2 43:00
Ronitt Rubinfeld (MIT and Tel Aviv University) 2/2 48:15
Sudipto Guha (University of Pennsylvania) 47:05
David Woodruff (IBM Almaden) 1/2 50:07
David Woodruff (IBM Almaden) 2/2 49:51
Christian Konrad (Reykjavik University) 33:38
Michael Kapralov (EPFL) 50:53
Krzysztof Onak (IBM T. J. Watson) 42:31
Harry Lang (Johns Hopkins University) 40:56
Graham Cormode (University of Warwick) 1/2 49:14
Graham Cormode (University of Warwick) 2/2 46:40
Christian Sohler (TU Dortmund) 42:02
Arnak Dalalyan (ENSAE / CREST, GENES) 45:26
Amit Chakrabarti (Dartmouth College) 1/2 43:15
Amit Chakrabarti (Dartmouth College) 2/2 56:17
Stephen Chestnut (ETH Zurich) 46:15
Pascal Vontobel (Chinese University of Hong Kong) 1:20:39
Nicolas Macris (EPFL) 56:46
Ioannis Kontoyiannis (Athens U of Econ & Business) 38:53
Alexandre d'Aspremont (École Normale Supérieure) 52:44
Ruediger Urbanke (EPFL) 1/2 49:26
Ruediger Urbanke (EPFL) 2/2 38:36
Sewoong Oh (UIUC) 58:04
Mehdi Molkaraie (UPF) 41:57
David Gamarnik (MIT) 50:24
Henry Pfister (Duke University) 1/2 54:23
Henry Pfister (Duke University) 2/2 53:21
Sidharth Jaggi (The Chinese University of Hong Kong) 46:52
Iryna Andriyanova (ETIS Lab, ENSEA/University of Cergy-Pontoise/CNRS) 51:24
Galen Reeves (Duke University) 48:24
Andrew McGregor (University of Massachusetts) 1/2 1:02:39
Andrew McGregor (University of Massachusetts) 2/2 39:25
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 1/2 56:01
Gregory Valiant (Stanford) 2/2 56:17
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
source: Institut Henri Poincaré 2016年3月28日
Alex Andoni (Columbia) 1/2 47:29 Sketching and Embeddings 1/2
Alex Andoni (Columbia)
March 11, 2016
Abstract: Sketching for distance estimation is the problem where we need to design a possibly randomized function f from a metric space to short strings, such that from f(x) and f(y) we can estimate the distance between x and y. This problem is a core problem in both the streaming and nearest neighbor search areas. We will discuss this problem and its connections to the theory of metric embeddings. In particular, we will discuss when and why sketching is equivalent to embedding into normed space such as ℓ1.Alex Andoni (Columbia) 2/2 1:02:28
Yue Lu (Harvard University) 40:14
Eric Moulines (Télécom Paristech) 56:03
Ronitt Rubinfeld (MIT and Tel Aviv University) 1/2 43:00
Ronitt Rubinfeld (MIT and Tel Aviv University) 2/2 48:15
Sudipto Guha (University of Pennsylvania) 47:05
David Woodruff (IBM Almaden) 1/2 50:07
David Woodruff (IBM Almaden) 2/2 49:51
Christian Konrad (Reykjavik University) 33:38
Michael Kapralov (EPFL) 50:53
Krzysztof Onak (IBM T. J. Watson) 42:31
Harry Lang (Johns Hopkins University) 40:56
Graham Cormode (University of Warwick) 1/2 49:14
Graham Cormode (University of Warwick) 2/2 46:40
Christian Sohler (TU Dortmund) 42:02
Arnak Dalalyan (ENSAE / CREST, GENES) 45:26
Amit Chakrabarti (Dartmouth College) 1/2 43:15
Amit Chakrabarti (Dartmouth College) 2/2 56:17
Stephen Chestnut (ETH Zurich) 46:15
Pascal Vontobel (Chinese University of Hong Kong) 1:20:39
Nicolas Macris (EPFL) 56:46
Ioannis Kontoyiannis (Athens U of Econ & Business) 38:53
Alexandre d'Aspremont (École Normale Supérieure) 52:44
Ruediger Urbanke (EPFL) 1/2 49:26
Ruediger Urbanke (EPFL) 2/2 38:36
Sewoong Oh (UIUC) 58:04
Mehdi Molkaraie (UPF) 41:57
David Gamarnik (MIT) 50:24
Henry Pfister (Duke University) 1/2 54:23
Henry Pfister (Duke University) 2/2 53:21
Sidharth Jaggi (The Chinese University of Hong Kong) 46:52
Iryna Andriyanova (ETIS Lab, ENSEA/University of Cergy-Pontoise/CNRS) 51:24
Galen Reeves (Duke University) 48:24
Andrew McGregor (University of Massachusetts) 1/2 1:02:39
Andrew McGregor (University of Massachusetts) 2/2 39:25
Ilias Diakonikolas (University of Southern California) 47:33
Gregory Valiant (Stanford) 1/2 56:01
Gregory Valiant (Stanford) 2/2 56:17
Gábor Lugosi (Pompeu Fabra University) 1/2 46:18
Gábor Lugosi (Pompeu Fabra University) 2/2 39:48
Subscribe to:
Posts (Atom)