AI History Battle

It is 1997 at Berkeley, and segmentation keeps failing the same way: methods that grow regions from local pixel similarity fragment every textured surface and leak across every soft boundary, because grouping is a global judgment being made with local evidence. Recast the image as a graph — pixels as nodes, affinities as weighted edges — and partition it by a criterion that charges a cut not by raw weight but by its share of each side's total association, so carving off one stray pixel stops being free. The optimum is NP-hard; show the relaxation that lands in the eigenvectors of a graph Laplacian, computable, principled, honest about its gap. Get it wrong and grouping remains hand-tuned heuristics; get it right and spectral methods enter vision's bloodstream.

global grouping criterionspectral relaxationperceptual organization
b. 1976
tapped · ask the professor
25

Chose Simulation as the data engine — wrong. Joint structured perception was the one that fit.

Urtasun's research on perception for self-driving vehicles depends on exactly the kind of reliable, principled image segmentation this problem's normalized-cuts method helped establish as a rigorous approach to grouping, since a self-driving system must partition a scene into coherent objects and surfaces before reasoning about them. Her practical engineering instinct that a segmentation failure has real downstream safety consequences aligns with this problem's stakes. She was not involved in developing the original 1997 normalized-cuts method, and her own research applies considerably more modern, learned segmentation techniques than the classical spectral relaxation this problem specifies, so the concrete 1997 deliverable belongs to Shi and Malik's original research program. The concrete 1997 deliverable belongs to Shi and Malik's original research program, not hers.

b. 1976
was tapped · ask the professor
15

Blei's topic models and variational inference methods are built for extracting latent thematic structure from text corpora, a different problem than this problem's graph-theoretic image segmentation via spectral relaxation of a Laplacian eigenvector problem. His broader comfort with approximate, tractable inference offers thin conceptual proximity, but he never worked on image segmentation or spectral graph theory specifically. Nothing in his own topic-model bibliography engages spectral graph theory directly. The domains simply never intersect in any meaningful technical sense. His topic-model legacy, while historically important, addresses text corpora rather than the graph-theoretic method this problem specifically requires. The historical record here is simply unambiguous about whose contribution this actually is. history is clear on this point, plainly.

Head to head 01 over 1 battle
Read Urtasun Read Blei Leaderboard

Battle #153 · 8/10/2026, 11:40:47 AM · this result is deterministic: the same two personas on this problem always resolve the same way.