English
Related papers

Related papers: A Discrepancy Bound for Deterministic Acceptance-R…

200 papers

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

The optimal fault-tolerance achievable by any protocol has been characterized in a wide range of settings. For example, for state machine replication (SMR) protocols operating in the partially synchronous setting, it is possible to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-01 Andrew Lewis-Pye , Tim Roughgarden

We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on $n$-point nominal training data. We then train limited complexity models to imitate these scores…

Machine Learning · Statistics 2016-01-25 Jonathan Root , Venkatesh Saligrama , Jing Qian

We study how well generative adversarial networks (GAN) learn probability distributions from finite samples by analyzing the convergence rates of these models. Our analysis is based on a new oracle inequality that decomposes the estimation…

Machine Learning · Computer Science 2022-05-26 Yunfei Yang

We study fundamental theoretical aspects of probabilistic roadmaps (PRM) in the finite time (non-asymptotic) regime. In particular, we investigate how completeness and optimality guarantees of the approach are influenced by the underlying…

Data Structures and Algorithms · Computer Science 2019-09-24 Matthew Tsao , Kiril Solovey , Marco Pavone

Under the assumption that the true density is decreasing, it is well known that the Grenander estimator converges at rate $n^{1/3}$ if the true density is curved [Sankhy\={a} Ser. A 31 (1969) 23-36] and at rate $n^{1/2}$ if the density is…

Statistics Theory · Mathematics 2014-05-26 Hanna Jankowski

We study high-dimensional mean estimation in a collaborative setting where data is contributed by $N$ users in batches of size $n$. In this environment, a learner seeks to recover the mean $\mu$ of a true distribution $P$ from a collection…

Machine Learning · Computer Science 2026-02-25 Maryam Aliakbarpour , Vladimir Braverman , Yuhan Liu , Junze Yin

We investigate the approximation of high-dimensional target measures as low-dimensional updates of a dominating reference measure. This approximation class replaces the associated density with the composition of: (i) a feature map that…

Computation · Statistics 2024-01-17 Matthew T. C. Li , Youssef Marzouk , Olivier Zahm

Nonparametric two-sample tests such as the Maximum Mean Discrepancy (MMD) are often used to detect differences between two distributions in machine learning applications. However, the majority of existing literature assumes that error-free…

Machine Learning · Statistics 2023-08-08 Ron Nafshi , Maggie Makar

Diffusion models, which convert noise into new data instances by learning to reverse a diffusion process, have become a cornerstone in contemporary generative modeling. In this work, we develop non-asymptotic convergence theory for a…

Machine Learning · Computer Science 2024-08-06 Gen Li , Yuting Wei , Yuejie Chi , Yuxin Chen

While state-of-the-art Deep Neural Network (DNN) models are considered to be robust to random perturbations, it was shown that these architectures are highly vulnerable to deliberately crafted perturbations, albeit being…

Machine Learning · Computer Science 2021-06-03 Omer Faruk Tuna , Ferhat Ozgur Catak , M. Taner Eskil

Generative models have demonstrated significant success in anomaly detection and segmentation over the past decade. Recently, diffusion models have emerged as a powerful alternative, outperforming previous approaches such as GANs and VAEs.…

Computer Vision and Pattern Recognition · Computer Science 2026-04-22 Mehrdad Moradi , Marco Grasso , Bianca Maria Colosimo , Kamran Paynabar

In the regression discontinuity design (RDD), it is common practice to assess the credibility of the design by testing the continuity of the density of the running variable at the cut-off, e.g., McCrary (2008). In this paper we propose an…

Econometrics · Economics 2020-02-13 Federico A. Bugni , Ivan A. Canay

Rejection sampling methods have recently been proposed to improve the performance of discriminator-based generative models. However, these methods are only optimal under an unlimited sampling budget, and are usually applied to a generator…

Machine Learning · Computer Science 2024-03-04 Alexandre Verine , Muni Sreenivas Pydi , Benjamin Negrevergne , Yann Chevaleyre

Accurate chemical compositions of star-forming regions are a critical diagnostic tool to characterize the star formation history and gas flows which regulate galaxy formation. However, the abundance discrepancy factor (ADF) between…

Conventional object detection models inevitably encounter a performance drop as the domain disparity exists. Unsupervised domain adaptive object detection is proposed recently to reduce the disparity between domains, where the source domain…

Computer Vision and Pattern Recognition · Computer Science 2020-07-06 Zhenwei He , Lei Zhang

Adaptivity is an important feature of data analysis---typically the choice of questions asked about a dataset depends on previous interactions with the same dataset. However, generalization error is typically bounded in a non-adaptive…

Machine Learning · Computer Science 2015-11-11 Raef Bassily , Adam Smith , Thomas Steinke , Jonathan Ullman

Control systems are inevitably affected by external disturbances, and a major objective of the control design is to attenuate or eliminate their adverse effects on the system performance. This paper presents a disturbance rejection approach…

Systems and Control · Electrical Eng. & Systems 2020-07-30 Zhitao Li , Amin Vahidi-Moghaddam , Hamidreza Modares , Jinsheng Sun

A circuit $\mathcal{C}$ samples a distribution $\mathbf{X}$ with an error $\epsilon$ if the statistical distance between the output of $\mathcal{C}$ on the uniform input and $\mathbf{X}$ is $\epsilon$. We study the hardness of sampling a…

Computational Complexity · Computer Science 2023-05-09 Yuval Filmus , Itai Leigh , Artur Riazanov , Dmitry Sokolov

We establish minimax convergence rates for score-based generative models (SGMs) under the $1$-Wasserstein distance. Assuming the target density $p^\star$ lies in a nonparametric $\beta$-smooth H\"older class with either compact support or…

Statistics Theory · Mathematics 2025-07-08 Arthur Stéphanovitch , Eddie Aamari , Clément Levrard