ML
    intermediate

    Loss Landscape 3D

    algorithms.live

    Simulation

    Convex (Bowl)

    Single global minimum. Gradient descent always converges to optimal solution.

    Landscape Settings

    0.10

    Start Position

    2.50
    2.50
    Concepts

    Convex: One global minimum. Easy for gradient descent.

    Non-Convex: Many local minima. Hard optimization!

    Legend
    Path
    Start
    Current
    Loss: Low → High

    What is this point on the surface?

    Sort

    Sort each description.

    Tap a piece, then tap where it goes — or drag it. Tap the tray to take one back.

    Local minimum

    Drop items here

    Saddle point

    Drop items here
    4 pieces left to place

    Test your knowledge

    21 questions
    Question 1 of 21
    Score: 0

    What is a global minimum?

    Learn these first

    Interview Questions

    Google Brain
    DeepMind
    Apple
    OpenAI
    NVIDIA
    Two Sigma
    Facebook AI Research
    Intel
    Cerebras
    Microsoft Research
    Baidu Research
    Google
    Meta
    Berkeley AI Research
    Carnegie Mellon University

    Love this visualization?

    Sign up to track your progress, earn achievements, use the AI assistant, and access your personal learning dashboard.

    100% free • No credit card required