What Is Machine Learning?
A procedure learns when it turns a finite sample into a map and that map is scored on inputs it did not use. The object is the pair of a hypothesis class and an estimation rule, together with a claim about unseen data.
A procedure learns when it turns a finite sample into a map and that map is scored on inputs it did not use. The object is the pair of a hypothesis class and an estimation rule, together with a claim about unseen data.
References and further study
Optional further reading only — Wikipedia, OpenStax, author sites, and MIT OCW course pages. Prefer open encyclopedia / CC BY texts first. These links are not MIT endorsement, and MatheLinux lessons are not hosted copies of OCW.
Copyright rule: MatheLinux stores only the citation. It does not copy or host external books, papers, videos, or datasets. MIT OCW is CC BY-NC-SA (non-commercial); open it on ocw.mit.edu. Publisher books require a legal copy. Quote sparingly and cite.
Submit work
Before you continue
Lesson close · Foundations of Machine Learning
Use this checkpoint to recall the lesson before marking it complete. The concepts below come from this lesson's authored sections.
Stuck? Send a blocker
One sentence on what stopped you (definition, derivation, lab control, time). This feeds Module-1 product metrics — not a public comment thread.
Progress
Sequence
Continue to Learning Paradigms, the next prerequisite step in this course.
Assume the pairs are i.i.d. draws from an unknown law on , and fix a loss . Risk is
Success means is small. A rule-based system is the case where a person writes and ignores .
The usual chain has five steps, and later model families only change step 1 or 3.
Expert systems fixed by hand, so step 3 was empty. Early neural nets used the same empirical-risk step on small . Kernels and ensembles enlarged while keeping a convex or tree-growing optimizer. Large samples and hardware made deep compositions the default flexible class for images, text, and some sequences. On tabular features with moderate , a line or a tree often wins because a smaller keeps from exploding. Depth does not replace the risk or the holdout.
A cross-sectional factor model is a supervised map from characteristics to a return. The definition requires a later window, or a purged holdout, before anyone calls the fit an edge.
Interactive · ML eras slider
focus: scale
Optional further reading (open references — MatheLinux does not host third-party course files):
Submit work
Optional human feedback—not required to mark the lesson complete. Pick a brief, submit it, or continue without submitting.
Human-graded work is a Pro course feature
The free lesson, quiz, and problem checks remain available. Pro members can choose a brief below, submit work, and receive a score and written feedback.
Previous submissions
No submitted work for this lesson yet.