arXiv (All)
open access
Adaptive Patching Is Harder Than It Looks For Time-Series Forecasting
Adaptive patching has been proposed for time-series forecasting: allocate finer patches where the sequence looks locally informative. We compare three adaptive patching methods with tuned uniform counterparts that use one fixed patch size throughout the input, while preserving each method's backbone
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning to Difference: Adaptive Reversible Differencing (AdaRDiff) for Time Series Forecasting#784890
- Learning to Difference: Adaptive Reversible Differencing (AdaRDiff) for Time Series Forecasting#783300
- Learning to Difference: Adaptive Reversible Differencing (AdaRDiff) for Time Series Forecasting#618590
- Machine Learning for Time Series Forecasting: Models, Benchmarks, and Challenges – A Case Study#384735
- GatedLinear: Adaptive Routing of Complementary Linear Bases for Time Series Forecasting#361442
Record · ID 1343596
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive