Professional Documents
Culture Documents
by ARNAB HALDER
Contents
• What is Machine Learning?
• Approaches for Machine Learning
• Several types of Machine Learning techniques
• Concepts of Neural Network
• Concepts of Neuron
• Universal Approximation Theorem
• Solving ODEs/PDEs using Neural Network
• Example: Viscous Burgers’ Equation
• Why we use Neural Network?
• References
What is Machine Learning?
Data Collection
Data Preprocessing
Model Training
Model Evaluation
Model Deployment
Several types of Machine Learning
techniques
Supervised
Learning
Unsupervised
Learning
Machine
Learning
Semi-
supervised
Learning
Reinforcement
Learning
Concepts of Neural Networks
𝑥1 • If the number of Hidden Layers > 1,
𝑦ො1
Then it is called Deep Network
___& hence the name Deep
𝑥2 𝑦ො2 ___Learning comes.
• The Input weight ‘n’ & the output
weight ‘k’ are not necessarily equal.
• Total weight required assuming
every neuron is connected to every
other neuron = (𝑛 × 𝑚 + Bias Units)
= (𝑛 × 𝑚 + 𝑚)
𝑚𝑡ℎ
𝑥𝑛 𝑦ො𝑘
𝑥3
Ԧ is vector
• Notable that, provided input into Linear combination section(𝑥)
but output ‘z’ is scaler.
Universal Approximation Theorem
NN
x 𝑢ො
(𝑎1 )
• 𝑎1 = 𝜎 𝜔1 𝑥 & 𝑢 = 𝜔2 𝜎 𝜔1 𝑥
ⅆ𝑢
• = 𝜔2 𝜎 ′ 𝜔, 𝑥 𝜔1 & this way all derivatives of ‘𝑢’ can be calculated by
ⅆ𝑥
backprop even with multiple layers of hidden neurons.
• Now, if 𝑢ො = NN(x), we can pose the problem as,
ቊ ⅆ2 𝑢
ෝ
ⅆ𝑥 2
+ 𝑎
ⅆෝ
𝑢
ⅆ𝑥
−𝑏
2
+ 𝑢ො 0 − 𝑢0 2
+ 𝑢ො 1 − 𝑢1 2 } =0
Cost Function
Loss Function
• As example (Viscous Burgers’ Equation) As an example, let us
consider the Burgers’ equation. This equation arises in various areas
of applied mathematics, including fluid mechanics, nonlinear
acoustics, gas dynamics, and traffic flow.
• Burgers’ equation can lead to shock formation that is notoriously hard
to resolve by classical numerical methods. In one space dimension,
the Burger’s equation along with Dirichlet boundary conditions reads
as:
0.01
• 𝑢𝑡 + 𝑢𝑢𝑥 − 𝑢𝑥𝑥 = 0, x ∈ [−1, 1], t ∈ [0, 1]
𝜋
• 𝑢(0, x) = −sin(πx),
• 𝑢(t, −1) = 𝑢(t, 1) = 0
0.01
• Let us define f(t, x) to be given by 𝑓: = 𝑢𝑡 + 𝑢𝑢𝑥 − 𝑢𝑥𝑥 .
𝜋