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
44:33
SREcon15 - Monitoring without Infrastructure @ Airbnb
USENIX
| Apr 9, 2015
43:43
SREcon15 - Scaling Networks through Software
USENIX
| Apr 9, 2015
51:14
SREcon15 - SRE Hiring
USENIX
| Apr 9, 2015
38:12
SREcon15 - Incident Analysis
USENIX
| Apr 13, 2015
51:23
SREcon15 - From Zero to Hero: Recommended Practices for Training your Ever-Evolving SRE Teams
USENIX
| Apr 13, 2015
