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

Trend · papers per month

16324864 · May 202619922001200920172026
48 results for piecewise-constant eigenvalue profiles

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.

We study the local Szegö-Weinberger profile in a geodesic ball Bg(y0,r0)B_g(y_0,r_0) centered at a point y0y_0 in a Riemannian manifold $(\M,g)$. This profile is obtained by maximizing the first nontrivial Neumann eigenvalue μ2μ_2 of the Laplace-Beltrami Operator ΔgΔ_g on $\M$ among subdomains of Bg(y0,r0)B_g(y_0,r_0) with fixed vol…

2011-10-21abs ↗pdf ↗

Let MSn+1Rn+2M\subset \mathbb{S}^{n+1}\subset\mathbb{R}^{n+2} be a compact cmc rotational hypersurface of the (n+1)(n+1)-dimensional Euclidean unit sphere. Denote by A2|A|^2 the square of the norm of the second fundamental form and J(f)=ΔfnfA2fJ(f)=-Δf-nf-|A|^2f the stability or Jacobi operator. In this paper we compute the spectra of the…

2019-02-19abs ↗pdf ↗

This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of c…

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

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 ↗

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.

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.

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 ↗

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.

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.

Improved covariance matrix estimation for portfolio optimization with guaranteed PSD and controlled conditioning.

problem Guaranteeing positive semidefinite ness and controlling spectral conditioning in IQ estimators.
method Introducing squeezing identity and atomic-IQ parameterization to construct structured channel matrices with PSD guarantees and analytic eigen floor for conditioning control.
result Atomic-IQ improves Sharpe ratios and delivers a more stable risk profile compared to standard estimators.

Profile entropy measures learnability and compressibility of discrete distributions.

problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.

We introduce a novel algorithm that computes the kk-sparse principal component of a positive semidefinite matrix AA. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional eigen-subspace of AA. We obtain provable approximation guarantees that depend on t…

2013-03-03abs ↗pdf ↗

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

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 ↗

We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…

2007-01-07abs ↗pdf ↗

We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …

2017-07-07abs ↗pdf ↗

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.

problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.

Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.

problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.

Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.

problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.