香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 10 Online learning. Expert problem

CMS57opomtr cine Week 10:Online Learning Instructor:Shengyu Zhang 1
Instructor: Shengyu Zhang 1

Location change for the final 2 classes Nov 17:YIA 404 (Yasumoto International Academic Park康本國祭學術園) ■Nov24:No class. Conference leave. Dec 1:YIA 508 (Yasumoto International Academic Park康本國祭學術園) 2
Location change for the final 2 classes ◼ Nov 17: YIA 404 (Yasumoto International Academic Park 康本國際學術園) ◼ Nov 24: No class. ❑ Conference leave. ◼ Dec 1: YIA 508 (Yasumoto International Academic Park 康本國際學術園) 2

Problem 1:Experts problem 3
Problem 1: Experts problem 3

Stock market StP 500 indixuekly 0边 -410购 000 00 050 Simplification:Only consider up or down. 4
Stock market ◼ Simplification: Only consider up or down. 4

Which expert to follow? Each day,stock market goes up or down. TRUSSKEY FINANCIAL ADVISORS Let'sTalk Investing N小d HERB WHITE TIAHOME.COM (936)588-0288 Each morning,n“experts'”predict the market.. How should we do?Whom to listen to?On combine their advice in some way? 5
Which expert to follow? ◼ Each day, stock market goes up or down. ◼ Each morning, 𝑛 “experts” predict the market. ◼ How should we do? Whom to listen to? Or combine their advice in some way? 5

Which expert to follow? Each day,stock market goes up or down. TRUSSKEY FINANCIAL ADVISORS Let's Talk Investing N小d HERB WHITE TIAHOME.COM (936)588-0288 At the end of the day,we'll see whether the market actually goes up or down. We lose 1 if our prediction was wrong. 6
Which expert to follow? ◼ Each day, stock market goes up or down. ◼ At the end of the day, we’ll see whether the market actually goes up or down. ◼ We lose 1 if our prediction was wrong. 6

After a year,we'll see with hindsight that one expert is the best. But,of course,we don't know who in advance. nWe''ll think“'If we had followed his advice.” Theorem:We have a method to perform close to the best expert! We don't assume anything about the experts. They may not know what they are talking about They may even collaborate in any bad manner
◼ After a year, we’ll see with hindsight that one expert is the best. ❑ But, of course, we don’t know who in advance. ◼ We’ll think “If we had followed his advice…” ◼ Theorem: We have a method to perform close to the best expert! ❑ We don’t assume anything about the experts. ◼ They may not know what they are talking about. ◼ They may even collaborate in any bad manner. 7

Method and intuition Algorithm:Randomized Weighted Majority Use random choice:following expert i with probability pi If an expert predicts wrongly:punish him by decreasing the probability of choosing him/her in next round. If someone gives you wrong info,then you tend to trust him less in future. 8
Method and intuition ◼ Algorithm: Randomized Weighted Majority ◼ Use random choice: following expert 𝑖 with probability 𝑝𝑖 ◼ If an expert predicts wrongly: punish him by decreasing the probability of choosing him/her in next round. ❑ If someone gives you wrong info, then you tend to trust him less in future. 8

Randomized Weighted Majority w:weight of experti at time :probability of choosing expertiat time for each i∈[n] w0=1,p=1/m for each t>1,i∈[n]: if expert i was wrong at step t-1 w0=w-(1-e) else Decrease your weight! w=w-0 op40=w0/∑w0 Probability is proportional to weight Choose i with prob.p and follow expert i's advice. 9
Randomized Weighted Majority ◼ for each 𝑖 ∈ [𝑛] 𝑤𝑖 (1) = 1, 𝑝𝑖 (1) = 1/𝑛 ◼ for each 𝑡 > 1, ∀𝑖 ∈ [𝑛]: ❑ if expert 𝑖 was wrong at step 𝑡 − 1 𝑤𝑖 (𝑡) = 𝑤𝑖 (𝑡−1) (1 − 𝜀) else 𝑤𝑖 (𝑡) = 𝑤𝑖 (𝑡−1) ❑ 𝑝𝑖 (𝑡) = 𝑤𝑖 𝑡 /σ𝑖 𝑤𝑖 (𝑡) ❑ Choose 𝑖 with prob. 𝑝𝑖 (𝑡) , and follow expert 𝑖’s advice. 𝑤𝑖 (𝑡) : weight of expert 𝑖 at time 𝑡 𝑝𝑖 (𝑡) : probability of choosing expert 𝑖 at time 𝑡 Decrease your weight! Probability is proportional to weight 9

