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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Integral basis

A number of fundamental quantities in statistical signal processing and information theory can be expressed as integral functions of two probability density functions. Such quantities are called density functionals as they map density functions onto the real line. For example, information divergence functions measure t…

2017-02-21abs ↗pdf ↗

A new method integrates Fourier basis expansion and mapping for improved time series forecasting.

problem Inconsistent starting cycles and series length issues in Fourier-based methods.
method Fourier Basis Mapping (FBM) method that integrates time-frequency features through Fourier basis expansion and mapping.
result FBM addresses inconsistencies and preserves temporal characteristics, achieving SOTA performance.

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

In this paper we prove that every H-type Lie algebra possesses a basis with respect to which the structure constants are integers. Existence of such an integral basis implies via the Mal'cev criterion that all simply connected H-type Lie groups contain cocompact lattices. Since the Campbell-Hausdorff formula is very si…

2001-01-28abs ↗pdf ↗

Study of characteristic numbers in 24-dimensional String manifolds.

problem Characterizing and understanding characteristic numbers of 24-dimensional String manifolds.
method Using Pontryagin numbers, integral basis of String cobordism group, and divisibility results.
result Established 2- and 3-primary divisibilities of characteristic numbers.

s-RBFN integrates multiple hypotheses for efficient and diverse prediction.

problem Integrating multiple hypotheses into learning models for regression.
method Structured Radial Basis Function Network (s-RBFN) using Voronoi tessellations and least-squares training.
result s-RBFN achieves superior generalization and efficiency compared to other models.

Geometrically represents path integral reduction Jacobian for interacting systems.

problem Quantizing a model mechanical system with dependent coordinates.
method Geometric representation using scalar curvature and Christoffel symbols in a nonholonomic basis.
result Found a geometric representation for the path integral reduction Jacobian.

This work introduces a fixed-point optimization for variational inference.

problem Improving quantified uncertainty in predictions by optimizing a simplified distribution over parameters.
method Projective integral updates for high-dimensional variational inference.
result Efficient quasirandom quadrature sequence for mean-field distributions, leading to quasi-Newton variational Bayes (QNVB).

Many applications that use empirically estimated functions face a curse of dimensionality, because the integrals over most function classes must be approximated by sampling. This paper introduces a novel regression-algorithm that learns linear factored functions (LFF). This class of functions has structural properties …

2014-12-19abs ↗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 ↗

Extends Lawrence's representations to integral Uqsl(2)U_q \mathfrak{sl}(2) Verma-modules and braid groups.

problem Integrating Lawrence's representations into Uqsl(2)U_q \mathfrak{sl}(2) Verma-modules and braid groups.
method Defining homological operators and showing they provide a representation for Uqsl(2)U_q \mathfrak{sl}(2), establishing isomorphisms and preserving key properties.
result Recovering an integral version of Kohno's theorem for Verma-modules and braid group representations.

We show that the Grothendieck group associated to integral polytopes in Rn\mathbb{R}^n is free-abelian by providing an explicit basis. Moreover, we identify the involution on this polytope group given by reflection about the origin as a sum of Euler characteristic type. We also compute the kernel of the norm map sendin…

2016-05-04abs ↗pdf ↗

This paper improves Gaussian process predictions by integrating prior knowledge.

problem Gaussian processes lack predictive power when prior information is ignored.
method Derive mean and covariance functions from previous data using weighted sums of basis functions.
result Integrating prior knowledge significantly increases look-ahead time and accuracy.

Proposes a framework to predict stock movements by integrating multi-order and internal dynamics.

problem Predicting stock movements with multi-order and internal dynamics.
method Temporal generative filters and hypergraph attentions using wavelet basis.
result Framework outperforms state-of-the-art methods in terms of profit and stability.

Gradient-enhanced GSA uses Poincaré chaos expansions for accurate sensitivity analysis.

problem Accurately estimating Sobol' indices with limited data.
method Integrates sparse, gradient-enhanced regression with Poincaré chaos expansions for derivative-based sensitivity analysis.
result Accurately estimated Sobol' indices using limited data.

Paper proposes TBSD for efficient anomaly detection in textured images.

problem Challenges in anomaly detection for textured images, especially in manufacturing systems.
method Texture basis integrated smooth decomposition (TBSD) approach.
result TBSD surpasses benchmarks with less misidentification and superior performance.

Deep model integrates MRI and DTI for autism severity prediction.

problem Predicting spectrum-level deficits in autism using multimodal brain imaging.
method Generative deep-learning framework combining rs-fMRI and DTI data.
result Hybrid model outperforms existing methods in predicting autism severity.

Unified model combines neural networks and dictionary learning for clinical predictions from brain data.

problem Predicting clinical severity from brain imaging data.
method Combines neural networks with dictionary learning to model patient-specific and shared features.
result Unified model outperforms state-of-the-art methods in predicting clinical severity.

Method learns radial basis function distributions from samples.

problem Learning radial basis function distributions from training samples.
method Projected particle Langevin optimization method with distributionally robust optimization.
result Empirical measure of Langevin particles converges to a reflected Itô diffusion-drift process.

We prove that any regular Casimir in 3D magnetohydrodynamics is a function of the magnetic helicity and cross-helicity. In other words, these two helicities are the only independent regular integral invariants of the coadjoint action of the MHD group SDiff(M)X(M)\text{SDiff}(M)\ltimes\mathfrak X^*(M), which is the semidirect pro…

2019-01-14abs ↗pdf ↗

Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.

problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.

Framework integrates brain connectivity data for clinical predictions.

problem Predicting clinical outcomes from brain connectivity data.
method Structurally-regularized Dynamic Dictionary Learning (sr-DDL) and LSTM-ANN block.
result Framework outperforms state-of-the-art approaches in clinical outcome prediction.

We address feature interpretation and reproducibility issues in dense nets, proposing a modified loss function.

problem Feature interpretation and reproducibility issues in dense nets.
method Proposed a modified loss function to circumvent basis collapse.
result Substantially concise nets with 100x fewer parameters and lower MSE loss.

The compact curves of an intermediate Kato surface SS form a basis of H2(S,Q)H^2(S,\mathbb Q). We present a way to compute the associated rational coefficients of the first Chern class c1(S)c_1(S). We get in particular a simple geometric obstruction for c1(S)c_1(S) to be an integral class, or equivalently index(S)=1(S)=1. We also f…

2014-06-09abs ↗pdf ↗

K-Means and RBF networks are shown to be equivalent under certain conditions.

problem Discrete clustering vs. continuous optimization in machine learning.
method Established variational and gradient-based equivalence between K-Means and RBF networks.
result Gradient-based updates of RBF centers recover K-Means centroid update rule.

The quantum cohomology algebra of the (full) flag manifold is a fundamental example in quantum cohomology theory, with connections to combinatorics, algebraic geometry, and integrable systems. Using a differential geometric approach, we give an algorithm for computing the multiplicative structure constants of this alge…

2003-06-26abs ↗pdf ↗