Amortized generative recovery advantage across problem families
Establish whether a configuration-importance model trained once across a family of fermionic Hamiltonian instances can complete the physical-sector tail of a new under-sampled instance without per-instance retraining and outperform a strong classical selector.
References
Amortization without per-instance retraining is therefore feasible---a train-once model generalizes across the family---but shows \emph{no statistically resolved advantage} over the classical baseline yet, the status of the open question: the single-instance negative result sets the bar, the amortized result meets but does not clear it, and---consistent with both---any advantage, if it exists, would be confined to the high-noise, high-correlation regime, never on the easy instances where the classical prior already wins.
The central next step is to identify favorable partitions from accessible chemical and structural information, and to determine whether their preparation and sampling benefits persist after these additional costs are included.