Parikshit Gopalan

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 44

Top Venues

CoRR

ITCS

NeurIPS

Electron. Colloquium Comput. Complex.

Publications

Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Shetty, Mihir Singhal
Omnipredictors for Regression and the Approximate Rank of Convex Functions. CoRR (2024)
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
On Computationally Efficient Multi-Class Calibration. CoRR (2024)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran
Loss Minimization Yields Multicalibration for Large Neural Networks. ITCS (2024)
Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Sherry, Mihir Singhal
Omnipredictors for regression and the approximate rank of convex functions. COLT (2024)
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
On Computationally Efficient Multi-Class Calibration. COLT (2024)
Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS (2023)
Aravind Gollakota, Parikshit Gopalan, Adam R. Klivans, Konstantinos Stavropoulos
Agnostically Learning Single-Index Models using Omnipredictors. NeurIPS (2023)
Aravind Gollakota, Parikshit Gopalan, Adam R. Klivans, Konstantinos Stavropoulos
Agnostically Learning Single-Index Models using Omnipredictors. CoRR (2023)
Parikshit Gopalan, Michael P. Kim, Omer Reingold
Characterizing notions of omniprediction via multicalibration. CoRR (2023)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Adam Tauman Kalai, Preetum Nakkiran
Loss minimization yields multicalibration for large neural networks. CoRR (2023)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran
A Unifying Theory of Distance from Calibration. STOC (2023)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran
When Does Optimizing a Proper Loss Yield Calibration? NeurIPS (2023)
Parikshit Gopalan, Michael P. Kim, Omer Reingold
Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration. NeurIPS (2023)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran
When Does Optimizing a Proper Loss Yield Calibration? CoRR (2023)
Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao
Low-Degree Multicalibration. CoRR (2022)
Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
Loss Minimization through the Lens of Outcome Indistinguishability. CoRR (2022)
Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
Multicalibrated Partitions for Importance Weights. ALT (2022)
Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran
A Unifying Theory of Distance from Calibration. CoRR (2022)
Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
Omnipredictors. ITCS (2022)
Mihai Budiu, Pratiksha Thaker, Parikshit Gopalan, Udi Wieder, Matei Zaharia
Overlook: Differentially Private Exploratory Visualization for Big Data. J. Priv. Confidentiality 12 (1) (2022)
Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder
KL Divergence Estimation with Multi-group Attribution. CoRR (2022)
Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao
Low-Degree Multicalibration. COLT (2022)
Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
Omnipredictors. CoRR (2021)
Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
Multicalibrated Partitions for Importance Weights. CoRR (2021)
Parikshit Gopalan, Roie Levin, Udi Wieder
Finding Skewed Subcubes Under a Distribution. ITCS (2020)
Parikshit Gopalan, Amir Yehudayoff
Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials. Theory Comput. 16 (2020)
Pratiksha Thaker, Mihai Budiu, Parikshit Gopalan, Udi Wieder, Matei Zaharia
Overlook: Differentially Private Exploratory Visualization for Big Data. CoRR (2020)
Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera
Hillview: A trillion-cell spreadsheet for big data. Proc. VLDB Endow. 12 (11) (2019)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
PIDForest: Anomaly Detection via Partial Identification. CoRR (2019)
Mihai Budiu, Parikshit Gopalan, Lalith Suresh, Udi Wieder, Han Kruiger, Marcos K. Aguilera
Hillview: A trillion-cell spreadsheet for big data. CoRR (2019)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
PIDForest: Anomaly Detection via Partial Identification. NeurIPS (2019)
Parikshit Gopalan, Roie Levin, Udi Wieder
Finding Skewed Subcubes Under a Distribution. CoRR (2019)
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
Public Projects, Boolean Functions, and the Borders of Border's Theorem. ACM Trans. Economics and Comput. 6 (3-4) (2018)
Vatsal Sharan, Parikshit Gopalan, Udi Wieder
Efficient Anomaly Detection via Matrix Sketching. NeurIPS (2018)
Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala
Stable and Consistent Membership at Scale with Rapid. USENIX Annual Technical Conference (2018)
Parikshit Gopalan, Vatsal Sharan, Udi Wieder
Faster Anomaly Detection via Matrix Sketching. CoRR (2018)
Parikshit Gopalan, Daniel M. Kane, Raghu Meka
Pseudorandomness via the Discrete Fourier Transform. SIAM J. Comput. 47 (6) (2018)
Lalith Suresh, Dahlia Malkhi, Parikshit Gopalan, Ivan Porto Carreiro, Zeeshan Lokhandwala
Stable and Consistent Membership at Scale with Rapid. CoRR (2018)
Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin
Maximally Recoverable Codes for Grid-like Topologies. SODA (2017)
Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin
Maximally Recoverable Codes for Grid-like Topologies. CoRR (2016)
Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson
Degree and Sensitivity: tails of two distributions. Electron. Colloquium Comput. Complex. 23 (2016)
Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson
Degree and Sensitivity: tails of two distributions. CoRR (2016)
Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson
Degree and Sensitivity: Tails of Two Distributions. Computational Complexity Conference (2016)
Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS (2016)
Parikshit Gopalan, Daniel M. Kane, Raghu Meka
Pseudorandomness via the Discrete Fourier Transform. FOCS (2015)
Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR (2015)
Parikshit Gopalan, Daniel M. Kane, Raghu Meka
Pseudorandomness via the discrete Fourier transform. CoRR (2015)
Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. 22 (2015)
Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
Making the Long Code Shorter. SIAM J. Comput. 44 (5) (2015)
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
Public projects, Boolean functions and the borders of Border's theorem. CoRR (2015)
Parikshit Gopalan, Noam Nisan, Tim Roughgarden
Public Projects, Boolean Functions, and the Borders of Border's Theorem. EC (2015)
Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin
Explicit Maximally Recoverable Codes With Locality. IEEE Trans. Inf. Theory 60 (9) (2014)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally testable codes and cayley graphs. ITCS (2014)
Parikshit Gopalan, Amir Yehudayoff
Inequalities and tail bounds for elementary symmetric polynomial. CoRR (2014)
Parikshit Gopalan, Daniel M. Kane, Raghu Meka
Pseudorandomness for concentration bounds and signed majorities. CoRR (2014)
Parikshit Gopalan
Constructing Ramsey graphs from Boolean function representations. Comb. 34 (2) (2014)
Parikshit Gopalan, Amir Yehudayoff
Inequalities and tail bounds for elementary symmetric polynomials. Electron. Colloquium Comput. Complex. 21 (2014)
Rodolfo Azevedo, John D. Davis, Karin Strauss, Parikshit Gopalan, Mark S. Manasse, Sergey Yekhanin
Zombie memory: extending memory lifetime by reviving dead blocks. ISCA (2013)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. 20 (2013)
Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin
Explicit Maximally Recoverable Codes with Locality. Electron. Colloquium Comput. Complex. 20 (2013)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. 42 (3) (2013)
Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin
Explicit Maximally Recoverable Codes with Locality. CoRR (2013)
Parikshit Gopalan, Raghu Meka, Omer Reingold
DNF sparsification and a faster deterministic counting algorithm. Comput. Complex. 22 (2) (2013)
Parikshit Gopalan
A Fourier-Analytic Approach to Reed-Muller Decoding. IEEE Trans. Inf. Theory 59 (11) (2013)
Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou
Locally Testable Codes and Cayley Graphs. CoRR (2013)
Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
Better Pseudorandom Generators from Milder Pseudorandom Restrictions CoRR (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. 19 (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold
DNF Sparsification and a Faster Deterministic Counting. Electron. Colloquium Comput. Complex. 19 (2012)
Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, Sergey Yekhanin
Erasure Coding in Windows Azure Storage. USENIX Annual Technical Conference (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold
DNF Sparsification and a Faster Deterministic Counting Algorithm. Computational Complexity Conference (2012)
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin
On the Locality of Codeword Symbols. IEEE Trans. Inf. Theory 58 (11) (2012)
Parikshit Gopalan, Adam R. Klivans, Raghu Meka
Learning Functions of Halfspaces using Prefix Covers. COLT (2012)
Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
Making the Long Code Shorter. FOCS (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS (2012)
Parikshit Gopalan, Raghu Meka, Omer Reingold
DNF Sparsification and a Faster Deterministic Counting Algorithm CoRR (2012)
Parikshit Gopalan, Venkatesan Guruswami
Hardness amplification within NP against deterministic algorithms. J. Comput. Syst. Sci. 77 (1) (2011)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. SIAM J. Comput. 40 (4) (2011)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom generators for combinatorial shapes. STOC (2011)
Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
Making the long code shorter, with applications to the Unique Games Conjecture CoRR (2011)
Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra
List Decoding Tensor Products and Interleaved Codes. SIAM J. Comput. 40 (5) (2011)
Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
An FPTAS for #Knapsack and Related Counting Problems. FOCS (2011)
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin
On the Locality of Codeword Symbols CoRR (2011)
Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer
Making the long code shorter, with applications to the Unique Games Conjecture. Electron. Colloquium Comput. Complex. 18 (2011)
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer
Testing Fourier Dimensionality and Sparsity. SIAM J. Comput. 40 (4) (2011)
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin
On the Locality of Codeword Symbols. Electron. Colloquium Comput. Complex. 18 (2011)
Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola
Bounded Independence Fools Halfspaces. SIAM J. Comput. 39 (8) (2010)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. Electron. Colloquium Comput. Complex. 17 (2010)
Parikshit Gopalan
A Fourier-Analytic Approach to Reed-Muller Decoding. FOCS (2010)
Parikshit Gopalan, Subhash Khot, Rishi Saket
Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. 39 (6) (2010)
Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. 17 (2010)
Parikshit Gopalan, Amir Shpilka, Shachar Lovett
The Complexity of Boolean Functions in Different Characteristics. Comput. Complex. 19 (2) (2010)
Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan
Fooling functions of halfspaces under product distributions. Electron. Colloquium Comput. Complex. 17 (2010)
Parikshit Gopalan, Adam R. Klivans, Raghu Meka
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs CoRR (2010)
Parikshit Gopalan, Rocco A. Servedio
with Threshold Gates. Electron. Colloquium Comput. Complex. 17 (2010)
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
Fooling Functions of Halfspaces under Product Distributions. Computational Complexity Conference (2010)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. FOCS (2010)
Anna Gál, Parikshit Gopalan
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. SIAM J. Comput. 39 (8) (2010)
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman
Fooling functions of halfspaces under product distributions CoRR (2010)
Parikshit Gopalan, Rocco A. Servedio
with Threshold Gates. APPROX-RANDOM (2010)
Parikshit Gopalan, Adam R. Klivans, Raghu Meka
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Electron. Colloquium Comput. Complex. 17 (2010)

Parikshit Gopalan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Parikshit Gopalan