# Résultats de recherche

Nombre de programmes trouvés : **558**

Cours magistraux

le
(59m6s)

## Tropp 2/9 - Random matrix theory and computational linear algebra

...This course treats some contemporary *algorithms* from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few *algorithms* that are both simple and practically useful. We begin with an...
Voir la vidéo
Cours magistraux

le
(1h18s)

## Bubeck 3/9 - Some geometric aspects of randomized online decision making

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online ...
Voir la vidéo
Cours magistraux

le
(55m13s)

## Bubeck 4/9 - Some geometric aspects of randomized online decision making

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online ...
Voir la vidéo
Conférences

le
(41m33s)

## Massoulié - Planting trees in graphs, and finding them back

In this talk we consider detection and reconstruction of planted structures in Erdős-Rényi random graphs. For planted line graphs, we establish the following phase diagram. In a low density region where the average degree λ of the initial graph is below some critical value λc, detection and reconstruction go from impossible to easy as the line length K crosses some critical value f(λ)ln(n), where n is the number of nodes in the graph. In the high density region λ>λc, detection goes from impossible to easy as K goes from o(\sqrt{n}) to ω(\sqrt{n}), and reconstruction remains impossible so long as K=o(n). We show similar properties for planted D-ary trees. These results are in contrast with the ...
Voir la vidéo
Conférences

le
(42m3s)

## Verzelen - Clustering with the relaxed K-means

This talk is devoted to clustering problems. It amounts to partitionning a set of given points or the nodes of a given graph, in such a way that the groups are as homogeneous as possible. After introducing two random instances of this problem, namely sub-Gaussian Mixture Model (sGMM) and Stochastic Block Model (SBM), I will explain how convex relaxations of the classical $K$-means criterion achieve near optimal performances. Emphasis will be put on the connections between the clustering bounds and relevant results in random matrix theory.
Voir la vidéo
Cours magistraux

le
(57m49s)

## Tropp 3/9 - Random matrix theory and computational linear algebra

...This course treats some contemporary *algorithms* from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few *algorithms* that are both simple and practically useful. We begin with an...
Voir la vidéo
Cours magistraux

le
(1h21s)

## Tropp 4/9 - Random matrix theory and computational linear algebra

...This course treats some contemporary *algorithms* from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few *algorithms* that are both simple and practically useful. We begin with an...
Voir la vidéo
Cours magistraux

le
(1h3m4s)

## Bubeck 5/9 - Some geometric aspects of randomized online decision making

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online computing ...
Voir la vidéo
Cours magistraux

le
(48m4s)

## Bubeck 6/9 - Some geometric aspects of randomized online decision making

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online computing ...
Voir la vidéo
Cours magistraux

le
(56m22s)

## Bubeck 7/9 - Some geometric aspects of randomized online decision making

This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence in the mid-2000's due to many applications in the internet economy. This course focuses on a set of challenging conjectures around these models from the 1980's and 1990's. We present a unified approach based on a combination of convex optimization techniques together with powerful probabilistic tools, which will allow us to derive state of the art results in online learning, bandit optimization, as well as some classical online computing ...
Voir la vidéo