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,878 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for piecewise visual

The horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

problem Characterizing the horoboundary of Teichmüller space.
method Using the relationship between the horofunction and visual compactifications of Teichmüller spaces.
result The horoboundary of Teichmüller space is path connected and has non-dense Busemann points.

We describe a method to infer dense depth from camera motion and sparse depth as estimated using a visual-inertial odometry system. Unlike other scenarios using point clouds from lidar or structured light sensors, we have few hundreds to few thousand points, insufficient to inform the topology of the scene. Our method …

2019-05-15abs ↗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.

These lectures were a part of the geometry course held during the Fall 2011 Mathematics Advanced Study Semesters (MASS) Program at Penn State (\url{http://www.math.psu.edu/mass/}). The lectures are meant to be accessible to advanced undergraduate and early graduate students in mathematics. We have placed a great emphas…

2014-05-26abs ↗pdf ↗

Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise to a piecewise linear (PL) approximant. This is extended to isotopic convergenc…

2016-03-28abs ↗pdf ↗

To help understand the underlying mechanisms of neural networks (NNs), several groups have, in recent years, studied the number of linear regions \ell of piecewise linear functions generated by deep neural networks (DNN). In particular, they showed that \ell can grow exponentially with the number of network paramet…

2019-05-27abs ↗pdf ↗

Proposes a flexible feature allocation model for sparse factor analysis.

problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.

Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.

problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.

Study geometrically characterizes piecewise circular curves with decreasing curvature.

problem Characterizing piecewise circular curves with decreasing curvature.
method Introducing moduli spaces and relating them to Legendrian polygons.
result Proves the moduli space contains a connected component homeomorphic to the Fock-Goncharov space of positive flags.

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.

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

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 ↗

A piecewise flat Finsler metric on a triangulated surface MM is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of geodesics on a piecewise flat Finsler surface, especially when it meets a vertex…

2016-08-21abs ↗pdf ↗

The problem of time-series clustering is considered in the case where each data-point is a sample generated by a piecewise stationary ergodic process. Stationary processes are perhaps the most general class of processes considered in non-parametric statistics and allow for arbitrary long-range dependence between variab…

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

Paper proposes algorithms to accurately identify breakpoints in piecewise regression.

problem Identifying accurate breakpoints in piecewise regression for better data fitting.
method Proposes novel greedy algorithms to minimize error and determine optimal breakpoints.
result The proposed algorithms outperform existing methods in accuracy and efficiency.

Simplicial, piecewise-flat discretizations of manifolds provide a clear path towards curvature analysis on discrete geometries and for solutions of PDE's on manifolds of complex topologies. In this manuscript we review and expand on discrete exterior calculus methods using hybrid domains. We then analyze the geometric …

2012-12-05abs ↗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 ↗

The paper establishes a discrete uniformization theorem for surfaces with piecewise hyperbolic metrics.

problem Finding decorated piecewise hyperbolic metrics with prescribed combinatorial curvature.
method Introduced combinatorial α-Ricci flow with surgery to handle potential singularities and prove longtime existence and convergence.
result Existence of decorated piecewise hyperbolic metrics with prescribed combinatorial α-curvature.

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.

The paper proves a theorem for discretizing Gaussian curvature on surfaces.

problem Discretizing Gaussian curvature on surfaces with nonpositive Euler number.
method Discrete conformal theory and variational principles with constraints.
result Each decorated piecewise Euclidean metric on surfaces with nonpositive Euler number is discrete conformal to a metric with a specific discrete curvature constant.

New algorithm detects changes in combinatorial semi-bandit rewards.

problem Detecting changes in piecewise-stationary reward distributions in combinatorial semi-bandits.
method Combination of CUCB algorithm and GLRT change-point detector.
result Regret bound of O(√(NKTlogT)) for piecewise-stationary combinatorial semi-bandits.

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.

We introduce a new multi-dimensional nonlinear embedding -- Piecewise Flat Embedding (PFE) -- for image segmentation. Based on the theory of sparse signal recovery, piecewise flat embedding with diverse channels attempts to recover a piecewise constant image representation with sparse region boundaries and sparse clust…

2018-02-09abs ↗pdf ↗

Deep neural networks with piecewise-polynomial activations can approximate smooth functions and their derivatives.

problem Approximating smooth functions and their derivatives with neural networks.
method Derives the depth, width, and sparsity required for approximation in Hölder norms.
result Deep neural networks with bounded weights can approximate Hölder smooth functions and their derivatives.

Discrete forms of the scalar, sectional and Ricci curvatures are constructed on simplicial piecewise flat triangulations of smooth manifolds, depending directly on the simplicial structure and a choice of dual tessellation. This is done by integrating over volumes which include appropriate samplings of hinges for each …

2016-03-10abs ↗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.

Generalizes Thurston's jiggling lemma for piecewise smooth solutions.

problem Creating piecewise smooth solutions of differential relations without homotopical assumptions.
method Jiggling arbitrary sections of EE to construct solutions of R\mathcal{R}.
result Generalization of Thurston's lemma for piecewise smooth solutions of differential relations.

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 ↗

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 ↗