Metraipolis › archive › dc_6d0de07477ca
Q-DEQ: Discrete Solving and Quantization for Deep Equilibrium Models in Time Series Forecasting under Edge Deployment Coding Constraints — arXiv:2609.24042
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24042
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:07:31.114Z
- SHA-256 of the archived text
1954d75e597f52b1c105be1a54ca5e05f1749f26c4a1e8dbf5af33e5c9d0ebce- Stable URL of this page
https://metraipolis.com/documento/dc_6d0de07477ca
How to cite
Q-DEQ: Discrete Solving and Quantization for Deep Equilibrium Models in Time Series Forecasting under Edge Deployment Coding Constraints — arXiv:2609.24042 — arXiv (en), https://arxiv.org/abs/2609.24042 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6d0de07477ca (Metraipolis archive dc_6d0de07477ca, sha256 1954d75e597f52b1c105be1a54ca5e05f1749f26c4a1e8dbf5af33e5c9d0ebce)
BibTeX
@misc{dc6d0de07477ca,
title = {Q-DEQ: Discrete Solving and Quantization for Deep Equilibrium Models in Time Series Forecasting under Edge Deployment Coding Constraints — arXiv:2609.24042},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24042},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6d0de07477ca; sha256 1954d75e597f52b1c105be1a54ca5e05f1749f26c4a1e8dbf5af33e5c9d0ebce},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24042. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Edge deployment motivates forecasting models with compact parameter storage and low-bit representations. Deep equilibrium models (DEQs) obtain implicit depth by repeatedly applying a shared layer, reducing the parameter cost of explicit layer stacking. Their usual Anderson solver, however, searches for update coefficients in the continuous real domain. We propose Q-DEQ, which formulates local updates in DEQ forward solving as discrete optimization problems. Candidate directions are constructed from the current state and iteration history, and a local quadratic residual model is used to evaluate their combinations. Binary encoding of the direction coefficients yields a quadratic unconstrained binary optimization (QUBO) problem that can be solved by simulated annealing (SA) or a coherent Ising machine (CIM). After fixed-point solving, a re-forward pass applies W8A8 fake quantization to the shared layer's weights and activations. We evaluate Q-DEQ with an iTransformer backbone on five multivariate time series forecasting datasets. Relative MSE differences from the explicit multi-layer baseline range from $-1.16\%$ to $+2.90\%$, with lower MSE on two datasets. DEQ parameter sharing reduces parameter counts by factors of $1.80\times$--$3.82\times$; combined with W8A8, static weight storage is reduced by factors of $4.3\times$--$12.8\times$. Local QUBO problems solved using CPU-based SA and the Kaiwu CIM physical backend produce closely matching downstream forecasts. These results establish local discrete solving as a viable component of DEQ time series forecasting and provide a route for executing fixed-point updates through different combinatorial optimization backends. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.24042 — 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-09T06:58:09.364Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).