English
Related papers

Related papers: On approximately monotone and approximately H\"old…

200 papers

We introduce a general method, named the h-function method, to unify the constructions of level-alpha exact test and 1-alpha exact confidence interval. Using this method, any confidence interval is improved as follows: i) an approximate…

Statistics Theory · Mathematics 2021-08-27 Weizhen Wang

Let $\mathcal{L}(x,a)$ be defined on $\left( -1,\infty \right) \times \left( 4/15,\infty \right) $ or $\left( 0,\infty \right) \times \left( 1/15,\infty \right) $ by the formula% \begin{equation*} \mathcal{L}(x,a)=\tfrac{1}{90a^{2}+2}\ln…

Classical Analysis and ODEs · Mathematics 2014-08-12 Zhen-Hang Yang

Let $(L; \sqcap, \sqcup)$ be a finite lattice and let $n$ be a positive integer. A function $f : L^n \to \mathbb{R}$ is said to be submodular if $f(\tup{a} \sqcap \tup{b}) + f(\tup{a} \sqcup \tup{b}) \leq f(\tup{a}) + f(\tup{b})$ for all…

Data Structures and Algorithms · Computer Science 2009-04-22 Fredrik Kuivinen

This paper explores the concept of reparametrization invariant norm (RPI-norm), that is any norm invariant under composition with diffeomorphisms. We prove the existence of an infinite family of RPI-norms, called standard RPI-norms, for…

Functional Analysis · Mathematics 2007-05-23 Patrizio Frosini , Claudia Landi

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

Data Structures and Algorithms · Computer Science 2015-03-31 Vitaly Feldman , Jan Vondrak

We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…

Analysis of PDEs · Mathematics 2025-01-03 Anders Olofsson , Jens Wittsten

We consider the problem of testing whether an unknown Boolean function $f$ is monotone versus $\epsilon$-far from every monotone function. The two main results of this paper are a new lower bound and a new algorithm for this well-studied…

Computational Complexity · Computer Science 2014-12-19 Xi Chen , Rocco A. Servedio , Li-Yang Tan

We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…

Probability · Mathematics 2021-04-14 Anders Aamand , Noga Alon , Jakob Bæk Tejs Knudsen , Mikkel Thorup

In this article, we prove two new versions of a theorem proven by Efron in [Efr65]. Efron's theorem says that if a function $\phi : \mathbb{R}^2 \rightarrow \mathbb{R}$ is non-decreasing in each argument then we have that the function $s…

Probability · Mathematics 2021-12-17 Yannis Oudghiri

The problem of testing monotonicity of a Boolean function $f:\{0,1\}^n \to \{0,1\}$ has received much attention recently. Denoting the proximity parameter by $\varepsilon$, the best tester is the non-adaptive…

Data Structures and Algorithms · Computer Science 2018-01-10 Deeparnab Chakrabarty , C. Seshadhri

Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…

Classical Analysis and ODEs · Mathematics 2022-03-03 Nicholas F. Marshall

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

Information Theory · Computer Science 2017-04-25 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

A non-negative function $f$ is said to be 'bell-shaped' if $f$ tends to zero at $\pm \infty$ and the $n$-th derivative of $f$ changes its sign $n$ times for every $n = 0, 1, 2, \ldots$ We provide a complete characterisation of the class of…

Probability · Mathematics 2019-10-18 Mateusz Kwaśnicki , Thomas Simon

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximal monotone operators provided that Rockafellar's constraint qualification holds. In this note, we provide a new maximal…

Functional Analysis · Mathematics 2010-01-05 Heinz H. Bauschke , Xianfu Wang , Liangjin Yao

We deal with monotonic regression of multivariate functions $f: Q \to \mathbb{R}$ on a compact rectangular domain $Q$ in $\mathbb{R}^d$, where monotonicity is understood in a generalized sense: as isotonicity in some coordinate directions…

Optimization and Control · Mathematics 2020-09-07 Jochen Schmid

We study the classical problem of approximating a non-decreasing function $f: \mathcal{X} \to \mathcal{Y}$ in $L^p(\mu)$ norm by sequentially querying its values, for known compact real intervals $\mathcal{X}$, $\mathcal{Y}$ and a known…

Machine Learning · Computer Science 2023-09-15 Pierre Gaillard , Sébastien Gerchinovitz , Étienne de Montbrun

Motivated by the problem of determining the values of $\alpha>0$ for which $f_\alpha(x)=e^\alpha - (1+1/x)^{\alpha x},\ x>0$ is a completely monotonic function, we combine Fourier analysis with complex analysis to find a family…

Classical Analysis and ODEs · Mathematics 2021-01-19 Christian Berg , Eugenio Massa , Ana P. Peron

We explore properties of the value function and existence of optimal stopping times for functionals with discontinuities related to the boundary of an open (possibly unbounded) set $\mathcal{O}$. The stopping horizon is either random, equal…

Optimization and Control · Mathematics 2017-01-11 Jan Palczewski , Lukasz Stettner

We study the problem of estimating a monotone function $f:\{0,1\}^d\to[0,1]$ from noisy observations at uniformly random vertices of the Boolean hypercube. As a measure of complexity for the target~$f$, we use the total $L^1$-influence…

Statistics Theory · Mathematics 2026-05-20 Gérard Biau

The Hardy-Littlewood maximal function $\mathcal{M}$ and the trigonometric function $\sin{x}$ are two central objects in harmonic analysis. We prove that $\mathcal{M}$ characterizes $\sin{x}$ in the following way: let $f \in…

Classical Analysis and ODEs · Mathematics 2015-11-16 Stefan Steinerberger
‹ Prev 1 8 9 10 Next ›