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.

169,051 papers · 148 categories

Trend · papers per month

3876113151 · May 202619922001200920182026
48 results for piecewise constant subspace

Constructs finite element spaces for (p,q)(p,q)-forms, excluding one subspace.

problem Constructing finite element spaces for (p,q)(p,q)-forms.
method Piecewise polynomial finite element spaces for all natural subspaces of (p,q)(p,q)-forms, excluding one subspace.
result Recovers known finite element spaces and introduces new ones.

We present a mathematical analysis of a non-convex energy landscape for robust subspace recovery. We prove that an underlying subspace is the only stationary point and local minimizer in a specified neighborhood under a deterministic condition on a dataset. If the deterministic condition is satisfied, we further show t…

2017-06-13abs ↗pdf ↗

Fast robust subspace tracking in sparse data-dependent noise with near-optimal delay.

problem Robustly tracking time-varying subspaces in the presence of sparse outliers.
method Introduces a fast mini-batch robust ST solution under mild assumptions.
result Provably correct subspace tracking with near-optimal delay and same time complexity as simple PCA.

Injectivity of geodesic ray transform for piecewise constants on compact manifolds.

problem Injectivity of geodesic ray transform for piecewise constant functions.
method Injectivity of geodesic ray transform on piecewise constant functions weighted by a continuous matrix weight.
result Injectivity of the geodesic X-ray transform on piecewise constant functions.

Paper studies efficient function approximation in high-dimensional spaces with low-dimensional structures.

problem Regression of functions varying along a central subspace in high-dimensional spaces.
method Generalized Contour Regression (GCR) algorithm for estimating the central subspace using piecewise polynomials.
result GCR leads to a mean squared estimation error of O(n1)O(n^{-1}) for the central subspace, improving the mean squared regression error of ff to $O(n^{- rac{2s}{2s+d}})$.

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.

New TVD estimator adapts to piecewise constant functions, improving performance.

problem Improving TVD estimator performance for piecewise constant functions.
method Investigates adaptivity of TVD estimator to piecewise constant functions and proposes a data-driven tuning parameter.
result The ideally tuned TVD estimator performs better than in the worst case for piecewise constant functions.

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…

2003-06-10abs ↗pdf ↗

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 ↗

We propose a new learning-based approach to solve ill-posed inverse problems in imaging. We address the case where ground truth training samples are rare and the problem is severely ill-posed - both because of the underlying physics and because we can only get few measurements. This setting is common in geophysical ima…

2018-05-29abs ↗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.

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.

A new method for clustering high-dimensional data into subspaces efficiently and accurately.

problem Inaccurate clustering due to poor intra-subspace similarity in existing methods.
method Iterative Maximum Correlation (IMC) for affinity matrix learning and Piecewise Correlation Estimation (PCE) for densification.
result SDSC framework improves clustering accuracy and efficiency for large-scale data.

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.

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.

Deep Jump Gaussian Processes model high-dimensional piecewise functions.

problem Modeling high-dimensional piecewise continuous functions with limited accuracy.
method Integrates region-specific locally linear projections with Jump Gaussian Processes (JGP) to capture local low-dimensional subspace structures.
result DJGP achieves superior predictive accuracy and more reliable uncertainty quantification compared to existing methods.

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.

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.

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.

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 ↗

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 ↗

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 ↗

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.

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.

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

problem Non-differentiability of sorting and ranking operations in machine learning.
method Differentiable proxies constructed as projections onto the permutahedron and reduction to isotonic optimization.
result First differentiable sorting and ranking operators with O(nlogn)O(n \log n) time and O(n)O(n) space complexity.

We develop a method to learn neural network activations with controlled Lipschitz constant.

problem Increase neural network capacity while controlling Lipschitz constant.
method Variational framework to learn activation functions with piecewise-linear constraints.
result Proves existence of solutions with continuous and piecewise-linear activations.

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 ↗

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 ↗

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…

2010-06-30abs ↗pdf ↗