4 citations · 15 across the 9 of their papers we have counts for
10 papers
TsSHAP: Robust model agnostic feature-based explainability for time series forecasting
Vikas C. Raykar, Arindam Jati, Sumanta Mukherjee +4
A trustworthy machine learning model should be accurate as well as explainable. Understanding why a model makes a certain decision defines the notion of explainability. While vario…
Efficient Pruning for Machine Learning Under Homomorphic Encryption
Ehud Aharoni, Moran Baruch, Pradip Bose +8
Privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. Among these, many rely on homomorphic encryption (HE) that offers confidentiality of the mod…
Efficient Encrypted Inference on Ensembles of Decision Trees
Kanthi Sarpatwar, Karthik Nandakumar, Nalini Ratha +4
Data privacy concerns often prevent the use of cloud-based machine learning services for sensitive personal data. While homomorphic encryption (HE) offers a potential solution by e…
Differentially Private Distributed Data Summarization under Covariate Shift
Kanthi Sarpatwar, Karthikeyan Shanmugam, Venkata Sitaramagiridharganesh Ganapavarapu +2
We envision AI marketplaces to be platforms where consumers, with very less data for a target task, can obtain a relevant model by accessing many private data sources with vast num…
Generalized Assignment via Submodular Optimization with Reserved Capacity
Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber +1
We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set of items, partitioned into group…
The Preemptive Resource Allocation Problem
Kanthi Sarpatwar, Baruch Schieber, 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 resource…
Constrained Submodular Maximization via Greedy Local Search
Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
We present a simple combinatorial -approximation algorithm for maximizing a monotone submodular function subject to a knapsack and a matroid constraint. This c…
Approximation Algorithms for Connected Maximum Cut and Related Problems
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid +2
An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S V that maximizes the number o…
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
Samir Khuller, Manish Purohit, Kanthi Sarpatwar
We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem, we are given an undirected graph G = (…
Hardness and Parameterized Algorithms on Rainbow Connectivity problem
Prabhanjan Ananth, Meghana Nasre, Kanthi K Sarpatwar
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists…