A Markovian Model for Learning-to-Optimize
<|reference_start|>A Markovian Model for Learning-to-Optimize: We present a probabilistic model for stochastic iterative algorithms with the use case of optimization algorithms in mind. Based on this model, we present PAC-Bayesian generalization bounds for functions that are defined on the trajectory of the learned algorithm, for example, the expected (non-asymptotic) convergence rate and the expected time to reach the stopping criterion. Thus, not only does this model allow for learning stochastic algorithms based on their empirical performance, it also yields results about their actual convergence rate and their actual convergence time. We stress that, since the model is valid in a more general setting than learning-to-optimize, it is of interest for other fields of application, too. Finally, we conduct five practically relevant experiments, showing the validity of our claims.<|reference_end|>
@article{sucker2024a,
    title={A Markovian Model for Learning-to-Optimize},
    author={Michael Sucker and Peter Ochs},
    journal={arXiv preprint arXiv:2408.11629},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.11629},
    primaryClass={cs.LG math.PR}
}