This is an exploratory research arc, not a shipped feature. It is documented
here for honesty and reuse. The headline outcome is a partial / negative
result: the novel mechanisms work, but the prototype is not
accuracy-competitive with GoldenMatch’s existing zero-config controller.
Source, prototypes, and per-step results live in
scripts/research/ in the
repository.What this was
A 2026-06 exploration of attacking entity resolution in a deliberately novel way, rather than tuning the existing pipeline. It began with a deep-research scan for genuine white space across six reframings of ER, then prototyped and stress-tested the most promising combination end-to-end. The combination, called program 1+3+6, treats ER as one amortized engine:- (1) Amortized Bayesian partition posterior — one trained network emits
p(partition | records)in a single forward pass, no per-dataset MCMC, amortized across datasets. - (3) Reconstruction-as-likelihood — instead of a hand-coded distortion model, learn the co-reference signal as “can a record’s masked field be reconstructed from its cluster-mates?”
- (6) EIG active design — choose the human/LLM label that maximally collapses the partition posterior’s entropy (not per-pair uncertainty), so transitivity resolves many induced pairs per label.
White-space scan
Each framing was checked against the literature for genuine novelty. Summary of where the open territory is:What was built and what each step found
Six runnable prototypes underscripts/research/, each a kill-criterion experiment
with an honest RESULTS-*.md writeup.
The honest bottom line
The novel mechanisms held up under test. As an ER system, the prototype is not good:
It loses to a ~15-line baseline and is far behind the production
auto-config it was exploring alternatives to.
Why the ceiling is structural. The residual gap is recall on hard typos, and the
only fix is a much stronger encoder — but fine-tuning an encoder on matching pairs
is supervised entity matching, already solved (Ditto ≈ 98% on DBLP-ACM).
Amortization / zero-shot is precisely what costs the accuracy. And these benchmarks
are near-saturated (incumbents at 0.94–0.96), so there was no accuracy headroom for
novelty — the test favours the incumbent.
What’s worth keeping
- The mechanisms and their evidence — reconstructability as a label-free cluster-quality signal, a calibrated amortized partition posterior, and EIG-over-partition active selection are each independently interesting and reproducible.
- The diagnosis — for amortized ER, the encoder and the simulator (not the inference head) are the gating problems; a pretrained encoder + realistic simulator recover most of the transfer.
- The reframing — if this line is ever revived, it should be as a calibrated-uncertainty / label-efficiency play on hard regimes (messy product data, cross-org PPRL), not as an accuracy play on saturated structured benchmarks.
Reproduce
Everything is inscripts/research/ (torch + sentence-transformers; recordlinkage
for Febrl3). Each prototype prints its own gate and writes a RESULTS-*.md. The
full design and verdict are in
docs/superpowers/specs/2026-06-07-amortized-bayesian-er-1plus3plus6-design.md.