DSECL Mathematical Foundations For Data Science Assignment
- Subject Code :
DSECL
- University :
BITS Pilani Exam Question Bank is not sponsored or endorsed by this college or university.
- Country :
India
Answer all the questions
Q1) Write a code to implement the three versions of the gradient descent namely. vanilla gradient descent, mini batch gradient descent and stochas tic gradient descent for a data set consisting of at least 1500 rows and 15 columns. Write the necessary theory and experiment on the convergence using the optimal batch size for the mini batch method. (4)
Q2) Implement the line search methods (bisection, golden section and Armijo rule) on the data set taken for Q1). What do you observe on the time taken by the methods and the associated convergence? (3)
Q3) Given the function f(x) = (x2 cos(x) + sin(x) ? x), derive the variable step size (?) that will ensure faster convergence of the gradient descent method and compare the results with (3)
- constant step size
- decaying step size using various values of ?0 and k
- Bold driver algorithm
Are you struggling to keep up with the demands of your academic journey? Don't worry, we've got your back! Exam Question Bank is your trusted partner in achieving academic excellence for all kind of technical and non-technical subjects.
Our comprehensive range of academic services is designed to cater to students at every level. Whether you're a high school student, a college undergraduate, or pursuing advanced studies, we have the expertise and resources to support you.
To connect with expert and ask your query click here Exam Question Bank
