English
Related papers

Related papers: Optimizing error of high-dimensional statistical q…

200 papers

Computing accurate low rank approximations of large matrices is a fundamental data mining task. In many applications however the matrix contains sensitive information about individuals. In such case we would like to release a low rank…

Data Structures and Algorithms · Computer Science 2012-11-06 Moritz Hardt , Aaron Roth

We show that adding differential privacy to Explainable Boosting Machines (EBMs), a recent method for training interpretable ML models, yields state-of-the-art accuracy while protecting privacy. Our experiments on multiple classification…

Machine Learning · Computer Science 2021-06-18 Harsha Nori , Rich Caruana , Zhiqi Bu , Judy Hanwen Shen , Janardhan Kulkarni

Constructing a differentially private (DP) estimator requires deriving the maximum influence of an observation, which can be difficult in the absence of exogenous bounds on the input data or the estimator, especially in high dimensional…

Machine Learning · Statistics 2022-07-27 Ryan Cumings-Menon

Nowadays, machine learning models and applications have become increasingly pervasive. With this rapid increase in the development and employment of machine learning models, a concern regarding privacy has risen. Thus, there is a legitimate…

Machine Learning · Computer Science 2022-11-22 Samah Baraheem , Zhongmei Yao

We show new lower bounds on the sample complexity of $(\varepsilon, \delta)$-differentially private algorithms that accurately answer large sets of counting queries. A counting query on a database $D \in (\{0,1\}^d)^n$ has the form "What…

Cryptography and Security · Computer Science 2018-10-25 Mark Bun , Jonathan Ullman , Salil Vadhan

We give a fast algorithm to optimally compose privacy guarantees of differentially private (DP) algorithms to arbitrary accuracy. Our method is based on the notion of privacy loss random variables to quantify the privacy loss of DP…

Data Structures and Algorithms · Computer Science 2021-10-27 Sivakanth Gopi , Yin Tat Lee , Lukas Wutschitz

The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully…

Optimization and Control · Mathematics 2020-12-23 Gael Lederrey , Virginie Lurkin , Tim Hillel , Michel Bierlaire

Computation of Mutual Information (MI) helps understand the amount of information shared between a pair of random variables. Automated feature selection techniques based on MI ranking are regularly used to extract information from sensitive…

Cryptography and Security · Computer Science 2020-09-24 Ankit Srivastava , Samira Pouyanfar , Joshua Allen , Ken Johnston , Qida Ma

A well-known algorithm in privacy-preserving ML is differentially private stochastic gradient descent (DP-SGD). While this algorithm has been evaluated on text and image data, it has not been previously applied to ads data, which are…

We propose a hybrid model of differential privacy that considers a combination of regular and opt-in users who desire the differential privacy guarantees of the local privacy model and the trusted curator model, respectively. We demonstrate…

Cryptography and Security · Computer Science 2019-11-25 Brendan Avent , Aleksandra Korolova , David Zeber , Torgeir Hovden , Benjamin Livshits

Differentially private (DP) mechanisms face the challenge of providing accurate results while protecting their inputs: the privacy-utility trade-off. A simple but powerful technique for DP adds noise to sensitivity-bounded query outputs to…

Cryptography and Security · Computer Science 2021-07-28 David M. Sommer , Lukas Abfalterer , Sheila Zingg , Esfandiar Mohammadi

Quantum machine learning (QML) can complement the growing trend of using learned models for a myriad of classification tasks, from image recognition to natural speech processing. A quantum advantage arises due to the intractability of…

Quantum Physics · Physics 2021-03-11 William M Watkins , Samuel Yen-Chi Chen , Shinjae Yoo

The Bloom filter is a simple yet space-efficient probabilistic data structure that supports membership queries for dramatically large datasets. It is widely utilized and implemented across various industrial scenarios, often handling…

Cryptography and Security · Computer Science 2026-01-26 Yekun Ke , Yingyu Liang , Zhizhou Sha , Zhenmei Shi , Zhao Song , Jiahao Zhang

The widespread acceptance of differential privacy has led to the publication of many sophisticated algorithms for protecting privacy. However, due to the subtle nature of this privacy definition, many such algorithms have bugs that make…

Cryptography and Security · Computer Science 2019-09-09 Zeyu Ding , Yuxin Wang , Guanhong Wang , Danfeng Zhang , Daniel Kifer

Differentially Private algorithms often need to select the best amongst many candidate options. Classical works on this selection problem require that the candidates' goodness, measured as a real-valued score function, does not change by…

Data Structures and Algorithms · Computer Science 2018-11-21 Jingcheng Liu , Kunal Talwar

Differentially private (DP) machine learning has recently become popular. The privacy loss of DP algorithms is commonly reported using $(\varepsilon,\delta)$-DP. In this paper, we propose a numerical accountant for evaluating the privacy…

Machine Learning · Statistics 2020-08-28 Antti Koskela , Joonas Jälkö , Antti Honkela

Private and public organizations regularly collect and analyze digitalized data about their associates, volunteers, clients, etc. However, because most personal data are sensitive, there is a key challenge in designing privacy-preserving…

Cryptography and Security · Computer Science 2022-04-05 Héber H. Arcolezi

In recent years, formal methods of privacy protection such as differential privacy (DP), capable of deployment to data-driven tasks such as machine learning (ML), have emerged. Reconciling large-scale ML with the closed-form reasoning…

Given a collection of vectors $x^{(1)},\dots,x^{(n)} \in \{0,1\}^d$, the selection problem asks to report the index of an "approximately largest" entry in $x=\sum_{j=1}^n x^{(j)}$. Selection abstracts a host of problems--in machine learning…

Cryptography and Security · Computer Science 2023-06-09 Ivan Damgård , Hannah Keller , Boel Nelson , Claudio Orlandi , Rasmus Pagh

Synthetic tabular data generation with differential privacy is a crucial problem to enable data sharing with formal privacy. Despite a rich history of methodological research and development, developing differentially private tabular data…

Machine Learning · Computer Science 2024-06-05 Toan V. Tran , Li Xiong
‹ Prev 1 8 9 10 Next ›