Indefinite kernel network with dependent sampling
From MaRDI portal
Publication:2855474
Recommendations
- Indefinite kernel network with \(l^q\)-norm regularization
- Regularization networks with indefinite kernels
- Least square regression with indefinite kernels and coefficient regularization
- Learning with convex loss and indefinite kernels
- Coefficient-based regularized regression with indefinite kernels by unbounded sampling
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Cross-validation based adaptation for regularization operators in learning theory
- Learning Theory
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Learning theory estimates via integral operators and their approximations
- Least square regression with indefinite kernels and coefficient regularization
- Leave-One-Out Bounds for Kernel Methods
- Minimum complexity regression estimation with weakly dependent observations
- On the mathematical foundations of learning
- Online regression with varying Gaussians and non-identical distributions
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Optimal rates for the regularized least-squares algorithm
- Regularization networks and support vector machines
- Regularization networks with indefinite kernels
- Regularized least square regression with dependent samples
- Supercritical age-dependent branching processes with immigration
- Support vector machine classification with indefinite kernels
- The generalization performance of ERM algorithm with strongly mixing observations
Cited in
(13)- Kernel-based sparse regression with the correntropy-induced loss
- Distributed learning with partial coefficients regularization
- A simpler approach to coefficient regularized support vector machines regression
- Indefinite kernel network with \(l^q\)-norm regularization
- Coefficient-based regression with non-identical unbounded sampling
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Learning rates of regression with \(q\)-norm loss and threshold
- Bias corrected regularization kernel method in ranking
- Learning theory approach to a system identification problem involving atomic norm
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Generalized support vector regression: duality and tensor-kernel representation
- Constructive analysis for coefficient regularization regression algorithms
- An oracle inequality for regularized risk minimizers with strongly mixing observations
This page was built for publication: Indefinite kernel network with dependent sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855474)
