Vision Is Representation Under Pressure
Every method here answers one question: what representation survives an image nobody arranged for the model. Pose, lighting, scale, and occlusion decide the answer.
Pixels to representations, and what breaks them
Every method here answers one question: what representation survives an image nobody arranged for the model. Pose, lighting, scale, and occlusion decide the answer.
Image classification is a promise that the rule holds on the next image. The split is the only instrument that tests the promise, and it leaks in two ways.
A linear classifier throws away the training set and keeps a weight matrix. The price of that compression is one averaged template per class.
Optimization is repeated local correction. The loss curve is the instrument that names which correction is broken, and it speaks before final accuracy does.
Backpropagation is the chain rule kept as bookkeeping. Almost every bug in it is a wrong shape, a stale cache, or a missing batch average.
A hidden layer is a learned change of coordinates, and its only defense is that it makes the final comparison easier. Remove the nonlinearity and the stack collapses into one linear map.
Most failures that look like model failures are setup failures. Data scale, initialization, normalization, regularization, and the loss must agree with each other.
Training is an inspection loop. A network that cannot memorize ten examples has not earned a larger dataset, and no optimizer repairs bad labels or leakage.
A spiral in two dimensions is the cheapest place to watch a linear model fail and a hidden layer fix it, and at that size no part of the loop can hide.
Convolution writes one claim about images into the architecture: useful patterns are local, and they repeat across space. The prior is the advantage, and a wrong prior is a cost already paid.
A visualization earns its place only when it changes a decision. Its job is to catch the model using the wrong evidence, and the test you run afterward is the only proof it produced anything.
Two numbers set the plan: how much labeled data you have, and how far it sits from the pretraining set. Where you freeze and what you fine-tune follow.
An RNN carries one compressed summary forward, and that compression is both the mechanism and the ceiling. Gates buy the state a straighter path through time.
Queries ask, keys advertise, values answer. A captioning decoder builds a different context vector for every word instead of reading one compressed summary.
A vision transformer trades convolution's locality and weight sharing for learned routing between patches, and the training recipe pays the difference.
Autoregressive models buy likelihood and pay in sampling speed. VAEs organize the latent space and blur. GANs sharpen and collapse. Name the metric first.
NeRF stores a scene as a function you query, and posed photographs are enough supervision because rendering is differentiable.
The gradients that trained the model are the gradients that break it. FGSM takes one step, PGD takes many, and a defense means nothing until you name the attacker.
Old ConvNet advice still works because the failures it prevents did not change: bad data, wrong normalization, unstable learning rates, leakage, weak baselines, and uninspected errors.
An autoregressive image model buys an exact likelihood and pays in the order it commits to and the sampling speed it gives up. The mask is what keeps the contract honest.
Generative modeling is a set of contracts, and the contract you name chooses the model family. Name the metric, then name the failure it hides.