LFD Book Forum  

Go Back   LFD Book Forum > Book Feedback - Learning From Data > Chapter 1 - The Learning Problem

Thread Tools Display Modes
Prev Previous Post   Next Post Next
Old 06-11-2019, 08:44 PM
jewelltaylor9430 jewelltaylor9430 is offline
Junior Member
Join Date: Jun 2019
Posts: 1
Unhappy Problem 1.3 Question Please Help

Question 1.3 A: Let p = min(1=<n=<N) y(n)(w*Yx(n)). Show that p > 0.

(For lack of any other notation I use brackets to represent subscripts, sorry)

Question 1.3 B: Show that wT(t)w* >= wT(t-1)w* + p, and conclude that wT(t)w* >= tp

My Questions:
- I understand p is defined in A but I am not familiar with the notation and I do not know what it represents. What is the min expression getting at? Is it the fact the value of p such that the value of n is minimized? Can you give me intuition behind what p actually is?

- How does the the RHS of the first inequality relate to the RHS of the second inequality in B? My understanding is t represents the iteration number of the perceptron algorithim. Is this the case or am I mistaken? Does tp somehow equal wT(t-1)w* + p and if so where the heck does it come from? I am so confused

Any help would be much appreciated, I have been stumped on this question for too long
Reply With Quote

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump

All times are GMT -7. The time now is 06:03 PM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.