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
20:14
ICAPS 2014: Truong-Huy Dinh Nguyen on "Bootstrapping Simulation-Based Algorithms..."
ICAPS
| Aug 5, 2014
19:59
ICAPS 2014: Peter Stone on "TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots"
ICAPS
| Aug 6, 2014
18:02
ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"
ICAPS
| Aug 6, 2014
22:17
ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."
ICAPS
| Aug 7, 2014
18:33
ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"
ICAPS
| Aug 7, 2014