Investigates chaotic financial time series with monthly contributions and devaluation.
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.
Trend · papers per month
Piecewise constant denoising can be solved either by deterministic optimization approaches, based on the Potts model, or by stochastic Bayesian procedures. The former lead to low computational time but require the selection of a regularization parameter, whose value significantly impacts the achieved solution, and whos…
Smooth symplectic manifolds can be approximated by PL symplectic manifolds.
Study identifies change points in piecewise constant reward functions with fixed exploration budget.
The fused lasso is analyzed for high-dimensional piecewise-constant regression coefficients.
We show that on a two-dimensional compact nontrapping manifold with strictly convex boundary, a piecewise constant function is determined by its integrals over geodesics. In higher dimensions, we obtain a similar result if the manifold satisfies a foliation condition. These theorems are based on iterating a local uniqu…
GraN-GAN normalizes gradients for better GAN performance.
The Heston stochastic volatility model is a standard model for valuing financial derivatives, since it can be calibrated using semi-analytical formulas and captures the most basic structure of the market for financial derivatives with simple structure in time-direction. However, extending the model to the case of time-…
We show injectivity of the geodesic X-ray transform on piecewise constant functions when the transform is weighted by a continuous matrix weight. The manifold is assumed to be compact and nontrapping of any dimension, and in dimension three and higher we assume a foliation condition. We make no assumption regarding con…
We show that on a two-dimensional compact nontrapping Riemannian manifold with strictly convex boundary, a piecewise constant function can be recovered from its integrals over geodesics. We adapt the injectivity proof which uses variations through geodesics to recover the function and we improve this result when the ma…
In this paper we develop an approach to conformal geometry of piecewise flat metrics on manifolds. In particular, we formulate the combinatorial Yamabe problem for piecewise flat metrics. In the case of surfaces, we define the combinatorial Yamabe flow on the space of all piecewise flat metrics associated to a triangul…
This paper addresses the problem of segmenting a time-series with respect to changes in the mean value or in the variance. The first case is when the time data is modeled as a sequence of independent and normal distributed random variables with unknown, possibly changing, mean value but fixed variance. The main assumpt…
We study online optimization of smoothed piecewise constant functions over the domain [0, 1). This is motivated by the problem of adaptively picking parameters of learning algorithms as in the recently introduced framework by Gupta and Roughgarden (2016). Majority of the machine learning literature has focused on Lipsc…
The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.
Neural network models improve survival analysis with reduced computation time.
We show that if is a Riemannian metric on a closed piecewise locally symmetric manifold , then the lift of to the universal cover has a discrete isometry group. We also show that the index $[\Isom(\widetilde{M}): π_1(M)]$ is bounded by a constant independent of .
Defines hierarchical clustering axioms for various densities.
The paper proves a theorem for discretizing Gaussian curvature on surfaces.
A piecewise constant curvature manifold is a triangulated manifold that is assigned a geometry by specifying lengths of edges and stipulating that for a chosen background geometry (Euclidean, hyperbolic, or spherical), each simplex has an isometric embedding into the background geometry with the chosen edge lengths. Ad…
New GMM models fit high-dimensional data with fewer parameters.
We prove a Gauss-Bonnet type formula for Riemann-Finsler surfaces of non-constant indicatrix volume and with regular piecewise smooth boundary. We give a Hadamard type theorem for N-parallels of a Landsberg surface.
Piecewise Linear-Quadratic (PLQ) penalties are widely used to develop models in statistical inference, signal processing, and machine learning. Common examples of PLQ penalties include least squares, Huber, Vapnik, 1-norm, and their asymmetric generalizations. Properties of these estimators depend on the choice of pena…
A method identifies abrupt changes in functions with fixed confidence under noisy feedback.
Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.
Given observations from an unknown absolute continuous distribution defined on some domain , we propose a nonparametric method to learn a piecewise constant function to approximate the underlying probability density function. Our density estimate is a piecewise constant function defined on a binary partition o…
A piecewise flat manifold is a triangulated manifold given a geometry by specifying edge lengths (lengths of 1-simplices) and specifying that all simplices are Euclidean. We consider the variation of angles of piecewise flat manifolds as the geometry varies in a particular way, which we call a conformal variation. This…
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…
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…
New method uses DC functions for piecewise linear regression.
A new method solves complex financial equations efficiently.
Paper introduces differentiable sorting and ranking with time complexity.
We consider the generic regularized optimization problem . Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407--499] have shown that for the LASSO--that is, if is squared error loss and is the norm of --the opti…
Marchal's lemma is the basic tool for eliminating collisions when using the direct method of the calculus of variations to establish existence of "designer" solutions to the classical N-body problem. Our goal here is to understand why Marchal's lemma holds, by taking a metric geometry perspective and employing the Jaco…
The double tetrahedron is the triangulation of the three-sphere gotten by gluing together two congruent tetrahedra along their boundaries. As a piecewise flat manifold, its geometry is determined by its six edge lengths, giving a notion of a metric on the double tetrahedron. We study notions of Einstein metrics, consta…
We study the theoretical properties of image denoising via total variation penalized least-squares. We define the total vatiation in terms of the two-dimensional total discrete derivative of the image and show that it gives rise to denoised images that are piecewise constant on rectangular sets. We prove that, if the t…
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 …
In [7], a notion of constant scalar curvature metrics on piecewise flat manifolds is defined. Such metrics are candidates for canonical metrics on discrete manifolds. In this paper, we define a class of vertex transitive metrics on certain triangulations of ; namely, the boundary complexes of cyclic polyt…
2D Total Variation Denoising (TVD) is a widely used technique for image denoising. It is also an important nonparametric regression method for estimating functions with heterogenous smoothness. Recent results have shown the TVD estimator to be nearly minimax rate optimal for the class of functions with bounded variatio…
We consider the problem of nonparametric regression when the covariate is -dimensional, where . In this paper we introduce and study two nonparametric least squares estimators (LSEs) in this setting---the entirely monotonic LSE and the constrained Hardy-Krause variation LSE. We show that these two LSEs are…
In this contribution we derive an explicit formula for the boundary non-crossing probabilities for Slepian processes associated with the piecewise linear boundary function. This formula is used to develop an approximation formula to the boundary non-crossing probabilities for general continuous boundaries. The formulas…
Smoothing graphons improve link prediction in Bayesian SBM without increasing computational complexity.
Partition Tree estimates conditional densities for mixed continuous and categorical variables.
The calibration of a local volatility models to a given set of option prices is a classical problem of mathematical finance. It was considered in multiple papers where various solutions were proposed. In this paper an extension of the approach proposed in LiptonSepp2011 is developed by i) replacing a piecewise constant…
New method unifies and formalizes data partitioning using a single vector.
Given a piecewise linear (PL) function defined on an open subset of , one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle representing the graph of the differential of . Restricting to dimension 2, we show that any smooth functi…
We consider stochastic volatility models using piecewise constant parameters. We suggest a hybrid optimization algorithm for fitting the models to a volatility surface and provide some numerical results. Finally, we provide an outlook on how to further improve the calibration procedure.
The time-evolving precision matrix of a piecewise-constant Gaussian graphical model encodes the dynamic conditional dependency structure of a multivariate time-series. Traditionally, graphical models are estimated under the assumption that data is drawn identically from a generating distribution. Introducing sparsity a…
SGD trains ReLU networks to implement piecewise linear maps with at most 3 knot points.