The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of gradient descent: CLS = PPAD pls |
scientific article; zbMATH DE number 7876159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of gradient descent: CLS = PPAD \(\cap\) pls |
scientific article; zbMATH DE number 7876159 |
Statements
The complexity of gradient descent: CLS = PPAD \(\cap\) pls (English)
0 references
4 July 2024
0 references
TFNP
0 references
computational complexity
0 references
continuous optimization
0 references
0 references
0 references
0.9995084404945374
0 references
0.8747566342353821
0 references
0.7598810195922852
0 references
0.755127489566803
0 references
