Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming
Aasish Kumar Sharma, Sanjeeb Prashad Pandey, Julian M. Kunkel

TL;DR
This paper introduces a hybrid quantum-classical optimization method combining UBQP and SGD to improve CNN training efficiency and accuracy, demonstrating promising results on the MNIST dataset.
Contribution
It presents a novel hybrid optimization approach integrating UBQP with SGD for CNN training, leveraging quantum computing concepts.
Findings
Achieves 10-15% accuracy improvement over standard BP-CNN.
Maintains similar execution times to traditional training.
Shows potential of hybrid quantum-classical methods in HPC for deep learning.
Abstract
Convolutional Neural Networks (CNNs) are pivotal in computer vision and Big Data analytics but demand significant computational resources when trained on large-scale datasets. Conventional training via back-propagation (BP) with losses like Mean Squared Error or Cross-Entropy often requires extensive iterations and may converge sub-optimally. Quantum computing offers a promising alternative by leveraging superposition, tunneling, and entanglement to search complex optimization landscapes more efficiently. In this work, we propose a hybrid optimization method that combines an Unconstrained Binary Quadratic Programming (UBQP) formulation with Stochastic Gradient Descent (SGD) to accelerate CNN training. Evaluated on the MNIST dataset, our approach achieves a 10--15\% accuracy improvement over a standard BP-CNN baseline while maintaining similar execution times. These results illustrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
