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

Trend · papers per month

3326649961,328 · Jun 202019922001200920172026
48 results for stochastic RBF method

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.

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.

In the classical Gaussian SVM classification we use the feature space projection transforming points to normal distributions with fixed covariance matrices (identity in the standard RBF and the covariance of the whole dataset in Mahalanobis RBF). In this paper we add additional information to Gaussian SVM by considerin…

2014-08-12abs ↗pdf ↗

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.

Paper presents a breast cancer detection model using ELM-RBF.

problem Detecting breast cancer using mammography with high cost and side effects.
method Multilayer fuzzy expert system with ELM-RBF model.
result ELM-RBF model outperforms linear-SVM model in accuracy, precision, sensitivity, specificity, and other metrics.

POAP and pySOT improve surrogate optimization of expensive functions.

problem Optimizing expensive functions with concurrent evaluations.
method Event-driven asynchronous framework for optimization strategies.
result Asynchronous computation offers significant speed-up advantages.

In this paper, we compare 5 different nonlinear kernels: min-max, RBF, fRBF (folded RBF), acos, and acos-χ2χ^2, on a wide range of publicly available datasets. The proposed fRBF kernel performs very similarly to the RBF kernel. Both RBF and fRBF kernels require an important tuning parameter (γγ). Interestingly, for a …

2016-03-21abs ↗pdf ↗

CKA with Gaussian RBF kernels converges linearly as bandwidth increases.

problem Understanding the behavior of CKA with large bandwidth Gaussian kernels.
method Analyzing the convergence of CKA based on Gaussian RBF kernels in the large-bandwidth limit.
result CKA based on Gaussian RBF kernels converges linearly as bandwidth increases.

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 ↗

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.

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.

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.

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 ↗

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_αρ.

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.

One of the main drawbacks of deep neural networks, like many other classifiers, is their vulnerability to adversarial attacks. An important reason for their vulnerability is assigning high confidence to regions with few or even no feature points. By feature points, we mean a nonlinear transformation of the input space …

2018-12-07abs ↗pdf ↗

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.

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 ↗

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.

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 ↗

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.

We propose a new model for pricing Quanto CDS and risky bonds. The model operates with four stochastic factors, namely: hazard rate, foreign exchange rate, domestic interest rate, and foreign interest rate, and also allows for jumps-at-default in the FX and foreign interest rates. Corresponding systems of PDEs are deri…

2017-11-20abs ↗pdf ↗

One-shot algorithm for feature-distributed kernel PCA reduces communication costs.

problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.

The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver …

2018-04-06abs ↗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.

We construct genRBF\bf genRBF kernel, which generalizes the classical Gaussian RBF kernel to the case of incomplete data. We model the uncertainty contained in missing attributes making use of data distribution and associate every point with a conditional probability density function. This allows to embed incomplete data i…

2016-12-05abs ↗pdf ↗

Enhanced kernel ridgeless regression improves performance with LAB RBF kernels.

problem Lack of flexibility in kernel ridgeless regression.
method Locally-Adaptive-Bandwidths (LAB) RBF kernels and kernel learning techniques.
result Functions learned from LAB RBF kernels belong to an integral space of RKHSs, demonstrating robust generalization.

Recent work in metric learning has significantly improved the state-of-the-art in k-nearest neighbor classification. Support vector machines (SVM), particularly with RBF kernels, are amongst the most popular classification algorithms that uses distance metrics to compare examples. This paper provides an empirical analy…

2012-08-16abs ↗pdf ↗

We present an approximation scheme for support vector machine models that use an RBF kernel. A second-order Maclaurin series approximation is used for exponentials of inner products between support vectors and test instances. The approximation is applicable to all kernel methods featuring sums of kernel evaluations and…

2014-03-04abs ↗pdf ↗

In this paper, we propose a new method to perform Sparse Kernel Principal Component Analysis (SKPCA) and also mathematically analyze the validity of SKPCA. We formulate SKPCA as a constrained optimization problem with elastic net regularization (Hastie et al.) in kernel feature space and solve it. We consider outlier d…

2018-09-07abs ↗pdf ↗

Conditional expectiles are becoming an increasingly important tool in finance as well as in other areas of applications. We analyse a support vector machine type approach for estimating conditional expectiles and establish learning rates that are minimax optimal modulo a logarithmic factor if Gaussian RBF kernels are u…

2017-02-24abs ↗pdf ↗

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.