arXiv research

New algorithms improve on consistency and robustness in convex function chasing with black-box advice.

The paper explores how ReLU DNNs can represent MPC policies and vice versa.

Study proves uniform ellipticity implies uniform polyconvexity for anisotropic energy functionals.

We study rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvature like quantities for polyhedral surfaces are introduced. Many of them are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived …

We investigate the rigidity of hyperbolic cone metrics on $3$-manifolds which are isometric gluing of ideal and hyper-ideal tetrahedra in hyperbolic spaces. These metrics will be called ideal and hyper-ideal hyperbolic polyhedral metrics. It is shown that a hyper-ideal hyperbolic polyhedral metric is determined up to i…

We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many predictions (e.g.\ rankings) as a point in $\mathbb{R}^d$, assigns the original loss val…

New bounds show polyhedral surrogates are optimal for generalization.

Using Roelcke formula for the Green function, we explicitly construct a basis in the kernel of the adjoint Laplacian on a compact polyhedral surface $X$ and compute the $S$-matrix of $X$ at the zero value of the spectral parameter. We apply these results to study various self-adjoint extensions of a symmetric Laplacian…

We study the rigidity of polyhedral surfaces using variational principle. The action functionals are derived from the cosine laws. The main focus of this paper is on the cosine law for a non-triangular region bounded by three possibly disjoint geodesics. Several of these cosine laws were first discovered and used by Fe…

Training certifiable neural networks enables one to obtain models with robustness guarantees against adversarial attacks. In this work, we introduce a framework to bound the adversary-free region in the neighborhood of the input data by a polyhedral envelope, which yields finer-grained certified robustness. We further …

New proof for global rigidity of vertex scaling on polyhedral surfaces.

We prove that a 3-dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by the metric induced on its boundary. Furthemore, any hyperbolic metric on the torus with cone singularities of positive curvature can be realized as the induced metric on the boundary of a convex polyhedral cusp. The …

Let $M$ be a smooth closed orientable surface. Let $F$ be the space of Morse functions on $M$ having fixed number of critical points of each index, moreover at least $χ(M)+1$ critical points are labeled by different labels (enumerated). A notion of a skew cylindric-polyhedral complex, which generalizes the notion of a …

It is proved that every discrete Morse function in the sense of Forman on a finite regular CW complex can be represented by a polyhedral Morse function in the sense of Banchoff on an appropriate embedding in Euclidean space of the barycentric subdivision of the CW complex; such a representation preserves critical point…

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

Study on discrete Gaussian curvature for polyhedral surfaces.

Compact polyhedral surfaces (or, equivalently, compact Riemann surfaces with conformal flat conical metrics) of an arbitrary genus are considered. After giving a short self-contained survey of their basic spectral properties, we study the zeta-regularized determinant of the Laplacian as a functional on the moduli space…

Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the aim of our work is to find and to discuss suitable assessments of smoothness of…

A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying …

The paper improves competitive and dynamic regret bounds for smoothed online learning.

We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $Ω(\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditio…

Scalable verifier for recurrent neural networks using polyhedral abstractions.

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

Locally finite complexes with polyhedral $CAT(0)$ metrics are arborescent.

DFFL tackles federated learning with heterogeneous objectives and constraints.

Paper proves rigidity of discrete conformal structures on polyhedral surfaces.

The paper proves rigidity of bordered polyhedral surfaces using variational principles.

We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to find 53 diminimal polyhedral maps on the Torus.

Characterizes metrics on triangulated surfaces using glued Euclidean triangles.

Deep learning has received much attention lately due to the impressive empirical performance achieved by training algorithms. Consequently, a need for a better theoretical understanding of these problems has become more evident in recent years. In this work, using a unified framework, we show that there exists a polyhe…

We propose a projected semi-stochastic gradient descent method with mini-batch for improving both the theoretical complexity and practical performance of the general stochastic gradient descent method (SGD). We are able to prove linear convergence under weak strong convexity assumption. This requires no strong convexit…

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2π.$ The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywher…

Paper tackles image reconstruction from limited data using polyhedral norms and convex regularizers.

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature me…

A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p = 4$, $p > q = 4$ or $q - 3 > p = 3$. It was shown in 2001 that there exist infi…

Smooth 2-tori in R^4 can be approximated by polyhedral Lagrangian or isotropic tori.

Survey on discrete curvature concepts for polygons and polyhedral surfaces.

We show that area minimizing polyhedral surfaces are saddle.

The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.

Study calculates Floer homology for binary polyhedral spaces.

A method to identify important features without solving the full problem.

This paper investigates several global rigidity issues for polyhedral surfaces including inversive distance circle packings. Inversive distance circle packings are polyhedral surfaces introduced by P. Bowers and K. Stephenson as a generalization of Andreev-Thurston's circle packing. They conjectured that inversive dist…

New index theory proves Gromov's dihedral conjectures.

Constructs a moment map flow for isotropic maps on surfaces.

This work describes compactifications of metric spaces and vector spaces using asymmetric norms.

Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.

In this article we introduce the notion of Polyhedral Kahler manifolds, even dimensional polyhedral manifolds with unitary holonomy. We concentrate on the 4-dimensional case, prove that such manifolds are smooth complex surfaces, and classify the singularities of the metric. The singularities form a divisor and the res…

The study connects polyhedral manifolds to Riemannian ones with geometric bounds.