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

Trend · papers per month

10213141 · Jun 202019922001200920172026
48 results for B-Spline Basis

This paper presents an efficient algorithm for evolving point cloud data on smooth manifolds using B-Splines.

problem Evolution of point cloud data on smooth manifolds in higher dimensions.
method Lagrangian approach using adaptive B-Spline interpolation.
result Demonstrates the convergence of geometric quantities and the effectiveness of the approach.

This paper is devoted to the application of B-splines to volatility modeling, specifically the calibration of the leverage function in stochastic local volatility models and the parameterization of an arbitrage-free implied volatility surface calibrated to sparse option data. We use an extension of classical B-splines …

2013-06-05abs ↗pdf ↗

New method speeds up sparse Gaussian processes for large datasets.

problem Efficiently modeling large datasets with many inducing variables.
method Projecting a GP onto B-spline basis functions for sparse linear algebra.
result Efficiently models fast-varying spatial phenomena with tens of thousands of inducing variables.

Dropout improves regularization in flexible models for rare features.

problem Understanding theoretical properties of dropout in generalized linear models.
method Theoretical analysis and application to adaptive smoothing with B-splines.
result Dropout prefers rare features in mean and dispersion parameters.

Proposes a new model for high-dimensional data analysis with unknown link function.

problem Estimating link function, component functions, and variable interactions in high-dimensional data.
method Generalized Sparse Additive Model with Unknown Link Function (GSAMUL) using B-spline basis and MLP network for link estimation, with 2,1\ell_{2,1}-norm regularizer for variable selection.
result Can realize both variable selection and hidden interaction.

Enhances FM models for numerical features using function basis encoding.

problem Challenges in incorporating numerical features into FM variants.
method Encoding numerical features into a vector of function values for learning segmentized functions.
result Improves model accuracy by learning segmentized functions of numerical features.

Group convolutional neural networks (G-CNNs) can be used to improve classical CNNs by equipping them with the geometric structure of groups. Central in the success of G-CNNs is the lifting of feature maps to higher dimensional disentangled representations, in which data characteristics are effectively learned, geometri…

2019-09-26abs ↗pdf ↗

A machine learning method selects optimal orthonormal bases for functional data analysis.

problem Lack of formal criteria for choosing initial orthonormal bases in functional data methods.
method Proposes a machine learning algorithm to learn and place knots for efficient orthogonal spline bases (splinets).
result Demonstrates efficiency, especially for sparse functional data and complex physical systems.

Bayesian nonparametric LABS model adapts to function smoothness in Besov spaces.

problem Estimating functions with unknown smoothness in Besov spaces.
method Lévy Adaptive B-spline (LABS) regression model with automatic smoothness adaptation.
result LABS posterior contracts around true function in Besov classes at nearly minimax-optimal rates.

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.

BEKAN uses RBFs and evolutionary methods to solve PDEs with boundary conditions.

problem Enforcing boundary conditions in neural networks for PDE solutions.
method Boundary condition-guaranteed evolutionary Kolmogorov-Arnold Network (BEKAN) with radial basis functions (RBFs). Incorporates Dirichlet, periodic, and Neumann conditions.
result BEKAN outperforms MLP and B-splines KAN in solving PDEs with boundary conditions.

Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.

problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate O(n2r/(2r+1))O(n^{-2r/(2r+1)}) for Sobolev space functions.

Efficient numerical method for time-fractional Black-Scholes model.

problem Solving time-fractional Black-Scholes equations for European options.
method Crank-Nicolson discretization for time, exponential B-spline for space.
result The proposed method is unconditionally stable and superior to existing approaches.

Locally-verifiable conditions ensure exactness of spline discrete de Rham complex.

problem Ensuring cohomological equivalence of spline discrete complex to continuous de Rham complex.
method Theoretical analysis and locally-verifiable sufficient conditions for exactness.
result Locally-verifiable conditions guarantee exactness of hierarchical B-spline discrete de Rham complex.

