Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization

3 September 2010

Papers citing "Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization"

3 / 3 papers shown

Title
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning Mario Bravo Juan Pablo Contreras 63 3 0 19 Mar 2024
Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression Yutong He Xinmeng Huang Yiming Chen W. Yin Kun Yuan 55 7 0 12 May 2023
$Minimax rates of estimation for high-dimensional linear regression over $\ell_q$-balls$ Minimax rates of estimation for high-dimensional linear regression over $\ell_q$ -balls Garvesh Raskutti Martin J. Wainwright Bin Yu 163 575 0 11 Oct 2009