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

Trend · papers per month

10213141 · Jun 202019922001200920172026
48 results for PBW basis

Recently S. Merkulov established a new link between differential geometry and homological algebra by giving descriptions of several differential geometric structures in terms of algebraic operads and props. In particular he described Nijenhuis structures as corresponding to representations of the cobar construction on …

2008-09-12abs ↗pdf ↗

Unique vertical isomorphisms between Fedosov dg manifolds are proven for Lie pairs.

problem Vertical isomorphisms of Fedosov dg manifolds associated with Lie pairs.
method Construction of Fedosov dg manifolds via splitting and connection, proving unique isomorphisms using iteration formula.
result Existence and uniqueness of vertical isomorphisms between Fedosov dg manifolds.

Inspired by the recent work of Chen-Stiénon-Xu on Atiyah classes associated to inclusions of Lie algebroids, we give a very simple criterium (in terms of those classes) for relative Poincaré-Birkhoff-Witt type results to hold. The tools we use (e.g. the first infinitesimal neighbourhood Lie algebroid) are straightforwa…

2012-05-14abs ↗pdf ↗

Extends quantization theory to mixed polarizations using transverse differential operators.

problem Quantization in mixed polarization.
method Developed a theory of transverse differential operators associated to non-singular polarizations.
result Obtained a geometric interpretation of deformation quantization and sheaf of subalgebras acting on polarized sections.

To a closed wide Lie subgroupoid A\mathbf{A} of a Lie groupoid L\mathbf{L}, i.e. a Lie groupoid pair, we associate an Atiyah class which we interpret as the obstruction to the existence of L\mathbf{L}-invariant fibrewise affine connections on the homogeneous space L/A\mathbf{L}/\mathbf{A}. For Lie groupoid pairs with…

2015-07-04abs ↗pdf ↗

Finsler space is differentiable manifold for which Minkowski space is the fiber of the tangent bundle. To understand structure of the reference frame in Finsler space, we need to understand the structure of orthonormal basis in Minkowski space. In this paper, we considered the definition of orthonormal basis in Minkows…

2012-01-19abs ↗pdf ↗

Finsler space is differentiable manifold for which Minkowski space is the fiber of the tangent bundle. To understand structure of the reference frame in Finsler space, we need to understand the structure of orthonormal basis in Minkowski space. In this paper, I considered the definition of orthonormal basis in Minkowsk…

2011-07-24abs ↗pdf ↗

We study a novel spline-like basis, which we name the "falling factorial basis", bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations in basis matrix multiplication and basis matrix inversion. The falling factoria…

2014-05-03abs ↗pdf ↗

We introduce a basis of the Orlik-Solomon algebra labeled by chambers, so called chamber basis. We consider structure constants of the Orlik-Solomon algebra with respect to the chamber basis and prove that these structure constants recover D. Cohen's minimal complex from the Aomoto complex.

2007-03-25abs ↗pdf ↗

New framework models complex spatial data with basis functions and graphical vectors.

problem Modeling highly-multivariate spatial processes with varying resolutions.
method Extends graphical lasso to multivariate Gaussian processes with independent graphical vectors at different resolutions, using an orthogonal basis and fusion penalty.
result Linear complexity and parsimonious conditional independence structure in multilevel graphical model.

Machine learning model predicts DFT total energy to complete basis set limit.

problem Finding a model to extrapolate DFT calculations to complete basis set limit.
method Quantile-random-forest model trained on binary solids data.
result Random-forest model achieves <25% symmetric MAPE for both DFT codes.

Optimizes basis for density-based atomic representations to enhance compactness and accuracy.

problem Improving the efficiency and accuracy of machine learning models for atomic properties.
method An unsupervised approach to determine the optimal basis set for atom density representations using splines.
result Optimal basis sets that encode structural information more compactly and accurately.

This study tackles basis risk in weather parametric insurance using Monte Carlo simulations.

problem Mismatch between actual loss and payout in weather parametric insurance leads to loss without payout or payout without loss.
method Empirical research using Monte Carlo simulations to test diversification and hedging strategies.
result Portfolio basis risk and volatility decrease with more contracts, and spatial relationships significantly impact basis risk.

The study explores various localized bases and their duals for scattered data approximation.

