Главная
Study mode:
on
1
Intro
2
DEEP LEARNING TODAY: EXPERIMENTAL REVOLUTION
3
CHALLENGES OF HIGH-DIMENSIONAL LEARNING
4
GEOMETRIC FUNCTION CLASSES
5
HARMONIC ANALYSIS ON THE SPHERE
6
INVARIANT KERNELS
7
OPTIMIZATION ASPECTS
8
OVERPARAMETRISATION
9
ALGORITHM-SPECIFIC HARDNESS
10
COMPUTATIONAL HARDNESS OF SHALLOW LEARNING
11
SHORTEST VECTOR PROBLEM
12
CONTINUOUS LEARNING WITH ERRORS
13
ALGORITHMIC UPPER BOUNDS
14
LLL AND RANDOM SUBSET PROBLEM
15
BEYOND GENERALISED LINEAR MODELS
16
CONCLUSIONS
Description:
Explore the intricacies of high-dimensional learning in this 57-minute seminar by Joan Bruna Estrach from New York University. Delve into the experimental revolution of deep learning and its challenges, examining geometric function classes and harmonic analysis on the sphere. Investigate invariant kernels, optimization aspects, and overparametrisation while considering algorithm-specific hardness. Analyze the computational hardness of shallow learning, the shortest vector problem, and continuous learning with errors. Discover algorithmic upper bounds, the LLL algorithm, and random subset problems. Expand your understanding beyond generalized linear models in this comprehensive exploration of data structure's role in high-dimensional machine learning.

On the Role of Data Structure in High-Dimensional Learning

Fields Institute
Add to list