Shadowing Properties of Optimization Algorithms
Authors: Antonio Orvieto, Aurelien Lucchi
NeurIPS 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We back-up and complement our theory with experiments on machine learning problems. |
| Researcher Affiliation | Academia | Antonio Orvieto Department of Computer Science ETH Zurich, Switzerland Aurelien Lucchi Department of Computer Science ETH Zurich, Switzerland |
| Pseudocode | No | The paper describes algorithms using mathematical equations but does not provide structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any explicit statements about releasing source code or links to a code repository for the described methodology. |
| Open Datasets | Yes | We consider the problem of binary classification of digits 3 and 5 from the MNIST data-set [33]. |
| Dataset Splits | No | The paper mentions 'n = 10000 training examples' but does not provide specific percentages or counts for training, validation, or test splits. It implicitly evaluates on the remaining data, but no explicit split details are provided. |
| Hardware Specification | No | The paper does not provide specific details about the hardware (e.g., CPU, GPU models, memory) used for running the experiments. |
| Software Dependencies | No | The paper mentions 'fourth-order Runge-Kutta' as a simulation method, but does not specify any software libraries or dependencies with version numbers. |
| Experiment Setup | Yes | We simulate GD-ODE using fourth-order Runge-Kutta[21] (high-accuracy integration) and run GD with learning rate h = 1. We simulate HB-ODE and run HB under the same conditions, using = 0.3 (to induce a significant momentum). |