12 citations · 19 across the 6 of their papers we have counts for
6 papers
On the Query Complexity of Training Data Reconstruction in Private Learning
Prateeti Mukherjee, Satya Lokam
We analyze the number of queries that a whitebox adversary needs to make to a private learner in order to reconstruct its training data. For DP learners with training data…
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions
Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu +2
The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function , the Fourier entropy of is at most its influence up to a unive…
-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman
-Minimum Storage Regenerating (-MSR) codes form a special class of Maximum Distance Separable (MDS) codes, providing mechanisms for exact regeneration of a single code block…
Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes
V. Lalitha, Satyanarayana V. Lokam
In this paper, we establish the matroid structures corresponding to data-local and local maximally recoverable codes (MRC). The matroid structures of these codes can be used to det…
On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method
Chia-Jung Lee, Satya V. Lokam, Shi-Chun Tsai +1
Let be the set of Boolean functions depending on all variables. We prove that for any , or depends on the…
Using Elimination Theory to construct Rigid Matrices
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar +1
The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introd…