Pith. sign in

REVIEW 2 cited by

Training Multi-layer Neural Networks on Ising Machine

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.03408 v1 pith:BSE674ZM submitted 2023-11-06 cs.LG cs.AIcs.NEquant-ph

classification cs.LGcs.AIcs.NEquant-ph
keywords isingbinaryalgorithmnetworkstrainfunctionmachinesneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

As a dedicated quantum device, Ising machines could solve large-scale binary optimization problems in milliseconds. There is emerging interest in utilizing Ising machines to train feedforward neural networks due to the prosperity of generative artificial intelligence. However, existing methods can only train single-layer feedforward networks because of the complex nonlinear network topology. This paper proposes an Ising learning algorithm to train quantized neural network (QNN), by incorporating two essential techinques, namely binary representation of topological network and order reduction of loss function. As far as we know, this is the first algorithm to train multi-layer feedforward networks on Ising machines, providing an alternative to gradient-based backpropagation. Firstly, training QNN is formulated as a quadratic constrained binary optimization (QCBO) problem by representing neuron connection and activation function as equality constraints. All quantized variables are encoded by binary bits based on binary encoding protocol. Secondly, QCBO is converted to a quadratic unconstrained binary optimization (QUBO) problem, that can be efficiently solved on Ising machines. The conversion leverages both penalty function and Rosenberg order reduction, who together eliminate equality constraints and reduce high-order loss function into a quadratic one. With some assumptions, theoretical analysis shows the space complexity of our algorithm is $\mathcal{O}(H^2L + HLN\log H)$, quantifying the required number of Ising spins. Finally, the algorithm effectiveness is validated with a simulated Ising machine on MNIST dataset. After annealing 700 ms, the classification accuracy achieves 98.3%. Among 100 runs, the success probability of finding the optimal solution is 72%. Along with the increasing number of spins on Ising machine, our algorithm has the potential to train deeper neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. EPIC-CIM: Training Convolutional Neural Networks on a Coherent Ising Machine via Equilibrium Propagation

    quant-ph 2026-07 reject novelty 4.0 of 10

    An energy-based CIM training scheme with equilibrium propagation reportedly reaches 92.3% MNIST test accuracy, but lacks a valid derivation and reproducible details.

  2. Exact and Asymptotically Complete Robust Verifications of Neural Networks via Ising Solvers

    cs.LG 2026-02 reject novelty 4.0 of 10

    A QUBO-based neural-network verification framework claims logarithmic spin complexity and asymptotically complete bounds, but the logarithmic encoding is not in the equations and the convergence theorem is unproved.

Pith tools