The Sample Complexity of Gradient Descent in Stochastic Convex Optimization

May-30-2025, 02:26:33 GMT–Neural Information Processing Systems

We analyze the sample complexity of full-batch Gradient Descent (GD) in the setup of non-smooth Stochastic Convex Optimization.

algorithm, artificial intelligence, machine learning, (17 more...)

Neural Information Processing Systems

May-30-2025, 02:26:33 GMT

Conferences PDF

Genre:
- Research Report > Experimental Study (0.93)

Technology:
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning > Gradient Descent (0.71)

Duplicate Docs Excel Report

Title
The Sample Complexity of Gradient Descent in Stochastic Convex Optimization

Similar Docs Excel Report more

Title	Similarity	Source
None found