ICML 2020

A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees

Jul 14, 2020

|

52 views

|

Michael O'Neill

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

ICAPS 2014: Tutorial by Siddharth Srivastava on "Task and Motion Planning for Robots..."

ICAPS | Apr 15, 2015

ICAPS 2014: Carmel Domshlak on "The Complexity of Optimal Monotonic Planning: The Bad, The ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Xing Tan on "The Complexity of Partial-Order Plan Viability Problems"

ICAPS | Apr 16, 2015

ICAPS 2014: Nir Lipovetzky and Christina Burt on "Planning for Mining Operations with Time and ..."

ICAPS | Apr 16, 2015

ICAPS 2014: Christopher Expósito-Izquierdo on "Optimization Model and Heuristic Approach for ..."

ICAPS | Apr 16, 2015