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

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for affine estimators

The paper establishes inequalities for convex curves and applies them to lattice point estimates.

problem Estimating the number of lattice points on convex curves.
method Developed comparison theorems for affine curves and used them to estimate areas and lattice points.
result Established inequalities for areas of inscribed triangles in terms of affine curvature and distance.

New algorithm estimates task affinities without repeated training, improving model performance and efficiency.

problem Efficiently estimating task affinities among multiple tasks for model training.
method Grad-TAG algorithm: trains a base model for all tasks and uses gradient-based linearization to estimate task affinities.
result Estimates task affinities with high accuracy and low computational cost.

We give the best possible upper bound for the number of exceptional values of the Lagrangian Gauss map of complete improper affine fronts in the affine three-space. We also obtain the sharp estimate for weakly complete case. As an application of this result, we provide a new and simple proof of the parametric affine Be…

2010-04-09abs ↗pdf ↗

We test for departures from normal and independent and identically distributed (NIID) returns, when returns under the alternative hypothesis are self-affine. Self-affine returns are either fractionally integrated and long-range dependent, or drawn randomly from an L-stable distribution with infinite higher-order moment…

2014-01-28abs ↗pdf ↗

This article investigates parameter estimation of affine term structure models by means of the generalized method of moments. Exact moments of the affine latent process as well as of the yields are obtained by using results derived for p-polynomial processes. Then the generalized method of moments, combined with Quasi-…

2015-08-07abs ↗pdf ↗

Estimates how many times a star appears due to gravitational lensing.

problem Estimating the number of times an observer sees a star due to gravitational lensing.
method Use affine linking numbers to estimate the number of times an observer sees a star.
result Estimates the number of times an observer sees a star due to gravitational lensing.

First we provide a simple set of sufficient conditions for the weak convergence of scaled affine processes with state space R+×RdR_+ \times R^d. We specialize our result to one-dimensional continuous state branching processes with immigration. As an application, we study the asymptotic behavior of least squares estimators…

2012-10-05abs ↗pdf ↗

For an affine two factor model, we study the asymptotic properties of the maximum likelihood and least squares estimators of some appearing parameters in the so-called subcritical (ergodic) case based on continuous time observations. We prove strong consistency and asymptotic normality of the estimators in question.

2013-02-14abs ↗pdf ↗

New AMP algorithm estimates signals and latent variables in mixed regression models.

problem Estimating signals and latent variables in mixed regression models.
method Approximate Message Passing (AMP) algorithm for matrix GLM.
result State evolution recursion and optimal denoising functions for precise error minimization.

The paper discusses algorithms for reconstructing curves with given Euclidean or affine curvatures.

problem Reconstructing planar curves with specified Euclidean or affine curvatures.
method The paper presents algorithms for curve reconstruction under the special Euclidean and equi-affine groups.
result The reconstructed curves are close to the original curves in terms of the specified curvatures.

We construct noncompact solutions to the affine normal flow of hypersurfaces, and show that all ancient solutions must be either ellipsoids (shrinking solitons) or paraboloids (translating solitons). We also provide a new proof of the existence of a hyperbolic affine sphere asymptotic to the boundary of a convex cone c…

2006-02-22abs ↗pdf ↗

Affine term structure models have gained significant attention in the finance literature, mainly due to their analytical tractability and statistical flexibility. The aim of this article is to present both theoretical foundations as well as empirical aspects of the affine model class. Starting from the original one-fac…

2008-09-11abs ↗pdf ↗

Equal-volume polygons are obtained from adequate discretizations of curves in 3-space, contained or not in surfaces. In this paper we explore the similarities of these polygons with the affine arc-length parameterized smooth curves to develop a theory of discrete affine invariants. Besides obtaining discrete affine inv…

2016-09-28abs ↗pdf ↗

Estimates latent positions in 1D torus from noisy pairwise affinities.

