A tri-layer Ising hetero-associative memory with PCA-SimHash encoding achieves finite-size capacity scaling to an asymptotic limit near 0.5 and demonstrates cross-modal reconstruction on sleep polysomnography data.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
roles
baseline 1polarities
baseline 1representative citing papers
MicSA reduces random-number generation in Monte Carlo simulations for 3D Ising spin glasses, supporting massively parallel GPU execution whose dynamics map to standard results via time rescaling.
Diffusion models suffer critical slowing down when sampling near criticality in the O(n) model but deeper local architectures reduce training-time scaling from quadratic to logarithmic in system size.
Minimizing variance across choices in the parallel minority game is exactly equivalent to finding the ground state of the mean-field Sherrington-Kirkpatrick Ising spin glass.
Tiny PT-symmetric non-Hermitian terms added to two XX-coupled qubits increase the success probability of reaching the ground state in quantum annealing.
The paper provides the detailed geometric and computational methods for solving the spherical grasshopper problem in the context of Bell inequalities and singlet simulation.
citing papers explorer
-
Finite-size scaling of hetero-associative retrieval in continuous-signal-driven Ising spin systems
A tri-layer Ising hetero-associative memory with PCA-SimHash encoding achieves finite-size capacity scaling to an asymptotic limit near 0.5 and demonstrates cross-modal reconstruction on sleep polysomnography data.
-
Microcanonical simulated annealing: Massively parallel Monte Carlo simulations with sporadic random-number generation
MicSA reduces random-number generation in Monte Carlo simulations for 3D Ising spin glasses, supporting massively parallel GPU execution whose dynamics map to standard results via time rescaling.
-
The critical slowing down in diffusion models
Diffusion models suffer critical slowing down when sampling near criticality in the O(n) model but deeper local architectures reduce training-time scaling from quadratic to logarithmic in system size.
-
Spin Glass Mapping of the Parallel Minority Game
Minimizing variance across choices in the parallel minority game is exactly equivalent to finding the ground state of the mean-field Sherrington-Kirkpatrick Ising spin glass.
-
Quantum dynamics of two $XX$ interacting PT-symmetric non-Hermitian qubits: enhancement of quantum annealing
Tiny PT-symmetric non-Hermitian terms added to two XX-coupled qubits increase the success probability of reaching the ground state in quantum annealing.
-
The Grasshopper Problem on the Sphere
The paper provides the detailed geometric and computational methods for solving the spherical grasshopper problem in the context of Bell inequalities and singlet simulation.