arXiv research

Defines hierarchical clustering axioms for various densities.

Given $iid$ 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…

Partition Tree estimates conditional densities for mixed continuous and categorical variables.

We study the isoperimetric problem in Euclidean space endowed with a density. We first consider piecewise constant densities and examine particular cases related to the characteristic functions of half-planes, strips and balls. We also consider continuous modification of Gauss density in $\R^2$. Finally, we give a list…

Neural network models improve survival analysis with reduced computation time.

New GMM models fit high-dimensional data with fewer parameters.

Given i.i.d samples from some unknown continuous density on hyper-rectangle $[0, 1]^d$, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a binary split of $[0, 1]^d$ and built up sequentially according to discrepancy crite…

This paper uses normalizing flows to approximate transport maps between densities.

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.

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

In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a piecewise constant estimation of the density of the edges across the clusters, and ad…

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 give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is $τ$-close (in total variation distance) to an unknown probability distribution $…

We study a variational problem for piecewise-smooth hypersurfaces in the (n+1)-dimensional Euclidean space with an anisotropic energy. An anisotropic energy is the integral of an energy density that depends on the normal at each point over the considered hypersurface. The minimizer of such an energy among all closed hy…

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…

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…

A new framework for flexible neural network receptive fields.

Investigates chaotic financial time series with monthly contributions and devaluation.

A new method for density estimation using mixture discrepancy and moments.

The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.

New analysis improves SGD for robust and quantile regression with sub-quadratic convergence.

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…

We show that if $g$ is a Riemannian metric on a closed piecewise locally symmetric manifold $M$, then the lift of $g$ to the universal cover $\widetilde{M}$ has a discrete isometry group. We also show that the index $[\Isom(\widetilde{M}): π_1(M)]$ is bounded by a constant independent of $g$.

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

Let $M$ be an $n$-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-κ^2$. Using the cone total curvature $TC(Γ)$ of a graph $Γ$ which was introduced by Gulliver and Yamada Math. Z. 2006, we prove that the density at any point of a soap film-like…

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…

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…

Method identifies latent variables from high-dimensional data with piecewise affine mixing.

New method efficiently interpolates nonparametric density estimators.

A method identifies abrupt changes in functions with fixed confidence under noisy feedback.

Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.

Finding anonymization mechanisms to protect personal data is at the heart of recent machine learning research. Here, we consider the consequences of local differential privacy constraints on goodness-of-fit testing, i.e. the statistical problem assessing whether sample points are generated from a fixed density $f_0$, 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.

BN refines local partition geometry in piecewise-affine networks during training.

Paper introduces differentiable sorting and ranking with $O(n \log n)$ time complexity.

Piecewise normalizing flows improve multi-modal distribution modeling.

We consider the generic regularized optimization problem $\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 $L$ is squared error loss and $J(β)=\|β\|_1$ is the $\ell_1$ 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…