Pages that link to "Item:Q5061429"
From MaRDI portal
The following pages link to How to iron out rough landscapes and get optimal performances: averaged gradient descent and its application to tensor PCA (Q5061429):
Displaying 6 items.
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Some remarks on replicated simulated annealing (Q2659822) (← links)
- Gradient descent dynamics and the jamming transition in infinite dimensions (Q5057865) (← links)
- When random tensors meet random matrices (Q6126103) (← links)
- Long random matrices and tensor unfolding (Q6180391) (← links)
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)