Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Mathematics of Machine Learning

You're reading from   Mathematics of Machine Learning Master linear algebra, calculus, and probability for machine learning

Arrow left icon
Product type Paperback
Published in May 2025
Publisher Packt
ISBN-13 9781837027873
Length 730 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Tivadar Danka Tivadar Danka
Author Profile Icon Tivadar Danka
Tivadar Danka
Arrow right icon
View More author details
Toc

Table of Contents (36) Chapters Close

Introduction Part 1: Linear Algebra FREE CHAPTER
1 Vectors and Vector Spaces 2 The Geometric Structure of Vector Spaces 3 Linear Algebra in Practice 4 Linear Transformations 5 Matrices and Equations 6 Eigenvalues and Eigenvectors 7 Matrix Factorizations 8 Matrices and Graphs References
Part 2: Calculus
9 Functions 10 Numbers, Sequences, and Series 11 Topology, Limits, and Continuity 12 Differentiation 13 Optimization 14 Integration References
Part 3: Multivariable Calculus
15 Multivariable Functions 16 Derivatives and Gradients 17 Optimization in Multiple Variables References
Part 4: Probability Theory
18 What is Probability? 19 Random Variables and Distributions 20 The Expected Value References
Part 5: Appendix
Other Books You May Enjoy
Index
Appendix A It’s Just Logic 1. Appendix B The Structure of Mathematics 2. Appendix C Basics of Set Theory 3. Appendix D Complex Numbers

13
Optimization

If someone gave you a function defined by some tractable formula, how would you find its minima and maxima? Take a moment and conjure up some ideas before moving on.

The first idea that comes to mind for most people is to evaluate the function for all possible values and simply find the optimum. This method immediately breaks down due to multiple reasons. We can only perform finite evaluations, so this would be impossible. Even if we cleverly define a discrete search grid and evaluate only there, this method takes an unreasonable amount of time.

Another idea is to use some kind of inequality to provide an ad hoc upper or lower bound, then see if this bound can be attained. Sadly, this is nearly impossible for more complicated functions, like losses for neural networks.

However, derivatives provide an extremely useful way to optimize functions. In this chapter, we will study the relationship between derivatives and optimal points, and algorithms on how to find them. Let...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Modal Close icon
Modal Close icon