English
Related papers

Related papers: Directed Isoperimetric Theorems for Boolean Functi…

200 papers

We study the complexity of approximate representation and learning of submodular functions over the uniform distribution on the Boolean hypercube $\{0,1\}^n$. Our main result is the following structural theorem: any submodular function is…

Machine Learning · Computer Science 2013-04-03 Vitaly Feldman , Pravesh Kothari , Jan Vondrak

We study a general nonlinear parabolic equation on a Lipschitz bounded domain in $\mathbb{R}^N$, \begin{equation*} \left\{\begin{array}{l l} \partial_t u-\mathrm{div} A(t,x,\nabla u)= f(t,x)&\text{in}\ \ \Omega_T,\\ u(t,x)=0 &\ \mathrm{ on}…

Analysis of PDEs · Mathematics 2019-05-14 Iwona Chlebicka , Piotr Gwiazda , Anna Zatorska-Goldstein

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

In this paper, we consider the unconstrained submodular maximization problem. We propose the first algorithm for this problem that achieves a tight $(1/2-\varepsilon)$-approximation guarantee using $\tilde{O}(\varepsilon^{-1})$ adaptive…

Data Structures and Algorithms · Computer Science 2018-11-20 Lin Chen , Moran Feldman , Amin Karbasi

The article [HPS] established a monotonicity inequality for the Helmholtz equation and presented applications to shape detection and local uniqueness in inverse boundary problems. The monotonicity inequality states that if two scattering…

Analysis of PDEs · Mathematics 2019-08-02 Bastian Harrach , Valter Pohjola , Mikko Salo

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Data Structures and Algorithms · Computer Science 2016-11-18 Josh Alman , Ryan Williams

We study the asymptotic behavior of the data-driven Sobolev test for testing uniformity on the (hyper)sphere. We show that it can be blind to certain contiguous alternatives and propose a simple modification of the test statistic. This…

Statistics Theory · Mathematics 2026-02-24 Marcio Reverbel

We compute the structure of a self-gravitating torus with polytropic equation-of-state (EOS) rotating in an imposed centrifugal potential. The Poisson-solver is based on isotropic multigrid with optimal covering factor (fluid…

Astrophysics of Galaxies · Physics 2016-12-07 J. -M. Huré , F. Hersant

The $N=\infty$ vector $O(N)$ model is a solvable, interacting field theory in three dimensions ($D$). In a recent paper with A. Chubukov and J. Ye~\cite{self}, we have computed a universal number, $\tilde{c}$, characterizing the size…

High Energy Physics - Theory · Physics 2009-10-22 Subir Sachdev

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Optimization and Control · Mathematics 2022-06-14 Hamza Fawzi

We study the rank of the Sum of Squares (SoS) hierarchy over the Boolean hypercube for Symmetric Quadratic Functions (SQFs) in $n$ variables with roots placed in points $k-1$ and $k$. Functions of this type have played a central role in…

Computational Complexity · Computer Science 2021-07-12 Adam Kurpisz , Aaron Potechin , Elias Samuel Wirth

Given observations from a positive random variable contaminated by multiplicative measurement error, we consider a nonparametric goodness-of-fit testing task for its unknown density in a non-asymptotic framework. We propose a testing…

Statistics Theory · Mathematics 2025-12-02 Jan Johannes , Bianca Neubert

Given a weighted graph $G$, a $(\beta,\varepsilon)$-hopset $H$ is an edge set such that for any $s,t \in V(G)$, where $s$ can reach $t$ in $G$, there is a path from $s$ to $t$ in $G \cup H$ which uses at most $\beta$ hops whose length is in…

Data Structures and Algorithms · Computer Science 2024-07-16 Vikrant Ashvinkumar , Aaron Bernstein , Chengyuan Deng , Jie Gao , Nicole Wein

We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas. Our structure theorem implies that such functions are…

Computational Complexity · Computer Science 2024-08-07 Irit Dinur , Yuval Filmus , Prahladh Harsha

In [2], the authors develop a global correspondence between immersed weakly horospherically convex hypersurfaces $\phi:M^n \to \mathbb{H}^{n+1}$ and a class of conformal metrics on domains of the round sphere $\mathbb{S}^n$. Some of the key…

Differential Geometry · Mathematics 2021-03-12 Vincent Bonini , Jie Qing , Jingyong Zhu

We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A striking feature of this model is that at every positive constraint…

Computational Complexity · Computer Science 2026-04-02 Shuyang Gong , Brice Huang , Shuangping Li , Mark Sellke

In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…

Computational Complexity · Computer Science 2019-04-15 Hiroki Morizumi

We present a computational framework for two-scale asymptotic homogenization to determine the intrinsic magnetic permeability of composites. To this end, considering linear magnetostatics, both vector and scalar potential formulations are…

Materials Science · Physics 2023-01-05 Celal Soyarslan , Jos Havinga , Leon Abelmann , Ton van den Boogaard

In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi,…

Combinatorics · Mathematics 2019-09-02 Hao Huang

We investigate the finite-time convergence properties of Temporal Difference (TD) learning with linear function approximation, a cornerstone algorithm in the field of reinforcement learning. We are interested in the so-called ``robust''…

Machine Learning · Computer Science 2025-09-26 Wei-Cheng Lee , Francesco Orabona
‹ Prev 1 8 9 10 Next ›