Related papers: Gradient estimates for scalar curvature
In this paper, on Riemannian manifolds with boundary, we establish a Yau type gradient estimate and Liouville theorem for harmonic functions under Dirichlet boundary condition. Under a similar setting, we also formulate a Souplet-Zhang type…
When studying turbulence, it is often desirable to be able to estimate the local spatial gradient of a vector quantity using in situ measurements from a small number of irregularly spaced points. While previous studies have focused on the…
We analyze the constant step size subgradient method on nonsmooth, nonconvex functions. We identify geometric assumptions on the objective function under which i) its domain admits a partition (stratification) into smooth manifolds (strata)…
This paper is a broad and accessible survey of the methods we have at our disposal for Monte Carlo gradient estimation in machine learning and across the statistical sciences: the problem of computing the gradient of an expectation of a…
In this note we present some gradient estimates for the diffusion equation $\partial_t u=\Delta u-\nabla \phi \cdot \nabla u $ on Riemannian manifolds, where $\phi $ is a C^2 function, which generalize estimates of R. Hamilton's and Qi S.…
In this paper we focus on the linear functionals defining an approximate version of the gradient of a function. These functionals are often used when dealing with optimization problems where the computation of the gradient of the objective…
We study zeroth-order optimization for convex functions where we further assume that function evaluations are unavailable. Instead, one only has access to a $\textit{comparison oracle}$, which given two points $x$ and $y$ returns a single…
We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of…
Gradient clipping is a popular modification to standard (stochastic) gradient descent, at every iteration limiting the gradient norm to a certain value $c >0$. It is widely used for example for stabilizing the training of deep learning…
We obtain a local estimate for the gradient of solutions to a second-order elliptic equation in divergence form with bounded measurable coefficients that are square-Dini continuous at the single point x=0. In particular, we treat the case…
Gradient descent, or negative gradient flow, is a standard technique in optimization to find minima of functions. Many implementations of gradient descent rely on discretized versions, i.e., moving in the gradient direction for a set step…
We give sufficient and "almost" necessary conditions for the prescribed scalar curvature problems within the conformal class of a Riemannian metric $ g $ for both closed manifolds and compact manifolds with boundary, including the…
We derive logarithmic gradient estimate and universal boundedness estimate for semilinear elliptic equations on \RCD\, metric measure spaces, which contains the class of Riemannian manifolds with Ricci curvature bounded below. These…
Despite tremendous success of modern neural networks, they are known to be overconfident even when the model encounters inputs with unfamiliar conditions. Detecting such inputs is vital to preventing models from making naive predictions…
Inspired by Goette-Semmelmann \cite{GSSU2002}, we derive an estimate for the scalar curvature without a nonnegativity assumption on curvature operator. As an application, we show that, on an even dimensional closed manifold with nonzero…
In the paper, we derive Li-Yau gradient estimates and Souplet Zhang type estimates of the following equation \begin{equation*} \begin{split} u_t= \Delta_\xi p+\lambda u+A(u) , \end{split} \end{equation*} on complete noncompact metric…
Fractional derivatives are a well-studied generalization of integer order derivatives. Naturally, for optimization, it is of interest to understand the convergence properties of gradient descent using fractional derivatives. Convergence…
In this note, we study the prescribed mean curvature equation with Neumann boundary conditions on Riemannian product manifold $ M^n\times \mathbb{R}$. The main goal is to establish the boundary gradient estimates for solutions by the…
It is widely accepted that the stepsize is of great significance to gradient method. Two efficient gradient methods with approximately optimal stepsizes mainly based on regularization models are proposed for unconstrained optimization. More…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…