Probabilités et statistiques

Cours

Tropp 8/9 - Random matrix theory and computational linear algebra
Cours
01:24:40
Tropp 8/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

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

Tropp 9/9 - Random matrix theory and computational linear algebra
Cours
00:40:59
Tropp 9/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

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

Tropp 6/9 - Random matrix theory and computational linear algebra
Cours
00:56:11
Tropp 6/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

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

Bubeck 8/9 - Some geometric aspects of randomized online decision making
Cours
00:49:23
Bubeck 8/9 - Some geometric aspects of randomized online decision making
Bubeck
Sébastien

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

Bubeck 9/9 - Some geometric aspects of randomized online decision making
Cours
00:57:02
Bubeck 9/9 - Some geometric aspects of randomized online decision making
Bubeck
Sébastien

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

Cours
Tropp 7/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

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

Tropp 5/9 - Random matrix theory and computational linear algebra
Cours
01:01:43
Tropp 5/9 - Random matrix theory and computational linear algebra
Tropp
Joel Aaron

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

Voir plus

Conférence

Zdeborová - Loss landscape and behaviour of algorithms in the spiked matrix-tensor model
Conférence
00:49:52
Zdeborová - Loss landscape and behaviour of algorithms in the spiked matrix-tensor model
Zdeborová
Lenka

A key question of current interest is: How are properties of optimization and sampling algorithms influenced by the properties of the loss function in noisy high-dimensional non-convex settings?

De Castro - Spectral convergence of random graphs and a focus on random geometric graphs
Conférence
00:43:44
De Castro - Spectral convergence of random graphs and a focus on random geometric graphs
Castro
Yohann de

In this talk, we present a non-asymptotic bound on the L2 distance between the spectrum of the probability matrix of a random graph and the spectrum of the integral operator. Then, we study the random

A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:43:38
A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléa…
Last
Günter

Stable matchings were introduced in a seminal paper by Gale and Shapley (1962) and play an important role in economics. Following closely Holroyd, Pemantle, Peres and Schramm (2009), we shall

On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
Conférence
00:51:42
On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et …

In this talk we will define notions of dimension for unimodular random graphs and point-stationary point processes. These notions are in spirit similar to the Minkowski dimension and the

Voir plus

Documentaire

KEZAKO : Pourquoi la tartine tombe toujours du coté beurré ?
Documentaire
00:04:00
KEZAKO : Pourquoi la tartine tombe toujours du coté beurré ?
Beaugeois
Maxime
Hennequin
Daniel

Kezako, la série documentaire qui répond à vos questions de science, aborde cette fois-ci la question "Pourquoi la tartine tombe toujours du coté beurré ?".  N'hesitez pas à réagir ou à oser

KEZAKO : Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?
Documentaire
00:03:39
KEZAKO : Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?
Beaugeois
Maxime
Hennequin
Daniel

Kezako, la série documentaire qui répond à vos questions de sciences traite de la question : "Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?". N'hesitez pas à réagir et à poser

Vidéo pédagogique

Voir plus