AI in Networks (ICE4420P)

Course Curriculum

This course aims to motivate the students towards the applications of AI in 5G and beyond networks. The course will enable the students to learn the foundational mathematics and algorithms, to be applied in wireless networks. The following modules will be covered in this course:


Note: Programming assignments/ hands on project will be given for modules 2-6.


Grading 

Assignments/ Quiz: 40%

Programming exercises: 30% 

Final exam: 30%

References

[1] Kurose, J., & Ross, K. (2010). Computer networks: A top down approach featuring the internet.

[2] S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.

[3] A. Antoniou and W.-S. Lu, Practical optimization: algorithms and engineering applications. Springer, 2007.

[4] CVX: A quick start (MATLAB) https://cvxr.com/cvx/doc/quickstart.html;

Python: https://cvxopt.org/userguide/solvers.html 

[5] S. Boyd, Subgradient methods https://web.stanford.edu/class/ee364b/lectures/subgrad_method_notes.pdf

[6] Hong, Mingyi, Xiangfeng Wang, Meisam Razaviyayn, and Zhi-Quan Luo. ”Iteration complexity analysis of block coordinate descent methods.” Mathematical Programming 163, no. 1 (2017): 85-114. https://arxiv.org/abs/1310.6957 

[7] Boyd, Stephen, and Jacob Mattingley. ”Branch and bound methods.” Notes for EE364b, Stanford University 2006 (2007): 07. https://see.stanford.edu/materials/lsocoee364b/17-bb_notes.pdf, https://see.stanford.edu/materials/lsocoee364b/17-bb_slides.pdf