Kohn-Sham Spectral Embedding on Sparse Graphs at the Nishimori Temperature for Image Classification

• URL: http://arxiv.org/abs/2607.28428v3
• Date: Thu, 06 Aug 2026 01:10:43 GMT
• Title: Kohn-Sham Spectral Embedding on Sparse Graphs at the Nishimori Temperature for Image Classification
• Abstract summary: Kohn-Sham Spectral Embedding (KSSE)<n>An energy-based model replacing the top-layer of convolutional networks with a sparse-graph spectral embedding at the Nishimori temperature of an associated Random-Bond Ising Model.<n>On ImageNet-1000 with frozen EfficientNet-B4 features, KSSE achieves 88.93% Top-1 accuracy with 21.24M parameters-beating Swin-L (197M, 86.4-87.3%) and matching the lower end of ViT-H/14 (632M, 88.0-89.5%) with 10x and 30x fewer parameters.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose Kohn-Sham Spectral Embedding (KSSE), an energy-based model replacing the top-layer classifier of convolutional networks with a sparse-graph spectral embedding at the Nishimori temperature of an associated Random-Bond Ising Model the spectral detectability threshold where class structure becomes marginally distinguishable from disorder. Mapping pre-trained features onto quasi-cyclic low-density parity-check graphs, we construct a regularized Laplacian (Bethe-Hessian) as an effective Kohn-Sham Hamiltonian, yielding D independent spectral problems-one per feature channel-solvable in $O(N log N + k_{mode}^{2} N)$ time by FFT on circulant blocks (Pontryagin self-duality), with low-mode Rayleigh-Ritz refinement ($k_{mode}=5$). Physically, this is a k.p effective-mass reduction on a one-dimensional ring crystal: the circulant support is the perfect crystal, the data weights a slowly varying impurity potential, and the Nishimori crossing a Fermi level at the band edge. Star-domain surgery optimizes the graph: instead of eliminating all frustrated cycles impossible without destroying the codewords-edge shifts create certified convexity around codewords with bounded residual frustration, with multi-scale fractal certification (basins $D_{2}<1$ vs rough landscapes $D_{2}>3$). The theory includes a generalized Ihara-Bass identity with a sharp spectral threshold, a non-backtracking growth trichotomy with frustration as a gauge-invariant $Z_{2}$ flux, a trapping-set spectral test, exact channel separability with a cup-product obstruction, plus loop-series, convexity, surgery, and quasi-stationarity bounds. On ImageNet-1000 with frozen EfficientNet-B4 features (D=1792) under a transductive protocol, KSSE achieves 88.93% Top-1 accuracy with ~21.24M parameters-beating Swin-L (197M, 86.4-87.3%) and matching the lower end of ViT-H/14 (632M, 88.0-89.5%) with 10x and 30x fewer parameters.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Two-Stage Deformable-Convolutional Inverse Design of Nanophotonic Absorbers from Optical Spectra [2.4149105714758545]
  Data-driven inverse design enables efficient generation of nanophotonic structures with prescribed optical responses.<n>This work presents a two-stage deformable-convolutional framework for reconstructing metal--insulator--metal resonator from 80-dimensional absorption spectra.
  arXiv  Detail & Related papers  (2026-08-12T09:47:06Z)
• Show the Signal, Hide the Noise: Spectral Forcing for Pixel-Space Diffusion [46.51681899437508]
  We introduce Spectral Forcing, a parameter-free, time-conditional 2D-DCT low-pass operator applied to the noisy input before the patch embedder.<n>Its cutoff expands monotonically with the diffusion time and becomes the identity at the data endpoint.<n>On ImageNet-256 with JiT-700M/32, Spectral Forcing consistently improves both FID and Inception Score across different training epochs.
  arXiv  Detail & Related papers  (2026-06-13T10:29:11Z)
• Pseudospectral Bounds for Transient Amplification in Coupled Gradient Descent [0.0]
  We develop a pseudospectral theory for block-triangular Jacobians.<n>We show that the Kreiss constant satisfies $K(J) leq 2/ (1-) + |C|/(4 (1-))$ when the diagonal blocks are symmetric with spectral radii at most $ 1$.<n>Experiments on linear-quadratic problems, IQC-based comparisons, and neural-network training confirm the theory.
  arXiv  Detail & Related papers  (2026-06-01T20:42:04Z)
• Non-Vacuous Certification of Transport MCMC via Oscillation-Controlled Normalizing Flows [3.8549131582427303]
  Transport MCMC trains a normalizing flow to precondition Metropolis--Hastings proposals.<n>We establish the first numerically non-vacuous, rigorous spectral-gap bound for such samplers.
  arXiv  Detail & Related papers  (2026-05-31T07:46:48Z)
