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

1345 · Jan 202619922001200920172026
48 results for B-Spline

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 ↗

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.

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.

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.

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.

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.

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.

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.

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 ↗

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.

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.

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 ↗

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.

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 ↗

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.

TPBS models improve robustness to overfitting with localized Dirichlet energy regularization.

problem Global Dirichlet energy-based regularization fails for TPBS models due to perfect interpolation.
method Propose local Dirichlet energy regularization and two inference estimators.
result TPBS models outperform neural networks in overfitting regimes and maintain competitive performance otherwise.

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 ↗

The paper develops a neural network method for estimating drift functions of diffusion processes from discrete observations.

problem Nonparametric estimation of drift function for diffusion processes from high-frequency discrete observations.
method Neural network-based estimator for drift function estimation.
result Derives a non-asymptotic convergence rate for the neural network estimator.

KAN-PCA improves asset return analysis by capturing more variance than classical PCA during market crises.

problem Inefficient classical PCA during market crises when correlations between assets change dramatically.
method KAN-PCA uses KAN (Kolmogorov-Arnold Networks) with B-spline functions to learn nonlinear projections.
result KAN-PCA achieves a higher reconstruction R^2 (66.57%) compared to classical PCA (62.99%) on 20 S&P 500 stocks.

KAPLAN-HR models survival data without manual interactions, outperforming existing methods.

problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.

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.

Kolmogorov-Arnold Networks enable ultrafast online learning with fixed-point quantization.

problem Efficient online learning for high-frequency systems with strict memory constraints.
method Fixed-point online training on FPGAs exploiting B-spline locality in KANs.
result Kolmogorov-Arnold Networks are more efficient and expressive than MLPs for low-latency tasks.

We present SplineNets, a practical and novel approach for using conditioning in convolutional neural networks (CNNs). SplineNets are continuous generalizations of neural decision graphs, and they can dramatically reduce runtime complexity and computation costs of CNNs, while maintaining or even increasing accuracy. Fun…

2018-10-31abs ↗pdf ↗

New method weaves paper strips for designing curved surfaces with elasticity.

problem Designing general curved surfaces with geometrical elasticity.
method Shape optimization of paper strips using nonlinear elasticity theory.
result Demonstrated creation of catenoid and helicoid surfaces with 54 paper strips.