A theoretical understanding of self-paced learning
From MaRDI portal
Recommendations
- On convergence properties of implicit self-paced objective
- Understanding self-paced learning under concave conjugacy theory
- Robust sparse coding via self-paced learning for data representation
- Self-paced multi-view co-training
- Self-paced dictionary learning with label information for image classification
Cites work
- 10.1162/153244303322753751
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Nearly unbiased variable selection under minimax concave penalty
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Parameter convergence for EM and MM algorithms
- Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression
- Stochastic gradient boosting.
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(9)- Understanding self-paced learning under concave conjugacy theory
- Robust sparse coding via self-paced learning for data representation
- Leveraging prior-knowledge for weakly supervised object detection under a collaborative self-paced curriculum learning framework
- On convergence properties of implicit self-paced objective
- Self-paced multi-view co-training
- scientific article; zbMATH DE number 7415125 (Why is no real title available?)
- Dual self-paced multi-view clustering
- Estimating finite mixture models using component self-paced learning
- A new robust biconvex clustering method with self-paced learning.
This page was built for publication: A theoretical understanding of self-paced learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778415)