Example (n=5,T=6,e=1/4) 1 2 3 4 5 our real 1 1,↑ 1,↑ 1,↓ 1,↑ 1,↓ ↑ 2 1,↑ 1, 0.75,↑ 1,↑ 0.75,↑ 个 3 1,↑ 0.75,↑ 0.75,↓ 1,↓ 0.75,↑ ↓ 4 0.75,↑ 0.5625,↑ 0.75,↓ 0.75,↓ 0.5625,↑ 5 0.5625,↓ 0.4219,↑ 0.75,↑ 0.75,↓ 0.4219,↓ 6 0.4219,↑ 0.4219,↑ 0.75,↓ 0.5625,↑ 0.3164,↑ ↓ loss 4 4 1 2 5 2 Numbers:weight Arrows:predications.Red:wrong. 10
Example (n=5, T=6, ε = 1/4) 1 2 3 4 5 our real 1 1, ↑ 1, ↑ 1, ↓ 1, ↑ 1, ↓ ↑ ↑ 2 1, ↑ 1, ↓ 0.75, ↑ 1, ↑ 0.75, ↑ ↑ ↑ 3 1, ↑ 0.75, ↑ 0.75, ↓ 1, ↓ 0.75, ↑ ↓ ↓ 4 0.75, ↑ 0.5625, ↑ 0.75, ↓ 0.75, ↓ 0.5625, ↑ ↑ ↓ 5 0.5625, ↓ 0.4219, ↑ 0.75, ↑ 0.75, ↓ 0.4219, ↓ ↓ ↑ 6 0.4219, ↑ 0.4219, ↑ 0.75, ↓ 0.5625, ↑ 0.3164, ↑ ↓ ↓ loss 4 4 1 2 5 2 ◼ Numbers: weight ◼ Arrows: predications. Red: wrong. 10
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 9 Online algorithm.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 8 Mechanism design.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 6 Algorithms for resource allocation.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 5 NP-Complete problems.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 4 Approximation algorithms.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 3 Algorithms for data streams.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 2 Linear program. Examples, Simplex algorithms, primal-dual, strong duality(and a physical interpretation), application to games.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 1 Review of basic concepts of algorithms and complexity, probability and tail bounds.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 8:Further Topics on Random Variables 1.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 9:Further Topics on Random Variables 2.pdf
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 11:Limit Theorems.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 9:Further Topics on Random Variables 2.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 11:Limit Theorems.pdf
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 8:Further Topics on Random Variables 1.pdf
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 10:Limit Theorems.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 10:Limit Theorems.pdf
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 7:General Random Variables 3.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 7:General Random Variables 3.pdf
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 6:General Random Variables 2.pptx
- 香港中文大学:《Probability and Statistics for Engineers》课程教学资源(辅导材料)Tutorial 6:General Random Variables 2.pdf
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 11 Influence maximization on social network.pptx
- 香港中文大学:《Topics in Theoretical Computer Science》课程教学资源(PPT课件讲稿)Lecture 12 Quantum computing. Quantum algorithms, BQP, quantum non-locality, quantum games.pptx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 1 Basics.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 2 Shor's algorithm.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 3 Hidden Subgroup Problems 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 4 Hidden Subgroup Problems 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 5 Searching algorithm and quantum adversary method.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 6 Quantum query complexity.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 7 Quantum communication complexity 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 8 Quantum communication complexity 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 9 Quantum information theory 1.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 10 Quantum information theory 2.docx
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 11 Quantum information theory 3.pdf
- 香港中文大学:《Quantum Computing》课程教学资源(课件讲稿)Lecture 12 Quantum information theory 4.pdf
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 1 Introduction to the course.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 2 Single Source Shortest Paths.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 3 Greedy Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 4 Randomized Algorithms.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 5 Dynamic Programming.pptx
- 香港中文大学:《Design and Analysis of Algorithms》课程教学资源(PPT课件讲稿)Week 10 NP-completeness.pptx