相关论文: Indistinguishability Obfuscation from Well-Founded…

The purpose of the present paper is to show few examples of nonlinear PDEs (mostly with strong geometric features) for which there is a hidden convex structure. This is not only a matter of curiosity. Once the convex structure is…

We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances that are constructed by using linear regression models, which are generated via…

Quantum computing solutions are increasingly deployed in commercial environments through delegated computing, especially one of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations. Since…

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

We consider the problems of hypothesis testing on a probability measure of independent sample, on solution of ill-posed problem, on deconvolution problem and on Poisson mean measure. For all these setups necessary conditions and sufficient…

We prove the global well-posedness to the 2D Oldroyd-B type models with $\nu \Lambda^{2\alpha}u$ and $\eta\Lambda^{2\beta}\tau$ satisfying $(i)\ \alpha>1, \eta=0$ or $(ii)\ \alpha=1,\ \beta>0$. By establishing the gradient estimate of $u$,…

We derive a tight upper bound on the probability over $\mathbf{x}=(x_1,\dots,x_\mu) \in \mathbb{Z}^\mu$ uniformly distributed in $ [0,m)^\mu$ that $f(\mathbf{x}) = 0 \bmod N$ for any $\mu$-linear polynomial $f \in…

All models may be wrong -- but that is not necessarily a problem for inference. Consider the standard $t$-test for the significance of a variable $X$ for predicting response $Y$ whilst controlling for $p$ other covariates $Z$ in a random…

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

Based on the work of Chen and Its [{\em J. Approx. Theory} {\bf 162} ({2010}) {270--297}], we further study orthogonal polynomials with respect to the singularly perturbed Laguerre weight $w(x;t,\alpha) = {x^\alpha}{\mathrm e^{-…

Hyperuniform many-particle systems are characterized by a structure factor $S({\mathbf{k}})$ that is precisely zero as $|\mathbf{k}|\rightarrow0$; and stealthy hyperuniform systems have $S({\mathbf{k}})=0$ for the finite range $0 <…

We show a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under…

In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

We consider the problem of computing tight privacy guarantees for the composition of subsampled differentially private mechanisms. Recent algorithms can numerically compute the privacy parameters to arbitrary precision but must be carefully…

In statistical inference, confidence set procedures are typically evaluated based on their validity and width properties. Even when procedures achieve rate-optimal widths, confidence sets can still be excessively wide in practice due to…

Standard high-dimensional regression methods assume that the underlying coefficient vector is sparse. This might not be true in some cases, in particular in presence of hidden, confounding variables. Such hidden confounding can be…

Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such models with respect to computational ones, is to explicitly…

We argue that for the proof of Bell's theorem no assumptions about realism or free will are necessary. The key formula \[E(AB|a,b) = \int A(a,b,\lambda)B(a,b,\lambda)\rho(\lambda) d\lambda\] follows from the logic of plausible reasoning…

Let $\mu$ be a Borel probability measure on a compact path-connected metric space $(X, \rho)$ for which there exist constants $c,\beta>1$ such that $\mu(B) \geq c r^{\beta}$ for every open ball $B\subset X$ of radius $r>0$. For a class of…