English
Related papers

Related papers: Notes on Sampled Gaussian Mechanism

200 papers

We design a class of additive noise mechanisms that satisfy \((\varepsilon, \delta)\)-differential privacy (DP) for scalar, real-valued query functions with known sensitivities, with a particular focus on moderate and low-privacy regimes.…

Cryptography and Security · Computer Science 2026-05-28 Huikang Liu , Aras Selvi , Wolfram Wiesemann

Self-supervised learning is an increasingly popular approach to unsupervised learning, achieving state-of-the-art results. A prevalent approach consists in contrasting data points and noise points within a classification task: this requires…

Machine Learning · Statistics 2023-01-25 Omar Chehab , Alexandre Gramfort , Aapo Hyvarinen

A new synthesis scheme is proposed to generate a random vector with prescribed joint density that induces a (latent) Gaussian tree structure. The quality of synthesis is shown by vanishing total variation distance between the synthesized…

Information Theory · Computer Science 2017-05-09 Ali Moharrer , Shuangqing Wei , George T. Amariucai , Jing Deng

We study the Gaussian Process regression model in the context of training data with noise in both input and output. The presence of two sources of noise makes the task of learning accurate predictive models extremely challenging. However,…

Machine Learning · Statistics 2015-07-03 Cuong Tran , Vladimir Pavlovic , Robert Kopp

Maximizing high-dimensional, non-convex functions through noisy observations is a notoriously hard problem, but one that arises in many applications. In this paper, we tackle this challenge by modeling the unknown function as a sample from…

Machine Learning · Computer Science 2012-07-03 Bo Chen , Rui Castro , Andreas Krause

Amplification by subsampling is one of the main primitives in machine learning with differential privacy (DP): Training a model on random batches instead of complete datasets results in stronger privacy. This is traditionally formalized via…

Cryptography and Security · Computer Science 2024-11-04 Jan Schuchardt , Mihail Stoian , Arthur Kosmala , Stephan Günnemann

New problems arise when the standard theory of joint detection and estimation is applied to a set of signals drawn from a continuous family; decision thresholds must be determined as a function of the continuous parameter x characterizing…

Statistics Theory · Mathematics 2014-07-17 D. Michael Milder , Robert G. Lindgren , Morris M. Berman

A continuous-time regression model with a jointly strictly sub-Gaussian random noise is considered in the paper. Upper exponential bounds for probabilities of large deviations of the least squares estimator for the regression parameter are…

Probability · Mathematics 2018-06-12 Alexander V. Ivanov , Igor V. Orlovskyi

This paper concerns differentially private Bayesian estimation of the parameters of a population distribution, when a statistic of a sample from that population is shared in noise to provide differential privacy. This work mainly addresses…

Methodology · Statistics 2023-01-09 Baris Alparslan , Sinan Yildirim

Overparametrization often helps improve the generalization performance. This paper presents a dual view of overparametrization suggesting that downsampling may also help generalize. Focusing on the proportional regime $m\asymp n \asymp p$,…

Statistics Theory · Mathematics 2023-10-17 Xin Chen , Yicheng Zeng , Siyue Yang , Qiang Sun

We propose an open loop methodology based on sample statistics to solve chance constrained stochastic optimal control problems with probabilistic safety guarantees for linear systems where the additive Gaussian noise has unknown mean and…

Systems and Control · Electrical Eng. & Systems 2023-03-24 Shawn Priore , Meeko Oishi

We show that if $F$ is a convex class of functions that is $L$-subgaussian, the error rate of learning problems generated by independent noise is equivalent to a fixed point determined by `local' covering estimates of the class, rather than…

Machine Learning · Statistics 2015-04-10 Shahar Mendelson

We study the problem of learning mixtures of Gaussians with approximate differential privacy. We prove that roughly $kd^2 + k^{1.5} d^{1.75} + k^2 d$ samples suffice to learn a mixture of $k$ arbitrary $d$-dimensional Gaussians up to low…

Machine Learning · Computer Science 2024-11-05 Hassan Ashtiani , Mahbod Majid , Shyam Narayanan

Ensuring that analyses performed on a dataset are representative of the entire population is one of the central problems in statistics. Most classical techniques assume that the dataset is independent of the analyst's query and break down…

Machine Learning · Computer Science 2024-09-25 Guy Blanc

We study the recovery of sparse vectors from subsampled random convolutions via $\ell_1$-minimization. We consider the setup in which both the subsampling locations as well as the generating vector are chosen at random. For a subgaussian…

Information Theory · Computer Science 2018-03-28 Shahar Mendelson , Holger Rauhut , Rachel Ward

We study the sparse high-dimensional Gaussian mixture model when the number of clusters is allowed to grow with the sample size. A minimax lower bound for parameter estimation is established, and we show that a constrained maximum…

Statistics Theory · Mathematics 2024-02-26 Dapeng Yao , Fangzheng Xie , Yanxun Xu

We consider Bayesian inference when only a limited number of noisy log-likelihood evaluations can be obtained. This occurs for example when complex simulator-based statistical models are fitted to data, and synthetic likelihood (SL) method…

Machine Learning · Statistics 2020-03-09 Marko Järvenpää , Michael Gutmann , Aki Vehtari , Pekka Marttinen

This paper presents a novel Bayesian strategy for the estimation of smooth signals corrupted by Gaussian noise. The method assumes a smooth evolution of a succession of continuous signals that can have a numerical or an analytical…

Applications · Statistics 2016-02-12 Abderrahim Halimi , Gerald S. Buller , Steve McLaughlin , Paul Honeine

We study the problem of estimating mixtures of Gaussians under the constraint of differential privacy (DP). Our main result is that $\text{poly}(k,d,1/\alpha,1/\varepsilon,\log(1/\delta))$ samples are sufficient to estimate a mixture of $k$…

Machine Learning · Statistics 2024-04-24 Mohammad Afzali , Hassan Ashtiani , Christopher Liaw

When starting an N-body simulation of an isolated galaxy, it is desirable to select particles from a distribution function to ensure that the model is in equilibrium. Random sampling from a DF is widely used, but results in a set of…

Astrophysics of Galaxies · Physics 2024-03-01 J A Sellwood