Results 21 to 30 of about 153,624 (281)
Quantile and Probability Curves Without Crossing [PDF]
This paper proposes a method to address the longstanding problem of lack of monotonicity in estimation of conditional and structural quantile functions, also known as the quantile crossing problem.
Chernozhukov, Victor +2 more
core +5 more sources
Approximate resilience, monotonicity, and the complexity of agnostic learning [PDF]
A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean functions, where we say
Dachman-Soled, Dana +4 more
core +1 more source
Application of operator monotone functions in economics; pp. 42–47 [PDF]
Operator monotone functions play an important role in economics. We show that 2-monotonicity is equivalent to decreasing relative risk premium, a notion recently introduced in microeconomics.
Frank Hansen
doaj +1 more source
On the Lyapunov Exponent of Monotone Boolean Networks †
Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations.
Ilya Shmulevich
doaj +1 more source
Nonparametric instrumental variable estimation under monotonicity [PDF]
The ill-posedness of the inverse problem of recovering a regression function in a nonparametric instrumental variable model leads to estimators that may suffer from a very slow, logarithmic rate of convergence. In this paper, we show that restricting the
Chetverikov, Denis, Wilhelm, Daniel
core +5 more sources
In this paper we consider a fractional differential system with coupled integral boundary value problems on a half-line, where the nonlinearity terms depend on unknown functions and the lower-order fractional derivative of unknown functions, and the ...
Haiyan Zhang, Yongqing Wang, Jiafa Xu
doaj +1 more source
Monotone Boolean Functions with s Zeros Farthest from Threshold Functions [PDF]
Let $T_t$ denote the $t$-threshold function on the $n$-cube: $T_t(x) = 1$ if $|\{i : x_i=1\}| \geq t$, and $0$ otherwise. Define the distance between Boolean functions $g$ and $h$, $d(g,h)$, to be the number of points on which $g$ and $h$ disagree.
Kazuyuki Amano, Jun Tarui
doaj +1 more source
ON K -MONOTONE APPROXIMATION IN LP
In 1995 Kopotun [4], introduced a paper on k -monotone polynomial and spline approximation in P L , 0 < p < ¥ quasi norm . In this paper, we discuss the errors of approximation of k -monotone function by k - monotone interpolation .
Malik Saad Al-Muhja, Eman Samir Bhaya
doaj +1 more source
Learning circuits with few negations [PDF]
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in any circuit ...
Blais, Eric +4 more
core +4 more sources
Testing equality of functions under monotonicity constraints
We consider the problem of testing equality of functions $f_j:[0,1]\to \mathbb{R}$ for $j=1,2,...,J$ the basis of $J$ independent samples from possibly different distributions under the assumption that the functions are monotone.
Durot, Cécile +2 more
core +3 more sources