• Probing SMEFT Operators through $t\bar{t}t\bar{t}$ Production with Hyper-Graph Neural Networks at the LHC [0.0]
  We use a Hyper-Graph Neural Network (H-GNN) to discriminate multilepton signal events from the dominant SM backgrounds.<n>In the H-GNN each event is represented as a hypergraph whose nodes correspond to reconstructed jets and leptons.<n>We project the expected sensitivity at the HL-LHC integrated luminosities of $1000mathrmfb-1$ and $3000mathrmfb-1$ with $50%$ uncertainty on the background estimation.
  arXiv  Detail & Related papers  (2026-05-18T13:27:32Z)
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
  We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
  arXiv  Detail & Related papers  (2026-05-15T10:20:05Z)
• OAM-Induced Lattice Rotation Reveals a Fractional Optimum in Fault-Tolerant GKP Quantum Sensing [0.0]
  We establish that orbital-angular-momentum encoding and Gottesman-Kitaev-Preskill (GKP) lattice geometry are structurally coupled.<n>Using an end-to-end differentiable Strawberry Fields--TensorFlow circuit, we jointly optimise $ell$, the lattice aspect ratio $r$, and the finite-energy envelope $$ to maximise quantum Fisher information.
  arXiv  Detail & Related papers  (2026-05-13T09:49:16Z)
• Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters [48.3175117923623]
  Most gradient clipping rules treat all parameters as heavy vectors and ignore the matrix structure of modern vectors.<n>We show empirically that data outliers often amplify only a small number of leading singular values.<n>Motivated by this phenomenon, we propose clipping, which stabilizes by singular values.
  arXiv  Detail & Related papers  (2026-05-12T09:24:59Z)
• Anchoring the Eigengap: Cross-Modal Spectral Stabilization for Sample-Efficient Representation Learning [0.8326214193432122]
  We show that vision models degrade sharply in low-data regimes, particularly in medical imaging where labeled samples are scarce.<n>We develop a theory of finite-sample representation learning that quantifies the recoverable dimension K(N)<n>We show that multimodal training maintains more stable modes and improves class separation, even when unimodal models achieve comparable few-shot accuracy.
  arXiv  Detail & Related papers  (2026-05-09T07:49:43Z)
• Weight-Decay Turns Transformer Loss Landscapes Villani: Functional-Analytic Foundations for Optimization and Generalization [2.9582724435853858]
  This paper provides the first rigorous functional-analytic characterization of the standard Transformer objective--cross-entropy loss with $L2$ regularization.<n>We show that the regularized loss $mathcalF$ is infinitely differentiable, grows at least quadratically, has Gaussian-integrable tails, and satisfies the differential growth condition $-mathcalF + tfrac1s|nablamathcalF|2 to infty$ as $|| to
  arXiv  Detail & Related papers  (2026-05-07T17:22:19Z)
• Quantum Simulation of Cranked Zirconium Isotopes: A Fixed-N Approach with a Structured Number-Conserving Ansatz [0.6062046099196193]
  We present a methodological study of quantum simulation of cranking in a Nilsson $+$ pairing Hamiltonian on a fixed grid.<n>We employ a structured, number-conserving singles-and-doubles ansatz: double excitations implement pair transfer, while singles are restricted to the nonzero Coriolis-coupling graph of the active Nilsson basis.
  arXiv  Detail & Related papers  (2026-04-01T12:54:29Z)
• Compact Circulant Layers with Spectral Priors [1.5755923640031846]
  Critical applications in areas such as medicine, robotics and autonomous systems require compact (i.e., memory efficient) neural networks.<n>We study compact spectral circulant and block-circulant-with-circulant-blocks (BCCB) layers.
  arXiv  Detail & Related papers  (2026-02-25T14:48:25Z)
• Structure-Informed Estimation for Pilot-Limited MIMO Channels via Tensor Decomposition [51.56484100374058]
  This paper formulates pilot-limited channel estimation as low-rank tensor completion from sparse observations.<n>Experiments on synthetic channels demonstrate 10-20,dB normalized mean-square error (NMSE) improvement over least-squares (LS)<n> evaluations on DeepMIMO ray-tracing channels show 24-44% additional NMSE reduction over pure tensor-based methods.
  arXiv  Detail & Related papers  (2026-02-03T23:38:05Z)
• Spectral Graph Clustering under Differential Privacy: Balancing Privacy, Accuracy, and Efficiency [53.98433419539793]
  We study the problem of spectral graph clustering under edge differential privacy (DP)<n>Specifically, we develop three mechanisms: (i) graph perturbation via randomized edge flipping combined with adjacency matrix shuffling, which enforces edge privacy; (ii) private graph projection with additive Gaussian noise in a lower-dimensional space to reduce dimensionality and computational complexity; and (iii) a noisy power iteration method that distributes Gaussian noise across iterations to ensure edge DP while maintaining convergence.
  arXiv  Detail & Related papers  (2025-10-08T15:30:27Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.