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

2468 · May 201619922001200920172026
48 results for Laguerre quadrature

Laguerre geometry of surfaces in R3\R^3 is given in the book of Blaschke [1], and have been studied by E.Musso and L.Nicolodi [5], [6], [7], B. Palmer [8] and other authors. In this paper we study Laguerre differential geometry of hypersurfaces in Rn\R^n. For any umbilical free hypersurface x:MRnx: M\to\R^n with non-zero …

2006-06-14abs ↗pdf ↗

A Laguerre minimal surface is an immersed surface in the Euclidean space being an extremal of the functional \int (H^2/K - 1) dA. In the present paper, we prove that the only ruled Laguerre minimal surfaces are up to isometry the surfaces R(u,v) = (Au, Bu, Cu + D cos 2u) + v (sin u, cos u, 0), where A, B, C, D are fixe…

2010-11-01abs ↗pdf ↗

The study of Laguerre isotropic hypersurfaces with rigidity and isoparametric properties.

problem Characterizing and understanding Laguerre isotropic hypersurfaces.
method Analyzing hypersurfaces with zero Laguerre form and constant eigenvalues of the Laguerre tensor.
result For L-isotropic hypersurfaces, if they are also L-isoparametric, the constant λλ must be zero.

In this paper we show that a Dupin hypersurface with constant Möbius curvatures is Möbius equivalent to either an isoparametric hypersurface in the sphere or a cone over an isoparametric hypersurface in a sphere. We also show that a Dupin hypersurface with constant Laguerre curvatures is Laguerre equivalent to a flat L…

2015-03-10abs ↗pdf ↗

This paper connects Laguerre minimal surfaces to Weierstrass representations.

problem Understanding the relationship between Laguerre minimal surfaces and Weierstrass representations.
method Defining spherical mean curvature and providing Weierstrass-type representations for two classes of surfaces.
result Laguerre minimal surfaces are related to H2H_2-surfaces, providing a new Weierstrass-type representation.

This exposition gives an introduction to the theory of surfaces in Laguerre geometry and surveys some results, mostly obtained by the authors, about three important classes of surfaces in Laguerre geometry, namely L-isothermic, L-minimal, and generalized L-minimal surfaces. The quadric model of Lie sphere geometry is a…

2018-02-15abs ↗pdf ↗

Spinor representation in isotropic space via Laguerre geometry.

problem Representing conformal and constant mean curvature surfaces in isotropic space.
method Developing Laguerre geometry of isotropic space, defining spin transformations, and constructing Weierstrass and Kenmotsu representations.
result Explicit constructions of zero mean curvature and constant mean curvature surfaces.

A new method for pricing derivatives using self-exciting dynamics and finite-difference transforms.

problem Pricing derivatives with accumulated marks using a self-exciting marked point process.
method Derive discounted pricing equation as a PIDE, transform to one-dimensional PIDEs, use Laplace/Fourier transform, approximate jump term, solve using finite difference scheme.
result Efficiently price derivatives with accumulated marks using a novel finite-difference and transform approach.

A Laguerre geometric local characterization is given of L-minimal surfaces and Laguerre deformations (T-transforms) of L-minimal isothermic surfaces in terms of the holomorphicity of a quartic and a quadratic differential. This is used to prove that, via their Laguerre Gauss maps, the T-transforms of L-minimal isotherm…

2014-01-08abs ↗pdf ↗

Motivated by the study of wave fronts in anisotropic media, we propose an incidence geometry of anisotropic spheres in a Finsler-Minkowski space. An anisotropic version of the Laguerre functional is considered. In some circumstances, this functional can be used to determine that two wavefronts observed at distinct time…

2014-03-31abs ↗pdf ↗

We use the isotropic projection of Laguerre geometry in order to establish a correspondence between plane curves and null curves in the Minkowski 33-space. We describe the geometry of null curves (Cartan frame, pseudo-arc parameter, pseudo-torsion, pairs of associated curves) in terms of the curvature of the correspon…

2016-05-06abs ↗pdf ↗

New quadrature method using randomly pivoted Cholesky outperforms existing techniques.

