content

Author: Yves Gendrault
Slides: PDF
Presentation: Video

Step 1: create your report using the CSDC latex template

Step 2: send your report to Pierre Parrend parrend@unistra.fr, together with :

a proposal for two reviewers of the Complex System community a proposal for reports type: it can be either research or technical papers the e-department of relevance the e-laboratory of relevance

Step 3: the reviews are performed as open peer-review exchange between the reviewers and the author(s) using a shared copy of the reference template for report review.
Reviewers provide accept, major rework, minor rework or reject recommandations. Reviewers also confirm the status of research or technical reports.
In case of major or minor rework, the improvements are made by the authors according to the requirements.

Step 4: acceptation is performed at the unanimity of the reviewers. The report is then affected a unique ARK number and published on the CS-DC Forum.

OFFICIAL WEBSITE - REGISTRATION

Presentation

This Summer School will consist in two courses given by professors Sergey Bobkov (Minneapolis) and Mokshay Madiman (Delaware) on Information Theory and Convex Analysis. The aim is to bring researchers from different communities (Probability, Analysis, Computer science) in the same place.
Participation of postdocs and PhD students is strongly encouraged. The school has some (limited number of) grants for young people (see the "registration" link above).

Abstracts        
Sergey Bobkov (Minneapolis) : Strong probability distances and limit theorems
Abstract: The lectures explore strong distances in the space of probability distributions, including total variation, relative entropy, chi squared and more general Renyi/Tsallis informational divergences, as well as relative Fisher information. Special attention is given to the distances from the normal law. The first part of the course is devoted to the general theory, and the second part to the behavior of such informational distances along convolutions and associated central limit theorem.

Mokshay Madiman (Delaware): Entropy power and related inequalities in continuous and discrete settings
Abstract: The lectures explore the behavior of Renyi entropies of convolutions of probability measures for a variety of ambient spaces. The first part of the course focuses on Euclidean spaces, beginning with the classical Shannon-Stam entropy power inequality and the closely related Brunn-Minkowski inequality, and developing several of the generalizations, variants, and reversals of these inequalities. The second part of the course focuses on discrete abelian groups, where one sees close connections to additive combinatorics.

Organizers

Nathael Gozlan Cyril Roberto Paul-Marie Samson.

Sponsors

Institut Henri Poincaré (IHP) Laboratoire d'Analyse et de Mathématiques Appliquées (LAMA) Labex Bézout Labex MME-DII