Swanand Kadhe

Swanand Kadhe

Auto-generated profile, based on publicly available information

Swanand Kadhe

IBM Research

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
24 October 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SKSwanand Kadhe
Swanand Kadhe
BGBrenden Garcia
Brenden Garcia
AHAnoosheh Heidarzadeh
Anoosheh Heidarzadeh
SRSalim El Rouayheb
Salim El Rouayheb
ASAlex Sprintson
Alex Sprintson
We study the problem of Private Information Retrieval (PIR) in the presence of prior side information. The problem setup includes a database of $K$ independent messages possibly replicated on several servers, and a user that needs to retrieve one of these messages. In addition, the user has some prior side information in the form of a subset of $M$ messages, not containing the desired message and unknown to the servers. This problem is motivated by practical settings in which the user can obtain side information opportunistically from other users or has previously downloaded some messages using classical PIR schemes. The objective of the user is to retrieve the required message with downloading minimum amount of data from the servers while achieving information-theoretic privacy in one of the following two scenarios: (i) the user wants to protect jointly the identities of the demand and the side information; (ii) the user wants to protect only the identity of the demand, but not necessarily the side information. To highlight the role of side information, we focus first on the case of a single server (single database). In the first scenario, we prove that the minimum download cost is $K-M$ messages, and in the second scenario it is $\lceil K/(M+1)\rceil $ messages, which should be compared to $K$ messages—the minimum download cost in the case of no side information. Then, we extend some of our results to the case of the database replicated on multiple servers. Our proof techniques relate PIR with side information to the index coding problem. We leverage this connection to prove converse results, as well as to design achievability schemes.

11 September 2020 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
NRNarayanan Rengaswamy
Narayanan Rengaswamy
RCRobert Calderbank
Robert Calderbank
SKSwanand Kadhe
Swanand Kadhe
HPHenry D. Pfister
Henry D. Pfister
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in C N×N as a 2m × 2m binary symplectic matrix, where N = 2 m . We prove two theorems that use symplectic transvections to efficiently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary, we prove that for an [[m, k]] stabilizer code every logical Clifford operator has 2 r(r+1)/2 symplectic solutions, where r = m - k, up to stabilizer degeneracy. The desired physical circuits are then obtained by decomposing each solution into a product of elementary symplectic matrices, that correspond to elementary circuits. This enumeration of all physical realizations enables optimization over the ensemble with respect to a suitable metric. Furthermore, we show that any circuit that normalizes the stabilizer can be transformed into a circuit that centralizes the stabilizer, while realizing the same logical operation. Our method of circuit synthesis can be applied to any stabilizer code, and this paper discusses a proof of concept synthesis for the [[6, 4, 2]] CSS code. Programs implementing the algorithms in this article, which includes routines to solve for binary symplectic solutions of general linear systems and our overall LCS (logical circuit synthesis) algorithm, can be found at https://github.com/nrenga/symplectic-arxiv18a

4 October 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MAMehmet Aktas
Mehmet Aktas
GJGauri Joshi
Gauri Joshi
SKSwanand Kadhe
Swanand Kadhe
FKFatemeh Kazemi
Fatemeh Kazemi
ESEmina Soljanin
Emina Soljanin
Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objects can flexibly handle skews in the request rates. Coding can help boost the service rate region , that is, increase the overall volume of data access requests that the system can handle. This paper aims to postulate the service rate region as an important consideration in the design of erasure-coded distributed systems. We highlight several open problems that can be grouped into two broad threads: 1) characterizing the service rate region of a given code and finding the optimal request allocation, and 2) designing the underlying erasure code for a given service rate region. As contributions along the first thread, we find the rate regions of maximum-distance-separable, locally repairable, and simplex codes. We show the effectiveness of hybrid codes that combine replication and erasure coding in terms of code design. We also discover fundamental connections between multi-set batch codes and the problem of maximizing the service rate region.

16 August 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
AGAvishek Ghosh
Avishek Ghosh
RMRaj Kumar Maity
Raj Kumar Maity
SKSwanand Kadhe
Swanand Kadhe
AMArya Mazumdar
Arya Mazumdar
KRKannan Ramchandran
Kannan Ramchandran
We develop a communication-efficient distributed learning algorithm that is robust against Byzantine worker machines. We propose and analyze a distributed gradient-descent algorithm that performs a simple thresholding based on gradient norms to mitigate Byzantine failures. We show the (statistical) error-rate of our algorithm matches that of Yin et al. (2018), which uses more complicated schemes (coordinate-wise median, trimmed mean). Furthermore, for communication efficiency, we consider a generic class of $\delta $ -approximate compressors from Karimireddi et al. (2019) that encompasses sign-based compressors and top- $k$ sparsification. Our algorithm uses compressed gradients and gradient norms for aggregation and Byzantine removal respectively. We establish the statistical error rate for non-convex smooth loss functions. We show that, in certain range of the compression factor $\delta $ , the (order-wise) rate of convergence is not affected by the compression operation. Moreover, we analyze the compressed gradient descent algorithm with error feedback (proposed in Karimireddi et al. 2019) in a distributed setting and in the presence of Byzantine worker machines. We show that exploiting error feedback improves the statistical error rate. Finally, we experimentally validate our results and show good performance in convergence for convex (least-square regression) and non-convex (neural network training) problems.

11 August 2016
Verified
Conference Paper
Closed access
SKSwanand Kadhe
Swanand Kadhe
ASAlex Sprintson
Alex Sprintson
In many practical settings, there is a need to design distributed storage codes with certain locality constraints. For a code C, its i-th symbol is said to have locality r if it can be recovered by accessing some other r symbols of C. Locally repairable codes (LRCs) are the family of codes such that every symbol has small locality. In this paper, we focus on LRCs with unequal symbol locality, wherein different symbols of the code have different locality values. First, we consider a class of codes with unequal information locality, i.e., systematic codes with unequal locality constraints imposed only on the information symbols. For this class of codes, we compute a tight upper bound on the minimum distance as a function of locality constraints. We demonstrate that the construction of Pyramid codes by Huang et al. can be adapted to design optimal codes with unequal information locality that achieve the minimum distance bound. Next, we consider codes with unequal all-symbol locality, i.e., codes in which the locality constraints are imposed on all symbols. We establish an upper bound on the minimum distance as a function of number of symbols of each locality value. We show that the construction based on rank-metric codes by Silberstein et al. can be adapted to obtain optimal codes with unequal all-symbol locality. Finally, we introduce the concept of locality requirement of a code, which can be viewed as a recoverability requirement on symbols. Information locality requirement of a code essentially specifies the minimum number of information symbols of each locality value that must be present in the code. For a given locality requirement, we present a greedy algorithm to construct codes that have maximum minimum distance among all codes that satisfy the locality requirement.

1 January 2025
Verified
Conference Paper
Open access
PDF file
INIvoline C. Ngong
Ivoline C. Ngong
SKSwanand Ravindra Kadhe
Swanand Ravindra Kadhe
HWHao Wang
Hao Wang
KMKeerthiram Murugesan
Keerthiram Murugesan
JWJustin D. Weisz
Justin D. Weisz
KRKarthikeyan Natesan Ramamurthy
Karthikeyan Natesan Ramamurthy
Ivoline C. Ngong, Swanand Ravindra Kadhe, Hao Wang, Keerthiram Murugesan, Justin D. Weisz, Amit Dhurandhar, Karthikeyan Natesan Ramamurthy. Findings of the Association for Computational Linguistics: ACL 2025. 2025.