Prasanna Date

Prasanna Date

Auto-generated profile, based on publicly available information

Prasanna Date

Oak Ridge National Laboratory Oak Ridge Tennessee USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2022 in Nature Computational Science
Verified
Journal Article
Closed access
PDF file
CSCatherine Schuman
Catherine Schuman
SKShruti R. Kulkarni
Shruti R. Kulkarni
MPMaryam Parsa
Maryam Parsa
JMJ. Parker Mitchell
J. Parker Mitchell
PDPrasanna Date
Prasanna Date
BKBill Kay
Bill Kay

11 May 2021 in Scientific Reports
Verified
Journal Article
Open access
PDF file
PDPrasanna Date
Prasanna Date
DADavis Arthur
Davis Arthur
LPLauren Pusey-Nazzaro
Lauren Pusey-Nazzaro
Training machine learning models on classical computers is usually a time and compute intensive process. With Moore’s law nearing its inevitable end and an ever-increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers can approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore’s law era. In order to solve problems on adiabatic quantum computers, they must be formulated as QUBO problems, which is very challenging. In this paper, we formulate the training problems of three machine learning models—linear regression, support vector machine (SVM) and balanced k-means clustering—as QUBO problems, making them conducive to be trained on adiabatic quantum computers. We also analyze the computational complexities of our formulations and compare them to corresponding state-of-the-art classical approaches. We show that the time and space complexities of our formulations are better (in case of SVM and balanced k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

9 November 2021 in Scientific Reports
Verified
Journal Article
Open access
PDF file
PDPrasanna Date
Prasanna Date
TPThomas Potok
Thomas Potok
A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up significant amount of time on classical computers. Adiabatic quantum computers have been shown to excel at solving optimization problems, and therefore, we believe, present a promising alternative to improve machine learning training times. In this paper, we present an adiabatic quantum computing approach for training a linear regression model. In order to do this, we formulate the regression problem as a quadratic unconstrained binary optimization (QUBO) problem. We analyze our quantum approach theoretically, test it on the D-Wave adiabatic quantum computer and compare its performance to a classical approach that uses the Scikit-learn library in Python. Our analysis shows that the quantum approach attains up to $${2.8 \times }$$ 2.8 × speedup over the classical approach on larger datasets, and performs at par with the classical approach on the regression error metric. The quantum approach used the D-Wave 2000Q adiabatic quantum computer, whereas the classical approach used a desktop workstation with an 8-core Intel i9 processor. As such, the results obtained in this work must be interpreted within the context of the specific hardware and software implementations of these machines.

5 March 2019 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
PDPrasanna Date
Prasanna Date
RPRobert Patton
Robert Patton
CSCatherine Schuman
Catherine Schuman
TPThomas Potok
Thomas Potok

4 September 2021 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
DADavis Arthur
Davis Arthur
PDPrasanna Date
Prasanna Date

1 July 2020
Verified
Conference Paper
Closed access
CSCatherine D. Schuman
Catherine D. Schuman
JMJ. Parker Mitchell
J. Parker Mitchell
JJJ. Travis Johnston
J. Travis Johnston
MPMaryam Parsa
Maryam Parsa
BKBill Kay
Bill Kay
RPRobert M. Patton
Robert M. Patton
Though robustness and resilience are commonly quoted as features of neuromorphic computing systems, the expected performance of neuromorphic systems in the face of hardware failures is not clear. In this work, we study the effect of failures on the performance of four different training algo-rithms for spiking neural networks on neuromorphic systems: two back-propagation-based training approaches (Whetstone and SLAYER), a liquid state machine or reservoir computing approach, and an evolutionary optimization-based approach (EONS). We show that these four different approaches have very different resilience characteristics with respect to simulated hardware failures. We then analyze an approach for training more resilient spiking neural networks using the evolutionary optimization approach. We show how this approach produces more resilient networks and discuss how it can be extended to other spiking neural network training approaches as well.