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

105211316421 · Jun 202019922001200920172026
48 results for piecewise linear regimes

A new tree-based model for multivariate responses interprets piecewise linear regimes.

problem Recovering piecewise multivariate linear regimes in complex data.
method Twoblock clustering trees with coskewness-based dimension reduction.
result Recovery of piecewise linear regimes in data.

New method samples from piecewise smooth distributions using Hamiltonian Monte Carlo.

problem Sampling from distributions with discontinuous gradients.
method Generalized Randomized Hamiltonian Monte Carlo (GRHMC) for piecewise smooth targets.
result GRHMC processes sample from piecewise smooth target distributions with the desired distribution as the invariant distribution.

Study identifies change points in piecewise constant reward functions with fixed exploration budget.

problem Locating abrupt changes in piecewise constant reward functions under bandit feedback.
method Fixed exploration budget, piecewise constant bandit problem, lower bounds, near optimal algorithms.
result Established lower bounds and near matching upper bounds for both small and large budgets.

PAR provides a flexible framework for quantization in optimization problems.

problem Challenges in optimization problems over discrete or quantized variables.
method Piecewise-affine regularization (PAR) for modeling and computational optimization.
result PAR-regularized loss functions exhibit high quantization at critical points in the overparameterized regime.

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\).

Study shows efficient neural network approach for stochastic bandits.

problem Optimizing decisions in uncertain environments with neural network models.
method OFU-ReLU algorithm that balances exploration and exploitation, using a transformed feature space.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret guarantee for stochastic bandits with ReLU neural networks.

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 ↗

Exact solutions reveal how unbalanced initializations promote rapid feature learning in neural networks.

problem Understanding how neural networks efficiently extract features from data.
method Deriving exact solutions to a minimal model of neural networks transitioning between lazy and rich learning regimes.
result Unbalanced layer-specific initialization variances and learning rates determine the degree of feature learning.

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.

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 ↗

Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.

problem Detecting change-points and estimating parameters in nonlinear dynamical systems with regime transitions.
method Residual-loss anomaly analysis of physics-informed neural networks, two-stage strategy.
result The method outperforms traditional approaches in change-point localization and parameter estimation accuracy.

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.

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 ↗

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.

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 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 present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on Rademacher complexity framework, we present new high-probability upper bounds for …

2019-06-29abs ↗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.

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 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.

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 ↗

XGBoost is often presented as the algorithm that wins every ML competition. Surprisingly, this is true even though predictions are piecewise constant. This might be justified in high dimensional input spaces, but when the number of features is low, a piecewise linear model is likely to perform better. XGBoost was exten…

2017-10-10abs ↗pdf ↗

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 the generic regularized optimization problem β^(λ)=argminβL(y,Xβ)+λJ(β)\hat{\mathsfβ}(λ)=\arg \min_βL({\sf{y}},X{\sfβ})+λJ({\sfβ}). Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407--499] have shown that for the LASSO--that is, if LL is squared error loss and J(β)=β1J(β)=\|β\|_1 is the 1\ell_1 norm of ββ--the opti…

2007-08-16abs ↗pdf ↗

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 ↗

We present a new, unifying approach following some recent developments on the complexity of neural networks with piecewise linear activations. We treat neural network layers with piecewise linear activations as tropical polynomials, which generalize polynomials in the so-called (max,+)(\max, +) or tropical algebra, with pos…

2018-05-22abs ↗pdf ↗