video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

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

Published on Feb 4, 20254043 Views

Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Recent years have seen a surge in

Related categories

Presentation