Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 14 min ago
PreprintCC BY 4.0arXiv

Hybrid Joint-Selective Optimization: Reduced-Space Levenberg-Marquardt Refinement of Low-Dimensional Parameters of Interest

Abstract

This paper introduces a hybrid joint-selective optimization (HJSO) framework for large-scale numerical problems in which a small subset of trainable quantities is of primary interest. We partition the full parameter vector into a high-dimensional remaining block and a low-dimensional block of parameters of interest (POIs), perform joint first-order optimization over the full parameter set, and then freeze the remaining variables while applying a reduced-space Levenberg-Marquardt (LM) refinement to the POIs. The method is designed for settings in which the POIs are low-dimensional but strongly influence the quality of the computed solution, while the full parameter space remains too large for full-space second-order methods. The framework is evaluated on three representative problems: a matrix eigenvalue problem, an inverse Bratu problem solved with a physics-informed neural network, and a 100-dimensional nonlinear Black-Scholes problem solved with the DeepBSDE method. In each test, HJSO reaches prescribed POI-error thresholds faster than the corresponding joint first-order baseline and improves the final POI accuracy for the reported solver configurations. The contribution is therefore not a universal optimizer, but a practical reduced-space strategy for problems with known low-dimensional parameters of interest and expensive high-dimensional training variables.

Related

  1. Neural Network-Assisted Refinement of Traditional Schemes for One-Dimensional Scalar Conservation Laws
    Imre Fekete, Ferenc Izsák, Vendel P. Kupás
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Riemannian Optimization on Unknown Manifolds via Stochastic Proximal Refinement
    Ruixiang Wu, Jiahao Ai, Tinko Sebastian Bartels +5
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
  3. Collision Parameters in Higher-Dimensional Families of Polynomials
    Dragos Ghioca, Negin Shadgar
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Online Optimization with Unknown Time-Varying Parameters Using Noisy Gradient Measurements
    Shivanshu Tripathi, Fabio Pasqualetti, Maziar Raissi
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Optimization of ReaxFF parameters for the Mo−S system using random optimization and coordinate search
    Arun Ravichandran, Michael L. Stein, Mert Y. Sengul +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{shahab2026hybrid,
  title = {{Hybrid Joint-Selective Optimization: Reduced-Space Levenberg-Marquardt Refinement of Low-Dimensional Parameters of Interest}},
  author = {Muhammad Luthfi Shahab and Gabriella Alfa Indahsari and Imam Mukhlash and Hadi Susanto},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37308},
  eprint = {2609.37308},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37308},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Hybrid Joint-Selective Optimization: Reduced-Space Levenberg-Marquardt Refinement of Low-Dimensional Parameters of Interest
AU  - Muhammad Luthfi Shahab
AU  - Gabriella Alfa Indahsari
AU  - Imam Mukhlash
AU  - Hadi Susanto
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37308
UR  - https://arxiv.org/abs/2609.37308
AB  - This paper introduces a hybrid joint-selective optimization (HJSO) framework for large-scale numerical problems in which a small subset of trainable quantities is of primary interest. We partition the full parameter vector into a high-dimensional remaining block and a low-dimensional block of parameters of interest (POIs), perform joint first-order optimization over the full parameter set, and then freeze the remaining variables while applying a reduced-space Levenberg-Marquardt (LM) refinement to the POIs. The method is designed for settings in which the POIs are low-dimensional but strongly influence the quality of the computed solution, while the full parameter space remains too large for full-space second-order methods. The framework is evaluated on three representative problems: a matrix eigenvalue problem, an inverse Bratu problem solved with a physics-informed neural network, and a 100-dimensional nonlinear Black-Scholes problem solved with the DeepBSDE method. In each test, HJSO reaches prescribed POI-error thresholds faster than the corresponding joint first-order baseline and improves the final POI accuracy for the reported solver configurations. The contribution is therefore not a universal optimizer, but a practical reduced-space strategy for problems with known low-dimensional parameters of interest and expensive high-dimensional training variables.
ER  -