Vivek Sarin

Vivek Sarin

Auto-generated profile, based on publicly available information

Vivek Sarin

Department of Computer Science and Engineering Texas A&M University College Station TX

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
11 May 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JDJyotikrishna Dass
Jyotikrishna Dass
YNYashwardhan Narawane
Yashwardhan Narawane
RMRabi N. Mahapatra
Rabi N. Mahapatra
VSVivek Sarin
Vivek Sarin
Support Vector Machine (SVM) is a supervised machine learning model for classification tasks. Training SVM on a large number of data samples is challenging due to the high computational cost and memory requirement. Hence, model training is supported on a high-performance server which typically runs a sequential training algorithm on centralized data. However, as we move towards massive workloads, it will be impossible to store all the data in a centralized manner and expect such sequential training algorithms to scale on traditional processors. Moreover, with the growing demands of real-time machine learning for edge analytics, it is imperative to devise an efficient training framework with relatively cheaper computations and limited memory. Therefore, we propose and implement a first-of-its-kind system of multiple FPGAs as a distributed computing framework comprising up to eight FPGA units on Amazon F1 instances with negligible communication overhead to fully parallelize, accelerate, and scale the SVM training on decentralized data. Each FPGA unit has a pipelined SVM training IP logic core operating at 125 MHz with a power dissipation of 39 Watts for accelerating its allocated computations in the overall training process. We evaluate and compare the performance of the proposed system on five real SVM benchmarks.

19 October 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ETEmil Thomas
Emil Thomas
VSVivek Sarin
Vivek Sarin

19 May 2021 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ETEmil Thomas
Emil Thomas
VSVivek Sarin
Vivek Sarin

14 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
ZZZiqi Zhao
Ziqi Zhao
VSVivek Sarin
Vivek Sarin
Gaussian Process Regression (GPR) is an important type of supervised machine learning model with inherent uncertainty measure in its predictions. We propose a new framework, nuGPR, to address the well-known challenge of high computation cost associated with GPR training. Our framework includes several ideas from numerical linear algebra to reduce the amount of computation in key steps of GPR, and we combine them to establish an end-to-end training algorithm. Specifically, we leverage the preconditioned conjugate gradient method to accelerate the convergence of the linear solves required in GPR. We exploit clustering in the input data to identify block-diagonal structure of the covariance matrix and subsequently construct low-rank approximations of the off-diagonal blocks. These enhancements significantly reduce the time and space complexity of our computations. In addition, unlike other frameworks that rely on exact differentiation, we employ numerical gradients to optimize the hyperparameters of our GPR model, further reducing the training cost by eliminating the need for backpropagation. Lastly, we leverage the CUDA Toolkit to efficiently parallelize the training procedure on NVIDIA GPUs. As a result, nuGPR reduces total training time by up to 2x and peak memory consumption by up to 12x on various synthetic and real-world datasets when compared to the best existing GPU-based GPR implementation.