event thumbnail image
Reinforcement Learning

Privacy-Preserving Reinforcement Learning

author: Jun Sakuma, Tokyo Institute of Technology

Description

Distributed reinforcement learning (DRL) has been studied as an approach to learn control policies thorough interactions between distributed agents and environments. The main emphasis of DRL has been put on the way to learn sub-optimal policies with the least or limited sharing of agents' perceptions. In this study, we introduce a new concept, privacy-preservation, into DRL. In our setting, agents' perceptions, such as states, rewards, and actions, are not only distributed but also are desired to be kept private. This can occur when agents' perceptions include private or confidential information. Conventional DRL algorithms could be applied to such problems, but do not theoretically guarantee privacy preservation. We design solutions that achieve optimal policies in standard reinforcement leering settings without requiring the agents to share their private information by means of well-known cryptographic primitive, secure function evaluation.

You might be experiencing some problems with Your Video player.
Slides
0:00 Privacy-preserving Reinforcement Learning
0:15 Motivating application: Load balancing (1)
1:30 Motivating application: Load balancing (2)
2:23 Definition of Privacy (1)
2:58 Definition of Privacy (2)
3:27 Are existing RLs privacy-preserving?
5:32 Privacy-preserving Reinforcement Learning
6:23 Building block: Homomorphic public-key cryptosystem
8:06 Building block: Random shares (1)
8:44 Building block: Random shares (2)
9:28 Building block: Private comparison
11:03 Privacy-preserving Reinforcement Learning
11:14 Step 1: Initialization of Q-vales (1)
11:40 Step 1: Initialization of Q-vales (2)
11:47 Step 1: Initialization of Q-vales (3)
11:58 Privacy-preserving Reinforcement Learning
12:07 Step 2-3: Private Action Selection (greedy) (1)
12:17 Step 2-3: Private Action Selection (greedy) (2)
12:34 Step 2-3: Private Action Selection (greedy) (3)
12:45 Step 2-3: Private Action Selection (greedy) (4)
12:50 Step 2-3: Private Action Selection (greedy) (5)
13:04 Privacy-preserving Reinforcement Learning
13:11 Step 3: Private Update of Q-values (1)
13:52 Step 3: Private Update of Q-values (2)
14:04 Step 3: Private Update of Q-values (3)
14:14 Step 3: Private Update of Q-values (4)
14:42 Step 3: Private Update of Q-values (5)
15:11 Step 3: Private Update of Q-values (6)
15:43 Step 3: Private Update of Q-values (7)
16:08 Privacy-preserving Reinforcement Learning
16:31 Experiment: Load balancing among factories (1)
18:57 Experiment: Load balancing among factories (2)
20:57 Summary
24:20 - Questions
24:49 - Questions
25:53 - Questions

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment: