Skip to main content

3.1 Differentiation of Univariate Functions

Many algorithms in machine learning optimize an objective function with respect to a set of desired model parameters that control how well a model explains the data: Finding good parameters can be phrased as an optimization problem. Examples include: linear regression , where we look at curve-fitting problems and optimize linear weight parameters to maximize the likelihood.

A function $f$ is a quantity that relates two quantities to each other. These quantities are typically inputs  $x \in \mathbb{R}^D$ and targets (function values) $f(x)$,which we assume are real-valued if not stated otherwise. Here $\mathbb{R}^D$  is the domain of $f$, and the function values $f(x)$ are the image/codomain of $f$.We often write
$f: \mathbb{R}^D \mapsto \mathbb{R}$
$x \mapsto f(x) $

to specify a function.
Example:
The dot product  $f(x)=x^T.x , x \in \mathbb{R}^2$ would be specified as
$f : \mathbb{R}^2 \mapsto \mathbb{R}$
$ x \mapsto x_1^2+x_2^2$

Vector calculus is one of the  fundamental mathematical tools we need in machine learning.We assume that the functions are differentiable.We will compute the gradients of functions to facilitate learning in machine learning models, since the gradient points in the direction of steepest ascent.

Differentiation of Univariate Functions
The difference quotient of a univariate function $y=f(x),x,y \in \mathbb{R}$ is

$\frac{\partial y}{\partial x}=\frac{f(x+\delta x)-f(x)}{\delta x}$

Computes the slope of the secant line through two points on the graph of $f$.In the figure these are the points with x-coordinates $x_0$ and $x_0+\delta x$.



The difference quotient can also be considered the average slope of $f$  between $x$ and $x + \delta x$.In the limit $\delta x \to 0$, we obtain the tangent of $f$ at $x$, if $f$ is differentiable.The tangent is then the derivative of $f$ at $x$.

The derivative of  $f$ at $x$ is defined as the limit, for $h >0$

$\frac{\mathrm{d}f }{\mathrm{d} x}=\lim_{h\to 0} \frac{f(x+h)-f(x))}{h}$

and the secant in figure become tangent.

The derivative of $f$ points in the direction of the steepest ascent of $f$.

Example: Derivative of a polynomial $f(x)=x^n$
$\frac{\mathrm{d}f }{\mathrm{d} x}=\lim_{h \to 0} \frac{f(x+h)-f(x)}{h}$
$\quad=\lim_{h \to 0} \frac{(x+h)^n-x^n}{h}$
$\quad=\lim_{h \to 0} \frac{\sum_{i=0}^{n} \binom{n}{i}x^{n-i}h^i-x^n}{h}$

When $i=0$ $,\binom{n}{i}x^{n-i}h^i=x^n$.By starting the sum at 1, the $x^n$-term cancels and we obtain

$\frac{\mathrm{d}f }{\mathrm{d} x}=\lim_{h \to 0} \frac{\sum_{i=1}^{n} \binom{n}{i}x^{n-i}h^i}{h}$
$\quad=\lim_{h \to 0}\sum_{i=1}^{n} \binom{n}{i}x^{n-i}h^{i-1}$
$\quad=\lim_{h \to 0}\binom{n}{1}x^{n-1}+ \sum_{i=2}^{n} \binom{n}{i}x^{n-i}h^{i-1}$
The second term will $\to 0$ as $h \to 0$
$\quad=\frac{n!}{1!(n-1)!}x^{n-1}=nx^{n-1}$


