Towards Faster Training Algorithms Exploiting Bandit Sampling From Convex to Strongly Convex Conditions (2023)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1109/tetci.2022.3171797
Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85130776061
Type: Journal Article/Review
Parent Publication: IEEE Transactions on Emerging Topics in Computational Intelligence
Issue: 2