A new method optimizes knot selection for spline dimensional decomposition in stochastic dynamic analysis.
problem Challenges in uncertainty quantification for dynamical systems with non-smooth or oscillating nonlinear behaviors.
method Interpolation-based optimal knot selection method for SDD, improving accuracy and computational efficiency.
result SDD with proposed knot selection yields higher accuracy than other methods, as shown in a lower control arm example.
We extend the adaptive regression spline model by incorporating saturation, the natural requirement that a function extend as a constant outside a certain range. We fit saturating splines to data using a convex optimization problem over a space of measures, which we solve using an efficient algorithm based on the condi…
Gaussian processes are the leading class of distributions on random functions, but they suffer from well known issues including difficulty scaling and inflexibility with respect to certain shape constraints (such as nonnegativity). Here we propose Deep Random Splines, a flexible class of random functions obtained by tr…
MSFA clusters high-dimensional spatial data using spline-based covariance structures.
problem Clustering high-dimensional spatial data with flexible covariance structures.
method Mixture of spatial factor analyzers with spline-based covariance and matrix variate factor analyzers for dimensionality reduction.
result Proposed models accurately infer and differentiate distinct spatial patterns in tensor-variate data.
DecompKAN improves time series forecasting accuracy and transparency.
problem Accurate and transparent time series forecasting in scientific domains.
method Combines decomposition, patching, normalization, and B-spline KAN edge functions.
result Achieves best or tied-best MSE on 20 of 36 comparisons across 9 datasets.
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.
The aim of this paper is to propose an operational two-dimensional parametric adjustment for laws of maintenance in disability. The method suggested rests on splines in dimension 2; it is applied to a real data set, and the scale of reserving which results from it is compared with the scale of reference of the BCAC.
Paper finds maximum curvature of Bézier-spline curves.
problem Finding maximum curvature of Bézier-spline curves.
method Modified B-spline solutions for inverse interpolation problem.
result Determined maximum curvature of Bézier-spline curves.
This study compares different types of normalizing flows for generating complex distributions.
problem Comparing different types of normalizing flows for generating complex distributions.
method Real-valued non-Volume preserving (RealNVP), masked autoregressive flow (MAF), coupling rational quadratic spline (C-RQS), and autoregressive rational quadratic spline (A-RQS) were compared using statistical tests.
result A-RQS algorithm outperforms others in terms of accuracy and training speed.
Simulates risk-neutral markets using neural spline flows.
problem Creating realistic risk-neutral market simulations.
method Developed a low-dimensional martingale representation and used neural spline flows for sampling.
result The calibrated simulator is closest to historical data with respect to Kullback-Leibler divergence.
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.
New framework explains deep neural networks using variational spline theory.
problem Understanding functions learned by deep neural networks.
method Developed a variational framework and function space.
result Deep ReLU networks are solutions to regularized data fitting problems over the proposed function space.
Paper proves regularity and existence of Riemannian splines.
problem Regularity and existence of Riemannian splines on manifolds.
method Generalization of DuBois-Reymond Lemma for higher-order splines.
result Established existence of minimizers for spline energy.
While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly due to the necessary spectral decomposition step, which limits control over the…
Improves spline quality and accuracy in computational microscopy.
problem Detecting slender, overlapping structures in microscopy images.
method Differentiable rendering approach for spline refinement.
result Achieves high reliability and sub-pixel accuracy.
This paper develops efficient surrogate models for optimization of complex dynamical systems.
problem Computational expense in solving complex dynamical systems through numerical simulation.
method Combination of proper orthogonal decomposition and radial basis functions for constructing low-dimensional surrogate models.
result Surrogate models reduce computational time for optimization problems while maintaining accuracy.
Adaptive algorithm improves nonlinear data assimilation for non-Gaussian systems.
problem Challenges of non-Gaussian statistics in data assimilation.
method Triangular measure transport with P-spline basis functions and an information criterion.
result Automatic selection of parsimonious parametrization for efficient adaptation.
This paper develops a new method for constructing splines on Lie groups using Poisson equation solutions.
problem Existing methods for constructing splines on Lie groups have limitations and assumptions that may not reflect actual curves.
method The paper introduces a new approach using solutions of the Poisson equation on Lie groups to construct splines.
result The new method allows for global splines with arbitrary initial conditions, improving curve reconstruction.
Sig-Splines model uses signatures and splines for time series data, achieving universality and convexity.
problem Creating a generative model for multivariate time series data.
method Combines linear transformations and signature transforms into a neural spline flow.
result Achieves universality and introduces convexity in model parameters.
With the renewed and growing interest in geometric continuity in mind, this article gives a general definition of geometrically continuous polygonal surfaces and geometrically continuous spline functions on them. Polynomial splines defined by G1 gluing data in terms of rational functions are analyzed further. A general…
Sinh-acceleration speeds up B-spline option pricing.
problem Improving efficiency in option pricing calculations.
method Using sinh-acceleration on B-spline probability density projection.
result SINH acceleration technique improves error control and reduces CPU time.
Deep P-Spline automates DNN structure selection for complex regression problems.
problem Challenges in selecting optimal network structures for DNNs.
method Linking neuron selection to knot placement in basis expansion techniques, introducing a difference penalty for automated knot selection.
result Deep P-Spline extends model class and forms a latent variable modeling framework with theoretical guarantees.
Combines spline interpolation and ARIMA for stock market forecasting.
problem Limited predictive performance of ARIMA in noisy data.
method Integrates cubic spline interpolation and ARIMA for time series forecasting.
result Demonstrates guidance for short-term stock market forecasting.
A new method evolves point clouds using B-splines for smooth surfaces.
problem Evolution of smooth surfaces from discrete point clouds.
method Adaptive Lagrangian B-spline framework for geometric evolution.
result Efficient and accurate reproduction of surface evolution phenomena.
A new nonparametric approach for system identification has been recently proposed where the impulse response is seen as the realization of a zero--mean Gaussian process whose covariance, the so--called stable spline kernel, guarantees that the impulse response is almost surely stable. Maximum entropy properties of the …
A new spline method for manifold learning using Hessian-based curvature penalties.
problem Learning manifolds with curvature penalties in high dimensions.
method Generalizes thin-plate splines to flat manifolds using Hessian matrices, minimizing square error with curvature constraints.
result Existence and uniqueness of the spline solution, expressed as Green's functions and Hessian approximations.
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 use splines and the Sasaki metric to analyze and compare manifold-valued trajectories.
problem Analyzing and comparing trajectories on Riemannian manifolds.
method Riemannian hierarchical model, Bézier splines, Sasaki metric.
result Spline-based approaches outperform state-of-the-art methods in intensity classification of trajectories.
NQE uses quantile regression for fast SBI with cubic Hermite splines.
problem Efficient Bayesian inference for complex models with limited data.
method Neural Quantile Estimation (NQE) learns quantiles autoregressively and interpolates them using cubic Hermite splines.
result NQE achieves state-of-the-art performance on various benchmark problems.
Cubic spline smoothing improves interpolation between irregularly sampled data.
problem Interpolation discontinuity in recurrent neural networks for irregularly sampled sequences.
method Cubic spline smoothing compensation module trained end-to-end with ODE-RNN.
result Improves interpolation between irregularly sampled data points.
Bayesian nonparametric method partitions shapes using curves.
problem Capturing complex shapes in multi-dimensional data.
method Proposes a novel spline partitioning approach using curves.
result Demonstrates improved shape modeling compared to existing methods.
We reparametrize ReLU NNs as splines to understand their learning dynamics.
problem Understanding the learning dynamics and inductive bias of neural networks.
method Reparametrize ReLU NNs as continuous piecewise linear splines to study learning dynamics.
result Standard weight initializations yield very flat functions, leading to strength and type of implicit regularization.
KOLMOGOROV-OPTIMAL RESOLUTION ESTIMATION (KORE) solves spline regression without exhaustive search
problem Hyperparameter tuning in spline regression
method Solving for optimal resolution analytically
result KORE matches exhaustive cross-validation and outperforms tuned models
A wide variety of activation functions have been proposed for neural networks. The Rectified Linear Unit (ReLU) is especially popular today. There are many practical reasons that motivate the use of the ReLU. This paper provides new theoretical characterizations that support the use of the ReLU, its variants such as th…
Smoothing splines provide a powerful and flexible means for nonparametric estimation and inference. With a cubic time complexity, fitting smoothing spline models to large data is computationally prohibitive. In this paper, we use the theoretical optimal eigenspace to derive a low rank approximation of the smoothing spl…
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 …
This paper introduces a spline-based method for nonparametric ADVI that handles complex posterior distributions.
problem Learning complex posterior distributions with skewness, multimodality, and bounded support.
method Develops a spline-based nonparametric approximation approach for ADVI.
result Establishes the asymptotic consistency of the derived lower bound for importance weighted autoencoder.
The paper introduces a spline-based method for calibrating neural networks.
problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.
Represents neural networks as solutions to inverse problems in Banach spaces.
problem Understanding the function learned by neural networks.
method Variational framework, representer theorem, polynomial ridge splines.
result Neural networks are solutions to inverse problems in Banach spaces.
A new model approximates complex functions in parameter space.
problem Complex and nonlinear functional regression problems.
method Mapping-to-Parameter function model with B-spline free knot placement.
result Robust knot placement algorithms improve model performance.
Multivariate splines linked to infinitely-wide neural networks with improved numerical performance.
problem Understanding the relationship between multivariate splines and neural networks.
method Showed multivariate splines can be represented as random features in infinitely-wide neural networks with a homogeneous activation function.
result The function space of multivariate splines is a Sobolev space on a Euclidean ball with explicit norm bounds on derivatives.
Motivated by applications in architecture and design, we present a novel method for increasing the developability of a B-spline surface. We use the property that the Gauss image of a developable surface is 1-dimensional and can be locally well approximated by circles. This is cast into an algorithm for thinning the Gau…
Quantum walks blend patterns into splines when averaged.
problem Understanding the asymptotic patterns of quantum random walks.
method Averaging over quantum coins using the Haar measure.
result Patterns blend into splines, showing a unified behavior.
In this paper, we consider one dimensional (shallow) ReLU neural networks in which weights are chosen randomly and only the terminal layer is trained. First, we mathematically show that for such networks L2-regularized regression corresponds in function space to regularizing the estimate's second derivative for fairly …
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing need for spline interpolation on curved, non-Euclidean space. The generalization…
A new modeling framework CSN simplifies and interprets machine learning models.
problem Complexity and interpretability issues in machine learning models.
method Combines spline transformation and cross-network to create CSN.
result CSN is as performant and interpretable as XGBoost and FCNN.
A comprehensive methodology is provided for smoothing noisy, irregularly sampled data with non-Gaussian noise using smoothing splines. We demonstrate how the spline order and tension parameter can be chosen a priori from physical reasoning. We also show how to allow for non-Gaussian noise and outliers which are typical…
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.