Skip to main content
Search

Oak Ridge National Laboratory

3 related articles

Subscribe to updates
  1. arXiv

    A quantum generative model's Fisher trace is pinned to its parameter count, so certification shifts to a two-metric escalation rule

    For quantum circuits that prepare real-amplitude states from half-angle rotations, the classical Fisher information matrix equals the quantum one off a measure-zero set, so its trace is fixed at the parameter count 2n−1 and says nothing about fit quality. The analysis turns to the Fisher eigenvalue rank and to two distributional metrics, Wasserstein-1 and maximum mean discrepancy: the rank only counts the support of the converged distribution and falls to chance on a full-support benchmark. For two analytically solvable bitstring defect families, the tolerance-mismatch window in which the two metrics disagree opens only at certification-grade tolerances and closes as the qubit count grows.

  2. Transition-state search stops assuming the ground state: global sampling plus a 30,000-parameter network remaps propane dehydrogenation

    Transition-state searches have long started from hand-chosen ground-state structures, which can miss metastable configurations that may govern rates at finite temperature. A workflow pairs global configurational search with a lightweight graph neural network: it samples many reactant, product and intermediate configurations on the potential energy surface, then predicts transition-state geometries with an edge-aware attention network of about 30,000 trainable parameters. On propane dehydrogenation over Pt4 supported on carbon nitride, the workflow recovers the known mechanism and yields competing pathways absent from earlier hand-built models; the authors also note that the metastable tetrahedral Pt4, though intrinsically more reactive, is too costly to form to dominate actual kinetics.

  3. aclanthology.org

    FOM-UL unlearns by editing only a few layers: under 4-bit quantization its residual memorization stays below whole-model baselines with higher retain utility

    Unlearning a large language model no longer requires diffuse updates across the whole model. FOM-UL scores each transformer layer by the ratio of its forget-set gradient norm to its retain-set gradient norm, updates only the few high-scoring layers, and adds layers one at a time when forgetting falls short. Across TOFU, KnowUnDo and MUSE-style evaluations it leaves less residual memorization than GA, NPO and KLD baselines while keeping retain-set utility close to the vanilla model, and it holds a favorable forgetting-utility trade-off under 8-bit and 4-bit post-training quantization, though residual memorization does rise under 4-bit relative to full precision.

You’re all caught up