Additional mathematical and learning concepts · MLD-0187
Computational complexity
How an algorithm's resource requirements grow with input or model size.
Original reference page · detailed expansion pending. Original definitions, examples, notes and citations are preserved below. New examples are illustrative, not benchmark results.
Original example
Compare the scaling of two inference algorithms.
Original caveat
Asymptotic complexity does not include every practical hardware effect.
Context and aliases
Level: Intermediate. Stages: Theory · Training · Evaluation.
Tags: ML · DL.
Aliases: None recorded.
Related concepts
Concepts linking here
Original references
- Deep Learning: online textbook ↗ · Consulted
- Mathematics for Machine Learning ↗ · Reference link
- scikit-learn User Guide ↗ · Consulted
- Original reference URL ↗