逐层扩展为什么能找到最短路径
逐层扩展按路径长度递增的顺序发现路径，因此第一次命中终点时，所走路径长度即为全局最短。
16 min 8 scenes
Explore by topic
Technology & Computing
AI, programming, data, computing, and the internet.
实时路网：派单与规划如何动态适配
动态路网在实时系统中通过'事件触发→增量更新→局部重算'三步机制维持准确，外卖派单和城市规划都用同一套思想应对突发事件。
16 min 8 scenes
How Your GPS Finds the Shortest Route in Seconds
Navigation runs a layer-by-layer greedy search from the start point, so every intersection is only locked in once with its shortest arrival — and the answer falls out the instant the destination is reached.
14 min 7 scenes
导航几秒算出全城最短路线
导航用从起点逐层向外扩展的贪心搜索，只检查每一个路口最优的一次到达方式，因此几秒内即可锁定全城最短路线。
8 min 4 scenes
Interpolation vs. Approximation in Neural Networks
Interpolation forces the network to pass exactly through every training point, producing high-frequency oscillations between them; approximation sacrifices exact fit for a smoother function that captures the underlying trend and behaves reasonably on unseen inputs.
16 min 8 scenes
When Queries and Keys Speak Different Languages
Dimension mismatch between queries and keys distorts the attention score distribution — specifically inflating its variance — and the sqrt(d_k) normalization in scaled dot-product attention exists precisely to keep that distribution stable regardless of dimension.
18 min 9 scenes
The Edge of a Nearest‑Centroid Cluster
The nearest‑centroid rule defines cluster membership by which centroid is closest, so cluster edges are the straight perpendicular bisectors between centroids — independent of the actual spread, shape, or density of the points.
16 min 8 scenes
When Big-O Lies: The Constant Trap
Big-O describes how running time grows with input size, but it hides three things that can dominate real performance: the multiplicative constant, the cost of each primitive operation, and how the data interacts with memory hierarchy. Algorithm choice should weight all three, not just the asymptotic class.
16 min 8 scenes
Inside the Hash Function
How keys are converted into numeric values, how those values are squeezed into a fixed array range with modulo arithmetic, and why collisions are an expected consequence.
18 min 9 scenes
Why Neural Nets Fit Noise
A network that can fit unseen noise isn't memorizing exceptions — it's because high-capacity models can interpolate the training data exactly, which forces the learned function to be smooth enough to generalize on real patterns.
24 min 12 scenes
What Is Attention Actually Comparing?
Attention compares a query vector to a bank of key vectors via a dot product, and the resulting scores weight how much of each value vector is read — a similarity operation over learned representations, not over surface words.
16 min 8 scenes
Where Does a Cluster End?
A cluster's edge is the set of points whose nearest centroid switches, and the centroid itself is the mean of its assigned points.
14 min 7 scenes
Why Big-O Ignores Constants
Big-O ignores constants because it describes how runtime scales with input size, and any fixed multiplier becomes irrelevant once the input grows.
8 min 4 scenes
Why Hash Table Lookup Is O(1)
Hash table lookup is constant time because the hash function maps a key directly to a slot index, turning a search across n entries into a single computed jump — provided the table is sized and the hash is uniform enough that collisions stay rare and amortized constant.
18 min 9 scenes
如何快速生成质数候选
解释筛法通过预先标记倍数来实现批量淘汰的机制，并说明它在候选质数生成中相对于试除法的效率优势。
16 min 8 scenes
Gradient Noise vs. Parameter Noise
Gradient noise and parameter noise shape optimization through fundamentally different mechanisms: gradient noise produces an implicit regularization that scales with learning rate, while parameter noise produces an explicit perturbation that scales with weight magnitude.
16 min 8 scenes
Designing AI-Allowed Assignments That Invite Curiosity
A reusable design pattern for AI-allowed assignments that separates automatable production from non-delegable inquiry, defended by a worked example and a boundary check.
16 min 8 scenes
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
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