problem Scattered data approximation using radial basis functions.
method Examines different localized bases including Lagrange, Newton, and multiresolution versions, and their duals.
result Localized orthogonal bases, such as the Newton basis, offer symmetric preconditioners and are feasible for scattered data approximation.

A negative basis trade enters a long bond position and buys protection on the issuer of the bond through credit default swap (CDS), aiming at arbitrage profit due to the bond-CDS basis. To classic reduced form model theorists, the existence of the basis is an abnormality or merely liquidity noise. Such a view, however,…

2020-02-20abs ↗pdf ↗

T-Basis represents neural network tensors with fewer parameters.

problem Efficiently representing neural network tensors with fewer parameters.
method T-Basis uses Tensor Rings to represent tensors in a neural network, parameterizing them with a small number of coefficients.
result T-Basis achieves high compression rates with minimal performance loss.

This paper optimizes PCE for efficient surrogate modeling in engineering.

problem Efficiently selecting polynomial regressors for surrogate modeling in computationally expensive models.
method Three state-of-the-art basis-adaptive sparse PCE methods are compared and analyzed.
result Automatic selection of the best solver and basis-adaptive scheme improves surrogate model accuracy.

In this paper we study a symmetry group of vector space. Basis manifold is a homogeneous space of a symmetry group. This concept leads us to the definition of active and passive transformations on basis manifold. Active transformation can be expressed as a transformation of vector space. Passive transformation gives ab…

2004-12-20abs ↗pdf ↗

Sparse principal component analysis (sparse PCA) aims at finding a sparse basis to improve the interpretability over the dense basis of PCA, meanwhile the sparse basis should cover the data subspace as much as possible. In contrast to most of existing work which deal with the problem by adding some sparsity penalties o…

2014-03-06abs ↗pdf ↗

A new kernel improves statistical surrogates for stochastic manifolds with diverse data.

problem Handling statistical surrogates for stochastic manifolds with heterogeneous data.
method A transient anisotropic kernel is introduced to improve statistical surrogates for stochastic manifolds with heterogeneous data.
result The transient anisotropic kernel provides a better representation of statistical dependencies in the learned probability measure.

BASIS improves LLM reasoning by sharing batchwise rollout info, reducing MSE by 69%.

problem Improving large language model reasoning with limited rollouts and batch information.
method BASIS samples only one rollout per prompt but uses batch information to improve value function estimation.
result BASIS reduces MSE in value function estimation by 69% compared to REINFORCE++.

Ordinal Regression (OR) aims to model the ordering information between different data categories, which is a crucial topic in multi-label learning. An important class of approaches to OR models the problem as a linear combination of basis functions that map features to a high dimensional non-linear space. However, most…

2018-06-18abs ↗pdf ↗

We study the problem of dynamically trading a futures contract and its underlying asset under a stochastic basis model. The basis evolution is modeled by a stopped scaled Brownian bridge to account for non-convergence of the basis at maturity. The optimal trading strategies are determined from a utility maximization pr…

2018-09-16abs ↗pdf ↗

Derives representations invariant under crystallographic groups for functions.

problem Representing and learning functions invariant under crystallographic groups.
method Derives linear and nonlinear representations of functions invariant under crystallographic groups.
result Derives orthonormal crystallographically invariant basis functions and embedding maps.

Given a simple algebraic group GG, a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations. Following the work of Westbury, we produce a set of webs for $\SL_n$ which form a bas…

2011-08-23abs ↗pdf ↗

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing ideals plays a critical role. However, such an approximation also gives rise to a…

2019-01-25abs ↗pdf ↗

Nonnegative matrix factorization (NMF) is a widely used linear dimensionality reduction technique for nonnegative data. NMF requires that each data point is approximated by a convex combination of basis elements. Archetypal analysis (AA), also referred to as convex NMF, is a well-known NMF variant imposing that the bas…

2019-10-02abs ↗pdf ↗

Introduces tunable basis functions for Gaussian processes.

problem Reduces computational complexity in Gaussian process approximations.
method Introduces tunable, local, and bounded basis functions for kernel approximation.
result Demonstrates superior performance compared to state-of-the-art methods, especially with poorly chosen kernel functions.