Related papers: First order operators on shrinking graph-like spac…
Divergence-form operators with stationary random coefficients homogenize over large scales. We investigate the effect of certain perturbations of the medium on the homogenized coefficients. The perturbations that we consider are rare at the…
The convergence rate of various first-order optimization algorithms is a pivotal concern within the numerical optimization community, as it directly reflects the efficiency of these algorithms across different optimization problems. Our…
We prove first-order convergence of semi-discrete monotone finite difference schemes for Hamilton--Jacobi equations on the Wasserstein space over a finite graph. A central challenge is the boundary degeneracy of the Wasserstein simplex,…
The elements of the class of non-homogeneous differential operators which are based on the same vector field, when viewed as acting on appropriate Hilbert spaces, are shown to be isomorphic to each other. It shown that the replacement of a…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
We study problems connected to first-order logic in graphs of bounded twin-width. Inspired by the approach of Bonnet et al. [FOCS 2020], we introduce a robust methodology of local types and describe their behavior in contraction sequences…
In this paper we prove reducibility of classes of linear first order operators on tori by applying a generalization of Moser's theorem on straightening of vector fields on a torus. We consider vector fields which are a $C^\infty$…
Differential operators acting on functions defined on graphs by different studies do not form a consistent framework for the analysis of real or complex functions in the sense that they do not satisfy the Leibniz rule of any order. In this…
This paper optimizes the step coefficients of first-order methods for smooth convex minimization in terms of the worst-case convergence bound (i.e., efficiency) of the decrease in the gradient norm. This work is based on the performance…
Constrained optimization problems where both the objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show for any Lipschitz, weakly convex objectives and…
We consider in this paper a class of single-ratio fractional minimization problems, in which the numerator part of the objective is the sum of a nonsmooth nonconvex function and a smooth nonconvex function while the denominator part is a…
We consider a general second order matrix operator in a multi-dimensional domain subject to a classical boundary condition. This operator is perturbed by a first order differential operator, the coefficients of which depend arbitrarily on a…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
Classical global convergence results for first-order methods rely on uniform smoothness and the \L{}ojasiewicz inequality. Motivated by properties of objective functions that arise in machine learning, we propose a non-uniform refinement of…
We consider the setting where the nodes of an undirected, connected network collaborate to solve a shared objective modeled as the sum of smooth functions. We assume that each summand is privately known by a unique node. NEAR-DGD is a…
In this article we obtain a complete description of the congruences of lines in $\p^4$ of order one provided that the fundamental surface $F$ is non-reduced (and possibly reducible) at one of its generic points, and their classification…
A wide class of regularization problems in machine learning and statistics employ a regularization term which is obtained by composing a simple convex function \omega with a linear transformation. This setting includes Group Lasso methods,…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such…