Главная
Study mode:
on
1
Introduction
2
Summary
3
Resource Allocation
4
Toy Example
5
Linear Programming
6
Comparative Ratio
7
Impossible Result
8
Possible Result
9
Key Idea
10
Dynamic Learning
11
General Linear Programming
12
Competitive Ratio
13
YG
14
Convergence
15
Optimal Solution
16
Proof
17
Stochastic Process
18
Stop in Time
19
Theorems
20
Applications
21
Evaluation
22
Closed Loop Solution
23
Future
24
Closed Loop
25
Simulation
26
Results
27
Generic Framework
28
Large L Regime
Description:
Explore advanced concepts in online linear programming and learning through this comprehensive lecture from the 2019 ADSI Summer Workshop on Algorithmic Foundations of Learning and Control. Delve into resource allocation, comparative ratios, and dynamic learning as Stanford University's Yinyu Ye presents "Further Developments on Online Linear Programming and Learning." Examine key ideas, impossibility results, and convergence theories while gaining insights into stochastic processes, competitive ratios, and the YG algorithm. Discover practical applications, closed-loop solutions, and simulation results that demonstrate the power of these techniques. Engage with a generic framework and explore the large L regime to enhance your understanding of cutting-edge algorithmic approaches in learning and control systems.

2019 ADSI Summer Workshop- Algorithmic Foundations of Learning and Control, Yinyu Ye

Paul G. Allen School
Add to list
0:00 / 0:00