Kanthi Sarpatwar

Kanthi Sarpatwar

Auto-generated profile, based on publicly available information

Kanthi Sarpatwar

IBM Research, Yorktown Heights, NY, USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 March 2019 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
DDD. N. Dillenberger
D. N. Dillenberger
PNP. Novotny
P. Novotny
QZQ. Zhang
Q. Zhang
PJP. Jayachandran
P. Jayachandran
HGH. Gupta
H. Gupta
KSK. Sarpatwar
K. Sarpatwar

4 August 2023
Verified
Conference Paper
Open access
GGGiridhar Ganapavarapu
Giridhar Ganapavarapu
SMSumanta Mukherjee
Sumanta Mukherjee
NGNatalia Martinez Gil
Natalia Martinez Gil
KSKanthi Sarpatwar
Kanthi Sarpatwar
ARAmaresh Rajasekharan
Amaresh Rajasekharan
RVRoman Vaculin
Roman Vaculin
With the growing adoption of AI, trust and explainability have become critical which has attracted a lot of research attention over the past decade and has led to the development of many popular AI explainability libraries such as AIX360, Alibi, OmniXAI, etc. Despite that, applying explainability techniques in practice often poses challenges such as lack of consistency between explainers, semantically incorrect explanations, or scalability. Furthermore, one of the key modalities that has been less explored, both from the algorithmic and practice point of view, is time-series. Several application domains involve time-series including Industry 4.0, asset monitoring, supply chain or finance to name a few. The AIX360 library (https://github.com/Trusted-AI/AIX360) has been incubated by the Linux Foundation AI & Data open-source projects and it has gained significant popularity: its public GitHub repository has over 1.3K stars and has been broadly adopted in the academic and applied settings. Motivated by industrial applications, large scale client projects and deployments in software products in the areas of IoT, asset management or supply chain, the AIX360 library has been recently expanded significantly to address the above challenges. AIX360 now includes new techniques including support for time-series modality introducing time series based explainers such as TS-LIME, TS Saliency explainer, TS-ICE and TS-SHAP. It also introduces improvements in generating model agnostic, consistent, diverse, and scalable explanations, and new algorithms for tabular data. In this hands-on tutorial, we provide an overview of the library with the focus on the latest additions, time series explainers and use cases such as forecasting, time series anomaly detection or classification, and hands-on demonstrations based on industrial use-cases selected to demonstrate practical challenges and how they are addressed. The audience will be able to evaluate different types of explanations with a focus on practical aspects motivated by real deployments.

12 November 2015
Verified
Book Chapter
Closed access
PDF file
MHMohammad Taghi Hajiaghayi
Mohammad Taghi Hajiaghayi
GKGuy Kortsarz
Guy Kortsarz
RMRobert MacDavid
Robert MacDavid
MPManish Purohit
Manish Purohit
KSKanthi Sarpatwar
Kanthi Sarpatwar

21 June 2023 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
KSKanthi Sarpatwar
Kanthi Sarpatwar
BSBaruch Schieber
Baruch Schieber
HSHadas Shachnai
Hadas Shachnai

1 January 2018 in Information Processing Letters
Verified
Journal Article
Closed access
RGRajiv Gandhi
Rajiv Gandhi
MHMohammad Taghi Hajiaghayi
Mohammad Taghi Hajiaghayi
GKGuy Kortsarz
Guy Kortsarz
MPManish Purohit
Manish Purohit
KSKanthi Sarpatwar
Kanthi Sarpatwar

18 November 2018 in arXiv
Verified
Preprint
Open access
PDF file
KSKanthi Sarpatwar
Kanthi Sarpatwar
BSBaruch Schieber
Baruch Schieber
HSHadas Shachnai
Hadas Shachnai
We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following variants of the classic {\em resource allocation problem} (\textsf{RAP}). The input to our problems is a set $J$ of jobs and a set $M$ of homogeneous hosts, each has an available amount of some resource. A job is associated with a release time, a due date, a weight, and a given length, as well as its resource requirement. A \emph{feasible} schedule is an allocation of the resource to a subset of the jobs, satisfying the job release times/due dates as well as the resource constraints. A crucial distinction between classic {\textsf{RAP}} and our problems is that we allow preemption and migration of jobs, motivated by virtualization techniques. We consider two natural objectives: {\em throughput maximization} (\textsf{MaxT}), which seeks a maximum weight subset of the jobs that can be feasibly scheduled on the hosts in $M$, and {\em resource minimization} (\textsf{MinR}), that is finding the minimum number of (homogeneous) hosts needed to feasibly schedule all jobs. Both problems are known to be NP-hard. We first present a $\Omega(1)$-approximation algorithm for \textsf{MaxT} instances where time-windows form a laminar family of intervals. We then extend the algorithm to handle instances with arbitrary time-windows, assuming there is sufficient slack for each job to be completed. For \textsf{MinR} we study a more general setting with $d$ resources and derive an $O(\log d)$-approximation for any fixed $d \geq 1$, under the assumption that time-windows are not too small. This assumption can be removed leading to a slightly worse ratio of $O(\log d\log^* T)$, where $T$ is the maximum due date of any job.