On convergence properties of implicit self-paced objective

DOI10.1016/J.INS.2018.06.014zbMATH Open1440.68235OpenAlexW2604125603WikidataQ129697204 ScholiaQ129697204MaRDI QIDQ2198236FDOQ2198236

Authors: Yong Zhang, SioLong Lo, Zhi Han, Zi-Lu Ma, Shi-Qi Liu, Deyu Meng 

Publication date: 9 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.06.014

Recommendations

• A theoretical understanding of self-paced learning
• Understanding self-paced learning under concave conjugacy theory
• Convergence rates for the stochastic gradient descent method for non-convex objective functions
• Robust sparse coding via self-paced learning for data representation
• Stochastic proximal linear method for structured non-convex problems

zbMATH Keywords

machine learningconvergencenonconvex optimizationself-paced learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Parameter convergence for EM and MM algorithms
• A theoretical understanding of self-paced learning

Cited In (2)

• Understanding self-paced learning under concave conjugacy theory
• A theoretical understanding of self-paced learning

This page was built for publication: On convergence properties of implicit self-paced objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198236)