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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sharma, Aasish Kumar, Pandey, Sanjeeb Prashad, Kunkel, Julian M.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912405503606784
author Sharma, Aasish Kumar
Pandey, Sanjeeb Prashad
Kunkel, Julian M.
author_facet Sharma, Aasish Kumar
Pandey, Sanjeeb Prashad
Kunkel, Julian M.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2506_00247
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming
Sharma, Aasish Kumar
Pandey, Sanjeeb Prashad
Kunkel, Julian M.
Machine Learning
Emerging Technologies
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.
title Performance Analysis of Convolutional Neural Network By Applying Unconstrained Binary Quadratic Programming
topic Machine Learning
Emerging Technologies
url https://arxiv.org/abs/2506.00247