@conference {633722,
	title = {Finite sample differentially private confidence intervals},
	booktitle = {Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics (LIPIcs)},
	year = {2018},
	pages = {44:1-44:9},
	publisher = {ITCS},
	organization = {ITCS},
	address = {Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.},
	abstract = {
	Version History:\&nbsp;Also presented\&nbsp;at TPDP 2017. Preliminary version posted as\&nbsp;arXiv:1711.03908 [cs.CR].



	We study the problem of estimating finite sample confidence intervals of the mean of a normal population under the constraint of differential privacy. We consider both the known and unknown variance cases and construct differentially private algorithms to estimate confidence intervals. Crucially, our algorithms guarantee a finite sample coverage, as opposed to an asymptotic coverage. Unlike most previous differentially private algorithms, we do not require the domain of the samples to be bounded. We also prove lower bounds on the expected size of any differentially private confidence set showing that our the parameters are optimal up to polylogarithmic factors.

},
	url = {http://drops.dagstuhl.de/opus/volltexte/2018/8344/},
	author = {Vishesh Karwa and Salil Vadhan}
}
