AI in Schools: The Motivation Risk
AI threatens student motivation when it removes the productive struggle that turns effort into curiosity.
8 min 4 scenes
Explore by topic
Technology & Computing
AI, programming, data, computing, and the internet.
From Skewed to Bell-Shaped: How the CLT Works
Averages of skewed data become normal because each sample mean is a sum of independent random pulls that symmetrizes through aggregation, with the spread shrinking predictably as 1/√n.
18 min 9 scenes
Heavy Tails in Correlated Sums
Correlation lets rare large steps align across many terms, and this alignment makes extreme outcomes occur far more often than independence predicts.
16 min 8 scenes
Escaping Saddle Points: Noise in Optimization
The mechanism by which random noise added to gradients or parameters systematically breaks the symmetry of a saddle point and drives the iterate toward a descending direction.
18 min 9 scenes
Lab Notebook: Why Sample Means Go Bell-Shaped
Sample means concentrate around the true mean with spread σ/√n because summing independent values convolves their distributions, an operation that erases sharp edges and corners until only a Gaussian profile remains.
18 min 9 scenes
Why a Small Gradient Can Stall at a Saddle
Explains why gradient magnitude is the wrong progress signal near saddles: the gradient can vanish at a saddle while a negative-curvature direction still permits escape, and detecting that direction — not just measuring gradient size — is what drives rapid exit.
18 min 9 scenes
When Opportunity Cost Fails
Opportunity cost reliably predicts choice only when alternatives are fully known, commensurable, and psychologically available; outside those conditions, decision-makers substitute reference points, sunk anchors, or identity-based reasoning instead.
16 min 8 scenes
Saddle Points in the Wild
A saddle point is a stationary point with both upward and downward curvature, and its escape routes lie along the negative-curvature directions revealed by the Hessian's eigenvalues.
14 min 7 scenes
When the Central Limit Theorem Wobbles
The bell-shaped limit survives mild dependence but changes shape — width, tail weight, and even symmetry — as correlation length and strength grow, and a single correlation time scale controls the transition.
16 min 8 scenes
What Really Moves the Weights?
Effective step size is the product of learning rate and gradient magnitude, so step length scales with both knob and slope.
18 min 9 scenes
Learning Rate or Bad Model? Diagnosing Training Failure
A trained eye reads loss curves, gradient norms, and weight updates to separate learning-rate failure from architectural or data failure — and knows which knob to turn next.
14 min 7 scenes
When a Learning Rate Diverges
A learning rate that worked can diverge when the loss landscape shifts under it — when gradients spike, curvature grows, or accumulated updates push the model into a steeper region — and you can read early warning signs before the explosion.
24 min 12 scenes
Why Gradient Descent Slows Near Saddle Points
A saddle point stalls gradient descent because the gradient itself nearly vanishes, and the surrounding curvature decides whether the algorithm escapes or gets stuck.
20 min 10 scenes
Why Stochastic Gradient Descent Beats Full-Batch
Gradient noise in SGD is not a bug to fix but a feature to exploit: it provides implicit regularization that helps the optimizer escape saddle points, traverse flat regions, and prefer wide minima that generalize.
18 min 9 scenes
How Can We Trust an Unsupervised Model?
Unsupervised models are evaluated by measurable properties of the structure they produce — internal consistency, stability under perturbation, and downstream usefulness — rather than by matching a hidden ground truth.
14 min 7 scenes
Hidden Dimensions in Data
How unsupervised learning reveals latent structure — clusters, low-dimensional manifolds, and anomalies — hidden inside high-dimensional data.
26 min 13 scenes
Is Modern AI Actually Unsupervised?
A clear separation between the textbook meaning of 'unsupervised learning' and the hybrid training pipelines behind modern AI, supported by concrete examples of each stage.
18 min 9 scenes
Can a Machine Discover Hidden Groups?
How an unsupervised algorithm like k-means turns feature vectors into discrete clusters, and why its verdict is real for some shapes and unreliable for others.
16 min 8 scenes
How Can a Machine Learn Without Answers?
Unsupervised learning works by turning raw inputs into compressed, similarity-based representations — clusters, dimensions, and patterns — that the model itself defines as 'consistent.'
16 min 8 scenes
How Machines Judge Similarity
Machines judge similarity by representing items as numerical vectors and computing the distance between them in a feature space.
8 min 4 scenes
TikTok FYP vs Instagram Explore
TikTok's For You Page learns you from pure watch behavior on strangers' videos, while Instagram's Explore learns you from likes and saves blended with your social graph — that's why they feel different.
8 min 4 scenes
有限域上模运算为何难逆
有限域上的模乘法本身是双射、结构完全确定，可一旦把多次乘法叠成幂，求逆就退化为遍历整个乘法群，规模随域大小指数膨胀。
8 min 4 scenes
Why the 7th Scale Degree Pulls Up
The raised 7th resolves up to tonic because a half step is smaller than a whole step, so upward motion covers the shortest distance to a stable pitch.
8 min 4 scenes
Photoshop Foundations
How the core Photoshop tools — selections, layers, masks, and adjustments — work together to transform and refine images.
24 min 12 scenes