Blanchard, M. (2024). Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems.
Citazione stile Chigago Style (17a edizione)Blanchard, Moise. Gradient Descent Is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems. 2024.
Citatione MLA (9a ed.)Blanchard, Moise. Gradient Descent Is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems. 2024.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.