Related papers: A Note on Banaszczyk's Inequality
Differential privacy changes the effective sample size governing CVaR learning. For tail mass $\tau$, the privacy-relevant sample size is not $n$, but $n\tau$; equivalently, the effective private tail sample size is $\epsilon n\tau$.…
In this paper, we use the hardness of quantization over general lattices as the basis of developing a physical layer secrecy system. Assuming that the channel state observed by the legitimate receiver and the eavesdropper are distinct, this…
We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \mathbf{y}$, exchanging two simultaneous messages. Crucially,…
We study functions generating Gabor Riesz bases on the integer lattice. The classical Balian-Low theorem restricts the simultaneous time and frequency localization of such functions. We obtain a quantitative estimate that extends both this…
\footnotesize B\"{o}r\"{o}czky, Lutwak, Yang and Zhang recently conjectured a certain strengthening of the Brunn-Minkowski inequality for symmetric convex bodies, the so-called log-Brunn-Minkowski inequality. We establish this inequality…
Henstock and Macbeath asked in 1953 whether the Brunn-Minkowski inequality can be generalized to nonabelian locally compact groups; questions along the same line were also asked by Hrushovski, McCrudden, and Tao. We obtain here such an…
An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed…
Motivated by the rapid rise in statistical tools in Functional Data Analysis, we consider the Gaussian mechanism for achieving differential privacy with parameter estimates taking values in a, potentially infinite-dimensional, separable…
Modern information communications use cryptography to keep the contents of communications confidential. RSA (Rivest-Shamir-Adleman) cryptography and elliptic curve cryptography, which are public-key cryptosystems, are widely used…
Recently, Carlier established in [3] a quantitave version of the Fitzpatrick inequality in a Hilbert space. We extend this result by Carlier to the framework of reflexive Banach spaces. In the Hilbert space setting, we obtain an improved…
Robust Bayesian methods for high-dimensional regression problems under diverse sparse regimes are studied. Traditional shrinkage priors are primarily designed to detect a handful of signals from tens of thousands of predictors in the…
A numerically stable method to solve the discretized Boltzmann-Enskog equation describing the behavior of non ideal fluids under inhomogeneous conditions is presented. The algorithm employed uses a Lagrangian finite-difference scheme for…
The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $\mathbb{R}^n$, we have $|A+B|^{1/n} \geq |A|^{1/n}+|B|^{1/n}$. Also, equality holds if and only if $A$ and $B$ are convex and homothetic sets in…
The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…
We give an $O(\log^2 n)$-query algorithm for finding a Tarski fixed point over the $4$-dimensional lattice $[n]^4$, matching the $\Omega(\log^2 n)$ lower bound of [EPRY20]. Additionally, our algorithm yields an ${O(\log^{\lceil…
The lattice Boltzmann equation (LBE) is a microscopically-inspired method designed to solve macroscopic fluid dynamics problems. As a such, it lives at the interface between the microscopic (molecular) and macroscopic (continuum) worlds,…
Trace inequalities are crucial tools to derive the stability of partial differential equations with inhomogeneous, natural boundary conditions. In the analysis of corresponding Galerkin methods, they are also essential to show convergence…
In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. First, it is proved that the secrecy function…
In this article we present a Bernstein inequality for sums of random variables which are defined on a spatial lattice structure. The inequality can be used to derive concentration inequalities. It can be useful to obtain consistency…
We revisit the classical broken sample problem: Two samples of i.i.d. data points $\mathbf{X}=\{X_1,\cdots, X_n\}$ and $\mathbf{Y}=\{Y_1,\cdots,Y_m\}$ are observed without correspondence with $m\leq n$. Under the null hypothesis,…