Rishi Saket - RankMe

84 papers A* 16A 15Journal 38Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Aggregating Data for Optimal Learning. UAI Sushant Agarwal, Yukti Makhija, Rishi Saket, Aravindan Raghuveer
2025	J	`jnl`	Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets. CoRR Aaryan Gupta, Rishi Saket, Aravindan Raghuveer
2025	J	`jnl`	Dense and Diverse Goal Coverage in Multi Goal Reinforcement Learning. CoRR Sagalpreet Singh, Rishi Saket, Aravindan Raghuveer
2025	—	`conf`	FRACTAL: Fine-Grained Scoring from Aggregate Text Labels. ACL (1) Yukti Makhija, Priyanka Agrawal, Rishi Saket, Aravindan Raghuveer
2025	A	`conf`	Learning Algorithms for Multiple Instance Regression. UAI Aaryan Gupta, Rishi Saket
2025	A	`conf`	Learning from Label Proportions and Covariate-shifted Instances. UAI Sagalpreet Singh, Navodita Sharma, Shreyas Havaldar, Rishi Saket, Aravindan Raghuveer
2025	A	`conf`	Weak to Strong Learning from Aggregate Labels. UAI Yukti Makhija, Rishi Saket
2024	J	`jnl`	Aggregating Data for Optimal and Private Learning. CoRR Sushant Agarwal, Yukti Makhija, Rishi Saket, Aravindan Raghuveer
2024	J	`jnl`	FRACTAL: Fine-Grained Scoring from Aggregate Text Labels. CoRR Yukti Makhija, Priyanka Agrawal, Rishi Saket, Aravindan Raghuveer
2024	A	`conf`	Generalization and Learnability in Multiple Instance Regression. UAI Kushal Chauhan, Rishi Saket, Lorne Applebaum, Ashwinkumar Badanidiyuru, Chandan Giri, Aravindan Raghuveer
2024	J	`jnl`	Hardness of Learning Boolean Functions from Label Proportions. CoRR Venkatesan Guruswami, Rishi Saket
2024	A	`conf`	LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions. CIKM Anand Brahmbhatt, Mohith Pokala, Rishi Saket, Aravindan Raghuveer
2024	J	`jnl`	Learning from Label Proportions and Covariate-shifted Instances. CoRR Sagalpreet Singh, Navodita Sharma, Shreyas Havaldar, Rishi Saket, Aravindan Raghuveer
2024	J	`jnl`	Weak to Strong Learning from Aggregate Labels. CoRR Yukti Makhija, Rishi Saket
2023	—	`conf`	Hardness of Learning Boolean Functions from Label Proportions. FSTTCS Venkatesan Guruswami, Rishi Saket
2023	J	`jnl`	LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions. CoRR Anand Brahmbhatt, Mohith Pokala, Rishi Saket, Aravindan Raghuveer
2023	J	`jnl`	Label Differential Privacy via Aggregation. CoRR Anand Brahmbhatt, Rishi Saket, Shreyas Havaldar, Anshul Nasery, Aravindan Raghuveer
2023	A	`conf`	Non-Uniform Adversarial Perturbations for Discrete Tabular Datasets. CIKM Jay Nandy, Jatin Chauhan, Rishi Saket, Aravindan Raghuveer
2023	A*	`conf`	PAC Learning Linear Thresholds from Label Proportions. NeurIPS Anand Brahmbhatt, Rishi Saket, Aravindan Raghuveer
2023	J	`jnl`	PAC Learning Linear Thresholds from Label Proportions. CoRR Anand Brahmbhatt, Rishi Saket, Aravindan Raghuveer
2022	A*	`conf`	Algorithms and Hardness for Learning Linear Thresholds from Label Proportions. NeurIPS Rishi Saket
2022	A	`conf`	Domain-Agnostic Contrastive Representations for Learning from Label Proportions. CIKM Jay Nandy, Rishi Saket, Prateek Jain, Jatin Chauhan, Balaraman Ravindran, Aravindan Raghuveer
2022	A*	`conf`	Multi-Variate Time Series Forecasting on Variable Subsets. KDD Jatin Chauhan, Aravindan Raghuveer, Rishi Saket, Jay Nandy, Balaraman Ravindran
2022	J	`jnl`	Multi-Variate Time Series Forecasting on Variable Subsets. CoRR Jatin Chauhan, Aravindan Raghuveer, Rishi Saket, Jay Nandy, Balaraman Ravindran
2022	A	`conf`	On Combining Bags to Better Learn from Label Proportions. AISTATS Rishi Saket, Aravindan Raghuveer, Balaraman Ravindran
2021	A*	`conf`	Hardness of learning DNFs using halfspaces. STOC Suprovat Ghoshal, Rishi Saket
2021	A*	`conf`	Learnability of Linear Thresholds from Label Proportions. NeurIPS Rishi Saket
2020	—	`conf`	Smart Contract Protocol for Authenticity and Compliance with Anonymity on Hyperledger Fabric. IEEE ICBC Rishi Saket, Nitin Singh, Pankaj Dayama, Vinayaka Pandit
2019	J	`jnl`	Hardness of Learning DNFs using Halfspaces. CoRR Suprovat Ghoshal, Rishi Saket
2019	J	`jnl`	Hardness of Learning DNFs using Halfspaces. Electron. Colloquium Comput. Complex. Suprovat Ghoshal, Rishi Saket
2018	A*	`conf`	Hardness of Learning Noisy Halfspaces using Polynomial Thresholds. COLT Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket
2017	—	`conf`	Approximation Algorithms for Stochastic k-TSP. FSTTCS Alina Ene, Viswanath Nagarajan, Rishi Saket
2017	J	`jnl`	Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2 SIAM J. Comput. Subhash Khot, Rishi Saket
2017	—	`conf`	Hardness of Rainbow Coloring Hypergraphs. FSTTCS Venkatesan Guruswami, Rishi Saket
2017	J	`jnl`	Hardness of Rainbow Coloring Hypergraphs. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Rishi Saket
2017	J	`jnl`	Hardness of learning noisy halfspaces using polynomial thresholds. CoRR Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket
2017	J	`jnl`	Hardness of learning noisy halfspaces using polynomial thresholds. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket
2017	J	`jnl`	On the Approximability of Digraph Ordering. Algorithmica Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
2017	J	`jnl`	Tight Hardness of the Non-Commutative Grothendieck Problem. Theory Comput. Jop Briët, Oded Regev, Rishi Saket
2016	J	`jnl`	Approximating CSPs using LP Relaxation. Electron. Colloquium Comput. Complex. Subhash Khot, Rishi Saket
2016	J	`jnl`	Approximation Algorithms for Stochastic k-TSP. CoRR Alina Ene, Viswanath Nagarajan, Rishi Saket
2016	J	`jnl`	Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu
2016	A	`conf`	Hardness of Bipartite Expansion. ESA Subhash Khot, Rishi Saket
2016	A	`conf`	On the Hardness of Learning Sparse Parities. ESA Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket
2015	—	`conf`	Approximating CSPs Using LP Relaxation. ICALP (1) Subhash Khot, Rishi Saket
2015	J	`jnl`	Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs. SIAM J. Discret. Math. Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket
2015	A	`conf`	On the Approximability of Digraph Ordering. ESA Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
2015	J	`jnl`	On the Approximability of Digraph Ordering. CoRR Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
2015	J	`jnl`	On the hardness of learning sparse parities. CoRR Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket
2015	J	`jnl`	On the hardness of learning sparse parities. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket
2015	A*	`conf`	Tight Hardness of the Non-commutative Grothendieck Problem. FOCS Jop Briët, Oded Regev, Rishi Saket
2014	J	`jnl`	Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2 Electron. Colloquium Comput. Complex. Subhash Khot, Rishi Saket
2014	A*	`conf`	Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. FOCS Subhash Khot, Rishi Saket
2014	A	`conf`	Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. CCC Rishi Saket
2014	A*	`conf`	Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. SODA Subhash Khot, Rishi Saket
2013	J	`jnl`	A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure. CoRR Rishi Saket
2013	J	`jnl`	Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. CoRR Rishi Saket
2013	J	`jnl`	Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. CoRR Subhash Khot, Rishi Saket
2013	J	`jnl`	Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket
2013	A	`conf`	Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover. CCC Sushant Sachdeva, Rishi Saket
2013	—	`conf`	The Approximability of the Binary Paintshop Problem. APPROX-RANDOM Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber
2012	A*	`conf`	Bypassing UGC from some optimal geometric inapproximability results. SODA Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu
2012	A*	`conf`	Hardness of Finding Independent Sets in Almost q-Colorable Graphs. FOCS Subhash Khot, Rishi Saket
2012	—	`conf`	New and Improved Bounds for the Minimum Set Cover Problem. APPROX-RANDOM Rishi Saket, Maxim Sviridenko
2012	J	`jnl`	Stochastic Vehicle Routing with Recourse CoRR Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket
2012	—	`conf`	Stochastic Vehicle Routing with Recourse. ICALP (1) Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket
2011	J	`jnl`	Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs CoRR Sushant Sachdeva, Rishi Saket
2011	—	`conf`	Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. APPROX-RANDOM Sushant Sachdeva, Rishi Saket
2011	J	`jnl`	On the hardness of learning intersections of two halfspaces. J. Comput. Syst. Sci. Subhash Khot, Rishi Saket
2010	—	`conf`	Approximate Lasserre Integrality Gap for Unique Games. APPROX-RANDOM Subhash Khot, Preyas Popat, Rishi Saket
2010	J	`jnl`	Bypassing UGC from some optimal geometric inapproximability results. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu
2010	J	`jnl`	Hardness of Reconstructing Multivariate Polynomials over Finite Fields. SIAM J. Comput. Parikshit Gopalan, Subhash Khot, Rishi Saket
2010	—	`conf`	On the Inapproximability of Vertex Cover on ICALP (1) Venkatesan Guruswami, Rishi Saket
2010	—	`conf`	Quasi-Random PCP and Hardness of 2-Catalog Segmentation. FSTTCS Rishi Saket
2009	—	`—`	Intractability results for problems in computational learning and approximation. Rishi Saket
2009	A*	`conf`	SDP Integrality Gaps with Local ell_1-Embeddability. FOCS Subhash Khot, Rishi Saket
2008	A*	`conf`	Hardness of Minimizing and Learning DNF Expressions. FOCS Subhash Khot, Rishi Saket
2008	A*	`conf`	On hardness of learning intersection of two halfspaces. STOC Subhash Khot, Rishi Saket
2007	—	`conf`	Hardness of Embedding Metric Spaces of Equal Size. APPROX-RANDOM Subhash Khot, Rishi Saket
2007	A*	`conf`	Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS Parikshit Gopalan, Subhash Khot, Rishi Saket
2007	J	`jnl`	Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Subhash Khot, Rishi Saket
2006	A	`conf`	A 3-Query Non-Adaptive PCP with Perfect Completeness. CCC Subhash Khot, Rishi Saket
2006	J	`jnl`	Frame packing algorithms for automotive applications. J. Embed. Comput. Rishi Saket, Nicolas Navet
2006	A*	`conf`	Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi