Metraipolis › archive › dc_cb8fc021a572

Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs — arXiv:2609.32558

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32558
License (as archived)
CC0-1.0
Archived
2026-10-07T23:04:25.026Z
SHA-256 of the archived text
751525329955748dd31973a146322d6c3e22ee2055f3f230490bd822c72d3f68
Stable URL of this page
https://metraipolis.com/documento/dc_cb8fc021a572

How to cite

Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs — arXiv:2609.32558 — arXiv (en), https://arxiv.org/abs/2609.32558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb8fc021a572 (Metraipolis archive dc_cb8fc021a572, sha256 751525329955748dd31973a146322d6c3e22ee2055f3f230490bd822c72d3f68)
BibTeX
@misc{dccb8fc021a572,
  title = {Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs — arXiv:2609.32558},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32558},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb8fc021a572; sha256 751525329955748dd31973a146322d6c3e22ee2055f3f230490bd822c72d3f68},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32558. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study entropy-regularized linear programs with sparse affine constraints and compare two exact dual representations induced by whether a redundant normalization constraint is retained or eliminated. Eliminating it yields a partially separable sum-exp dual with sparse affine factors but unbounded curvature. Our main result is an accelerated randomized block method whose acceleration preserves sparse data-access cost. The key ingredient is a global entropy-specific Hessian--gap bound that remains valid for signed constraint matrices, admits computable block-overlap refinements, and provides deterministic curvature certificates before sampling. This geometry supports square-root importance sampling and an exact lazy implementation in which sparse arithmetic cost is weighted by local curvature rather than by a worst-block factor. We further introduce a gap-dependent curvature dimension that connects the generalized-smooth regime to the classical effective-rank intuition for coordinate methods. Retaining the normalization constraint yields a log-sum-exp dual with globally bounded higher derivatives, enabling gradient-regularized and cubic-regularized Newton methods. Experiments compare the resulting methods in terms of coordinate epochs, arithmetic operations, and wall-clock time, separating the effects of acceleration, touched-data sparsity, and problem-specific structure.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.32558 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T22:42:39.185Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).