Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

336598130 · May 202619922001200920172026
48 results for piecewise-linear surfaces

The paper tackles prescribing discrete Gaussian curvature on polyhedral surfaces.

problem Prescribing discrete Gaussian curvature on polyhedral surfaces.
method Discrete conformal theory and variational principles with constraints.
result Proves Kazdan-Warner type theorems for polyhedral surfaces.

Piecewise linear activations create many spurious local minima in neural networks.

problem Understanding the loss surface of neural networks with piecewise linear activations.
method Proved the existence of infinite spurious local minima and partitioned the loss surface into smooth cells.
result Piecewise linear activations create many spurious local minima that are invariant under a continuous path.

A triangulated piecewise-linear minimal surface in Euclidean 3-space defined using a variational characterization is critical for area amongst all continuous piecewise-linear variations with compact support that preserve the simplicial structure. We explicitly construct examples of such surfaces that are embedded and a…

2004-10-13abs ↗pdf ↗

We consider smooth isotropic immersions from the 2-dimensional torus into R2nR^{2n}, for n2n \geq 2. When n=2n = 2 the image of such map is an immersed Lagrangian torus of R4R^4. We prove that such isotropic immersions can be approximated by arbitrarily C0C^0-close piecewise linear isotropic maps. If n3n \geq 3 the piece…

2018-02-23abs ↗pdf ↗

Tropical geometry and weighted lattices improve curve and surface fitting.

problem Fitting max-\star tropical curves and surfaces to data.
method Max-\star algebra, weighted lattices, morphological adjunctions.
result Optimal piecewise-linear regression for max-\star curves and surfaces.

Paper connects surface shape analysis and unbalanced optimal transport.

problem Computing the SRNF shape distance on piecewise linear surfaces.
method Characterizes SRNF shape distance as WFR distance pullback, proposes new algorithm for WFR distance computation.
result Direct computation of SRNF shape distance on piecewise linear surfaces.

New method characterizes surface quadrilateral layouts as special immersions.

problem Characterize surface quadrilateral layouts mathematically.
method Characterizes quadrilateral layouts as special immersions of a cut representation of the surface into the Euclidean plane.
result Mathematically describes and generalizes integer grid maps.

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles needed to forma triangulated embedded orientable surface in R^d having P as its geo…

2002-02-18abs ↗pdf ↗

We consider Zimmer's program of lattice actions on surfaces by PL homomorphisms. It is proved that when the surface is not the torus or Klein bottle the action of any finite-index subgroup of SL(n,Z), n>4, (more generally for any 2-big lattice), factors through a finite group action. The proof is based on an establishm…

2013-01-27abs ↗pdf ↗

This article provides an attempt to extend concepts from the theory of Riemannian manifolds to piecewise linear spaces. In particular we propose an analogue of the Ricci tensor, which we give the name of an Einstein vector field. On a given set of piecewise linear spaces we define and discuss (normalized) Ricci flows. …

2015-08-22abs ↗pdf ↗

We prove that every piecewise linear manifold of dimension up to four on which a finite group acts by piecewise linear homeomorphisms admits a compatible smooth structure with respect to which the group acts smoothly. This solves a challenge posed by Thurston in dimension three and confirms a conjecture by Kwasik and L…

2015-07-09abs ↗pdf ↗

Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson form converges to a piecewise linear form first defined by Kontsevich. The proof …

2010-10-20abs ↗pdf ↗

