-
Notifications
You must be signed in to change notification settings - Fork 333
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[hu] cs-229-supervised-learning #132
base: master
Are you sure you want to change the base?
Conversation
…eatsheet-supervised-learning.md
…pervised-learning.md
[hu] Supervised Learning
…pervised-learning.md
Thanks a lot for your work @balazs-vida, it looks great! I just restored some templates that got deleted from the Now, we can start the review process with other native speakers who can come in and comment on the translation. Please feel free to invite anyone you know who could do that! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Outside of one comment, the rest is perfect!
|
||
**76. Union bound ― Let A1,...,Ak be k events. We have:** | ||
|
||
⟶ σ-szubadditivitás (más néven Boole-egyenlőtlenség) ― Legyenek A1,...,Ak események. Ekkor: |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'd change sigma-subadditivity to (finite) subadditivity, since the number of events is finite.
@shervinea This is my attempt to create the pull request for the Supervised Learning cheatsheet. Looks like I managed to create a branch with only this cheatsheet in it (by deleting the other two sheets from this branch). Contentwise, no changes have been made to it.
Please let me know if this looks acceptable. Thanks!