Înapoi la articole →

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 64
  1. Latent on the Spectrum: Why Cats Sit Closer to Dogs Than to Cars

    A label-similarity kernel can be turned into a target codebook by spectral embedding: retain its leading eigenmodes, scale by their square roots, and spend a finite dimension budget.

  2. Q and K Projections in JAX/Flax NNX

    A runnable companion to Why Attention Needs Q and K Projections: build scaled dot-product attention with separate query and key projections in Flax NNX, pull the bilinear form B = W_Q W_Kᵀ out of the module, split it into a symmetric metric and an antisym…

  3. Why Attention Needs Q and K Projections

    The dot product in attention is not enough by itself.

  4. The Prototype Readout in JAX/Flax NNX

    A runnable companion to The Readout is a Convex Combination of Prototypes: read the columns of W_out as output prototypes in Flax NNX, measure the convex/conic/affine/linear regimes numerically, then build a Nadaraya–Watson kernel readout that is convex by

  5. The Readout is a Convex Combination of Prototypes

    The second linear map in a transformer MLP is a dictionary of output prototypes, one per hidden unit.

  6. Auditing Latent Space Geometry in JAX

    A runnable companion to the Welch-bound latent-space post: generate GIFs and implement the JAX metrics that tell you whether embeddings are collapsing, wasting rank, forming a simplex, or pressing against the Welch floor.

  7. What Makes a Good Latent Space? The Welch Bound and the Simplex

    The hidden codebook inside representation learning: why collapse happens, why opposition is a trap, why class means form a simplex, and why the Welch bound sets the best geometry when too many concepts share too few dimensions.

  8. Cheap Attention in JAX/Flax NNX

    A runnable companion to Cheap Attention: implement positive-feature linear attention in JAX and Flax NNX, watch the all-pairs ledger turn into a shared feature state, and see where the N×N matrix disappears.

  9. Cheap Attention: Linear-Time Kernel Approximation

    A 128K-token context creates billions of pairwise questions per attention head.

  10. Organizing Randomness: Contrastive Learning in JAX

    A block-by-block JAX + Optax implementation of six contrastive losses, each watched as a real animated GIF turning random 2D points into organized embeddings.

  11. Untangling the Moons: A Visual History of Contrastive Learning

    Eight contrastive losses, twenty years of history, and one geometric audit.

  12. Self-Attention as Kernel Regression in JAX/Flax NNX

    A runnable companion to Attention is Explainable Because it is a Kernel: build scaled dot-product attention from scratch in Flax NNX, prove in code that it is exactly a Nadaraya–Watson kernel smoother, watch the separate q/k projections break positive-def…

  13. What Attention Weights Can Explain

    Self-attention has the normalized weighted-average form of a compatibility smoother.

  14. What Activations Do to Geometry

    ReLU, GELU, and their relatives enter a layer's Jacobian as an input-dependent row scaling.