Related papers: On Sharp Stochastic Zeroth Order Hessian Estimator…

Estimation algebras have been extensively studied in Euclidean space, where finite-dimensional estimation algebras form the foundation of the Kalman and Benes filters, and have contributed to the discovery of many other finite-dimensional…

Derivative-free Riemannian optimization (DFRO) aims to minimize an objective function using only function evaluations, under the constraint that the decision variables lie on a Riemannian manifold. The rapid increase in problem dimensions…

Stochastic optimization problems with unknown decision-dependent distributions have attracted increasing attention in recent years due to its importance in applications. Since the gradient of the objective function is inaccessible as a…

We propose an L-BFGS optimization algorithm on Riemannian manifolds using minibatched stochastic variance reduction techniques for fast convergence with constant step sizes, without resorting to linesearch methods designed to satisfy Wolfe…

In stochastic zeroth-order optimization, a problem of practical relevance is understanding how to fully exploit the local geometry of the underlying objective function. We consider a fundamental setting in which the objective function is…

We find sharp bounds for the norm inequality on a Pseudo-hermitian manifold, where the L^2 norm of all second derivatives of the function involving horizontal derivatives is controlled by the L^2 norm of the sub-Laplacian. Perturbation…

Let $E$ be a separable Banach space and let $X, X_1,\dots, X_n, \dots$ be i.i.d. Gaussian random variables taking values in $E$ with mean zero and unknown covariance operator $\Sigma: E^{\ast}\mapsto E.$ The complexity of estimation of…

There are several different notions of "low rank" for tensors, associated to different formats. Among them, the Tensor Train (TT) format is particularly well suited for tensors of high order, as it circumvents the curse of dimensionality:…

Decentralized optimization on Riemannian manifolds is foundational for many modern machine learning and signal processing applications in which data are non-Euclidean and generated and processed in a distributed manner. Although intrinsic…

Motivated by a wide variety of applications, ranging from stochastic optimization to dimension reduction through variable selection, the problem of estimating gradients accurately is of crucial importance in statistics and learning theory.…

For positive $p$-harmonic functions on Riemannian manifolds, we derive a gradient estimate and Harnack inequality with constants depending only on the lower bound of the Ricci curvature, the dimension $n$, $p$ and the radius of the ball on…

Most zeroth-order optimization algorithms mimic a first-order algorithm but replace the gradient of the objective function with some gradient estimator that can be computed from a small number of function evaluations. This estimator is…

Stochastic optimisation in Riemannian manifolds, especially the Riemannian stochastic gradient method, has attracted much recent attention. The present work applies stochastic optimisation to the task of recursive estimation of a…

This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta\_{n+1} = \theta\_n + \gamma\_{n+1} H\_{\theta\_n}(X\_{n+1})$ where $\{\theta\_nn, n \geq 0\}$ is a $R^d$-valued sequence,…

This article studies sharp norm estimates for the commutator of pseudo-differential operators with multiplication operators on closed Heisenberg manifolds. In particular, we obtain a Calderon commutator estimate: If $D$ is a first-order…

We derive estimates of the Hessian of two smooth functions defined on Grassmannian manifold. Based on it, we can derive curvature estimates for minimal submanifolds in Euclidean space via Gauss map. In this way, the result for Bernstein…

We derive second order estimates for $\chi$-plurisubharmonic solutions of complex Hessian equations with right hand sides depending on gradients on compact Hermitian manifolds.

This work puts forth low-complexity Riemannian subspace descent algorithms for the minimization of functions over the symmetric positive definite (SPD) manifold. Different from the existing Riemannian gradient descent variants, the proposed…

This report investigates the fitting of the Hessian or its inverse for stochastic optimizations using a Hessian fitting criterion derived from the preconditioned stochastic gradient descent (PSGD) method. This criterion is closely related…

In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…