Courses from 1000+ universities
17 years ago, Krishna Kumar started offering free PMP prep online. Today, it’s a leading digital upskilling platform that helps millions upskill in AI, cybersecurity, data science, and more.
600 Free Google Certifications
Personal Creativity
Entrepreneurship
Instructional Design
Ecology and Wildlife Conservation
The Science of Well-Being
Mountains 101
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore how local graph limits provide theoretical foundations for understanding sampling-based graph neural networks and their scalability across large graphs.
Explore how neural models achieve size generalization through algorithmic alignment, covering theoretical foundations and practical applications in geometric optimization problems.
Explore mathematical connections between geometric graph expressivity and rigidity theory, linking MPGNN invariants to classical geometric problems and future research directions.
Explore the theoretical foundations of homomorphism indistinguishability and its applications in graph learning, quantum information, and computational complexity analysis.
Explore neural networks that map multisets to vectors using permutation invariant operations, analyzing injectivity and bi-Lipschitzness properties with sorting-based approaches.
Discover how calibrated machine learning predictions enhance discrete optimization algorithms by bridging reliability and efficiency in decision-making under uncertainty.
Explore cutting-edge integration of machine learning and operations research for data-driven optimization problems with combinatorial structures in industrial settings.
Explore the theoretical foundations of ReLU networks using polyhedral geometry, graph theory, and combinatorial optimization to understand representable functions and complexity.
Discover how the Szemerédi Regularity Lemma from graph theory provides theoretical foundations for Graph Neural Networks, enabling better generalization bounds and scalable designs for large graphs.
Explore graph foundation models and universal representations, examining positional vs structural embeddings, invariances in statistical tests, and applications to algorithmic reasoning in network optimization.
Discover a computational framework for quantifying finite-iteration performance of first-order optimization methods through fixed-length computational graphs and verification.
Explore graph machine learning and GNN behavior on large random graphs through geometric models, convergence analysis, and stability insights for deep architectures.
Explore advanced graph neural networks using P-tensors to overcome message passing limitations while maintaining equivariance and improving expressiveness for complex graph structures.
Dive into combinatorial optimization and graph learning fundamentals with expert insights from Cornell Tech's Andrea Lodi in this comprehensive bootcamp session.
Discover geometric principles and graph learning techniques in this comprehensive bootcamp covering theoretical foundations and practical applications.
Get personalized course recommendations, track subjects and courses with reminders, and more.