Related papers: A note about EC-$(s,t)$-weak tractability of multi…

This article extends weak convergence bounds of Markov transition kernels to convergence bounds on the variance of the Markov kernel applied to Lipschitz functions. In the reversible case, weak convergence rates of the transition kernels…

Our focus is on the stable approximate solution of linear operator equations based on noisy data by using $\ell^1$-regularization as a sparsity-enforcing version of Tikhonov regularization. We summarize recent results on situations where…

We consider Galerkin approximations of holomorphic Fredholm operator eigenvalue problems for which the operator values don't have the structure "coercive+compact". In this case the regularity (in sense of [O. Karma, Numer. Funct. Anal.…

This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results…

We study the complexity of the maximum coverage problem, restricted to set systems of bounded VC-dimension. Our main result is a fixed-parameter tractable approximation scheme: an algorithm that outputs a $(1-\eps)$-approximation to the…

Let $P$ be a Markov kernel on a measurable space $\X$ and let $V:\X\r[1,+\infty)$. We provide various assumptions, based on drift conditions, under which $P$ is quasi-compact on the weighted-supremum Banach space $(\cB_V,\|\cdot\|_V)$ of…

We study the complexity of high-dimensional approximation in the $L_2$-norm when different classes of information are available; we compare the power of function evaluations with the power of arbitrary continuous linear measurements. Here,…

We study the approximation of compact linear operators defined over certain weighted tensor product Hilbert spaces. The information complexity is defined as the minimal number of arbitrary linear functionals which is needed to obtain an…

We prove a central limit theorem for a general class of adaptive Markov Chain Monte Carlo algorithms driven by sub-geometrically ergodic Markov kernels. We discuss in detail the special case of stochastic approximation. We use the result to…

The objective of this paper is to provide a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems for which the objective space is not necessarily convex. Our approach is…

We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…

Kernel methods are widely used in machine learning, especially for classification problems. However, the theoretical analysis of kernel classification is still limited. This paper investigates the statistical performances of kernel…

We develop algorithms for multivariate integration and approximation in the weighted half-period cosine space of smooth non-periodic functions. We use specially constructed tent-transformed rank-1 lattice points as cubature nodes for…

Efficient global optimization is a widely used method for optimizing expensive black-box functions such as tuning hyperparameter, and designing new material, etc. Despite its popularity, less attention has been paid to analyzing the…

Weak approximations have been developed to calculate the expectation value of functionals of stochastic differential equations, and various numerical discretization schemes (Euler, Milshtein) have been studied by many authors. We present a…

This paper proposes a tractable family of remainder-form mixed-monotone decomposition functions that are useful for over-approximating the image set of nonlinear mappings in reachability and estimation problems. Our approach applies to a…

In this paper, we study multivariate approximation defined over weighted anisotropic Sobolev spaces which depend on two sequences ${\bf a}=\{a_j\}_{j\geq1}$ and ${\bf b}=\{b_j\}_{j\geq1}$ of positive numbers. We obtain strong equivalences…

The rough Heston model is a very popular recent model in mathematical finance; however, the lack of Markov and semimartingale properties poses significant challenges in both theory and practice. A way to resolve this problem is to use…

This paper is devoted to the study of noncommutative maximal operators with rough kernels. More precisely, we prove the weak type $(1,1)$ boundedness for noncommutative maximal operators with rough kernels. The proof of weak type (1,1)…

In this work, we broadly connect kernel-based filtering (e.g. approaches such as the bilateral filters and nonlocal means, but also many more) with general variational formulations of Bayesian regularized least squares, and the related…