Related papers: A Note on the Size-Sensitive Packing Lemma
In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves not just lower bounds for…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
Large language models (LLMs) perform very well in several natural language processing tasks but raise explainability challenges. In this paper, we examine the effect of random elements in the training of LLMs on the explainability of their…
We modify the proof of the basic lemma of a paper of Saks and Zygmund on additive functions of rectangles.
Complex classifiers may exhibit "embarassing" failures in cases where humans can easily provide a justified classification. Avoiding such failures is obviously of key importance. In this work, we focus on one such setting, where a label is…
We state and prove a version of Dyson's Lemma for a product of smooth projective varieties of arbitrary dimension using positivity methods.
Besicovitch showed that if a set is null for the Hausdorff measure associated to a given dimension function, then it is still null for the Hausdorff measure corresponding to a smaller dimension function. We prove that this is not true for…
This paper describes an automatic termination checker for a generic first-order call-by-value language in ML style. We use the fact that value are built from variants and tuples to keep some information about how arguments of recursive call…
A Hausdorff measure version of the Duffin-Schaeffer conjecture in metric number theory is introduced and discussed. The general conjecture is established modulo the original conjecture. The key result is a Mass Transference Principle which…
Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…
We consider several examples of probabilistic existence proofs using compressibility arguments, including some results that involve Lov\'asz local lemma.
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
We study the size-topology relations in random packings of dry adhesive polydisperse microspheres with Gaussian and lognormal size distributions through a geometric tessellation. We find that the dependence of the neighbour number on the…
For consistency (even oracle properties) of estimation and model prediction, almost all existing methods of variable/feature selection critically depend on sparsity of models. However, for ``large $p$ and small $n$" models sparsity…
We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…
Learning from Label Proportions (LLP) is a weakly supervised learning method that aims to perform instance classification from training data consisting of pairs of bags containing multiple instances and the class label proportions within…
An elementary proof of a quantitative version of the Riemann-Lebesgue lemma for functions supported on the half line is given. Applications to differential models with memory are discussed.
We describe two distinct simple, short and self contained proofs of the composition lemma.
Gordeev and Haeusler [GH19] claim that each tautology $\rho$ of minimal propositional logic can be proved with a natural deduction of size polynomial in $|\rho|$. This builds on work from Hudelmaier [Hud93] that found a similar result for…
We use confocal microscopy to study a random close packed sample of colloidal particles. We introduce an algorithm to estimate the size of each particle. Taking into account their sizes, we compute the compressibility of the sample as a…