The complexity of gradient descent: CLS = PPAD ∩ PLS (Q6065170)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 7765152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of gradient descent: CLS = PPAD ∩ PLS |
scientific article; zbMATH DE number 7765152 |
Statements
The complexity of gradient descent: CLS = PPAD ∩ PLS (English)
0 references
14 November 2023
0 references
TFNP
0 references
computational complexity
0 references
continuous optimization
0 references
0.9995084404945374
0 references
0.8762076497077942
0 references
0.7603631019592285
0 references
0.7556003928184509
0 references
