Sign inGet started
Paper · arXiv

Most-Recent Anchoring with Recurrent Ordering for Time Series Forecasting

Long-term forecasting models commonly process all patches in a look-back window using the same fixed stack. Older contextual patches and recent evidence therefore receive the same computational depth. Yet the information closest to the forecast and the more distant context do not contribute equally. Uniform processing leaves this distinction unexpressed in the architecture. We propose MARO, a Most-Recent Anchoring with Recurrent Ordering model that processes the look-back window from the most recent patch to the oldest. The most recent patch serves as the anchor. It initializes the latent state and conditions each subsequent step, so older patches are folded into a representation that rem...

AuthorsJung Min Choi, Ngoc Son Le, Ibram Abdelmalak et al.
Primary categorycs.LG
Published2 October 2026
Last updated at source2 October 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/a0f3558e-caed-43c2-bd0a-6689bd62866a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.