[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-9835":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":10,"totalLinesOfCode":10,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":16,"subscribersCount":16,"size":16,"stars1d":15,"stars7d":14,"stars30d":17,"stars90d":16,"forks30d":16,"starsTrendScore":18,"compositeScore":19,"rankGlobal":10,"rankLanguage":10,"license":20,"archived":21,"fork":21,"defaultBranch":22,"hasWiki":23,"hasPages":23,"topics":24,"createdAt":10,"pushedAt":10,"updatedAt":44,"readmeContent":45,"aiSummary":46,"trendingCount":16,"starSnapshotCount":16,"syncStatus":47,"lastSyncTime":48,"discoverSource":49},9835,"maths-cs-ai-compendium","HenryNdubuaku\u002Fmaths-cs-ai-compendium","HenryNdubuaku","Become a cracked AI\u002FML Research Engineer","",null,"TypeScript",4483,620,51,3,0,806,27,30.38,"Apache License 2.0",false,"main",true,[25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43],"ai-textbook","algorithms","artificial-intelligence","computer-science","computer-vision","deep-learning","jax","linear-algebra","machine-learning","machine-learning-algorithms","math","mathematics","multimodal-learning","nlp","probability","python","reinforcement-learning","speech-processing","statistics","2026-06-12 02:02:13","# Maths, CS & AI Compendium\n\n\u003Cimg src=\"images\u002Flogo.png\" alt=\"Logo\" style=\"border-radius: 30px; width: 100%;\">\n\n**Read online**: [henryndubuaku.github.io\u002Fmaths-cs-ai-compendium](https:\u002F\u002Fhenryndubuaku.github.io\u002Fmaths-cs-ai-compendium\u002F)\n\n## Overview\nMost textbooks bury good ideas under dense notation, skip the intuition, assume you already know half the material, and quickly get outdated in fast-moving fields like AI. This is an open, unconventional textbook covering maths, computing, and artificial intelligence from the ground up. Written for curious practitioners looking to deeply understand the stuff, not just survive an exam\u002Finterview. \n\n## Background\nOver the past years working in AI\u002FML, I filled notebooks with intuition first, real-world context, no hand-waving explanations of maths, computing and AI concepts. In 2025, a few friends used these notes to prep for interviews at DeepMind, OpenAI, Nvidia etc. They all got in and currently perform well in their roles. Meanwhile I got in Y Combinator last year. So I'm sharing to everyone.\n\n## MCP Server\nThis repo includes an MCP server that lets any AI assistant (Claude Code, Cursor, VS Code, etc.) use the compendium as a knowledge base. It requires a local clone of the repo. Comes with tools for educational purposes and example implementations.\n\n## Outline \n\n| # | Chapter | Summary | Status |\n|---|---------|---------|--------|\n| 01 | [Vectors](chapter%2001%3A%20vectors\u002F01.%20vector%20spaces.md) | Spaces, magnitude, direction, norms, metrics, dot\u002Fcross\u002Fouter products, basis, duality | Available |\n| 02 | [Matrices](chapter%2002%3A%20matrices\u002F01.%20matrix%20properties.md) | Properties, special types, operations, linear transformations, decompositions (LU, QR, SVD) | Available |\n| 03 | [Calculus](chapter%2003%3A%20calculus\u002F01.%20differential%20calculus.md) | Derivatives, integrals, multivariate calculus, Taylor approximation, optimisation and gradient descent | Available |\n| 04 | [Statistics](chapter%2004%3A%20statistics\u002F01.%20fundamentals.md) | Descriptive measures, sampling, central limit theorem, hypothesis testing, confidence intervals | Available |\n| 05 | [Probability](chapter%2005%3A%20probability\u002F01.%20counting.md) | Counting, conditional probability, distributions, Bayesian methods, information theory | Available |\n| 06 | [Machine Learning](chapter%2006%3A%20machine%20learning\u002F01.%20classical%20machine%20learning.md) | Classical ML, gradient methods, deep learning, reinforcement learning, distributed training | Available |\n| 07 | [Computational Linguistics](chapter%2007%3A%20computational%20linguistics\u002F01.%20linguistic%20foundations.md) | syntax, semantics, pragmatics, NLP, language models, RNNs, CNNs, attention, transformers, text diffusion, text OCR, MoE, SSMs, modern LLM architectures, NLP evaluation | Available |\n| 08 | [Computer Vision](chapter%2008%3A%20computer%20vision\u002F01.%20image%20fundamentals.md) | image processing, object detection, segmentation, video processing, SLAM, CNNs, vision transformers, diffusion, flow matching, VR\u002FAR | Available |\n| 09 | [Audio & Speech](chapter%2009%3A%20audio%20and%20speech\u002F01.%20digital%20signal%20processing.md) | DSP, ASR, TTS, voice & acoustic activity detection, diarisation, source separation, active noise cancellation, wavenet, conformer | Available |\n| 10 | [Multimodal Learning](chapter%2010%3A%20multimodal%20learning\u002F01.%20multimodal%20representations.md) | fusion strategies, contrastive learning, CLIP, VLMs, image\u002Fvideo tokenisation, cross-modal generation, unified architectures, world models | Available |\n| 11 | [Autonomous Systems](chapter%2011%3A%20autonomous%20systems\u002F01.%20perception.md) | perception, robot learning, VLAs, self-driving cars, space robots | Available |\n| 12 | [Graph Neural Networks](chapter%2012%3A%20graph%20neural%20networks\u002F01.%20geometric%20deep%20learning.md) | geometric deep learning, graph theory, GNNs, graph attention, Graph Transformers, 3D equivariant networks | Available |\n| 13 | [Computing & OS](chapter%2013%3A%20computing%20and%20OS\u002F01.%20discrete%20maths.md) | discrete maths, computer architecture, operating systems, concurrency, parallelism, programming languages | Available |\n| 14 | [Data Structures & Algorithms](chapter%2014%3A%20data%20structures%20and%20algorithms\u002F00.%20foundations.md) | Big O, recursion, backtracking, DP, arrays, hashing, linked lists, stacks, trees, graphs, sorting, binary search | Available |\n| 15 | [Production Software Engineering](chapter%2015%3A%20production%20software%20engineering\u002F01.%20linux%20and%20CMD.md) | Linux, Git, codebase design, testing, CI\u002FCD, Docker, model serving, MLOps, monitoring, best way to use coding agents | Available |\n| 16 | [SIMD & GPU Programming](chapter%2016%3A%20SIMD%20and%20GPU%20programming\u002F00.%20why%20C%2B%2B%20and%20how%20ML%20frameworks%20work.md) | C++ for ML, how frameworks work, hardware fundamentals, ARM NEON\u002FI8MM\u002FSME2, x86 AVX, GPU\u002FCUDA, Triton, TPUs, RISC-V, Vulkan, WebGPU | Available |\n| 17 | [AI Inference](chapter%2017%3A%20AI%20inference\u002F01.%20quantisation.md) | quantisation, efficient architectures, serving and batching, edge inference, speculative decoding, cost optimisation | Available |\n| 18 | [ML Systems Design](chapter%2018%3A%20ML%20systems%20design\u002F01.%20systems%20design%20fundamentals.md) | systems fundamentals, cloud computing, distributed systems, ML lifecycle, feature stores, A\u002FB testing, recommendation\u002Fsearch\u002Fads\u002Ffraud design examples | Available |\n| 19 | Applied AI | Ai in finance, healthcare, protein, drug discovery | Coming |\n| 20 | Bleeding Edge AI | quantum ML, neuromorphic ML, decentralised AI, datacenters in space, brain machine interfaces | Coming |\n\n## Foreword\n\nA newborn's brain is a newly initialised neural network, which trains from realworld data and experience into adulthood...until forever. Exceptional understanding of French with the flawless accent implies correct exposure to exceptional French and flawless accent. Similarly, great AI Researchers & engineers with excellent problem-skills imply quality knowledge consumed and exposure rich experience. \n\nNow Kvashchev's experiment was a long-term Serbian study demonstrating that intensive, three-year training in creative problem-solving can significantly boost intelligence, particularly fluid intelligence, adding 10-15 IQ points. There is such a thing as having a natuarally high IQ, similar to how quality weight initialisations yield better training, evidenced by nature-vs-nurture experimental findings. \n\nHowever, the only advantage a high-IQ individual really has is the ability to learn\u002Frecognise patterns faster. But using a repeated pattern makes any concept absolutely learnable. Charles Darwin was considered a very average, if not below-average, student by his teachers and father. He described himself as not being quick-witted, feeling like a \"slow processor\" who needed time to soak in data.\n\nBetween 3-10yrs, I performed well academically, naturally grasping concepts without ever taking notes or revising. I got a bit cocky between 11-13 and dropped to the bottom half of an 80-student class with this technique. Now between 14-15, I began reading like a normal student, finishing 1st in my final secondary school semester. Early school curriculum works well with natural IQ but real-world talents are powered by quality knowledge consumption and execution intensity. \n\nIn fact, most students who perform well academically are just more studious, but the academic system is designed for fast learners. This compendium provides a rounded and well-connected flow of knowledge to facilitate better learning for the Darwins of the world. You only need elementary maths and basic python programming, everything else is picked up, just read and trust the process! \n\n## How To Study Better \n\nFirst semester at university, I took 17 modules at once, grades were not great for it, so I used a technique:\n\n**Phase 1**: Cumulative reading after classes \nRead each slide\u002Fnote title\u002Fheaders only, close the book, then visualise and write an explanation for that concept. Only re-read what you missed, similar to masked-language modeling in machine learning. After the re-read, ultimately implement the concept in code after. You develop muscle memory for each concept.  \n\n**Phase 2**: Shadow reading before exams \nRead each slide\u002Fnote subtitle, close the book, then visualise and write an explanation for that concept. Only re-read what you missed, similar to masked-language modelling in machine learning. After the re-read, ultimately implement the concept in code after. You develop muscle memory for each concept. \n\nThis worked really well for my friends who were not very confident. In fact, one of these friends beat me in advanced engineering mathematics modeule, where we covered Hessians and Optimisation. She works at a big oil & gas firm today. The willingness of the soul matters more than the body we are working with (Rosenthal experiment).\n\n## Who is Henry Ndubuaku?\n\nRead the GitHub profile! \n\n## Citation\n```bibtex\n@book{ndubuaku2025compendium,\n  title     = {Maths, CS & AI Compendium},\n  author    = {Henry Ndubuaku},\n  year      = {2026},\n  publisher = {GitHub},\n  url       = {https:\u002F\u002Fgithub.com\u002FHenryNdubuaku\u002Fmaths-cs-ai-compendium}\n}\n```\n","该项目是一个面向AI\u002FML研究工程师的开放教材，涵盖了数学、计算机科学和人工智能的基础知识。它以直观易懂的方式讲解了向量空间、矩阵运算、微积分、统计学、概率论等核心概念，并深入探讨了机器学习、自然语言处理和计算机视觉等领域的算法和技术。项目采用TypeScript编写，并提供了一个MCP服务器，允许各种AI助手将其作为知识库使用。适用于希望从零开始全面理解AI相关理论与实践的研究者、学生及从业者，特别适合准备面试或希望在AI领域深耕的技术人员。",2,"2026-06-11 03:24:57","top_topic"]