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% · Dec 199219922001200920172026
48 results for Radial Basis Function (RBF)

New RBF networks can approximate any continuous function.

problem Approximating any continuous function on a compact subset.
method Replacing smoothing factors with shifts in RBF networks and proving approximation under certain conditions.
result RBF networks can approximate any continuous function on any compact subset.

OKSVM optimizes RBF kernel hyperparameter for SVMs, improving classification performance.

problem Intrinsic dependence of RBF kernel hyperparameter on SVM performance.
method Gradient descent method for automatic hyperparameter learning and SVM weights adjustment.
result OKSVM outperforms classical SVM regardless of initial RBF hyperparameter values.

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.

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.

New matrix approximation method using RBF components for better memory efficiency.

problem Efficiently approximate any real matrix without being symmetric or positive definite.
method Formulate as an optimization problem with gradient descent methods.
result Significantly reduces memory usage for various matrix types.

AEN-RBF kernel improves robustness in Bayesian optimization for complex systems.

problem Bayesian optimization struggles with outliers in RBF kernel, leading to poor performance.
method Proposes AEN-RBF kernel function, demonstrating improved robustness and convergence.
result The AEN-RBF kernel function reduces mean squared prediction error and improves convergence.

Optimizes expensive functions using adaptive RBF surrogate model.

problem Global optimization of expensive, possibly non-differentiable functions.
method Adaptive Radial Basis Function (RBF) surrogate model with uncertainty quantification.
result The proposed method identifies optimal points efficiently, especially for non-smooth surfaces.

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.

Mammography is often used as the most common laboratory method for the detection of breast cancer, yet associated with the high cost and many side effects. Machine learning prediction as an alternative method has shown promising results. This paper presents a method based on a multilayer fuzzy expert system for the det…

2019-10-29abs ↗pdf ↗

We show theoretical similarities between the Least Squares Support Vector Regression (LS-SVR) model with a Radial Basis Functions (RBF) kernel and maximum a posteriori (MAP) inference on Bayesian RBF networks with a specific Gaussian prior on the regression weights. Although previous works have pointed out similar expr…

2019-05-01abs ↗pdf ↗

In this paper, we propose a novel adaptive kernel for the radial basis function (RBF) neural networks. The proposed kernel adaptively fuses the Euclidean and cosine distance measures to exploit the reciprocating properties of the two. The proposed framework dynamically adapts the weights of the participating kernels us…

2019-05-09abs ↗pdf ↗

Modified model for Quanto CDS pricing with stochastic recovery and reduced complexity.

problem Modeling Quanto CDS with stochastic recovery and reduced complexity of interest rate.
method Modified Itkin, Shcherbakov, and Veygman (2019) model with RBF-FD method.
result Influence of recovery rate volatility and mean-reversion on Quanto CDS spread.

DCA algorithm applied to SVR with RBF kernel for nonconvex optimization.

problem Nonconvex optimization of SVR with Gaussian RBF kernel.
method DC algorithm with analytical DC decomposition of SVR objective.
result Convergence properties of DCA on RBF-SVR can be assessed through CαρC_αρ.

We propose a novel reversible jump Markov chain Monte Carlo (MCMC) simulated annealing algorithm to optimize radial basis function (RBF) networks. This algorithm enables us to maximize the joint posterior distribution of the network parameters and the number of basis functions. It performs a global search in the joint …

2013-01-16abs ↗pdf ↗

Estimates individualized treatment effects using shared RBF-net neurons.

problem Identifying differential treatment effects based on covariates.
method Non-parametric radial basis function (RBF)-nets with shared hidden neurons in a Bayesian framework.
result Demonstrated through simulations and real data, the method identifies interesting treatment effects.

The GMM (generalized min-max) kernel was recently proposed (Li, 2016) as a measure of data similarity and was demonstrated effective in machine learning tasks. In order to use the GMM kernel for large-scale datasets, the prior work resorted to the (generalized) consistent weighted sampling (GCWS) to convert the GMM ker…

2016-07-12abs ↗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.

