Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 819
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
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
Cours magistraux

le (49m24s)

Bubeck 8/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 (57m3s)

Bubeck 9/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 (58m34s)

Tropp 1/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 introduction to matrix concentration inequalities, which are a powerful tool for analyzing structured random matrices. We use these ideas to study matrix approximations constructed via randomized sampling, such as the random features method. As a more sophisticated application, we present a complete treatment of a recent algorithm for solving graph Laplacian linear systems in near-linear time. Some references : 1. Tropp, "An introduction to ...
Voir la vidéo
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 introduction to matrix concentration inequalities, which are a powerful tool for analyzing structured random matrices. We use these ideas to study matrix approximations constructed via randomized sampling, such as the random features method. As a more sophisticated application, we present a complete treatment of a recent algorithm for solving graph Laplacian linear systems in near-linear time. Some references : 1. Tropp, "An introduction to ...
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 introduction to matrix concentration inequalities, which are a powerful tool for analyzing structured random matrices. We use these ideas to study matrix approximations constructed via randomized sampling, such as the random features method. As a more sophisticated application, we present a complete treatment of a recent algorithm for solving graph Laplacian linear systems in near-linear time. Some references : 1. Tropp, "An introduction to ...
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 introduction to matrix concentration inequalities, which are a powerful tool for analyzing structured random matrices. We use these ideas to study matrix approximations constructed via randomized sampling, such as the random features method. As a more sophisticated application, we present a complete treatment of a recent algorithm for solving graph Laplacian linear systems in near-linear time. Some references : 1. Tropp, "An introduction to ...
Voir la vidéo

 
FMSH
 
Facebook Twitter
Mon Compte