In this paper, we introduce a bordism category CdPL\mathcal{C}_d^{PL} whose objects are bundles of closed (d1)(d-1)-dimensional piecewise linear manifolds and whose morphisms are bundles of dd-dimensional piecewise linear cobordisms. In the main theorem of this article, we show that the classifying space $B\mathcal{C}_d^{…

2016-08-22abs ↗pdf ↗

We study strip deformations of convex cocompact hyperbolic surfaces, defined by inserting hyperbolic strips along a collection of disjoint geodesic arcs properly embedded in the surface. We prove that any deformation of the surface that uniformly lengthens all closed geodesics can be realized as a strip deformation, in…

2014-07-21abs ↗pdf ↗

The theory of geometric structures on a surface with nonempty boundary can be developed by using a decomposition of such a surface into hexagons, in the same way as the theory of geometric structures on a surface without boundary is developed using the decomposition of such a surface into pairs of pants. The basic elem…

2012-09-30abs ↗pdf ↗

Paper presents ABGD for efficient piecewise linear regression in high dimensions.

problem Efficiently solving piecewise linear regression in high-dimensional spaces.
method Parametrizes piecewise linear functions as difference of max-affine functions, using ABGD algorithm.
result ABGD converges linearly to an ε-accurate estimate with optimal sample complexity.

New proof shows efficient ReLU networks for piecewise linear functions.

problem Existence of efficient ReLU neural networks for piecewise linear functions.
method Degree 1 triangulations of the relative homology class bounded by polyhedra.
result Existence of efficient ReLU neural networks for functions with compact support.

Crooked planes are piecewise linear surfaces that were introduced by Drumm in the early 1990s to construct fundamental domains for properly discontinuous actions of free groups on Minkowski 3-space. In a previous paper, we introduced analogues of these surfaces, called AdS crooked planes, in the 3-dimensional anti-de S…

2014-10-21abs ↗pdf ↗

Equivariant neural networks use symmetry to interpret complex data.

problem Interpreting and understanding the behavior of equivariant neural networks.
method Decompose layers into simple representations and analyze nonlinear activation functions.
result Equivariant neural networks can be interpreted using a filtration generalizing Fourier series.

A hybrid model combines piecewise linear and neural components for interpretable predictions.

problem Post-hoc interpretable methods lead to contradictory explanations and lower prediction accuracy.
method Hybrid model with piecewise linear and neural components.
result The model achieves good interpretability and state-of-the-art accuracy.

The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in http://arxiv.org/abs/math.AG/0209253. The result is established with the help of the …

2003-12-31abs ↗pdf ↗

Hilbert initiated the standpoint in foundations of mathematics. From this standpoint, we allow only a finite number of repetitions of elementary operations when we construct objects and morphisms. When we start from a subset of a Euclidean space. Then we assume that any element of the line has only a finite number of c…

2013-10-21abs ↗pdf ↗

New method uses DC functions for piecewise linear regression.

problem Regression with piecewise linear constraints.
method Estimates piecewise linear convex functions using a difference of convex functions.
result Method achieves close to minimax statistical risk and comparable performance to existing methods.

T-curves are piecewise linear curves which have been used with success since the beginning of the 1990's to construct new real algebraic curves with prescribed topology mainly on the real projective plane. In fact T-curves can be used on any real projective toric surface. We generalize here the construction of the latt…

1999-01-06abs ↗pdf ↗

The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.

problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.

A new complexity measure for neural networks improves upon classical methods.

problem Lack of a refined complexity measure for comparing different neural network architectures, especially permutation-invariant ones.
method Introduced an equivalence relation among linear functions and counted them relative to this relation.
result The new complexity measure clearly distinguishes between different models and increases exponentially with depth.

We reparametrize ReLU NNs as splines to understand their learning dynamics.

problem Understanding the learning dynamics and inductive bias of neural networks.
method Reparametrize ReLU NNs as continuous piecewise linear splines to study learning dynamics.
result Standard weight initializations yield very flat functions, leading to strength and type of implicit regularization.

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

problem Global rigidity of vertex scaling on polyhedral surfaces.
method Elementary variational proof based on continuity of eigenvalues and extension of convex functions.
result Global rigidity of vertex scaling proved without involving 3D hyperbolic geometry.

Simplifies PLNNs to interpretable models for better explainability.

problem Challenges in interpretability of PLNNs for high-stakes applications.
method Trained deep network simplification and algorithm for reducing flat networks.
result Improved interpretability of PLNNs without sacrificing performance.

We exhibit a knot PP in the solid torus, representing a generator of first homology, such that for any knot KK in the 3-sphere, the satellite knot with pattern PP and companion KK is not smoothly slice in any homology 4-ball. As a consequence, we obtain a knot in a homology 3-sphere that does not bound a piecewise-…

2014-05-06abs ↗pdf ↗