Sivakanth Gopi

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 72

Top Topics

Convex Optimization

Constraint Satisfaction

Locally Decodable Codes

Top Venues

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

Publications

Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. CoRR (2024)
Da Yu, Sivakanth Gopi, Janardhan Kulkarni, Zinan Lin, Saurabh Naik, Tomasz Lukasz Religa, Jian Yin, Huishuai Zhang
Selective Pre-training for Private Fine-tuning. Trans. Mach. Learn. Res. 2024 (2024)
Xinyu Tang, Richard Shin, Huseyin A. Inan, Andre Manoel, Fatemehsadat Mireshghallah, Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Robert Sim
Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation. ICLR (2024)
Joshua Brakensiek, Manik Dhar, Jiyang Gao, Sivakanth Gopi, Matt Larson
Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes. CoRR (2024)
Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. ICLR (2024)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang
AG Codes Achieve List Decoding Capacity over Constant-Sized Fields. STOC (2024)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi
Generalized GM-MDS: Polynomial Codes Are Higher Order MDS. STOC (2024)
Suriya Gunasekar, Yi Zhang, Jyoti Aneja, Caio César Teodoro Mendes, Allie Del Giorno, Sivakanth Gopi, Mojan Javaheripi, Piero Kauffmann, Gustavo de Rosa, Olli Saarikivi, Adil Salim, Shital Shah, Harkirat Singh Behl, Xin Wang, Sébastien Bubeck, Ronen Eldan, Adam Tauman Kalai, Yin Tat Lee, Yuanzhi Li
Textbooks Are All You Need. CoRR (2023)
Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. CoRR (2023)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi
Generalized GM-MDS: Polynomial Codes are Higher Order MDS. CoRR (2023)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang
AG codes achieve list decoding capacity over contant-sized fields. CoRR (2023)
Xinyu Tang, Richard Shin, Huseyin A. Inan, Andre Manoel, Fatemehsadat Mireshghallah, Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Robert Sim
Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation. CoRR (2023)
Da Yu, Sivakanth Gopi, Janardhan Kulkarni, Zinan Lin, Saurabh Naik, Tomasz Lukasz Religa, Jian Yin, Huishuai Zhang
Selective Pre-training for Private Fine-tuning. CoRR (2023)
Manik Dhar, Sivakanth Gopi
A construction of Maximally Recoverable LRCs for small number of local groups. ISIT (2023)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi
Improved Field Size Bounds for Higher Order MDS Codes. ISIT (2023)
Joshua Brakensiek, Sivakanth Gopi, Visu Makam
Generic Reed-Solomon Codes Achieve List-Decoding Capacity. STOC (2023)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler. CoRR (2023)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler. COLT (2023)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian
Private Convex Optimization in General Norms. SODA (2023)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu
Private Convex Optimization via Exponential Mechanism. COLT (2022)
Sivakanth Gopi, Venkatesan Guruswami
Improved Maximally Recoverable LRCs Using Skew Polynomials. IEEE Trans. Inf. Theory 68 (11) (2022)
Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang
Differentially Private Fine-tuning of Language Models. ICLR (2022)
Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. SIAM J. Comput. 51 (3) (2022)
Manik Dhar, Sivakanth Gopi
A construction of Maximally Recoverable LRCs for small number of local groups. CoRR (2022)
Joshua Brakensiek, Sivakanth Gopi, Visu Makam
Generic Reed-Solomon codes achieve list-decoding capacity. CoRR (2022)
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi
Improved Field Size Bounds for Higher Order MDS Codes. CoRR (2022)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu
Private Convex Optimization via Exponential Mechanism. CoRR (2022)
Joshua Brakensiek, Sivakanth Gopi, Visu Makam
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes. IEEE Trans. Inf. Theory 68 (11) (2022)
Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian
Private Convex Optimization in General Norms. CoRR (2022)
Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee, Judy Hanwen Shen, Uthaipon Tantipongpipat
Fast and Memory Efficient Differentially Private-SGD via JL Projections. CoRR (2021)
Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin
Differentially Private n-gram Extraction. NeurIPS (2021)
Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee, Judy Hanwen Shen, Uthaipon Tantipongpipat
Fast and Memory Efficient Differentially Private-SGD via JL Projections. NeurIPS (2021)
Sivakanth Gopi, Venkatesan Guruswami
Improved Maximally Recoverable LRCs using Skew Polynomials. Electron. Colloquium Comput. Complex. 28 (2021)
Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin
Differentially Private Set Union. J. Priv. Confidentiality 11 (3) (2021)
Joshua Brakensiek, Sivakanth Gopi, Visu Makam
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes. CoRR (2021)
Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. ISIT (2021)
Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. CoRR (2021)
Sivakanth Gopi, Yin Tat Lee, Lukas Wutschitz
Numerical Composition of Differential Privacy. CoRR (2021)
Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang
Differentially Private Fine-tuning of Language Models. CoRR (2021)
Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin
Differentially Private n-gram Extraction. CoRR (2021)
Sivakanth Gopi, Yin Tat Lee, Lukas Wutschitz
Numerical Composition of Differential Privacy. NeurIPS (2021)
Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang
Locally Private Hypothesis Selection. CoRR (2020)
Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin
Differentially Private Set Union. ICML (2020)
Sivakanth Gopi, Venkatesan Guruswami
Improved Maximally Recoverable LRCs using Skew Polynomials. CoRR (2020)
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49 (3) (2020)
Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin
Differentially Private Set Union. CoRR (2020)
Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities. IEEE Trans. Inf. Theory 66 (10) (2020)
Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang
Locally Private Hypothesis Selection. COLT (2020)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw Distributions and Locally Decodable Codes. Theory Comput. 15 (2019)
Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. CoRR (2019)
Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. SODA (2019)
Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Electron. Colloquium Comput. Complex. 26 (2019)
Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami
CSPs with global modular constraints: algorithms and hardness via polynomial representations. STOC (2019)
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS (2019)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64 (8) (2018)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. IEEE Trans. Inf. Theory 64 (9) (2018)
Zeev Dvir, Sivakanth Gopi, Avi Wigderson
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR (2018)
Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal
Lower Bounds for 2-Query LCCs over Large Alphabet. APPROX-RANDOM (2017)
Jop Briët, Sivakanth Gopi
Gaussian width bounds with applications to arithmetic progressions in random settings. CoRR (2017)
Arnab Bhattacharyya, Sivakanth Gopi
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. ACM Trans. Comput. Theory 9 (2) (2017)
Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin
On Maximally Recoverable Local Reconstruction Codes. Electron. Colloquium Comput. Complex. 24 (2017)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw Distributions and Locally Decodable Codes. ITCS (2017)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
ranking problem. SODA (2017)
Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin
On Maximally Recoverable Local Reconstruction Codes. CoRR (2017)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA (2017)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw distributions and locally decodable codes. CoRR (2016)
Arnab Bhattacharyya, Sivakanth Gopi
Lower bounds for 2-query LCCs over large alphabet. Electron. Colloquium Comput. Complex. 23 (2016)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with Subpolynomial Communication. J. ACM 63 (4) (2016)
Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider
Competitive analysis of the top-K ranking problem. CoRR (2016)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. 23 (2016)
Arnab Bhattacharyya, Sivakanth Gopi
Lower bounds for 2-query LCCs over large alphabet. CoRR (2016)
Arnab Bhattacharyya, Sivakanth Gopi
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. Computational Complexity Conference (2016)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with Sub-Polynomial Communication. STOC (2015)
Arnab Bhattacharyya, Sivakanth Gopi
Lower bounds for constant query affine-invariant LCCs and LTCs. Electron. Colloquium Comput. Complex. 22 (2015)
Arnab Bhattacharyya, Sivakanth Gopi
Lower bounds for constant query affine-invariant LCCs and LTCs. CoRR (2015)
Zeev Dvir, Sivakanth Gopi
On the Number of Rich Lines in Truly High Dimensional Sets. SoCG (2015)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with sub-polynomial communication. CoRR (2014)
Zeev Dvir, Sivakanth Gopi
On the number of rich lines in truly high dimensional sets. CoRR (2014)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with sub-polynomial communication. Electron. Colloquium Comput. Complex. 21 (2014)
Pavol Cerný, Sivakanth Gopi, Thomas A. Henzinger, Arjun Radhakrishna, Nishant Totla
Synthesis from incompatible specifications. EMSOFT (2012)