Related papers: Functions measuring smoothness and the constants i…
Generalized and Simulated Method of Moments are often used to estimate structural Economic models. Yet, it is commonly reported that optimization is challenging because the corresponding objective function is non-convex. For smooth…
We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that…
The goal of the paper is development of an optimization method with the superlinear convergence rate for a nonsmooth convex function. For optimization an approximation is used that is similar to the Steklov integral averaging. The…
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 work, we develop new optimization algorithms that use approximate second-order information combined with the gradient regularization technique to achieve fast global convergence rates for both convex and non-convex objectives. The…
Building on the rather large literature concerning the regularity of the solution of the standard normal Stein equation, we provide a complete description of the best possible uniform bounds for the derivatives of the solution of the…
Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…
We study the problem of minimizing a relatively-smooth convex function using stochastic Bregman gradient methods. We first prove the convergence of Bregman Stochastic Gradient Descent (BSGD) to a region that depends on the noise (magnitude…
In this short note we study uniform approximations to the normal distributions by Jacobi theta functions. We shall show that scaled theta functions approach to a normal distribution exponentially fast.
In this article we derive Talagrand's $T_2$ inequality on the path space w.r.t. the maximum norm for various stochastic processes, including solutions of one-dimensional stochastic differential equations with measurable drifts, backward…
The stochastic three points (STP) algorithm is a derivative-free optimization technique designed for unconstrained optimization problems in $\mathbb{R}^d$. In this paper, we analyze this algorithm for three classes of functions: smooth…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We present two new remarkably simple stochastic second-order methods for minimizing the average of a very large number of sufficiently smooth and strongly convex functions. The first is a stochastic variant of Newton's method (SN), and the…
By analogy with the program of McKinnon-Roth, we define and study approximation constants for points of a projective variety X defined over K the function field of an irreducible and non-singular in codimension 1 projective variety defined…
We consider the rate of piecewise constant approximation to a locally stationary process $X(t),t\in [0,1]$, having a variable smoothness index $\alpha(t)$. Assuming that $\alpha(\cdot)$ attains its unique minimum at zero and satisfies the…
We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for…
We prove a representation for the support of McKean Vlasov Equations. To do so, we construct functional quantizations for the law of Brownian motion as a measure over the (non-reflexive) Banach space of H\"older continuous paths. By solving…
In this paper, in a multivariate setting we derive near optimal rates of convergence in the minimax sense for estimating partial derivatives of the mean function for functional data observed under a fixed synchronous design over H\"older…
This note establishes smooth approximation from above for J-plurisubharmonic functions on an almost complex manifold (X,J). The following theorem is proved. Suppose X is J-pseudoconvex, i.e., X admits a smooth strictly J-plurisubharmonic…
In this paper we introduce and analyze, for two and three dimensions, a finite element method to approximate the natural frequencies of a flow system governed by the Stokes-Brinkman equations. Here, the fluid presents the capability of…