Study stable commutator length in free products using surface maps.
problem Stable commutator length in free products of groups.
method Using surface maps into a wedge of spaces, proving piecewise rational linearity and embedding properties.
result Stable commutator length in free products is piecewise rational linear when it vanishes on each factor.
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.
LinXGBoost extends XGBoost for better regression of piecewise linear functions.
problem Regression of functions with jumps or discontinuities is challenging.
method LinXGBoost stores linear models at each leaf, equivalent to piecewise regularized least-squares.
result LinXGBoost outperforms vanilla XGBoost and Random Forest in experiments.
We establish a close connection between stable commutator length in free groups and the geometry of sails (roughly, the boundary of the convex hull of the set of integer lattice points) in integral polyhedral cones. This connection allows us to show that the scl norm is piecewise rational linear in free products of Abe…
The center of a quotient group of piecewise linear homeomorphisms is trivial.
problem Understanding the structure of a specific group of homeomorphisms.
method Analyzing a quotient of piecewise linear homeomorphisms of the real line.
result The center of the quotient group is trivial.
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. …
PARC uses piecewise linear predictors for regression and classification.
problem Multivariate regression and classification problems.
method Alternates between ridge and softmax regression, and cluster assignment based on accuracy and separability.
result Converges to a local minimum in a finite number of steps.
Global approximation for piecewise linear paths via signatures.
problem Global approximation theorems for piecewise linear paths.
method Using signatures of piecewise linear paths and their density in Lp-norms. result Linear functionals of signatures are dense in Lp-norms under an integrability condition. The paper approximates smooth isotropic surfaces with piecewise linear ones.
problem Approximating smooth isotropic surfaces with piecewise linear ones.
method Using analogies with infinite dimensional moment map geometry, the authors prove the approximation of smooth isotropic immersions by piecewise linear ones.
result Smooth isotropic immersions can be approximated by piecewise linear isotropic maps.
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.
Investigates stability of piecewise flat Ricci flow using analysis and simulations.
problem Stability of piecewise flat Ricci flow.
method Linear stability analysis and numerical simulations.
result Adaptations avoided numerical instability and led to convergence to smooth solutions.
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 regularization, variable selection procedure. result New high-probability generalization error bounds for piecewise-linear regression trees.
This paper studies PL cobordism categories and their homotopy types.
problem Understanding the homotopy types of PL cobordism categories.
method Introducing a bordism category and showing weak homotopy equivalence to an infinite loop space.
result The classifying space BCdPL is weak homotopy equivalent to an infinite loop space. 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…
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.
Signature uniquely identifies piecewise linear surfaces up to thin homotopy.
problem Characterizing piecewise linear surfaces up to equivalence.
method Crossed module of piecewise linear surfaces and signature homomorphism.
result Signature uniquely characterizes surfaces up to translation and thin homotopy.
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.
First explicit isometric immersion of a flat Klein bottle in 3D space.
problem Finding an isometric embedding of a Klein bottle in 3D.
method Piecewise-linear map from a Klein bottle to Euclidean 3-space.
result Explicit numerical data for a flat Klein bottle isometrically immersed in 3D.
New approach treats neural networks with piecewise linear activations using tropical geometry.
problem Upper bounds on linear regions of neural networks with ReLU or leaky ReLU activations.
method Treat neural network layers with piecewise linear activations as tropical polynomials, refining upper bounds using tropical geometry.
result Upper bounds on linear regions improved to $\min\left\{ 2^m, \sum_{j=0}^n \binom{m}{j}
ight\}$, where n,m are the number of inputs and outputs, respectively. GraN-GAN normalizes gradients for better GAN performance.
problem Improving image generation in GANs with piecewise linear discriminators.
method Piecewise Gradient Normalization (GraN) for input-dependent normalization.
result Significant performance gains in image generation across various datasets.
Paper proposes variational inference for piecewise-linear systems.
problem Intractability of switching dynamical systems.
method Variational approximation and expectation-maximization algorithms.
result Parameters can be estimated off-line, including the number of linear modes.
Smooths local volatility model calibration with piecewise linear variance.
problem Calibrating local volatility models to option prices.
method Extends LiptonSepp2011 approach with piecewise linear variance and non-zero interest rates/dividends.
result Analytical tractability with Kummer's hypergeometric functions.
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.
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.
Embeddings in 5D can be isotoped to closed braids.
problem Embeddings of manifolds in high dimensions.
method Piecewise linear co-dimension two embeddings, isotopy to closed braids.
result Embeddings in 5D can be isotoped to closed braids.
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.
Optimizes piecewise local-linear approximations for global model understanding.
problem Global model behavior interpretation for black-box models.
method Dynamic programming framework for piecewise local-linear approximations with fidelity guarantees.
result Polynomial time algorithm for optimal clustering.
Neural networks can represent complex piecewise functions efficiently.
problem Representing continuous piecewise affine functions with neural networks.
method Two hidden layers with ReLU activation, O(p) neurons for p pieces. result CPA functions can be represented by a neural network with linear size.
New cones in 4D space found with minimal mass.
problem Finding mass-minimizing piecewise linear cones in 4D space.
method Mass minimization via Lipschitz maps, classification of candidates.
result No additional mass-minimizing cones found outside five known cases.
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 L2 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.
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:SnoSn 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.
This paper proposes a distributed Bayesian method for piecewise sparse linear models.
problem High computational cost in simultaneous model selection for piecewise linear models.
method Distributed factorized asymptotic Bayesian (FAB) inference on distributed memory architectures.
result Achieves high prediction accuracy and performance scalability.
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…
We consider the generic regularized optimization problem β^(λ)=argminβL(y,Xβ)+λJ(β). Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407--499] have shown that for the LASSO--that is, if L is squared error loss and J(β)=∥β∥1 is the ℓ1 norm of β--the opti…
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…
New applications of trace embedding lemma show exotic 4-manifolds properties.
problem Detecting exotic phenomena in 4-dimensional smooth structures.
method New applications of trace embedding lemma to study piecewise-linear surfaces.
result Found infinitely many pairs of homeomorphic 4-manifolds with distinct properties.
This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation of the logistic loss function. However, since there is a significant gap between …
This paper tightens bounds on linear regions in piecewise linear neural networks.
problem Understanding the expressiveness of piecewise linear neural networks.
method Analyzes the maximal number of linear regions in single and multi-layer PLNNs, and rectifier networks.
result Derives tighter bounds on the maximal number of linear regions in PLNNs and rectifier networks.
We analyze concave idleness functions of graph curvature.
problem Understanding curvature functions of graphs.
method We study the concavity and piecewise linearity of Ollivier-Ricci idleness functions of graphs.
result Idleness functions are concave and piecewise linear with at most 3 linear parts.
New knots show linear independence in slice concordance.
problem Understanding the structure of rationally slice knots.
method Provided an infinite family of knots that are linearly independent.
result Found knots that are linearly independent and infinite order.
Polytopes in high dimensions have at least 2n+4 normals.
problem Understanding normals to convex polytopes in high dimensions.
method Proved for generic simple polytopes in R^n, n>3.
result Each polytope contains a point with at least 2n+4 normals.
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.