English
Related papers

Related papers: Locality Bounds for Sampling Hamming Slices

200 papers

There is a wide range of applications where the local extrema of a function are the key quantity of interest. However, there is surprisingly little work on methods to infer local extrema with uncertainty quantification in the presence of…

Methodology · Statistics 2023-09-28 Meng Li , Zejian Liu , Cheng-Han Yu , Marina Vannucci

We investigate variance bounds under symmetry constraints in classical, free, and Boolean probability, focusing on Bernoulli distributions and their noncommutative analogues, projections with trace \(p\). We show that symmetrizers under…

Probability · Mathematics 2025-11-10 Sukrit Chakraborty

The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…

Machine Learning · Computer Science 2022-09-13 Paul Scharnhorst , Emilio T. Maddalena , Yuning Jiang , Colin N. Jones

Local samplers are algorithms that generate random samples based on local queries to high-dimensional distributions, ensuring the samples follow the correct induced distributions while maintaining time complexity that scales locally with…

Data Structures and Algorithms · Computer Science 2025-10-14 Hongyang Liu , Chunyang Wang , Yitong Yin

The statistics and machine learning communities have recently seen a growing interest in classification-based approaches to two-sample testing. The outcome of a classification-based two-sample test remains a rejection decision, which is not…

Statistics Theory · Mathematics 2022-11-15 Loris Michel , Jeffrey Näf , Nicolai Meinshausen

The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previous works provided…

Machine Learning · Computer Science 2025-03-12 Mathieu Bazinet , Valentina Zantedeschi , Pascal Germain

We study goodness-of-fit of discrete distributions in the distributed setting, where samples are divided between multiple users who can only release a limited amount of information about their samples due to various information constraints.…

Data Structures and Algorithms · Computer Science 2019-07-23 Jayadev Acharya , Clément L. Canonne , Yanjun Han , Ziteng Sun , Himanshu Tyagi

Dependency networks (Heckerman et al., 2000) provide a flexible framework for modeling complex systems with many variables by combining independently learned local conditional distributions through pseudo-Gibbs sampling. Despite their…

Machine Learning · Computer Science 2026-04-02 Kazuya Takabatake , Shotaro Akaho

We prove several new results on the Hamming weight of bounded uniform and small-bias distributions. We exhibit bounded-uniform distributions whose weight is anti-concentrated, matching existing concentration inequalities. This construction…

Computational Complexity · Computer Science 2024-07-18 Harm Derksen , Peter Ivanov , Chin Ho Lee , Emanuele Viola

The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…

Probability · Mathematics 2024-07-24 Jean C. Peyen , Leonid V. Bogachev , Paul P. Martin

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…

Information Theory · Computer Science 2024-03-01 Deheng Yuan , Tao Guo , Zhongyi Huang , Shi Jin

We continue a comprehensive numerical study of semilocal string networks and their cosmological evolution. These can be thought of as hybrid networks comprised of (non-topological) string segments, whose core structure is similar to that of…

High Energy Physics - Phenomenology · Physics 2017-08-02 A. Lopez-Eiguren , J. Urrestilla , A. Achúcarro , A. Avgoustidis , C. J. A. P. Martins

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

The Lovasz Local Lemma (LLL) is a probabilistic tool which has been used to show the existence of a variety of combinatorial structures with good "local" properties. The "LLL-distribution" can be used to show that the resulting structures…

Combinatorics · Mathematics 2023-10-13 David G. Harris

The aim of this paper is to give a new proof that any very weak $s$-harmonic function $u$ in the unit ball $B$ is smooth. As a first step, we improve the local summability properties of $u$. Then, we exploit a suitable version of the…

Analysis of PDEs · Mathematics 2024-12-05 Alessandro Carbotti , Simone Cito , Domenico Angelo La Manna , Diego Pallara

For any unitary representation $\rho$ on a finite-dimensional Hilbert space \(V\) with differential \(d\rho : \mathfrak{g} \to \mathfrak{u}(V)\) for the Lie algebra $\mathfrak g$, we consider the Hamiltonian evolution \[ U_X(t) \coloneqq…

Quantum Physics · Physics 2026-03-10 Naihuan Jing , Molena Nguyen

Weight sharing, equivariance, and local filters, as in convolutional neural networks, are believed to contribute to the sample efficiency of neural networks. However, it is not clear how each one of these design choices contributes to the…

Machine Learning · Computer Science 2025-01-27 Arash Behboodi , Gabriele Cesa

The paper analyzes theoretically and empirically the performance of likelihood weighting (LW) on a subset of nodes in Bayesian networks. The proposed scheme requires fewer samples to converge due to reduction in sampling variance. The…

Artificial Intelligence · Computer Science 2012-07-02 Bozhena Bidyuk , Rina Dechter

Quantum simulation in its current state faces experimental overhead in terms of physical space and cooling. We propose boson sampling as an alternative compact synthetic platform performing at room temperature. Identifying the capability of…

Quantum Physics · Physics 2025-04-03 Anuprita V. Kulkarni , Vatsana Tiwari , Auditya Sharma , Ankur Raina