On Different Facets of Regularization Theory
From MaRDI portal
Publication:4815036
DOI10.1162/089976602760805296zbMath1079.68585WikidataQ35028483 ScholiaQ35028483MaRDI QIDQ4815036
Publication date: 19 August 2004
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/089976602760805296
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Radial basis function network learning using localized generalization error bound, Discriminatively regularized least-squares classification, Subspace based direction of arrival estimation of DS-CDMA signals using orthogonal projection, Classifier learning with a new locality regularization method, Pointwise convergence of Fourier regularization for smoothing data, Generating Spike Trains with Specified Correlation Coefficients
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- A statistical perspective on ill-posed inverse problems (with discussion)
- Spline smoothing: The equivalent variable kernel method
- A regularized solution to edge detection
- Modeling by shortest data description
- Pattern recognition as a quest for minimum entropy
- Some extensions of radial basis functions and their applications in artificial intelligence
- Generalization bounds for function approximation from scattered noisy data
- Analysis of hidden nodes for multi-layer perceptron neural networks
- On radial basis function nets and kernel regression: Statistical consistency, convergence rates, and receptive field size
- On Tikhonov regularization, bias and variance in nonlinear system identification
- Adaptive regularization parameter selection method for enhancing generalization capability of neural networks
- Regularization networks and support vector machines
- Some results on Tchebycheffian spline functions and stochastic processes
- On the mathematical foundations of learning
- Sparse On-Line Gaussian Processes
- On a Class of Support Vector Kernels Based on Frames in Function Hilbert Spaces
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- Flat Minima
- A Penalty-Function Approach for Pruning Feedforward Neural Networks
- 10.1162/15324430260185646
- An Approach to Time Series Analysis
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- III-Posed problems early vision: from computational theory to analogue networks
- Probabilistic Solution of Ill-Posed Problems in Computational Vision
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Atomic Decomposition by Basis Pursuit
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Matching pursuits with time-frequency dictionaries
- Entropy-based algorithms for best basis selection
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- RKHS approach to detection and estimation problems--I: Deterministic signals in Gaussian noise
- Theory of Reproducing Kernels
- Least third-order cumulant method with adaptive regularization parameter selection for neural networks
- A new look at the statistical model identification
