Related papers: Exact asymptotic order for generalised adaptive ap…
A key problem in approximation theory is the recovery of high-dimensional functions from samples. In many cases, the functions of interest exhibit anisotropic smoothness, and, in many practical settings, the nature of this anisotropy may be…
We take the first step in extending the integrability approach to one-point functions in AdS/dCFT to higher loop orders. More precisely, we argue that the formula encoding all tree-level one-point functions of SU(2) operators in the defect…
Asymptotic formula is derived for the behavior of the fundamental solution of the second-order elliptic self-adjoint operator with a piecewise-smooth coefficient in front of the senior derivatives near the discontinuity surface of the…
We consider the asymptotics of orthogonal polynomials for measures that are differentiable, but not necessarily analytic, multiplicative perturbations of Jacobi-like measures supported on disjoint intervals. We analyze the Fokas-Its-Kitaev…
An intrinsic definition in terms of conformal capacity is proposed for the conformal type of a Carnot--Carath\'eodory space (parabolic or hyperbolic). Geometric criteria of conformal type are presented. They are closely related to the…
The paper deals with asymptotic properties of the adaptive procedure proposed in the author paper, 2007, for estimating an unknown nonparametric regression. %\cite{GaPe1}. We prove that this procedure is asymptotically efficient for a…
Motivated by the study of the asymptotic behavior of Jacobi polynomials $\left( P_{n}^{(nA,nB)}\right) _{n}$ with $A\in \mathbb C$ and $B>0$ we establish the global structure of trajectories of the related rational quadratic differential on…
In their seminal work, Polyak and Juditsky showed that stochastic approximation algorithms for solving smooth equations enjoy a central limit theorem. Moreover, it has since been argued that the asymptotic covariance of the method is best…
In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…
A fully stochastic second-order adaptive-regularization method for unconstrained nonconvex optimization is presented which never computes the objective-function value, but yet achieves the optimal $\mathcal{O}(\epsilon^{-3/2})$ complexity…
For a homogenization problem associated to a linear elliptic operator, we prove the existence of a distributional corrector and we find an approximation scheme for the homogenized coefficients. We also study the convergence rates in the…
We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of large number…
Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…
In this paper, we mainly discuss asymptotic profiles of solutions to a class of abstract second-order evolution equations of the form $u''+Au+u'=0$ in real Hilbert spaces, where $A$ is a nonnegative selfadjoint operator. The main result is…
We develop and implement a novel fast bootstrap for dependent data. Our scheme is based on the i.i.d. resampling of the smoothed moment indicators. We characterize the class of parametric and semi-parametric estimation problems for which…
We propose a new family of adaptive first-order methods for a class of convex minimization problems that may fail to be Lipschitz continuous or smooth in the standard sense. Specifically, motivated by a recent flurry of activity on…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
Modern density functional approximations achieve moderate accuracy at low computational cost for many electronic structure calculations. Some background is given relating the gradient expansion of density functional theory to the WKB…
We consider the problem of detecting a rectangle of activation in a grid of sensors in d-dimensions with noisy measurements. This has applications to massive surveillance projects and anomaly detection in large datasets in which one detects…
Uniform upper bounds and the asymptotic expansion with an explicit remainder term are established for the Macdonald function $K_{i\tau}(x)$. The results can be applied, for instance, to study the summability of the divergent…