Published November 3, 2026 | Version v1

Code for "Forgetting matters: when subspace optimization accelerates without the strong convexity parameter"

  • 1. Moscow Independent Research Institute of Artificial Intelligence
  • 2. Innopolis University

Description

Code and computed results for the numerical experiments of the paper “Forgetting matters: when subspace optimization accelerates without the strong convexity parameter” by I. Kuruzov, A. Vyguzov, I. Dorofeev and A. Gasnikov (arXiv:2611.00727). The package fmcode implements exact subspace methods (SESOP, the plane form of conjugate gradients, windows, the activation schedule of filter pairs and the smooth adaptive pair), Nesterov’s method with and without restarts and L-BFGS on regularized logistic regression and on one- and two-dimensional capillary energies, together with the hard instances for SESOP. The folder experiments contains one script per table and figure of Section 6, results contains the outputs reported in the paper, and checks contains numerical checks of several lemmas and theorems. Requirements: Python 3.10 or newer, NumPy, SciPy and Matplotlib. See README.md for installation and usage.

Files

forgetting_matters_code.zip

Files (793.3 kB)

Name Size
md5:da261537bdfa3bc9c2689f60de276b78
793.3 kB Preview Download