Nihar B. Shah and Dengyong Zhou
ICML 2016.
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing
Nihar B. Shah and Dengyong Zhou
Journal of Machine Learning Research 2016 (shorter version at NeurIPS 2015).
Dataset
Parametric Prection from Parametric Agents
Yuan Luo, Nihar B. Shah, Jianwei Huang, Jean Walrand
Operations Research, 2017.
Truth Serums for Massively Crowdsourced Evaluation Tasks
Vijay Kamble, Nihar Shah, David Marn, Abhay Parekh, Kannan Ramachandran
SCUGC 2015: The 5th Workshop on Social Computing and User-Generated Content.
On the Impossibility of Convex Inference in Human Computation
Nihar B. Shah and Dengyong Zhou
AAAI, Austin, Jan. 2015.
A Case for Ordinal Peer-evaluation in MOOCs
Nihar B. Shah, Joseph Bradley, Abhay Parekh, Martin J. Wainwright, Kannan Ramchandran
Neural Information Processing Systems (NeurIPS): Workshop on Data Driven Education, Lake Tahoe, Dec. 2013.
Regularized Minimax Conditional Entropy for Crowdsourcing
Dengyong Zhou, Qiang Liu, John Platt, Christopher Meek, and Nihar B. Shah
Dec. 2014.
PAST RESEARCH ON DISTRIBUTED STORAGE
(* indicates equal contribution)
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
When Do Redundant Requests Reduce Latency ?
Nihar B. Shah, Kangwook Lee and Kannan Ramchandran
IEEE Transactions on Communication, Feb. 2016.
Slides
The MDS Queue: Analysing Latency Performance of Codes
Kangwook Lee, Nihar B. Shah, Longbo Huang and Kannan Ramchandran
IEEE Transactions on Information Theory, 2017.
Addendum and Erratum
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
Nihar B. Shah*, K. V. Rashmi*, P. Vijay Kumar and Kannan Ramchandran
IEEE Transactions on Information Theory, March 2012.
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
K. V. Rashmi*, Nihar B. Shah* and P. Vijay Kumar
IEEE Transactions on Information Theory, August 2011.
IEEE Data Storage Best Paper and Best Student Paper Awards for the years 2011 & 2012.
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
Nihar B. Shah*, K. V. Rashmi*, P. Vijay Kumar and Kannan Ramchandran
IEEE Transactions on Information Theory, April 2012.
On Minimizing Data-read and Download for Storage-Node Recovery
Nihar B. Shah
IEEE Communications Letters, 2013.
Second place in the first ACM University Student Research Competition, 2013.
Having Your Cake and Eating It Too: Jointly Optimal Codes for I/O, Storage and Network-bandwidth In Distributed Storage Systems
KV Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, and Kannan Ramchandran
USENIX FAST, Santa Clara, Feb. 2015.
Picked as the best paper of USENIX FAST 2015 by StorageMojo.
Fundamental Limits on Communication for Oblivious Updates in Storage Networks
Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi
IEEE GLOBECOM 2014, Dec. 2014.
A "Hitchhiker's" Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers
K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, and Kannan Ramchandran
ACM SIGCOMM, Aug 2014.
One Extra Bit of Download Ensures Perfectly Private Information Retrieval
Nihar B. Shah, K. V. Rashmi and Kannan Ramchandran
ISIT 2014.
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, and Kannan Ramchandran
USENIX HotStorage, San Jose, Jun. 2013.
Secret Sharing Across a Network with Low Communication Cost: Distributed Algorithm and Bounds
Nihar B. Shah, K. V. Rashmi and Kannan Ramchandran
IEEE International Symposium on Information Theory
(ISIT), Istanbul, Jul. 2013.
Slides
Poster
Information-theoretically Secure Regenerating Codes for Distributed Storage
Nihar B. Shah*, K. V. Rashmi*, K. Ramchandran, and P. Vijay Kumar
IEEE Transactions on Information Theory 2017.
Regenerating Codes for Errors and Erasures in Distributed Storage
K. V. Rashmi*, Nihar B. Shah*, Kannan Ramchandran, and P. Vijay Kumar
IEEE International Symposium on Information Theory
(ISIT), Cambridge, Jul. 2012.
Slides
Enabling Node Repair in Any Erasure Code for Distributed Storage
K. V. Rashmi*, Nihar B. Shah* and P. Vijay Kumar
IEEE International Symposium on Information Theory (ISIT), St. Petersburg, Jul. 2011.
A Flexible Class of Regenerating Codes for Distributed Storage
Nihar B. Shah*, K. V. Rashmi*, and P. Vijay Kumar
IEEE International Symposium on Information Theory (ISIT), Austin, Jun. 2010.
Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage
K. V. Rashmi*, Nihar B. Shah*, P. Vijay Kumar, and Kannan Ramchandran
IEEE International Symposium on Information Theory (ISIT), Austin, Jun. 2010.
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage    (the complete version on Arxiv)
Nihar B. Shah*, K. V. Rashmi*, P. Vijay Kumar and Kannan Ramchandran
IEEE Information Theory Workshop (ITW), Cairo, Jan. 2010.
Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage
K. V. Rashmi*, Nihar B. Shah*, P. Vijay Kumar and Kannan Ramchandran
Allerton Conference on Control, Computing and Communication, Urbana-Champaign, Sep. 2009.
Regenerating Codes for Distributed Storage Networks (invited)
Nihar B. Shah*, K. V. Rashmi*, P. Vijay Kumar, and Kannan Ramchandran
International Workshop on the Arithmetic of Finite Fields (WAIFI), Istanbul, Jun. 2010.
Network Coding
K. V. Rashmi*, Nihar B. Shah* and P. Vijay Kumar
Resonance, vol. 15, no. 7, pp. 604-621., Jul. 2010.
(Resonance is a journal of science education published by the Indian Academy of Sciences)
.
Distributed Storage System for Optimal Storage Space and Network Bandwidth Utilization and A Method Thereof
K. V. Rashmi*, Nihar B. Shah* and P. Vijay Kumar
US Patent, Nov 2011.
Justin Payan
Justin Payan
Postdoc, Machine Learning Department
Balint Gyevnar
Balint Gyevnar
Postdoc, Machine Learning Department
(joint with Atoosa Kasirzadeh)
Alexander Goldberg
Alexander Goldberg
PhD student, Computer Science Department
(advised jointly with Giulia Fanti)
Madeline Kitch
Madeline Kitch
PhD student, Computer Science Department
Sarina Xi
Sarina Xi
MS student, Machine Learning
Orelia Pi
Orelia Pi
BS student, Computer Science
Noemi Barbagli
Noemi Barbagli
BS student, Statistics and Machine Learning
ALUMNI
Charvi Rastogi
Charvi Rastogi
PhD, Machine Learning Department
(advised jointly with Ken Holstein)
Steven Jecmen
Steven Jecmen
PhD, Computer Science Department
(advised jointly with Fei Fang)
Ivan Stelmakh
Ivan Stelmakh
PhD, Machine Learning Department
(advised jointly with Aarti Singh)
Ryan Liu
Ryan Liu
BS and MS in Computer Science
Wenxin Ding
Wenxin Ding
MS in Computer Science
BS in Mathematics and Computer Science
(advised jointly with Weina Wang)
Qiqi Xu
Qiqi Xu
MS in Machine Learning
(advised jointly with Hoda Heidari)
FUNDING
We gratefully acknowledge support from the National Science Foundation, CMU Block center, CMU CyLab, ONR, a Google Research Scholar award, a JP Morgan Faculty Research Award, and an NSF-Amazon Fair AI research grant.