Random Separating Hyperplane Theorem and Learning Polytopes
Centre for Networked Intelligence, IISc via YouTube
The Fastest Way to Become a Backend Developer Online
Learn Generative AI, Prompt Engineering, and LLMs for Free
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a technical lecture on advanced mathematical concepts where Prof. Amit Kumar from IIT Delhi presents a strengthened version of the classical separating hyperplane theorem for polytopes. Learn how this enhanced theorem enables the learning of polytope vertices through optimization oracles, providing a framework applicable to various hidden variable problems in machine learning. Delve into combinatorial optimization concepts presented by an accomplished researcher who has received numerous prestigious awards including the Shanti Swarup Bhatnagar Award and holds fellowships in multiple Indian science academies. Discover the collaborative research findings developed with Chiranjib Bhattacharyya and Ravindran Kannan that bridge theoretical mathematics with practical machine learning applications.
Syllabus
Time: 5:00 PM – PM IST
Taught by
Centre for Networked Intelligence, IISc