Convex analysis method for distributed learning algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7306853 (Why is no real title available?)
- scientific article; zbMATH DE number 7415114 (Why is no real title available?)
- Approximating functions with multi-features by deep convolutional neural networks
- Approximation analysis of CNNs from a feature extraction view
- Boosted kernel ridge regression: optimal learning rates and early stopping
- Capacity dependent analysis for functional online learning algorithms
- Communication-efficient algorithms for statistical optimization
- Convergence of online pairwise regression learning with quadratic loss
- Convergence rate of SVM for kernel-based robust regression
- Convex analysis and monotone operator theory in Hilbert spaces
- Deterministic error analysis of kernel regularized regression for spherical scattered data
- Distributed SGD in overparametrized linear regression
- Distributed kernel ridge regression with communications
- Distributed learning with multi-penalty regularization
- Distributed learning with regularized least squares
- Distributed minimum error entropy algorithms
- Distributed robust regression with correntropy losses and regularization kernel networks
- Distributed semi-supervised learning with kernel ridge regression
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
- Federated learning for minimizing nonsmooth convex loss functions
- Learning Theory
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Learning rates of least-square regularized regression
- Learning theory estimates via integral operators and their approximations
- Learning theory of distributed regression with bias corrected regularization kernel network
- Learning theory of distributed spectral algorithms
- Moduli of smoothness, \(K\)-functionals and Jackson-type inequalities associated with Kernel function approximation in learning theory
- Multi-kernel regularized classifiers
- Multi-task learning via linear functional strategy
- On regularization algorithms in learning theory
- On the mathematical foundations of learning
- On the robustness of regularized pairwise learning methods based on kernels
- Optimal rates for regularization of statistical inverse learning problems
- Optimal rates for the regularized least-squares algorithm
- Optimality of robust online learning
- Regularized kernel networks with convex p-Lipschitz loss
- Regularized least square regression with spherical polynomial kernels
- Reproducing property of bounded linear operators and kernel regularized least square regressions
- Robust kernel-based distribution regression
- Shannon sampling. II: Connections to learning theory
- Spectral Algorithms for Supervised Learning
- Support Vector Machines
- The learning rate of kernel regularized regression associated with a correntropy-induced loss
- Total stability of outcome weighted learning
This page was built for publication: Convex analysis method for distributed learning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848221)
