all AI news
Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization. (arXiv:2205.12751v2 [math.OC] UPDATED)
Oct. 13, 2022, 1:13 a.m. | Benjamin Dubois-Taine, Francis Bach, Quentin Berthet, Adrien Taylor
cs.LG updates on arXiv.org arxiv.org
We consider the problem of minimizing the sum of two convex functions. One of
those functions has Lipschitz-continuous gradients, and can be accessed via
stochastic oracles, whereas the other is "simple". We provide a Bregman-type
algorithm with accelerated convergence in function values to a ball containing
the minimum. The radius of this ball depends on problem-dependent constants,
including the variance of the stochastic oracle. We further show that this
algorithmic setup naturally leads to a variant of Frank-Wolfe achieving
acceleration …
More from arxiv.org / cs.LG updates on arXiv.org
Testing the Segment Anything Model on radiology data
2 days, 5 hours ago |
arxiv.org
Calorimeter shower superresolution
2 days, 5 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Software Engineer for AI Training Data (School Specific)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Python)
@ G2i Inc | Remote
Software Engineer for AI Training Data (Tier 2)
@ G2i Inc | Remote
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US