Dec 3, 2023
Want to learn Machine Learning (ML), Deep Learning (DL), 5G, 6G, and PYTHON?
Check out our schools below!
https://www.iitk.ac.in/mwn/MLDL/index.html
https://www.iitk.ac.in/mwn/IITK6G/index.html
IIT Kanpur Intensive Training School (ITS) on PYTHON for Machine Learning, Neural Networks and Deep Learning
2nd to 22nd December 2023
https://www.iitk.ac.in/mwn/MLDL/index.html
Welcome to the IIT Kanpur Intensive Training School (ITS) on PYTHON for Machine Learning, Neural Networks and Deep Learning. This school, spanning over 3 weeks, is an intensive program for scholars, students, faculty members, industry professionals and R&D staff aspiring to get an in-depth exposure and learn hands-on implementation of the cutting edge algorithms and software for Machine Learning (ML), Neural Networks (NN) and Deep Learning (DL) toward projects, research and placements to further their career. The school will include extensive assisted PYTHON programming sessions, and numerous important packages such as NUMPY, LINALG, MATPLOTLIB, SCIKIT-LEARN, TENSORFLOW, KERAS. The school also includes problem solving sessions to prepare for tests/ job interviews in ML and DL. For an extensive list of lecture modules and hands-on programming projects, please check the PROGRAM
IIT Kanpur PYTHON + MATLAB Training School on 5G/ 6G Wireless Technologies
2nd to 22nd March 2024
https://www.iitk.ac.in/mwn/IITK6G/index.html
Welcome to the PYTHON + MATLAB Training School on 5G/ 6G Wireless Technologies: MIMO, massive MIMO, mmWave MIMO, NOMA, OTFS and IRS. This is a unique cutting edge project based training school that will feature exhaustive lecture modules and several PYTHON/ MATLAB projects/ case-studies on the latest MIMO, Massive MIMO, mmWave MIMO, NOMA technologies for 5G. Also, with 5G systems being rapidly deployed around the globe, there is accelerated development of Beyond 5G (B5G) and 6G wireless technologies that break the barriers of 5G. OTFS is a cutting-edge 2D modulation technique that operates in the Delay-Doppler domain, while Intelligent reflecting surface (IRS) is another novel technology that enables dynamically altering the radio propagation environment to achieve a phenomenal boost in the capacities. Together, these dual technologies are expected to power the shift to 6G. This training school will feature exhaustive tutorial style lecture modules and several intensive supervised PYTHON/ MATLAB/ OCTAVE programming modules so that participants are able to gain practical hands-on experience of working on state-of-the-art 5G/ 6G projects
All modules will be held on evenings and weekends for the convenience of participants. The extensive projects and PYTHON programming for MACHINE LEARNING (ML), NEURAL NETWORKS (NN), DEEP LEARNING (DL), 5G and 6G are of significant value to participants of all backgrounds.
How do these programs benefit YOU?
UG/ PG students: Learn the latest programming techniques in PYTHON and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKIT-LEARN, SEABORN, TENSORFLOW, KERAS together with practical ML/ NN / DL/ 5G/ 6G knowledge for projects/ thesis and also to gain an unbeatable edge in placements!
PhD Scholars/ Faculty members: Use PYTHON, and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKIT-LEARN, SEABORN, TENSORFLOW, KERAS for research and also to establish virtual labs or for project guidance in ML/ NN / DL/ 5G/ 6G Technologies with real world datasets!
Industry Professionals: Take your skills to the next level by learning PYTHON, and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKITLEARN, SEABORN, TENSORFLOW, KERAS, together with principles of Module Design and Analysis using Practical Data Sets for ML/ NN / DL/ 5G/ 6G Technologies!
Learn the latest ML/ NN/ DL/ 5G/ 6G Algorithms, PYTHON Programming & Libraries from experts at IIT Kanpur
PYTHON, Machine Learning, Neural Networks, Deep Learning, 5G and 6G are the top skills for placements in leading global MNCs such as Google, Amazon, facebook, Microsoft, Qualcomm, Broadcom, Samsung, Mediatek and many others!
Our industry participants have come from top global MNCs, Indian R&D Labs below and many more!
Our academic participants have come from IITs, NITs, top national and international educational institutions and more!
Contact Us:
e-mail: [email protected]
Join/ follow us on our social media sites
https://www.facebook.com/people/MWN-Lab-IIT-Kanpur/100063786175713/
https://twitter.com/LabMwn
https://www.linkedin.com/in/mwn-lab-7236231ba/?originalSubdomain=in
[Music]
[Music]
hello welcome to another module in this
massive open online course so we are
looking at applications of convexity
convexity of a function of a vector and
we are looking at a practical
application for a MIMO communication
system or a MIMO wireless system so let
us continue our discussion so we are
looking at application of convexity in
my Moore wireless system and what we
have said is the following thing I have
this model y bar equals H times X bar
plus n bar this is my R cross one
received vector this is the R cross T
channel matrix this is the T cross one
transmit vector and this is an or cross
one noise vector and the problem is
given Y bar we have to recover X bar
correct
at the receiver all right one has to
estimate recover or basically you can
also say estimate estimate x-bar which
is basically your transmit vector given
the receive vector estimate the transmit
vector now let us go back for a minute
look at a simple sinner units ignore the
noise for a little bit now what you can
see is if you ignore the noise this
reduces to Y bar equals H X bar and this
is basically you can see this is a
system of linear equations okay this is
a system or linear system of equations
this is a linear system of linear
equations and number of equations is
basically you can see R equals number of
equations correct and the number of
unknowns is basically the elements of
this X bar which are the transmitted
symbols so T equals the number of
unknowns now let us consider a simple
scenario start by considering a simple
scenario with R equals T okay now if R
equals P what happens number of
equations equals number of unknowns
therefore the matrix H correct that is a
square matrix okay and if H is
invertible then I can simply find the
receive vector by doing H inverse Y X
bar equals H inverse one remember this
is an approximation okay X bar equals H
inverse Y approximation in the sense
that we are assuming we are neglecting
the impact or the influence of noise
okay so if R equals T we have y bar
equals H X bar Y bar equals HX bar so
this is T cross T matrix if R equals T
okay because R equals T R is R cross T
if R equals T is T cross T implies it's
a square matrix
okay so implies this is a square matrix
if invertible remember inverse is not
guaranteed to exist if invertible then I
can find X hat that is estimate of
vector X as H inverse into y bar excite
equals H inverse y bar this is the
estimate of the transmit vector X
estimate of the transmit vector X now on
the other hand if R is strictly greater
than T consider another scenario R is
strictly greater than now what happens
if R is strictly greater than T the
number of equations is much greater than
the number of unknowns it means that the
system is over determined so this
implies number of equations is greater
than the number of unknowns implies it
is an overeater main system
now for an over determined system
typically you cannot solve the system of
equations y bar equals HX bar you cannot
solve it typically okay which means you
can only solve it approximately right
you cannot find an X bar such that y bar
equals HX bar which means you have to
find the best vector x bar such that the
error approximation error y bar minus HX
bar is minimized okay now what this
means is since you cannot solve y bar
equal to HX bar you can find the error
vector so e bar by e bar we denote the
error vector okay over determined so you
cannot find the vector such that y bar
equals HX bar so cannot find
or cannot find X bar such that y bar
equals HX bar implies find X bar such
that the error is minimized the error is
minimized plus now what is the error
error is we have the error vector e bar
error is the norm okay norm y bar or
norm y bar square okay you can think of
this as the energy of the error vector
the total energy of the error that is
minimized which basically implies that
we want to minimize norm of Y bar minus
H X bar square so we want to find X bar
so find X bar such that Y bar minus HX
bar square the error is mean so we want
to find the best vector X bar
that minimizes the error that is norm of
y bar minus X bar square this is known
as the least squares
the least squares problem or simply the
LS the least squares that is you want to
find the x-bar which gives you the least
square error or in this case the square
norm of they're simply known as the
squared error so we want to minimize
going to find the vector X bar the
estimate which minimizes which uses the
least square error so that is known as
the least squares estimate and there is
a very important problem that arises
frequently in both communications as
well as signal processing okay now we
want to simplify this let us start by
simplifying this cost function norm of y
minus H X bar square remember we said
this is norm of error vector square norm
of error vector square is y bar
transpose E bar vector transpose itself
that is the norm square of the vector
which we can now write as Y bar minus H
X bar transpose into y bar minus H X bar
which is equal to Y bar transpose minus
X bar transpose X transpose into y bar
minus HX bar which is equal to now
multiply this out Y bar transpose Y bar
minus X bar transpose H transpose Y bar
y bar transpose H X bar these two terms
are the transpose of each other remember
quantity real number which is transpose
of itself is equal to itself so these
two quantities you can see they're real
numbers simply scalar quantities and
their transpose of each other and
therefore they're equal so I am going to
simply write this as twice X bar
transpose H transpose Y bar plus X bar
transpose H transpose H into X bar ok
now this is what we get ok so this is
the cost function
also known as the cost least-squares
cost function you can also think of this
as the least-squares cost function now
let us denote this least-squares cost
function by f of x bar remember this is
our function of the vector X bar okay so
this least squares cost function is a
function of the vector X bar okay now
here before we consider the now we have
to consider remember the Hessian to
demonstrate this convex so first let's
look at the gradient the properties of
the gradient and then we look at the
Hessian okay so let us consider a simple
function C bar transpose X bar if you
look at the gradient of this the
gradient of C bar transpose X bar now
remember C bar transpose X bar you can
write this as the vector c1 c2 CT row
vector c1 c2 CT x column vector X 1 X 2
up to XT which is equal to C 1 X 1 plus
C 2 X 2 plus so on up to CT XT and now
the gradient of the C bar transpose X
bar you can see derivative with respect
to X 1 is C 1 with respect to X 2 is C 2
with respect to X T C T so this is
simply C bar similarly now the gradient
now remember C bar transpose X bar is
equal to X bar transpose C bar therefore
gradient of C bar transpose X bar is
gradient of X bar transpose C bar
equal to C bar okay so this is what we
have over here okay now what about the
Hessian now if you look at the Hessian
there for second order derivative of X
bar transpose C bar or C bar transpose X
bar that will be the gradient of the
grade that is the gradient of C bar
which is Percy bar is a constant so
gradient so if you look at this Hessian
of X bar transpose C bar X bar transpose
any constant vector C bar and that is
going to because never this is linear in
X bar all right so if you differentiate
it twice it's going to be zero so the
gradient of the term X bar transpose
Hessian of the term X bar transpose C
bar is zero on the other hand if you
look at this now look at this term term
of the form that is X bar transpose P X
bar with P equal to P transpose
okay so P is symmetric
you can show that the gradient of this
first we start with a gradient gradient
of this is X bar transpose px bar this
is you can show this is twice P times X
bar now you take the gradient the
Hessian of X bar transpose px bar you
can also write this as the row vector of
the gradient of that is you are taking
the gradient and so the Hessian first
you differentiate by the row they
differentiate by the column and then you
differentiate by the row right so
transpose gradient transpose gradient of
twice of X bar transpose P X bar which
you can write as the gradient transpose
or now we have seen already the gradient
of X bar transpose px bar that is twice
PX bar now this is of the form well this
is of the form twice C bar transpose X
bar so you can see this will be you can
check that this Hessian will be twice of
P so the gradient of X bar transpose PX
bar will be twice into the matrix B this
is your quadratic term okay
this is a quadratic term okay now we go
back to our original least squares cost
function that is f of X bar and then we
compute its Hessian okay so now if you
go back to the least squares cost
function you will see that the cost
function is norm of Y bar minus HX bar
square which is y bar transpose Y bar
minus twice X bar transpose H transpose
y plus X bar transpose H transpose H
into X bar now if you first let us take
the gradient of this thing
now observe that the gradient of Y bar
transpose Y bar this is a constant y bar
transpose Y bar given vector Y bar so
this is zero minus twice gradient of X
bar transpose Y or vector C bar H
transpose so this gradient is simply
going to be remember this is your C bar
so this is simply going to be C bar plus
gradient of X bar transpose H transpose
H into X bar now remember this is your
matrix P which you can see is symmetric
so this gradient will be simply twice P
X bar or twice H transpose H at X bar so
that's it so now you have minus two
times C bar which is H transpose Y bar
plus twice P which is H transpose H into
X bar this is the gradient and the
Hessian will now be if you differentiate
this again of course this is a constant
term gradient of this is zero and
corresponding to this what we have we
have already seen twice P into X bar
Hessian that is you take the gradient of
that that will be twice P so this will
be twice H transpose H so the Hessian of
this reduces to
twice H transpose H
this is twice H transpose and now you
can see if you call this matrix as P
first you can see P equals P transpose
because H transpose H transpose a B
transpose is B transpose a transpose so
this is H transpose into H transpose
transpose what H transpose transpose is
itself so first this is a symmetric
matrix and further if you look at X bar
transpose H transpose H into X bar well
what is this this will be equal to H X
bar transpose times HX bar which is
equal to norm of vector transpose itself
that is norm H X bar square which is
greater than equal to zero which means X
bar transpose px bar X bar transpose H
transpose HX bar is always greater than
equal to 0 for any vector X bar which
means that this matrix P H transpose H
is always positive semi-definite which
implies twice H transpose H because you
are multiplying it by a positive
constant is also going to be positive
semi-definite therefore the Hessian is
positive semi-definite which implies
that the least squares cost function is
convex that is a very important property
which helps us design the receiver in
this MIMO system in fact that is what we
are going to do when we solve the convex
optimization problem ok so what you will
realize here is that this implies H
transpose H is a positive semi definite
matrix which implies that you are
multiplying it by a positive constant 2
which implies twice H transpose H is
positive semi-definite which implies
that Delta square f of X bar
is that is this ACN is positive
semi-definite okay
implies Y bar minus HX bar square this
is a convex this is a convex function of
X bar okay so this f of X bar this is
convex and solving this convex
optimization vex problem this
optimization problem one obtains the
estimate of the transmit vector X bar
and this is going to be important when
we talk about the receiver design for a
MIMO system okay so solving this
this can be used to design receiver
this can be used to design the receiver
for the MIMO system all right so it's
important so this least squares problem
at least squares problem occurs in
several different scenarios all right so
one sort of application of this least
squares problem is to define an
efficient receiver for MIMO system we
are trying to find the best transmit
vector X bar corresponding to a received
vector Y bar that minimizes the
approximation error that is the best
vector best estimate X hat which closely
predicts or which is close or which is
the which basically best explained so
you can say which is the best
approximation for the receive vector Y
bar in this MIMO system alright so we
will stop here and continue with other
aspects thank you very much
[Music]
[Music]