English
Related papers

Related papers: Generalized Samorodnitsky noisy function inequalit…

200 papers

Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…

Quantum Physics · Physics 2021-12-28 Debajyoti Bera , Tharrmashastha Sapv

In this paper we consider $ X(\bar\varphi)$ anisotropic symmetric space $ 2\pi$ of periodic functions of $m$ variables, in particular, the generalized Lorentz space $L_{\bar{\psi},\bar{\tau}}^{*}(\mathbb{T}^{m})$ and Nikol'skii--Besov's…

Classical Analysis and ODEs · Mathematics 2021-06-01 Gabdolla Akishev

Let $X_1, X_2,\dots$ be a short-memory linear process of random variables. For $1\leq q<2$, let $\cF$ be a bounded set of real-valued functions on $[0,1]$ with finite $q$-variation. It is proved that…

Probability · Mathematics 2019-09-26 Rimas Norvaiša , Alfredas Račkauskas

For an ergodic Brownian diffusion with invariant measure $\nu$, we consider a sequence of empirical distributions ($\nu$n) n$\ge$1 associated with an approximation scheme with decreasing time step ($\gamma$n) n$\ge$1 along an adapted…

Probability · Mathematics 2018-10-09 I Honoré

The manifold hypothesis suggests that the generalization performance of machine learning methods improves significantly when the intrinsic dimension of the input distribution's support is low. In the context of KRR, we investigate two…

Machine Learning · Computer Science 2026-01-23 Rustem Takhanov

We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with…

Quantum Physics · Physics 2021-12-03 Srinivasan Arunachalam , Alex B. Grilo , Tom Gur , Igor C. Oliveira , Aarthi Sundaram

Sensor calibration is an indispensable task in any networked cyberphysical system. In this paper, we consider a sensor network plagued with offset errors, measuring a rank-1 signal subspace, where each sensor collects measurements under a…

Signal Processing · Electrical Eng. & Systems 2023-12-14 Raj Thilak Rajan

Recently, Samorodnitsky proved a strengthened version of Mrs. Gerber's Lemma, where the output entropy of a binary symmetric channel is bounded in terms of the average entropy of the input projected on a random subset of coordinates. Here,…

Information Theory · Computer Science 2016-05-11 Or Ordentlich

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

Computational Complexity · Computer Science 2025-02-21 Krišjānis Prūsis , Jevgēnijs Vihrovs

We extend a randomisation method, introduced by Shiffman-Zelditch and developed by Burq-Lebeau on compact manifolds for the Laplace operator, to the case of $\mathbb{R}^d$ with the harmonic oscillator. We construct measures, thanks to…

Analysis of PDEs · Mathematics 2013-12-17 Aurélien Poiret , Didier Robert , Laurent Thomann

Sorting is the task of ordering $n$ elements using pairwise comparisons. It is well known that $m=\Theta(n\log n)$ comparisons are both necessary and sufficient when the outcomes of the comparisons are observed with no noise. In this paper,…

Information Theory · Computer Science 2024-07-09 Ziao Wang , Nadim Ghaddar , Banghua Zhu , Lele Wang

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

Computational Complexity · Computer Science 2026-05-27 Haakon Larsen , Tushant Mittal , Silas Richelson , Sourya Roy

In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…

Functional Analysis · Mathematics 2026-04-21 Van Kien Nguyen

This paper is devoted to various applications of Hardy-Sobolev type inequalities. We derive a new $L^2$ estimate for the $\bar{\partial}-$equation on ${\mathbb C}^n$ which yields a quantitative generalization of the Hartogs extension…

Complex Variables · Mathematics 2018-02-01 Bo-Yong Chen

We study continuity properties of Sobolev mappings $f \in W_{\mathrm{loc}}^{1,n} (\Omega, \mathbb{R}^n)$, $n \ge 2$, that satisfy the following generalized finite distortion inequality \[\lvert Df(x)\rvert^n \leq K(x) J_f(x) + \Sigma (x)\]…

Analysis of PDEs · Mathematics 2024-02-21 Anna Doležalová , Ilmari Kangasniemi , Jani Onninen

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

Information Theory · Computer Science 2017-02-15 Septimia Sarbu

An asymptotic theory is established for linear functionals of the predictive function given by kernel ridge regression, when the reproducing kernel Hilbert space is equivalent to a Sobolev space. The theory covers a wide variety of linear…

Statistics Theory · Mathematics 2025-08-25 Rui Tuo , Lu Zou

We consider the task of recovering a Sobolev function on a connected compact Riemannian manifold $M$ when given a sample on a finite point set. We prove that the quality of the sample is given by the $L_\gamma(M)$-average of the geodesic…

Numerical Analysis · Mathematics 2024-09-23 David Krieg , Mathias Sonnleitner

In 2011, Guruswami-H{\aa}stad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the…

Information Theory · Computer Science 2016-11-22 Lingfei Jin , Chaoping Xing , Xiande Zhang

We consider a generic modified logarithmic Sobolev inequality (mLSI) of the form $\mathrm{Ent}_{\mu}(e^f) \le \tfrac{\rho}{2} \mathbb{E}_\mu e^f \Gamma(f)^2$ for some difference operator $\Gamma$, and show how it implies two-level…

Probability · Mathematics 2021-04-13 Holger Sambale , Arthur Sinulis