Convergence Rates for Graph-Based Learning Featuring Singular PDEs
Hausdorff Center for Mathematics via YouTube
-
10
-
- Write review
PowerBI Data Analyst - Create visualizations and dashboards from scratch
Most AI Pilots Fail to Scale. MIT Sloan Teaches You Why — and How to Fix It
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 convergence rates in graph-based learning through the lens of singular partial differential equations in this 48-minute mathematical lecture. Delve into the theoretical foundations connecting graph-based machine learning methods with PDE analysis, examining how singular PDEs emerge in the study of learning algorithms on graphs. Investigate the mathematical frameworks used to establish convergence guarantees and analyze the rates at which graph-based learning algorithms approach their optimal solutions. Learn about the interplay between discrete graph structures and continuous PDE formulations, understanding how this connection provides insights into the behavior and performance of modern machine learning techniques. Gain exposure to advanced mathematical concepts at the intersection of analysis, machine learning theory, and graph theory through rigorous mathematical exposition and proof techniques.
Syllabus
Leon Bungert: Convergence rates for graph-based learning featuring singular PDEs
Taught by
Hausdorff Center for Mathematics