Neural networks allow Q-learning reinforcement learning agents such as deep Q-networks (DQN) to approximate complex mappings from state spaces to value functions. However, this also brings drawbacks when compared to other function approximators such as tile coding or their generalisations, radial basis functions (RBF) …

2018-06-20abs ↗pdf ↗

The method of "random Fourier features (RFF)" has become a popular tool for approximating the "radial basis function (RBF)" kernel. The variance of RFF is actually large. Interestingly, the variance can be substantially reduced by a simple normalization step as we theoretically demonstrate. We name the improved scheme …

2016-05-18abs ↗pdf ↗

Kernel methods are widespread in machine learning; however, they are limited by the quadratic complexity of the construction, application, and storage of kernel matrices. Low-rank matrix approximation algorithms are widely used to address this problem and reduce the arithmetic and storage cost. However, we observed tha…

2015-05-03abs ↗pdf ↗

Paper proposes machine learning models for more accurate road inspection.

problem Traditional road inspection systems have safety, energy, and cost issues.
method Hybrid machine learning models using surface deflection data from FWD tests.
result CMIS model outperforms other models with APRE=2.3303, AAPRE=11.6768, RMSE=12.0056, and SD=0.0210.

Paper provides unbiased spectral moment estimates from finite data.

problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.

In this research, an emotion recognition system is developed based on valence/arousal model using electroencephalography (EEG) signals. EEG signals are decomposed into the gamma, beta, alpha and theta frequency bands using discrete wavelet transform (DWT), and spectral features are extracted from each frequency band. P…

2019-03-18abs ↗pdf ↗

Improved guarantees and multiple-descent curve for data approximations.

problem Improving the effectiveness of small low-rank approximations of large datasets.
method Spectral properties of the data matrix to obtain improved approximation guarantees.
result Revealed a multiple-descent curve in approximation factor as a function of k.

Gradient-based training and pruning for radial basis function networks in materials physics.

problem Interpretable and robust machine learning for materials physics problems.
method Gradient-based training and pruning of radial basis function networks with closed-form optimization criteria.
result Pruned models provide compact and interpretable versions of larger models, offering insights into atom-level migration processes.

Due to the extremely volatile nature of financial markets, it is commonly accepted that stock price prediction is a task full of challenge. However in order to make profits or understand the essence of equity market, numerous market participants or researchers try to forecast stock price using various statistical, econ…

2018-05-29abs ↗pdf ↗

For the first time in mathematical finance field, we propose the local weak form meshless methods for option pricing; especially in this paper we select and analysis two schemes of them named local boundary integral equation method (LBIE) based on moving least squares approximation (MLS) and local radial point interpol…

2014-10-29abs ↗pdf ↗

Novel Bayesian prior for neural networks encodes amplitude and lengthscale.

problem Lack of user-friendly priors for specifying basic properties in Bayesian neural networks.
method Introduced Poisson Process Radial Basis Function Networks (PP-RBFN) as a novel prior.
result PP-RBFN allows decoupled specification of amplitude and lengthscale, and estimated function is consistent.

New ML models improve VVLC channel characterization for vehicular OWC.

problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.

Paper introduces r-DEP classifier for binary classification tasks.

problem No natural ordering for feature patterns in practical situations.
method Introduces reduced dilation-erosion (r-DEP) classifier using multi-valued mathematical morphology.
result r-DEP classifiers outperform traditional SVCs in balanced accuracy.

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.

New methods improve global optimisation for expensive functions using lookahead strategies.

problem Optimising expensive functions without gradient info in high dimensions.
method Nonmyopic acquisition strategies based on approximate dynamic programming.
result Nonmyopic methods outperform myopic approaches in various applications.

Time-aware deep learning methods improve spatial downscaling of atmospheric pollutants.

problem Transform coarse satellite data of atmospheric pollutants into high-resolution fields.
method Super-resolution deep residual networks and UNet architectures are extended with a temporal module encoding observation time.
result Temporal modules significantly improve downscaling performance and convergence speed.