problem Estimating latent positions in a 1D torus from noisy pairwise affinities.
method Introduced an estimation procedure with provable localization error of O(log(n)/n)O(\sqrt{\log(n)/n}).
result The estimation procedure provably localizes latent positions with a maximum error of O(log(n)/n)O(\sqrt{\log(n)/n}).

The paper shows that energy futures yield curves have an affine geometry.

problem Estimating dynamic behavior of yield curves from data while avoiding arbitrage.
method Finite dimensional models for yield curves, diffusion coefficients, and compatibility conditions.
result The compatibility of yield curves with diffusion coefficients forces an affine geometry.

We introduce a class of maps from an affine flat into a Riemannian manifold that solve an elliptic system defined by the natural second order elliptic operator of the affine structure and the nonlinear Riemann geometry of the target. These maps are called affine harmonic. We show an existence result for affine harmonic…

2009-02-15abs ↗pdf ↗

Affine jump-diffusions constitute a large class of continuous-time stochastic models that are particularly popular in finance and economics due to their analytical tractability. Methods for parameter estimation for such processes require ergodicity in order establish consistency and asymptotic normality of the associat…

2018-10-31abs ↗pdf ↗

Paper presents an efficient algorithm for estimating Lipschitz functions from noisy data.

problem Estimating unknown Lipschitz functions from noisy observations.
method Extends max-affine methods to Lipschitz setting using nonlinear feature expansion and adaptive partitioning.
result Achieves minimax convergence rate with respect to intrinsic dimension, up to logarithmic factors.

Estimates box dimension of fractal interpolation surfaces using oscillation vectors.

problem Estimating the complexity of fractal interpolation surfaces.
method Defined vertical scaling matrices and used them to relate oscillation vectors of different levels.
result Obtained the box dimension of generalized affine fractal interpolation surfaces.

Algorithm learns affine transformations robustly from corrupted samples.

problem Learning affine transformations from corrupted samples.
method New geometric certificate and iterative improvement method.
result Total variation distance of O(ε)O(ε) between learned and original distributions.

This paper discusses properties of a Doubly Stochastic Poisson Process (DSPP) where the intensity process belongs to a class of affine diffusions. For any intensity process from this class we derive an analytical expression for probability distribution functions of the corresponding DSPP. A specification of our results…

2011-09-13abs ↗pdf ↗

Paper presents ABGD for efficient piecewise linear regression in high dimensions.

problem Efficiently solving piecewise linear regression in high-dimensional spaces.
method Parametrizes piecewise linear functions as difference of max-affine functions, using ABGD algorithm.
result ABGD converges linearly to an ε-accurate estimate with optimal sample complexity.

This study examines biases in flow matching samplers using finite-sample estimation.

problem Biases in flow matching samplers when using finite-sample surrogates.
method Finite-sample plug-in estimation and hierarchy of empirical FM models.
result Exact empirical minimizer and smoothed plug-in regime identified for affine conditional flows.

Subspace clustering refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Current subspace clustering approaches are usually based on a two-stage framework. In the first stage, an affinity matrix is generated from data. In the second one, spectral clustering is applied on …

2019-10-20abs ↗pdf ↗

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

problem Identifying latent variables from high-dimensional observations with dependencies and piecewise affine transformations.
method Proposes a two-stage method with sparsity and Gaussianity regularization.
result Effectively recovers ground-truth latent variables from synthetic and image data.

The paper generalizes a Steklov eigenvalue inequality for substatic triples under non-negative Ricci curvature.

problem Estimating Steklov eigenvalues for substatic triples under non-negative Ricci curvature.
method Generalization of Fraser-Li type inequality for substatic triples under non-negative Ricci curvature associated with an affine connection.
result The paper provides a new inequality for Steklov eigenvalues of substatic triples.

In this article, we introduce a 22-parameter family of affine connections and derive the Ricci curvature. We first establish an integral Bochner technique. On one hand, this technique yields a new proof to our recent work in \cite{LX} for substatic manifolds. On the other hand, this technique leads to various geometri…

2016-09-05abs ↗pdf ↗