Differentiation Rules
Product Rule: $(f(x)g(x))'=f '(x)g(x)+f(x) g'(x)$
Quotient Rule:$ \left(\frac{f(x)}{g(x)}\right)'=\frac{f '(x)g(x)-f(x)g'(x)}{g(x)^2}$
Sum Rule:$(f(x)+g(x))'= f ' (x) + g'(x)$
Chain Rule:$(g(f(x))'=g'(f(x))f ' (x)$

Chain rule is widely used in machine learning especially in neural network
Eg: lets compute the derivative of the function $h(x)=(2x+1)^4$, using the chain rule with
$h(x)=(2x+1)^4=g(f(x))$
$f(x)=2x+1$
$g(f)=f^4$
$f '(x)=2$
$g'(f)=4f^3=4(2x+1)^3$
So
$h'(x)=4(2x+1)^3. 2= 8(2x+1)^3$




Example Problems
1.Compute the derivative $f '(x)$ for $f(x) = log(x^4) sin(x^3) $

$f '(x)=\frac{1}{x^4}.4x^3.sin(x^3)+log(x^4).cos(x^3).3x^2$
$f '(x)=\frac{4}{x}.sin(x^3)+3x^2.log(x^4).cos(x^3)$

2.Compute the derivative $f '(x)$ of the logistic sigmoid  $f(x) =\frac{1}{1+exp(-x)}$

$f '(x) =\frac{1+exp(-x).0-1.-1.exp(-x)}{(1+exp(-x))^2}$
$f '(x)=\frac{exp(-x)}{(1+exp(-x))^2}$

3.Compute the derivative $f '(x)$ of the function $f(x) = exp(-\frac{1}{2\sigma^2}(x-\mu)^2)$
where $\mu,\sigma \in \mathbb{R}$ are constants.

$f '(x)=f(x).-\frac{1}{2\sigma^2}2.(x-\mu)$
$f '(x)=f(x).-\frac{1}{\sigma^2}.(x-\mu)$

Learn More.....Examples














Comments

Post a Comment

Popular posts from this blog

Mathematics for Machine Learning- CST 284 - KTU Minor Notes - Dr Binu V P

  Introduction About Me Syllabus Course Outcomes and Model Question Paper University Question Papers and Evaluation Scheme -Mathematics for Machine learning CST 284 KTU Overview of Machine Learning What is Machine Learning (video) Learn the Seven Steps in Machine Learning (video) Linear Algebra in Machine Learning Module I- Linear Algebra 1.Geometry of Linear Equations (video-Gilbert Strang) 2.Elimination with Matrices (video-Gilbert Strang) 3.Solving System of equations using Gauss Elimination Method 4.Row Echelon form and Reduced Row Echelon Form -Python Code 5.Solving system of equations Python code 6. Practice problems Gauss Elimination ( contact) 7.Finding Inverse using Gauss Jordan Elimination  (video) 8.Finding Inverse using Gauss Jordan Elimination-Python code Vectors in Machine Learning- Basics 9.Vector spaces and sub spaces 10.Linear Independence 11.Linear Independence, Basis and Dimension (video) 12.Generating set basis and span 13.Rank of a Matrix 14.Linear Mapping...
Post a Comment
Read more

Vectors in Machine Learning

As data scientists we work with data in various formats such as text images and numerical values We often use vectors to represent data in a structured and efficient manner especially in machine learning applications In this blog post we will explore what vectors are in terms of machine learning their significance and how they are used What is a Vector? In mathematics, a vector is a mathematical object that has both magnitude and direction. In machine learning, a vector is a mathematical representation of a set of numerical values. Vectors are usually represented as arrays or lists of numbers, and each number in the list represents a specific feature or attribute of the data. For example, suppose we have a dataset of houses, and we want to predict their prices based on their features such as the number of bedrooms, the size of the house, and the location. We can represent each house as a vector, where each element of the vector represents a specific feature of the house, such as the nu...
Post a Comment
Read more

2.14 Singular Value Decomposition

The Singular Value Decomposition ( SVD) of a matrix is a central matrix decomposition method in linear algebra.It can be applied to all matrices,not only to square matrices and it always exists.It has been referred to as the 'fundamental theorem of linear algebra'( strang 1993). SVD Theorem: Let $A^{m \times n}$ be a rectangular matrix of rank $r \in [0,min(m,n)]$. The SVD of A is a decomposition of the form. $A= U \Sigma V^T $ with an orthogonal matrix $U \in \mathbb{R}^{m \times m}$ with column vectors $u_i, i=1,\ldots,m$ and an orthogonal matrix $V \in \mathbb{R}^{n \times n}$ with column vectors $v_j, j=1,\ldots,n$.Moreover, $\Sigma$ is an $m \times n$ matrix with $\sum_{ii} = \sigma \ge 0$ and $\sigma_{ij}=0, i \ne j$. The diagonal entries $\Sigma_i=1,\ldots,r$ of $\sigma$ are called singular values . $u_i$ are called left singular vectors , and $v_j$ are called right singular vectors .By convention singular values are ordered ie; $\sigma_1 \ge \sigma_2 \ldots \sigma_r \...
Post a Comment
Read more