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
Hello welcome to another module in this massive open online course . So, we are looking at
convex functions we have completed the basic ah; ah discussion on the basic aspects including
illustration of several practical applications. Let us now focus on some examples to understand
these concepts better all right. So, what we want to start looking at is examples
for convex functions, the first example we want to look at a new concept which is that
of a conjugate that of a conjugate .
This is a very interesting concept for the following reason which I am going to describe
shortly , but the definitions . So, given F of given a function
given a function F of x bar the conjugate denoted by
the conjugate function F conjugate y bar is is this is given as the maximum over the vectors
x bar of y bar transpose x bar minus F of x bar it has a rather very interesting definition
. And ah so this is the definition the con conjugate
function and the interesting aspect of this is this conjugate function is convex even
when F of x the original function is not coming this is important aspect. So, the important
aspect of this is that the conjugate function F conjugate y bar is convex.
Even if F of x bar is not even if F of y bar is not x of corresponding every function any
function F of x bar convex or non convex one can construct an associated convex function
which is a conjugate function. And that is very easy to see for instance
if you look at F conjugative of y bar let me just write this again which is y bar transpose
x bar minus F of x bar. Well you can see that this is a linear, linear in y bar
for each x for each value of x bar this is a linear function in y bar .
So, you are taking which is basically which implies that this is a convex in y bar. And
therefore, we need to taking the set anyway you take the maximum, you are taking the maximum
of set of convex functions and therefore, from the property that we have discussed for
convex functions. The maximum of a set of convex functions is convex, therefore, you
are taking the set the maximum of the set of convex functions that is one function for
each x bar all right . Which is convex in y bar for each x bar, you
are taking the maximum and therefore, the resulting function is convex, implies the
maximum, implies the maximum implies the maximum is convex ok.
And therefore, it is convex even if the original function F is not convex ok. Let us take an
example of this conjugate function consider the quadratic, consider the quadratic function.
Which is F of x bar equals half x bar transpose Q x bar with Q equals symmetric positive semi
definite ok, which we have also written as follows to greater equal to 0.
Now if you take now to conjugate the to construct the conjugate function: we have F conjugate
y bar equals maximum of over x bar y bar transpose x bar minus F of x bar which has half x bar
transpose ok . And now to maximize this let us differentiate
this ok to maximize this differentiate and set it equal to 0. We are going to
differentiate with respect to x bar that is considered its gradient of this quantity ok.
Let us call this as ah; g of x bar, which has differentiated g derivative of g with
respect to the vector x bar you and remember derivative of F y bar transpose x bar .
It is of the form c bar transpose x bar derivative F c bar which is basically y bar minus half
derivative of x bar transpose 2 x bar remember we said is twice derivative of x bar transpose
p x bar is twice p x bar. So, here we have twice Q x bar, which is equal to 0 you are
setting the derivative equal to 0 this implies y bar equals Q x bar this implies x bar equals
Q inverse x bar equals Q inverse y bar ok. And the conjugate function F conjugate y equals
y bar transpose Q inverse y bar minus that is y bar transpose into x bar minus half,
x bar transpose Q inverse x bar. Which is nothing, but ah basically Q inverse
is of x bar and substituting y bar Q inverse y bar transpose Q times Q inverse y bar, which
is equal to ah which is equal to basically y bar transpose Q inverse y bar minus half
y bar transpose Q inverse into Q into Q inverse y bar .
So, Q inverse and Q cancel so you again have minus half y bar transpose Q inverse y bar
. So, that is basically half, y bar transpose Q inverse y bar which is basically the conjugate
function conjugate function of. And you can see this conjugate function is
also quadratic
is also quadratic in fact, you can say this is convex, because Q is positive semi definite.
Which implies Q inverse is also positive semi definite remember that is an important result
property of positive semi definite matrices, if that is the metrics is positive semi definite,
the inverses is also positive semi definite. And now you have a quadratic function with
a positive semi definite metrics and therefore, that is Q inverse and therefore, that is also
a convex it is a convex function that half y bar transpose y bar Q inverse y bar is a
convex function ok And so therefore, this is convex and this
the conjugate function of x bar transpose Q inverse x bar ok so, this is something that
we have . So, one can readily derive the con conjugate function ok.
Let us now look at another example slightly complicated one which we want to prove the
convexity, prove the convexity of you want to prove the convexity of the following function
where F of x bar equals log k equal to 1 to n e raise to summation e raise to so, this
is log some of exponentials is also referred to as the log of sum of exponentials .
So, very interesting function that arises in several log sum of
this is the log sum of exponentials, which rises in several applications. What we want
to show that show that this is convex show that this function is convex.
And for this what we will do is will compute the hessian all right so remember that has
to be convexity, whenever its differentiable is yet you can compute the hessian and demonstrate
that the hessian is a positive semi definite matrix. And that is what we want to do in
this problem I want to compute the hessian and demonstrate that it is indeed a positive
semi definite matrix . So, all right the processes is slightly involved
so, ah I urge you to be patient ok. So, first let us set for convenience e raise to x k
let us say z this equal to z k ok . So, I have F of x bar equals log sum of exponentials
that is log, that is basically you can see this is simply log of z 1 plus z 2 plus z
n. Which is log I can write this as 1 bar transpose
the vector z bar, where z bar is the vector is z 1 z 2 up to z n and 1 bar is basically
the vector of all once. You we are taking simply the when you are multiplying one bar
transpose z bar you are take simply taking the sum of all elements of z bar ok.
And now ah; if you differentiate, that is if you differentiate this
with respect to each x i all right . That is basically you are computing the gradient
with respect to x of F of x bar or rather the ith element ok if you are looking at the
gradient, you are looking at the ith element of the gradient ok. Now that would be d by
d x or rather d by d x derivative with respect to i of your log 1 bar transpose z bar. The
derivative of log is log x is 1 over so 1 over 1 bar transpose, times the derivative
of 1 bar transpose z bar with respect to each x i .
Now in z bar you can see only z i which is e raise to x i depends on x i. So, this is
1 over 1 bar transpose z bar into derivative of z i with respect to x i, but recall z i
is e raise to x i so, e raise to x i . So, derivative with respect to x i is e raise
to x i only which is basically z I so this reduces to 1 over 1 bar transpose z bar times
z i ok. So, you have if you look at the gradient;
which is basically the derivative of F of x with respect to each component of derivative
of F of x with respect to each component. That is equal to well z 1 z 2 up to z n 1
divided by 1 bar transpose z bar . Which is basically you can see this is z bar
transpose z bar over 1 bar transpose z bar, that is the gradient of z bar over 1 bar transpose
z bar that is the gradient. Now let us compute the hessian, hessian means
the second order derivative ok . So, now, for the hessian first let us look at the derivative
with respect to each component x j that is we have compute the second order components
of the form derivative with partial with respect to x i , partial with respect to x j .
Ah; This is nothing, but partial with respect to x j of partial of F of x bar with respect
to x i. Which is partial with respect to x j of partial with respect to x j of well what
is this quantity this is we note the partial with respect to x i that is your z i divided
by 1 bar transpose z bar. Well partial with respect to x j of z i is
0 so, this is simply you can write this as minus 1 over 1 bar transpose z bar square
into partial of 1 bar transpose z bar with respect x j that leads on this x j ah z j,
which depends on x j. So, that is ah when you differentiate z j
that is remember z j equals e raise to x j when you differentiate with respect to x j
you are left with e raise to x j which is again z j . So, this is this quantity component
is minus z i z j by 1 over transpose z bar square ok.
Now on the other hand if you compute the second order derivative with respect to x i itself,
that is terms of the form partial with second order partial with respect to x i that is
dou square F by dou x i square that would be second order order partial with respect
to x i of the first order partial with respect to x i. Which is dou by dou i z i divided
by 1 bar transpose z bar . Now if you differentiate the numerator we
already see in derivative of z i with respect x i is z i itself.
So, that will be z i divided by well that will be z i divided by 1 bar transpose z bar
minus, now divide derivative of the numerator. So, 1 bar trans[pose]- or derivative of the
denominator that is minus 1 of bar transpose minus 1 over one bar transpose z bar square
z i. Times the derivative of z i with respect to x i or 1 bar transpose z bar with respect
to x i which is again z i . So, this is you have a z i square in the numerator
so you will have z i divided by 1 bar transposes z bar minus z i square divided by 1 bar transfer
z bar whole square ok. And now, if I will therefore so only so, these
terms are only present in terms of the form dou square F x bar dou x i square all right.
They are not present if you can look at it they are not present, when you are in the
second order terms of the form partial with respect to x i x j ok.
Ah; So, when you write you can readily see that if you look at the hessian that will
be well what is the hessian? Hessian is partial of F with respect to x 1 square partial of
with respect to x 1 x 2 partial of x with respect to x 2, partial with respect to x
1. And you have the partial with respect to dou square F by dou x 2 square and so on .
And if you put all these terms together what you will see is you will see that this is
given as 1 over 1 bar transpose z bar, times the diagonal terms remember the diagonal terms
of the forms z 1 z 2 which are only there for the partial, that is terms of the from
dou square F by dou x i square. So, this is z 1 z 2 up to z n minus terms
of the forms z i z j, which can be represented as z bar z bar transpose divided by 1 bar
transpose z bar square. So, this is the this is the hessian, hessian of F of x bar
this is the hessian of the F x. Now we have to demonstrate to show that this
is a positive semi so I can also write this as just one last example; this is a diagonal
metrics; diagonal metrics that contains z bar the vector z bar on its diagonal. I can
simply write this as diagonal z bar . So, this is diagonal z bar divided by 1 bar transpose
z bar minus z bar z bar transpose divided by 1 bar transpose z bar whole square all
right. This is a hessian and we have to show to show
that this is positive semi definite. To show this is indeed PSD for convexity of F of x
bar. That is you want to show that is this is indeed
a positive semi definite metrics ah; to verify the complexity of this function F of x all
right, which we will do in the subsequent module so, we will stop here.
Thank you very much.