Sign in
ICML 2020
Event Home
A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees
Jul 14, 2020
|
52 views
|
arXiv link
Michael O'Neill
Follow
LINE
203 videos · undefined sub area
Optimization
1748 videos · undefined sub area
Details
This is a video presentation of the paper "A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees" accepted at the ICML 2020 workshop Beyond First Order Methods in ML Systems. A list of accepted papers can be found here:
https://sites.google.com/view/optml-icml2020/accepted-papers?authuser=0
. The paper can be found on arXiv here:
https://arxiv.org/abs/2006.07925
.
Category: ICML 2020
Comments
loading...
Reactions
(0)
| Note
📝 No reactions yet
Be the first one to share your thoughts!
Reactions
(0)
Note
loading...
Recommended
43:26
SREcon14 - Grilled Cheese at Scale: A Recipe for Stability Practices
USENIX
| Jun 26, 2014
50:45
SREcon14 - Design Review Best Practices
USENIX
| Jun 26, 2014
55:04
SREcon14 - Keys to SRE
USENIX
| Jun 26, 2014
3:08
The ICAPS Three
ICAPS
| Jul 2, 2014
20:34
ICAPS 2014: Daniel Harabor on "Improving Jump Point Search"
ICAPS
| Jul 2, 2014
