English

Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming

Machine Learning 2025-06-03 v1 Emerging Technologies

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 the potential of hybrid quantum-classical techniques in High-Performance Computing (HPC) environments for Big Data and Deep Learning. Fully realizing these benefits, however, requires a careful alignment of algorithmic structures with underlying quantum mechanisms.

Keywords

Cite

@article{arxiv.2506.00247,
  title  = {Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming},
  author = {Aasish Kumar Sharma and Sanjeeb Prashad Pandey and Julian M. Kunkel},
  journal= {arXiv preprint arXiv:2506.00247},
  year   = {2025}
}

Comments

11 pages, 22 figures, accepted in IEEE COMPSAC 2025 Conference. Preprint before peer review

R2 v1 2026-07-01T02:51:46.271Z