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

Trend · papers per month

265277103 · May 202619922001200920172026
48 results for Piecewise-Constant Densities

Defines hierarchical clustering axioms for various densities.

problem Defining hierarchical clustering for different types of densities.
method An axiomatic approach to piecewise constant densities, then extending to general densities.
result Our axiomatic definition results in Hartigan's cluster tree under certain conditions.

Given iidiid 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…

2014-04-05abs ↗pdf ↗

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

problem Estimating conditional densities for mixed data types.
method Tree-based framework modeling conditional distributions as piecewise-constant densities on adaptive partitions, minimizing conditional negative log-likelihood.
result Improved probabilistic prediction compared to CART-style trees and state-of-the-art methods.

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 R2\R^2. Finally, we give a list…

2009-06-08abs ↗pdf ↗

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

problem Overparameterization and lack of flexibility in GMMs for high-dimensional data.
method Piecewise-constant covariance eigenvalue profiles, EM and penalized EM algorithms.
result Superior likelihood-parsimony tradeoffs in density fitting, clustering, and denoising.

Given i.i.d samples from some unknown continuous density on hyper-rectangle [0,1]d[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[0, 1]^d and built up sequentially according to discrepancy crite…

2015-09-23abs ↗pdf ↗

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…

2015-08-06abs ↗pdf ↗

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.

The fused lasso is analyzed for high-dimensional piecewise-constant regression coefficients.

problem Estimation of high-dimensional piecewise-constant regression coefficients.
method Formulated a restricted isometry condition for the fused lasso estimator and derived estimation bounds.
result The estimation error can be dominated by either the lasso or the fused lasso rate, depending on the number of non-zero coefficients and piece-wise constant segments.

A new framework for flexible neural network receptive fields.

problem Adaptive and flexible receptive fields in neural networks.
method Density-embedding layers that replace affine transformations with scalar products of input and density functions.
result Density-embedding layers can adaptively tune receptive fields and are computationally efficient.

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…

2016-04-07abs ↗pdf ↗

Investigates chaotic financial time series with monthly contributions and devaluation.

problem Analyzing chaotic behavior in financial processes with piecewise contributions and negative interest rates.
method Examines a financial process with monthly contributions and devaluation, showing dichotomy in behavior.
result Financial time series exhibit either periodic sequences or Cantor set of ω-limit points, with chaotic behavior at points of a Cantor attractor.

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…

2019-01-07abs ↗pdf ↗

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

problem Identifying abrupt changes in piecewise constant functions quickly and with certainty.
method Fixed-confidence piecewise constant bandit problem, focusing sampling efforts near change points.
result Asymptotically optimal method proven computationally efficient and effective in experiments.

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

problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.

A new method solves complex financial equations efficiently.

problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.

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…

2018-04-09abs ↗pdf ↗

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…

2019-11-17abs ↗pdf ↗

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…

2019-02-04abs ↗pdf ↗

Smoothing graphons improve link prediction in Bayesian SBM without increasing computational complexity.

problem Accurate modeling of exchangeable relational data with flexible and computationally efficient graphons.
method Introducing smoothing procedures to piecewise-constant graphons to create smoothing graphons, which allow continuous intensity values for relations.
result Smoothing graphons improve AUC and precision for link prediction in real-world data sets.

This paper aims at formulating the issue of ranking multivariate unlabeled observations depending on their degree of abnormality as an unsupervised statistical learning task. In the 1-d situation, this problem is usually tackled by means of tail estimation techniques: univariate observations are viewed as all the more …

2017-05-03abs ↗pdf ↗

MF-PID uses interacting samples to efficiently transport probability mass.

problem Efficiently transporting probability mass in generative models.
method Introducing Mean-Field Path-Integral Diffusion (MF-PID) where samples become interacting agents.
result MF-PID achieves 19-24% reductions in control energy for demand-response control of energy systems.

The paper studies deformation of discrete conformal structures on surfaces using combinatorial curvature flows.

problem Finding piecewise constant curvature metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows, including Ricci flow and Calabi flow, are applied to deform Glickenstein's discrete conformal structures.
result The solution of the combinatorial Ricci flow can be uniquely extended and converges exponentially fast for any initial value under certain conditions.

NODEs with explicit time dependence can interpolate and generalize like piecewise-constant estimators.

problem Learning from finite datasets with neural ODEs.
method Control-theoretic perspective applied to semi-autonomous NODEs.
result SA-NODEs can interpolate and satisfy SCC, leading to generalization rates similar to histogram and nearest-neighbor estimators.

We consider the numerical approximation of the quantile hedging price in a non-linear market. In a Markovian framework, we propose a numerical method based on a Piecewise Constant Policy Timestepping (PCPT) scheme coupled with a monotone finite difference approximation. We prove the convergence of our algorithm combini…

2019-02-28abs ↗pdf ↗

We present the group fused Lasso for detection of multiple change-points shared by a set of co-occurring one-dimensional signals. Change-points are detected by approximating the original signals with a constraint on the multidimensional total variation, leading to piecewise-constant approximations. Fast algorithms are …

2011-06-21abs ↗pdf ↗

We investigate the properties of the combinatorial Ricci flow for surfaces, both forward and backward -- existence, uniqueness and singularities formation. We show that the positive results that exist for the smooth Ricci flow also hold for the combinatorial one and that, moreover, the same results hold for a more gene…

2011-04-11abs ↗pdf ↗

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…

2011-11-25abs ↗pdf ↗

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…

2016-08-18abs ↗pdf ↗

We study the problem of estimating a manifold from random samples. In particular, we consider piecewise constant and piecewise linear estimators induced by k-means and k-flats, and analyze their performance. We extend previous results for k-means in two separate directions. First, we provide new results for k-means rec…

2012-09-05abs ↗pdf ↗