相关论文: BMO and exponential Orlicz space estimates of the …

We provide necessary and sufficient conditions for the coincidence, up to equivalence of the norms, between strong and weak Orlicz spaces. Roughly speaking, this coincidence holds true only for the so-called exponential spaces. We find also…

Schauder Orlicz-type estimates are derived for weak solutions to second-order linear elliptic equations in divergence form with lower-order terms. The Orlicz setting $X=L^\psi$ is treated first. Under suitable assumptions on the Young…

We study singular integral operators with variable Calder\'on--Zygmund kernels and their commutators with $VMO$ functions in the framework of Orlicz spaces. After revisiting the classical $L^p$ theory, we establish boundedness results in…

The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…

We study point-wise estimates for the modified Riesz potential. We show that the point-wise estimates imply embeddings into Orlicz spaces from the L^1_p-space where the functions are defined in non-smooth domains. The Orlicz functions…

We provide explicit formulas for the norm of bounded linear functionals on Orlicz-Lorentz function spaces $\Lambda_{\varphi,w}$ equipped with two standard Luxemburg and Orlicz norms. Any bounded linear functional is a sum of regular and…

We study the online discrepancy minimization problem for vectors in $\mathbb{R}^d$ in the oblivious setting where an adversary is allowed fix the vectors $x_1, x_2, \ldots, x_n$ in arbitrary order ahead of time. We give an algorithm that…

We estimate the $L^{p}$ norms of the discrepancy between the volume and the number of integer points in $r\Omega-x$, a dilated by a factor $r$ and translated by a vector $x$ of a convex body $\Omega$ in $\mathbb{R}^{d}$ with smooth boundary…

We use the Haar function system in order to study the $L_2$ discrepancy of a class of digital $(0,n,2)$-nets. Our approach yields exact formulas for this quantity, which measures the irregularities of distribution of a set of points in the…

This is the final part of a series of papers where we study perturbations of divergence form second order elliptic operators $-\operatorname{div} A \nabla$ by first and zero order terms, whose complex coefficients lie in critical spaces,…

We find the best asymptotic lower bounds for the coefficient of the leading term of the $L_1$ norm of the two-dimensional (axis-parallel) discrepancy that can be obtained by K.Roth's orthogonal function method among a large class of test…

Many algorithms in machine learning and computational geometry require, as input, the intrinsic dimension of the manifold that supports the probability distribution of the data. This parameter is rarely known and therefore has to be…

In the stochastic online vector balancing problem, vectors $v_1,v_2,\ldots,v_T$ chosen independently from an arbitrary distribution in $\mathbb{R}^n$ arrive one-by-one and must be immediately given a $\pm$ sign. The goal is to keep the norm…

We construct and analyze approximation rates of deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order partial…

We prove an exponential size separation between depth 2 and depth 3 neural networks (with real inputs), when approximating a $\mathcal{O}(1)$-Lipschitz target function to constant accuracy, with respect to a distribution with support in the…

Consider the task of \textit{online} vector balancing for stochastic arrivals $(X_i)_{i \in [T]}$, where the time horizon satisfies $T = \Theta(n)$, and the $X_i$ are i.i.d uniform $d$--sparse $n$--dimensional binary vectors, with $2\leq d…

The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…

Bayesian Neural Networks (BNNs) are trained to optimize an entire distribution over their weights instead of a single set, having significant advantages in terms of, e.g., interpretability, multi-task learning, and calibration. Because of…

Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…

Let ${\mathcal X}$ be a metric space with doubling measure, $L$ a nonnegative self-adjoint operator in $L^2({\mathcal X})$ satisfying the Davies-Gaffney estimate, $\omega$ a concave function on $(0,\infty)$ of strictly lower type…