Related papers: A slope generalization of Attouch theorem

Based on a result by Taylor, Hendrickx, and Glineur (J. Optim. Theory Appl., 178(2):455--476, 2018) on the attainable convergence rate of gradient descent for smooth and strongly convex functions in terms of function values, an elementary…

It is shown that, under suitable conditions, involving in particular the existence of analytic constants of motion, the presence of Lie point symmetries can ensure the convergence of the transformation taking a vector field (or dynamical…

This paper establishes the equivalence of the Aubin property and the strong regularity for generalized equations over $C^2$-cone reducible sets. This result resolves a long-standing question in variational analysis and extends the…

With a new proof approach we prove in a more general setting the classical convergence theorem that almost everywhere convergence of measurable functions on a finite measure space implies convergence in measure. Specifically, we generalize…

Recent studies have shown that many nonconvex machine learning problems satisfy a generalized-smooth condition that extends beyond traditional smooth nonconvex optimization. However, the existing algorithms are not fully adapted to such…

There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

We define the slope of a colored link in an integral homology sphere, associated to admissible characters on the link group. Away from a certain singular locus, the slope is a rational function which can be regarded as a multivariate…

Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…

For a convex domain $D$ that is enclosed by the hypersurface $\partial D$ of bounded normal curvature, we prove an angle comparison theorem for angles between $\partial D$ and geodesic rays starting from some fixed point in $D$, and the…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

In this article a relation between curvature functionals for surfaces in the Euclidean space and area functionals in relative differential geometry will be given. Relative differential geometry can be described as the geometry of surfaces…

It was established in [8] that Lipschitz inf-compact functions are uniquely determined by their local slope and critical values. Compactness played a paramount role in this result, ensuring in particular the existence of critical points. We…

In 1966, P. Guenther proved the following result: Given a continuous function f on a compact surface M of constant curvature -1 and its periodic lift g to the universal covering, the hyperbolic plane, then the averages of the lift g over…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…

A systematic mismatch exists between mathematically ideal and effective activation updates during gradient descent. As intended, parameters update in their direction of steepest descent. However, activations are argued to constitute a more…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…