Related papers: Better approximation of function by $\alpha-$Berns…
We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…
We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…
We present an elementary proof of a conjecture by I. Ra\c{s}a which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive very recently by the use of stochastic convex orderings. Moreover,…
By introducing the "comparison and replacement" (CNR) operation, we propose a general-purpose pure quantum approximate optimization algorithm and derive its core optimization mechanism quantitatively. The algorithm is constructed to a…
In this paper, we introduce Mellin-Steklov exponential samplingoperators of order $r,r\in\mathbb{N}$, by considering appropriate Mellin-Steklov integrals. We investigate the approximation properties of these operators in continuousbounded…
In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form…
We develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…
Some sharp results related to the convergence of means and families of operators generated by the generalized Bochner-Riesz kernels are obtained. The exact order of approximation of functions by these methods via $K$-functional (or its…
Learning With Opponent-Learning Awareness (LOLA) (Foerster et al. [2018a]) is a multi-agent reinforcement learning algorithm that typically learns reciprocity-based cooperation in partially competitive environments. However, LOLA often…
We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients ($n \gg p \gg 1$). In this regime,…
In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\mathbf{x})$, our algorithm introduces a simple line search step after each…
We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…
We design an algorithm which finds an $\epsilon$-approximate stationary point (with $\|\nabla F(x)\|\le \epsilon$) using $O(\epsilon^{-3})$ stochastic gradient and Hessian-vector products, matching guarantees that were previously available…
A new family of block-sparse proportionate affine projection algorithms (BS-PAPA) is proposed to improve the performance for block-sparse systems. This is motivated by the recent block-sparse proportionate normalized least mean square…
In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…
We introduce functions for relative maximization in a general context: the beta and alpha applications. After a systematic study concerning regularities, we investigate how to approximate certain values of these functions using periodic…
In this paper we study a nonlinear dual space preconditioning approach for the relaxed Proximal Point Algorithm (PPA) with application to monotone and relatively cohypomonotone inclusions, called anisotropic PPA. The algorithm is an…
We develop a finite difference approximation of order $\alpha$ for the $\alpha$-fractional derivative. The weights of the approximation scheme have the same rate-matrix type properties as the popular Gr\"unwald scheme. In particular,…
Nikol'skii known theorem for the kernels satisfying a condition $A^*_n$, is proved and for kernels from wider class. Explicit formulas for calculating the value of an approximation of classes $\W^{r, \beta}_{p, n} $ by convolution operators…
We suggest a novel classification algorithm that is based on local approximations and explain its connections with Artificial Neural Networks (ANNs) and Nearest Neighbour classifiers. We illustrate it on the datasets MNIST and EMNIST of…