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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920182026
48 results for piecewise linear map

Open and discrete maps with specific branch set images are equivalent to PL branched covers.

problem Understanding the equivalence of open and discrete maps and PL branched covers.
method Demonstrated that an open and discrete map f ⁣:SnoSnf \colon \mathbb{S}^n o \mathbb{S}^n with a specific branch set image is equivalent to a PL branched cover up to homeomorphism.
result Open and discrete maps with a specific branch set image are equivalent to PL branched covers.

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.

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 ↗

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f be a simplicial map of the graph S to the plane. The map f is approximab…

2008-08-08abs ↗pdf ↗

SGD trains ReLU networks to implement piecewise linear maps with at most 3 knot points.

problem Understanding the training dynamics of neural networks trained via SGD.
method Mean-field analysis of a two-layer ReLU network trained via SGD for a univariate regression problem.
result At convergence, SGD-trained ReLU networks implement piecewise linear maps with at most 3 knot points.

This work generalizes bounds on the number of linear regions in CPWL NNs.

problem Determining the number of linear regions in CPWL neural networks is challenging.
method Generalized bounds on the maximal number of linear regions for arbitrary CPWL activation functions.
result Depth significantly increases the number of linear regions, but not exponentially.

We study the complexity of functions computable by deep feedforward neural networks with piecewise linear activations in terms of the symmetries and the number of linear regions that they have. Deep networks are able to sequentially map portions of each layer's input-space to the same output. In this way, deep models c…

2014-02-08abs ↗pdf ↗

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 survey consists of two parts. Part 1 is devoted to amoebas. These are images of algebraic subvarieties in the complex torus under the logarithmic moment map. The amoebas have essentially piecewise-linear shape if viewed at large. Furthermore, they degenerate to certain piecewise-linear objects called tropical vari…

2004-02-29abs ↗pdf ↗

For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from (Ω,g)(Ω, g) to a compact Riemannian manifold (N,h)Rk(N,h)\subset\mathbb R^k without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…

2011-08-22abs ↗pdf ↗

This paper uses linear rational splines for invertible modeling, offering a simpler inverse and similar costs.

problem Creating expressive invertible models with tractable Jacobian determinants.
method Replacing affine transformations with linear rational splines in coupling layers.
result Linear rational splines offer a simpler inverse and similar costs for inference and generation.

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 ↗

New algorithm reveals piecewise affine structure of neural networks.

problem Lack of strong guarantees on deep neural networks' behavior in safety-critical applications.
method Developed a novel algorithm to compute the piecewise affine form of neural networks.
result Computed piecewise affine representations of neural networks with rectified linear unit activations.

Piecewise-linear regression trees improve tree-based regression with theoretical and practical benefits.

problem Improving tree-based regression models with theoretical guarantees and practical tractability.
method Regularized piecewise-linear node-splitting criterion, LASSO-type and 2\ell_{2} regularization, variable selection procedure.
result New high-probability generalization error bounds for piecewise-linear regression trees.

Study growth patterns in random networks using i.i.d. perturbations.

problem Understanding the growth of affine regions in random piecewise-linear networks.
method Analyzes a random compositional model with i.i.d. perturbations of the tent map, proving submultiplicative pressure and using finite-state defect process for upper-tail lower bounds.
result Proves the existence of a submultiplicative pressure for \(N_n\) and gives exponential upper bounds for \(n^{-1}\log N_n\).

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 ↗

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 method for identifying NPWARX models with arbitrary domains using probabilistic mixture models.

problem Identifying hybrid system models with discontinuous maps.
method Probabilistic mixture model with a neural network for nonlinear partitioning and Expectation Maximization for parameter estimation.
result Demonstrated on a nonlinear piece-wise problem with discontinuous maps.

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.

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 ↗

Introduces HTV to measure function complexity in learning schemes.

problem Assessing the complexity of supervised-learning schemes.
method Defines Hessian-Schatten total variation (HTV) as a seminorm to quantify function complexity.
result HTV is invariant to rotations, scalings, and translations, and its minimum value is achieved for linear mappings.

New GP model estimates piecewise continuous functions.

problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.

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.

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.

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.

Let C^Z\widehat{\mathcal{C}}_{\mathbb{Z}} denote the group of knots in homology spheres that bound homology balls, modulo smooth concordance in homology cobordisms. Answering a question of Matsumoto, the second author previously showed that the natural map from the smooth knot concordance group C\mathcal{C} to $\wideha…

2018-01-23abs ↗pdf ↗

We study algebraic varieties of ReLU networks to understand their representable functions.

problem Understanding the functions that ReLU neural networks can represent.
method We introduce algebraic varieties associated with ReLU networks and derive polynomial equations to characterize representable functions.
result Conditions under which ReLU networks attain their expected dimension, providing insight into their structural properties.

Proposes adaptive ridge regression for functional linear models with piecewise shapes.

problem Functional linear regression with unknown coefficient function.
method Adaptive piecewise function template with L2L_2 penalization.
result Improves predictive power and interpretability compared to standard methods.

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.

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.

Support vector machines (SVM) and other kernel techniques represent a family of powerful statistical classification methods with high accuracy and broad applicability. Because they use all or a significant portion of the training data, however, they can be slow, especially for large problems. Piecewise linear classifie…

2017-08-20abs ↗pdf ↗

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.

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 ↗