In this talk, we present a novel approach for value selection in fixed-pattern factorized sparse approximate inverse preconditioners. Unlike classical constructions that rely on algebraic Frobenius-residual criteria, the proposed strategy chooses admissible entries by directly optimizing spectral objectives of the congruent preconditioned operator. To make this practical for large-scale sparse matrices, we derive projected Krylov support-gradients implemented via a detached Rayleigh surrogate, which avoids differentiating through the Lanczos recurrence. Numerical experiments on finite-element test problems demonstrate that spectral value selection significantly improves fixed-support preconditioner performance, especially for symmetric indefinite saddle-point systems. Finally, we discuss an amortized node-edge model to predict factor entries across related matrices.