Skip to main content

2.2 Inner products

Inner products allow for the introduction of intuitive geometrical concepts,such as the length of a vector and the angle or distance between two vectors. A major purpose of inner products is to determine whether vectors are orthogonal to each other.

Dot Product

It is a special type of inner product.The scalar product/dot product of two vectors in $\mathbb{R}^n$ is given by

$x^T y= \sum_{i=1}^n x_iy_i $

Example
from numpy import inf
from numpy import array
a = array([1, 2, 3])
b = array([2, 3, 4])
print(a)
print(b)
print("dot product")
print(a.dot(b))

O/P
[1 2 3]
[2 3 4] 
dot product 
20



General Inner products
Let $V$ be a vector space and  $\Omega : V \times V \to \mathbb{R}$ be a bilinear mapping that takes two vectors and maps them onto real number. Then

$\Omega$ is called symmetric if $\Omega(x,y)=\Omega(y,x)$ for all $x,y \in V$, i.e., the order of the arguments does not matter.
$\Omega$ is called positive definite if
$\forall x \in V / \{0\}$: $\Omega(x,x) > 0, \Omega(0,0)=0 $

Definition:Let $V$ be a vector space and  $\Omega : V \times V \to \mathbb{R}$ be a bilinear mapping that takes two vectors and maps them onto real number. Then

  • A positive definite, symmetric bilinear mapping $\Omega : V \times V \to \mathbb{R}$ is called an inner product on $V$.We typically write $<x,y>$ instead of  $\Omega(x,y)$
  • The pair $(V,<\cdot,\cdot>)$ is called an inner product space or (real) vector space with inner product.If we use the dot product defined as $x^Tx$, we call $(V,<\cdot,\cdot>)$ a Euclidean vector space
Inner Product that is not dot product

Consider $V=\mathbb{R}^2$. If we define
$<x,y>:=x_1y_1-(x_1y_2+x_2y_1)+2x_2y_2$
then $<\cdot,\cdot>$ is an inner product but different from the dot product.
$<x,y>:=x_1y_1-(x_1y_2+x_2y_1)+2x_2y_2$
$\qquad= y_1x_1 - (y_1x_2 + y_2x_1) + 2y_2x_2 = <y,x>$

Thus it is symmetric

It holds that
$<x,x> = x_1^2- (2x_1x_2) + 2x_2^2$
$= (x_1 - x_2)^2 + x_2^2$

This is a sum of positive terms for $x \ne 0$. Moreover, this expression shows that if $<x,x> = 0$ then $x_2 = 0$ and then $x_1 = 0$, i.e., $x = 0$. Hence, $<.,.>$ is positive definite.


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 and Matr
Post a Comment
Read more

4.3 Sum Rule, Product Rule, and Bayes’ Theorem

 We think of probability theory as an extension to logical reasoning Probabilistic modeling  provides a principled foundation for designing machine learning methods. Once we have defined probability distributions corresponding to the uncertainties of the data and our problem, it turns out that there are only two fundamental rules, the sum rule and the product rule. Let $p(x,y)$ is the joint distribution of the two random variables $x, y$. The distributions $p(x)$ and $p(y)$ are the corresponding marginal distributions, and $p(y |x)$ is the conditional distribution of $y$ given $x$. Sum Rule The addition rule states the probability of two events is the sum of the probability that either will happen minus the probability that both will happen. The addition rule is: $P(A∪B)=P(A)+P(B)−P(A∩B)$ Suppose $A$ and $B$ are disjoint, their intersection is empty. Then the probability of their intersection is zero. In symbols:  $P(A∩B)=0$  The addition law then simplifies to: $P(A∪B)=P(A)+P(B)$  wh
Post a Comment
Read more

5.1 Optimization using Gradient Descent

Since machine learning algorithms are implemented on a computer, the mathematical formulations are expressed as numerical optimization methods.Training a machine learning model often boils down to finding a good set of parameters. The notion of “good” is determined by the objective function or the probabilistic model. Given an objective function, finding the best value is done using optimization algorithms. There are two main branches of continuous optimization constrained and unconstrained. By convention, most objective functions in machine learning are intended to be minimized, that is, the best value is the minimum value. Intuitively finding the best value is like finding the valleys of the objective function, and the gradients point us uphill. The idea is to move downhill (opposite to the gradient) and hope to find the deepest point. For unconstrained optimization, this is the only concept we need,but there are several design choices. For constrained optimization, we need to intr
Post a Comment
Read more