English
Related papers

Related papers: Isoperimetric Inequalities for Real-Valued Functio…

200 papers

This paper studies estimation of and inference on a distribution function $F$ that is concave on the nonnegative half line and admits a density function $f$ with potentially unbounded support. When $F$ is strictly concave, we show that the…

Statistics Theory · Mathematics 2019-11-12 Zheng Fang

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…

Quantum Physics · Physics 2013-06-27 Kaushik Chakraborty , Subhamoy Maitra

We show that for any constant $\epsilon > 0$ and $p \ge 1$, it is possible to distinguish functions $f : \{0,1\}^n \to [0,1]$ that are submodular from those that are $\epsilon$-far from every submodular function in $\ell_p$ distance with a…

Data Structures and Algorithms · Computer Science 2016-11-24 Eric Blais , Abhinav Bommireddi

We prove existence and regularity of minimizers for a class of functionals defined on Borel sets in $R^n$. Combining these results with a refinement of the selection principle introduced by the authors in arXiv:0911.0786, we describe a…

Analysis of PDEs · Mathematics 2011-01-04 Marco Cicalese , Gian Paolo Leonardi

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

Computational Complexity · Computer Science 2014-03-25 Mark Bun , Justin Thaler

We introduce iR2N, a modified proximal quasi-Newton method for minimizing the sum of a smooth function $f$ and a lower semi-continuous prox-bounded function $h$, allowing inexact evaluations of $f$, its gradient, and the associated proximal…

Optimization and Control · Mathematics 2025-12-17 Nathan Allaire , Sébastien Le Digabel , Dominique Orban

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

Classical Analysis and ODEs · Mathematics 2026-01-01 Maxim R. Burke

We establish new separations between the power of monotone and general (non-monotone) Boolean circuits: - For every $k \geq 1$, there is a monotone function in ${\sf AC^0}$ that requires monotone circuits of depth $\Omega(\log^k n)$. This…

Computational Complexity · Computer Science 2023-05-12 Bruno P. Cavalar , Igor C. Oliveira

In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…

Optimization and Control · Mathematics 2025-04-16 Alberto González-Sanz , Marcel Nutz , Andrés Riveros Valdevenito

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Data Structures and Algorithms · Computer Science 2014-02-11 Ferdinando Cicalese , Travis Gagie , Eduardo Laber , Martin Milanic

We consider a nonparametric Bayesian approach to estimation and testing for a multivariate monotone density. Instead of following the conventional Bayesian route of putting a prior distribution complying with the monotonicity restriction,…

Statistics Theory · Mathematics 2023-06-09 Kang Wang , Subhashis Ghosal

We establish a new global endpoint Sobolev inequality for measures that extends the classical theorem of Meyers-Ziemer by placing a maximal function on the right-hand side. This result has several significant consequences. It extends…

Classical Analysis and ODEs · Mathematics 2026-03-06 Simon Bortz , Kabe Moen , Andrea Olivo , Carlos Pérez , Ezequiel Rela

A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every…

Computational Complexity · Computer Science 2007-08-17 Krzysztof Majewski , Nicholas Pippenger

Infinite-dimensional, holomorphic functions have been studied in detail over the last several decades, due to their relevance to parametric differential equations and computational uncertainty quantification. The approximation of such…

Numerical Analysis · Mathematics 2025-02-20 Ben Adcock , Nick Dexter , Sebastian Moraga

This paper introduces a novel algorithmic solution for the approximation of a given multivariate function by a nomographic function that is composed of a one-dimensional continuous and monotone outer function and a sum of univariate…

Information Theory · Computer Science 2015-07-14 Steffen Limmer , Jafar Mohammadi , Slawomir Stanczak

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

Computer Science and Game Theory · Computer Science 2024-03-01 Alexandros Hollender , Chester Lawrence , Erel Segal-Halevi

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

Classical Analysis and ODEs · Mathematics 2020-11-23 Angshuman R. Goswami , Zsolt Páles

Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Lata{\l}a we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded…

Probability · Mathematics 2013-04-09 Radosław Adamczak , Paweł Wolff

This paper proposes a class of origin-smooth approximators of indicators underlying the sum-of-negative-part statistic for testing multiple inequalities. The need for simulation or bootstrap to obtain test critical values is thereby…

Methodology · Statistics 2012-06-27 Le-Yu Chen , Jerzy Szroeter

We show that there exists a Boolean function $F$ which observes the following separations among deterministic query complexity $(D(F))$, randomized zero error query complexity $(R_0(F))$ and randomized one-sided error query complexity…

Computational Complexity · Computer Science 2015-06-25 Sagnik Mukhopadhyay , Swagato Sanyal
‹ Prev 1 4 5 6 7 8 10 Next ›