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

2515027521,003 · Jun 202019922001200920172026
48 results for RBF neural networks

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.

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 ↗

Herein, we propose a spatio-temporal extension of RBFNN for nonlinear system identification problem. The proposed algorithm employs the concept of time-space orthogonality and separately models the dynamics and nonlinear complexities of the system. The proposed RBF architecture is explored for the estimation of a highl…

2019-08-04abs ↗pdf ↗

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 ↗

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.

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.

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 ↗

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 ↗

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 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.

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 ↗

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 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.

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 ↗

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.

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.

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 ↗

K-StoNet improves neural networks by avoiding local minima and assessing uncertainty.

problem Local minima and prediction uncertainty in deep neural networks.
method Combines SVR with latent variable model, using RBF kernel for feature space mapping and IRO algorithm for training.
result The model asymptotically converges to the global optimum and assesses prediction uncertainty easily.

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.

Standard kernels such as Matérn or RBF kernels only encode simple monotonic dependencies within the input space. Spectral mixture kernels have been proposed as general-purpose, flexible kernels for learning and discovering more complicated patterns in the data. Spectral mixture kernels have recently been generalized in…

2018-11-27abs ↗pdf ↗

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.

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 ↗

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 ↗

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.

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 ↗

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.

Neural network with data augmentation improves multi-stage pump prediction accuracy.

problem Predicting multi-stage pump external characteristics with high accuracy.
method Neural network model with data augmentation for multi-objective prediction.
result Neural network model with data augmentation outperforms other models in accuracy.

Single deep model detects out-of-distribution data with single forward pass.

problem Detecting out-of-distribution data points in neural networks.
method Deterministic uncertainty quantification (DUQ) using gradient penalty for reliable detection.
result Single model outperforms or matches ensemble methods in out-of-distribution detection.

Machine Learning (ML) algorithms, like Convolutional Neural Networks (CNN), Support Vector Machines (SVM), etc. have become widespread and can achieve high statistical performance. However their accuracy decreases significantly in energy-constrained mobile and embedded systems space, where all computations need to be c…

2017-04-10abs ↗pdf ↗

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.

There are plenty of problems where the data available is scarce and expensive. We propose a generator of semi-artificial data with similar properties to the original data which enables development and testing of different data mining algorithms and optimization of their parameters. The generated data allow a large scal…

2014-03-28abs ↗pdf ↗