English
Related papers

Related papers: On the $\Phi$-Stability and Related Conjectures

200 papers

Given a convex function $\Phi:[0,1]\to\mathbb{R}$, the $\Phi$-stability of a Boolean function $f$ is defined as $\mathbb{E}[\Phi(T_{\rho}f(\mathbf{X}))]$, where $\mathbf{X}$ is a random vector uniformly distributed on the discrete cube…

Probability · Mathematics 2026-04-08 Lei Yu

Let $T_{\epsilon}$ be the noise operator acting on Boolean functions $f:\{0, 1\}^n\to \{0, 1\}$, where $\epsilon\in[0, 1/2]$ is the noise parameter. Given $\alpha>1$ and fixed mean $\mathbb{E} f$, which Boolean function $f$ has the largest…

Probability · Mathematics 2021-01-27 Jiange Li , Muriel Medard

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

We prove the "Most informative boolean function" conjecture of Courtade and Kumar for high noise $\epsilon \ge 1/2 - \delta$, for some absolute constant $\delta > 0$. Namely, if $X$ is uniformly distributed in $\{0,1\}^n$ and $Y$ is…

Information Theory · Computer Science 2015-11-29 Alex Samorodnitsky

We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by…

Probability · Mathematics 2022-08-16 Ronen Eldan , Dan Mikulincer , Prasad Raghavendra

Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra $B$) is also known in more general form in terms of expansion in a set $\Phi$ of orthonormal functions. However,…

Computational Complexity · Computer Science 2013-12-06 Virendra Sule

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

Information Theory · Computer Science 2013-07-16 Gowtham R. Kumar , Thomas A. Courtade

For a field K, rational function phi in K(z) of degree at least two, and alpha in P^1(K), we study the polynomials in K[z] whose roots are given by the solutions to phi^n(z) = alpha, where phi^n denotes the nth iterate of phi. When the…

Number Theory · Mathematics 2021-11-24 Rafe Jones , Alon Levy

This paper investigates some aspects of the variational behaviour of nonsmooth functions, with special emphasis on certain stability phenomena. Relationships linking such properties as sharp minimality, superstability, error bound and…

Optimization and Control · Mathematics 2014-10-10 Amos Uderzo

We consider the Courtade-Kumar most informative Boolean function conjecture for balanced functions, as well as a conjecture by Li and M\'edard that dictatorship functions also maximize the $L^\alpha$ norm of $T_pf$ for $1\leq\alpha\leq2$…

Information Theory · Computer Science 2020-04-06 Leighton Pate Barnes , Ayfer Özgür

Given a compact convex domain $C\subset \mathbb{R}^k$ and bounded measurable functions $f_1,\ldots,f_n:C\to \mathbb{R}$, define the sup-convolution $(f_1\ast \ldots \ast f_n)(z)$ to be the supremum average value of…

Functional Analysis · Mathematics 2023-07-20 Peter van Hintum , Hunter Spink , Marius Tiba

The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been…

Computational Complexity · Computer Science 2019-03-29 Sourav Chakraborty , Sushrut Karmalkar , Srijita Kundu , Satyanarayana V. Lokam , Nitin Saurabh

Suppose $\XX{N}$ is a uniformly distributed $N$-dimensional binary vector and $\YY{N}$ is obtained by passing $\XX{N}$ through a binary symmetric channel with crossover probability $\alpha$. Recently, Courtade and Kumar postulates that…

Information Theory · Computer Science 2017-10-20 Mustafa Kesal

We study stability, long-time behavior and moment estimates for stochastic evolution equations with additive Wiener noise and with singular drift given by a divergence type quasilinear diffusion operator which may not necessarily exhibit a…

Analysis of PDEs · Mathematics 2023-09-28 Florian Seib , Wilhelm Stannat , Jonas M. Tölle

The stability problem in Ulam's sense has recently been explored in locally convex cone environments, as shown in \cite{ MNF, NR1, NR2}. In continuation of this research direction, our work examines the stability properties of the quadratic…

Functional Analysis · Mathematics 2025-08-19 J. -H. Bae , J. Mohammadpour , A. Najati

We apply the effective potential method to study the vacuum stability of the bounded from above $(-\phi^{6})$ (unstable) quantum field potential. The stability ($\partial E/\partial b=0)$ and the mass renormalization ($\partial^{2}…

High Energy Physics - Theory · Physics 2015-03-17 Abouzeid. M. Shalaby

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

Computer Science and Game Theory · Computer Science 2022-08-12 Xiaotie Deng , Hanyu Li , Ningyuan Li

The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…

Information Theory · Computer Science 2026-01-15 Adel Javanmard , David P. Woodruff
‹ Prev 1 2 3 10 Next ›