problem Efficiently approximating integrals of functions in reproducing kernel Hilbert spaces.
method Nodes drawn by randomly pivoted Cholesky algorithm.
result Randomly pivoted Cholesky quadrature is fast and achieves comparable accuracy to more computationally intensive methods.

SOBER optimizes and quadrates efficiently in parallel for diverse tasks.

problem Scalability of batch Bayesian optimization and quadrature for expensive functions.
method Reformulates batch selection as a quadrature problem, balancing exploitation and exploration.
result SOBER outperforms 11 baselines on 12 tasks.

Improved Gaussian Process regression using TQFF over RFF and Gaussian QFF.

problem Limited performance of Quadrature Fourier Features (QFF) in approximating highly oscillatory functions.
method Developed Trigonometric Quadrature Fourier Features (TQFF) using a novel non-Gaussian quadrature rule.
result TQFF provides better approximation accuracy and fewer features compared to RFF and Gaussian QFF.

We study quadrature rules for functions from an RKHS, using nodes sampled from a determinantal point process (DPP). DPPs are parametrized by a kernel, and we use a truncated and saturated version of the RKHS kernel. This link between the two kernels, along with DPP machinery, leads to relatively tight bounds on the qua…

2019-06-18abs ↗pdf ↗

Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…

2014-08-09abs ↗pdf ↗

Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…

2012-04-07abs ↗pdf ↗

We give an elaborated treatment of discrete isothermic surfaces and their analogs in different geometries (projective, Möbius, Laguerre, Lie). We find the core of the theory to be a novel projective characterization of discrete isothermic nets as Moutard nets. The latter belong to projective geometry and are nets with …

2006-10-13abs ↗pdf ↗

A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds optimal values of function (value-nodes) and the corresponding weights. The Gaussi…

2018-07-17abs ↗pdf ↗

We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the plane is known to admit a great variety of geometric properties which are also pres…

2018-08-22abs ↗pdf ↗

Adaptive Bayesian quadrature (ABQ) is a powerful approach to numerical integration that empirically compares favorably with Monte Carlo integration on problems of medium dimensionality (where non-adaptive quadrature is not competitive). Its key ingredient is an acquisition function that changes as a function of previou…

2019-05-24abs ↗pdf ↗

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

This paper introduces repulsive Monte Carlo methods for computing the sliced Wasserstein distance.

problem Computing the integral of a function on the unit sphere using Monte Carlo methods.
method The approach involves using determinantal point processes and repelled point processes to create quadratures for the sliced Wasserstein distance.
result The UnifOrtho estimator is recommended for the computation of the sliced Wasserstein distance in large dimensions.

New Fourier features improve high-precision approximation in large-scale problems.

problem Designing scalable, high-precision Fourier features for large-scale kernel methods.
method Introducing a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions.
result Improved approximation bounds with new Fourier features.

Improved Nyström approximation for kernel quadrature with theoretical guarantees.

problem Efficiently approximating positive definite kernels for large datasets.
method Refined sampling and subspace selection in Nyström approximation.
result Novel theoretical guarantees for non-i.i.d. landmark points in kernel quadrature.

Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the approximation errors. Our aim is to design a method for moment transformation for …

2017-01-05abs ↗pdf ↗

Adaptive quadrature improves Bayesian inference through active learning.

problem Efficiently estimating posterior densities in Bayesian inference.
method Sequential node selection using acquisition functions, combining interpolative surrogate models and quadrature rules.
result Positive estimation of marginal likelihood with improved accuracy.

Improved kernel herding algorithm for faster quadrature rule convergence.

problem Slow convergence speed of standard kernel herding algorithm.
method Improved gradient approximation to obtain sparser solutions.
result The cosine of the angle between negative gradient and approximate gradient determines convergence speed.

Efficiently marginalizes over Gaussian Process kernels for better model flexibility and uncertainty.

problem Inefficient marginalization over Gaussian Process kernels for large datasets.
method Bayesian Quadrature scheme with maximum mean discrepancies and invariances between Spectral Mixture kernels.
result Achieves more accurate predictions and better calibrated uncertainty than state-of-the-art baselines.