Mathematics – Optimization and Control
Scientific paper
2012-02-19
Mathematics
Optimization and Control
25 pages, 6 figures
Scientific paper
Randomized algorithms that base iteration-level decisions on samples from some pool are ubiquitous in machine learning and optimization. Examples include stochastic gradient descent and randomized coordinate descent. This paper makes progress at theoretically evaluating the difference in performance between sampling with- and without-replacement in such algorithms. Focusing on least means squares optimization, we formulate a noncommutative arithmetic-geometric mean inequality that would prove that the expected convergence rate of without-replacement sampling is faster than that of with-replacement sampling. We demonstrate that this inequality holds for many classes of random matrices and for some pathological examples as well. We provide a deterministic worst-case bound on the gap between the discrepancy between the two sampling models, and explore some of the impediments to proving this inequality in full generality. We detail the consequences of this inequality for stochastic gradient descent and the randomized Kaczmarz algorithm for solving linear systems.
Re Christopher
Recht Benjamin
No associations
LandOfFree
Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-563647