Главная
Study mode:
on
1
Intro
2
Reinforcement Learning
3
GOOGLE TEACHES AI TO PLAY THE GAME OF CHIP DESIGN
4
Black box Optimization
5
Properties of Black box functions
6
Latent Space Monte-Carlo Tree Search (LaMCTS)
7
Simple Usage
8
Another example
9
Motivating Examples
10
The Meaning of Learning Action Space
11
How to learn the action space?
12
Different Partition → Different Value Distribution
13
Learn action space
14
Approach
15
Sample in a Leaf
16
Performance
17
Optimizing linear policy for Mujoco tasks
18
Limitations
19
Multi-Objective Optimization
Description:
Explore cutting-edge approaches to solving high-dimensional optimization problems in this 43-minute conference talk. Delve into recent advancements that combine deep neural networks with reinforcement learning and search methods to outperform traditional human-driven solutions. Discover how these innovative techniques are applied to various domains, including online job scheduling, neural architecture search, and black-box optimization. Learn about the Latent Space Monte-Carlo Tree Search (LaMCTS) algorithm, its simple usage, and performance in optimizing linear policies for Mujoco tasks. Gain insights into the challenges of learning action spaces, multi-objective optimization, and the limitations of current approaches. This talk provides a comprehensive overview of state-of-the-art methods for tackling complex optimization problems in design, operations research, and scientific exploration.

Learning to Optimize High Dimensional Optimization Problems

Open Data Science
Add to list
0:00 / 0:00