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
Algebraic Geometry
SQL
Computer Science
Project Management: The Basics for Success
Sustainable Tourism: Society & Environmental Aspects
Introducción a los encofrados y las cimbras en obra civil y edificación
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore joint optimization of specialized models for heterogeneous data using the sum-of-minimum approach. Learn algorithm design, performance bounds, and applications in various machine learning tasks.
Explore Kurdyka-Łojasiewicz exponents in L1-regularized optimization, focusing on Hadamard difference parametrization and its impact on local convergence rates of gradient methods.
Explore acceleration mechanisms in optimization and machine learning, aiming to unify diverse approaches for a comprehensive mathematical theory.
Explore a novel Newton-type algorithm for nonsmooth optimization problems, focusing on difference programming and its applications in structured optimization and practical problem-solving.
Explore advanced optimization techniques for constrained min-max problems, focusing on inexact fixed-point iterations and stochastic algorithms for nonconvex-nonconcave scenarios.
Explore the relationship between Bakry-Émery curvature-dimension and Kato condition on Ricci curvature, uncovering insights on Kato limit spaces and Riemannian manifolds.
Explore inertial algorithms with Tikhonov regularization for optimization problems, examining strong convergence to minimum norm solutions and fast convergence rates for objective function values.
Explore optimal time complexities for parallel optimization methods with heterogeneous data, compute, and communication. Gain insights into efficient distributed SGD algorithms.
Explore optimization techniques for functions with low effective dimensionality, focusing on random and deterministic subspace methods for nonconvex problems and efficient subspace learning.
Explore recent developments in bilevel optimization algorithms, their theoretical analysis, and challenges in machine learning and data science applications.
Explore a novel SDE model for SGD that incorporates Hessian information, improving accuracy in capturing escaping behaviors and achieving exact recovery for quadratic objectives.
Explore stochastic-gradient-based algorithms for constrained continuous optimization, focusing on interior-point and sequential-quadratic-programming methods with convergence guarantees and practical applications.
Explore sample size estimates for risk-neutral semilinear PDE-constrained optimization using SAA approach, covering nonasymptotic analysis and numerical illustrations.
Explore nonmonotone forward-backward splitting for nonsmooth composite problems in Hilbert spaces, covering convergence analysis, complexity, and numerical experiments.
Explore a novel derivative-free optimization method using improved under-determined quadratic interpolation, considering trust-region iteration properties and model optimality.
Get personalized course recommendations, track subjects and courses with reminders, and more.