Related papers: First order operators on shrinking graph-like spac…

A graph $G$ is said to be $1$-perfectly orientable if it has an orientation such that for every vertex $v\in V(G)$, the out-neighborhood of $v$ in $D$ is a clique in $G$. In $1982$, Skrien posed the problem of characterizing the class of…

In this paper, we investigate the first eigenvalue $\Lambda_1$ of the area Jacobi operator for complex curves in K\"ahler surfaces, establishing an extrinsic counterpart to the classical Lichnerowicz theorem for the Laplace-Beltrami…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

In recent years, the success of deep learning has inspired many researchers to study the optimization of general smooth non-convex functions. However, recent works have established pessimistic worst-case complexities for this class…

For a second order differential operator $A(\msx) =-\nabla a(\msx)\nabla + b'(\msx)\nabla+ \nabla \big(\msb''(\msx) \cdot\big)$ on a bounded domain $D$ with the Dirichlet boundary conditions on $\partial D$ there exists the inverse…

(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to approximately reverse the application of a transduction,…

Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there exist first order convergent sequences of graphs with no…

First-order methods (FOMs) have recently been applied and analyzed for solving problems with complicated functional constraints. Existing works show that FOMs for functional constrained problems have lower-order convergence rates than those…

This note discusses proofs for convergence of first-order methods based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants.

In many statistical learning problems, it is desired that the optimal solution conforms to an a priori known sparsity structure represented by a directed acyclic graph. Inducing such structures by means of convex regularizers requires…

We prove the following estimate for the spectrum of the normalized Laplace operator $\Delta$ on a finite graph $G$, \begin{equation*}1- (1- k[t])^{\frac{1}{t}}\leq \lambda_1 \leq \cdots \leq \lambda_{N-1}\leq 1+ (1- k[t])^{\frac{1}{t}},…

In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

We present a unified convergence analysis for first order convex optimization methods using the concept of strong Lyapunov conditions. Combining this with suitable time scaling factors, we are able to handle both convex and strong convex…

This paper provides a theoretical and numerical comparison of classical first-order splitting methods for solving smooth convex optimization problems and cocoercive equations. From a theoretical point of view, we compare convergence rates…

First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories…

Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…

We study the approximation of nonlinear operators between function spaces by transformers. Our approach is to lift functions to measures supported on their graphs and leverage a recently introduced measure-theoretic view of transformers. A…

It is not hard to write a first order formula which is true for a given graph G but is false for any graph not isomorphic to G. The smallest number $(G) of nested quantifiers in a such formula can serve as a measure for the ``first order…

The purpose of this paper is twofold. First, basic concepts such as Gamma function, almost convergence, fractional order difference operator and sequence spaces are given as a survey character. Thus, the current knowledge about those…

The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…