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 Gauß-Legendre quadrature

Regularization preserves topological data structure in autoencoders.

problem Ensuring topological data structure preservation in autoencoders.
method Regularization using Legendre nodes to preserve manifold embedding.
result Regularized autoencoders ensure one-to-one embedding of data manifolds.

Study of contact whirl curves in Sasakian Lorentzian 3-manifolds.

problem Understanding the geometric properties of curves in Lorentzian contact manifolds.
method Introducing and analyzing contact whirl curves, deriving differential equations, and proving rigidity phenomena.
result Every non-geodesic Legendre Frenet curve is a contact whirl curve with constant torsion τ=1.

QSurv models survival data without discretization, achieving high accuracy.

problem Intractable likelihood estimation for continuous-time survival models.
method QSurv uses numerical quadrature for cumulative hazard approximation and time-conditioned low-rank adaptation.
result QSurv achieves competitive predictive performance and interpretable hazard patterns.

In this paper we describe how one can obtain Lie group structures on the group of (vertical) bundle automorphisms for a locally convex principal bundle P over the compact manifold M. This is done by first considering Lie group structures on the group of vertical bundle automorphisms Gau(P). Then the full automorphism g…

2006-12-18abs ↗pdf ↗

The study examines Bertrand Legendre curves in the unit tangent bundle over Euclidean plane.

problem Investigating properties of Legendre curves and their associated curves.
method Analyzing Bertrand Legendre curves and their associated curves, including parallel, evolute, and involute curves.
result Existence conditions and inverse operation for Bertrand Legendre curves are provided.

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.

A geometrization of Schmidt-Legendre transformation of the second order Lagrangians is proposed by building a proper Tulczyjew's triplet. The symplectic relation between Ostrogradsky-Legendre and Schmidt-Legendre transformations is obtained. Several examples are presented.

2016-07-28abs ↗pdf ↗

Legendre transformations link related integrable hierarchies.

problem Understanding relationships between integrable hierarchies.
method Legendre-type transformations of generalized Frobenius manifolds.
result Linear reciprocal transformations link related hierarchies.

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 ↗

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 ↗

The report analyzes Legendre decomposition for tensor data.

problem Finding effective lower dimensional representations of tensors.
method Theoretical analysis of dual parameters and dually flat manifold properties, followed by experimental verification and clustering.
result Parameters on submanifold cannot be directly used as low-rank representations.

A new family of conformal test martingales based on Legendre polynomials for online exchangeability testing.

problem Detecting variance, skewness, and higher-order deviations from uniformity in online data.
method A family of conformal test martingales based on shifted Legendre polynomials.
result The Variational Legendre Jumper reduces exponential scaling to linear time with minimal loss in power.

The paper studies a flow of Legendre curves, generalizing the inverse curvature flow of regular curves.

problem Analyzing the inverse curvature flow of Legendre curves.
method Investigates the unique existence, monotonicity, and asymptotic behavior of the flow.
result The flow asymptotically converges to a self-similar solution, categorized by initial curve.

We introduce complex generalizations of the classical Legendre transform, operating on Kähler metrics on a compact complex manifold. These Legendre transforms give explicit local isometric symmetries for the Mabuchi metric on the space of Kähler metrics around any real analytic Kähler metric, answering a question origi…

2016-08-19abs ↗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 ↗

Legendre curves are smooth plane curves which may have singular points, but still have a well defined smooth normal (and corresponding tangent) vector field. Because of the existence of singular points, the usual curvature concept for regular curves cannot be straightforwardly extended to these curves. However, Fukunag…

2017-04-17abs ↗pdf ↗

Following Burstall and Hertrich-Jeromin we study the Ribaucour transformation of Legendre submanifolds in Lie sphere geometry. We give an explicit parametrization of the resulted Legendre submanifold F^\hat{F} of a Ribaucour transformation, via a single real function ττ which represents the regular Ribaucour sphere co…

2013-03-08abs ↗pdf ↗

We propose a method for inferring the conditional indepen- dence graph (CIG) of a high-dimensional discrete-time Gaus- sian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as, e.g., an autoregressive model) for the vector random process; rather, it only assu…

2013-11-13abs ↗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.

In some previous papers, a Legendre duality between Lagrangian and Hamiltonian Mechanics has been developed. The (ρ,η)-tangent application of the Legendre bundle morphism associated to a Lagrangian L or Hamiltonian H is presented. Using that, a Legendre description of Lagrangian Mechanics and Hamiltonian Mechanics is d…

2011-08-29abs ↗pdf ↗

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an inpu…

2018-02-13abs ↗pdf ↗

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.

The Runge-Kutta-Legendre scheme improves pricing American options and other derivatives.

problem Pricing American options and other derivatives with improved accuracy and stability.
method Runge-Kutta-Legendre finite difference scheme applied to Black-Scholes and Heston models.
result Improved convergence and stability compared to existing schemes.

The general framework of Legendre transformation is extended to the case of symplectic groupoids, using an appropriate generalization of the notion of generating function (of a Lagrangian submanifold).

1996-12-04abs ↗pdf ↗

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.