Online regularized pairwise learning with least squares loss
From MaRDI portal
Publication:5220066
DOI10.1142/S0219530519410070zbMath1435.68284OpenAlexW2982521376WikidataQ126857206 ScholiaQ126857206MaRDI QIDQ5220066
Publication date: 10 March 2020
Published in: Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219530519410070
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Linear operators in reproducing-kernel Hilbert spaces (including de Branges, de Branges-Rovnyak, and other structured spaces) (47B32)
Related Items
Learning theory of minimum error entropy under weak moment conditions, Online regularized pairwise learning with non-i.i.d. observations, Convergence of online pairwise regression learning with quadratic loss, Error analysis of kernel regularized pairwise learning with a strongly convex loss, Generalization ability of online pairwise support vector machine
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalization bounds for metric and similarity learning
- Consistency analysis of an empirical minimum error entropy algorithm
- Unregularized online learning algorithms with general loss functions
- Optimal rates for regularization of statistical inverse learning problems
- Model selection for regularized least-squares algorithm in learning theory
- Online gradient descent learning algorithms
- A linear functional strategy for regularized ranking
- Optimum bounds for the distributions of martingales in Banach spaces
- Online pairwise learning algorithms with convex loss functions
- Universality of deep convolutional neural networks
- Online regularized learning with pairwise loss functions
- Optimal rates for the regularized least-squares algorithm
- Ranking and empirical minimization of \(U\)-statistics
- Learning theory estimates via integral operators and their approximations
- Learning Theory
- Online Regularized Classification Algorithms
- Deep distributed convolutional neural networks: Universality
- Regularization schemes for minimum error entropy principle
- Learning rates for regularized least squares ranking algorithm
- Online Pairwise Learning Algorithms
- Online minimum error entropy algorithm with unbounded sampling
- Theory of Reproducing Kernels