We propose a sequential learning policy for noisy discrete global optimization and ranking and selection (R\&S) problems with high dimensional sparse belief functions, where there are hundreds or even thousands of features, but only a small portion of these features contain explanatory power. We aim to identify the spa…

2015-03-18abs ↗pdf ↗

Develops flexible non-parametric ACFs using B-spline kernels.

problem Flexible modelling of the autocovariance function (ACF) in time-series, spatial, and spatio-temporal analysis.
method Derives the inverse Fourier transform of B-spline spectral bases to create a general class of non-parametric ACFs.
result Provides a provably dense, flexible, and general class of non-parametric ACFs for various types of processes.

Framework for designing nonlinearities in neural networks with slope constraints.

problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.

Study prenatal PM2.5 exposure and 4th grade reading scores, identifying critical windows of susceptibility.

problem Understanding the impact of prenatal PM2.5 exposure on educational outcomes.
method Developed a locally adaptive Bayesian regression model with B-spline basis expansion and dynamic shrinkage priors.
result Prenatal PM2.5 exposure during early and late pregnancy is most adverse for 4th grade reading scores.

Revisits stochastic collocation with exponential splines for option pricing.

problem Improving the accuracy of option price interpolation using stochastic collocation.
method Uses exponential quadratic splines and optimizes abscissae or parameters of B-splines.
result Shows that fixing abscissae and optimizing parameters leads to better interpolation accuracy.

KANHedge improves hedging of high-dimensional options using learnable B-spline activation functions.

problem Challenges in high-dimensional option pricing and hedging due to the curse of dimensionality.
method Introduces KANHedge, a novel BSDE-based hedger leveraging Kolmogorov-Arnold Networks with learnable B-spline activation functions.
result KANHedge provides improved hedging performance, achieving significant reductions in hedging cost metrics.

RST improves environmental time series classification accuracy using randomized B-spline trees.

problem Improving accuracy in classifying complex environmental time series.
method Randomized Spline Trees (RST) integrates randomized functional representations into ensemble learning.
result RST variants outperform standard Random Forests and Gradient Boosting on most environmental time series datasets.

Kolmogorov-Arnold Networks promise scalable performance in high dimensions.

problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.

PIE-PINN estimates elastic properties from noisy, low-res displacement data.

problem Estimating heterogeneous elastic properties from low-resolution, noisy data.
method Probabilistic Physics-Informed Neural Network (PIE-PINN) framework combining B-spline and hierarchical scale model.
result Robust estimation of Young's modulus and Poisson's ratio from noisy, low-resolution displacement data.

Independent component analysis (ICA) has been widely used for blind source separation in many fields such as brain imaging analysis, signal processing and telecommunication. Many statistical techniques based on M-estimates have been proposed for estimating the mixing matrix. Recently, several nonparametric methods have…

2007-05-29abs ↗pdf ↗

Isogeometric analysis is a recently developed computational approach that integrates finite element analysis directly into design described by non-uniform rational B-splines (NURBS). In this paper we show that price surfaces that occur in option pricing can be easily described by NURBS surfaces. For a class of stochast…

2019-10-01abs ↗pdf ↗

Deep neural network is a state-of-art method in modern science and technology. Much statistical literature have been devoted to understanding its performance in nonparametric estimation, whereas the results are suboptimal due to a redundant logarithmic sacrifice. In this paper, we show that such log-factors are not nec…

2019-02-05abs ↗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 ↗

Stochastic volatility (SV) models mimic many of the stylized facts attributed to time series of asset returns, while maintaining conceptual simplicity. The commonly made assumption of conditionally normally distributed or Student-t-distributed returns, given the volatility, has however been questioned. In this manuscri…

2013-08-27abs ↗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 ↗

Uber optimizes marketplace levers using machine learning to improve resource allocation efficiency.

problem Optimizing budget allocation for drivers and riders to maximize business value.
method End-to-end machine learning and optimization procedure using feature store, model training, and ADMM.
result Substantially improved Uber's resource allocation efficiency through high-dimensional optimization.