REVIEW 10 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks
read the original abstract
Probabilistic forecasting, i.e. estimating the probability distribution of a time series' future given its past, is a key enabler for optimizing business processes. In retail businesses, for example, forecasting demand is crucial for having the right inventory available at the right time at the right place. In this paper we propose DeepAR, a methodology for producing accurate probabilistic forecasts, based on training an auto regressive recurrent network model on a large number of related time series. We demonstrate how by applying deep learning techniques to forecasting, one can overcome many of the challenges faced by widely-used classical approaches to the problem. We show through extensive empirical evaluation on several real-world forecasting data sets accuracy improvements of around 15% compared to state-of-the-art methods.
Forward citations
Cited by 10 Pith papers
-
UC-Search: Risk-Aware Test-Time Search for Delayed Constrained Time-Series Control
UC-Search is a model-agnostic test-time wrapper that adds feasibility-automaton search and uncertainty-based risk adjustment to produce better delayed constrained control than CEM, MPPI, and risk-random baselines on p...
-
Decision-Calibrated Conformal Uncertainty for Pacing Decisions in Streaming Advertising
Decision-calibrated conformal uncertainty for pacing uses the support function of the signed policy sensitivity set to achieve smaller uncertainty radii on public datasets.
-
Expectations vs. Realities: The Cost of MSE-Optimal Forecasting Under Conditional Uncertainty
MSE-optimal multi-step forecasters cannot match the marginal distribution of realizations under nonzero conditional uncertainty, creating a quantifiable accuracy-realism Pareto frontier across benchmarks.
-
ParaRNN: An Interpretable and Parallelizable Recurrent Neural Network for Time-Dependent Data
ParaRNN decouples RNN dynamics into interpretable additive components, enabling parallelization and nonparametric regression bounds while matching vanilla RNN performance on sequential tasks.
-
Exploring the Potential of Probabilistic Transformer for Time Series Modeling: A Report on the ST-PT Framework
ST-PT turns transformers into explicit factor graphs for time series, enabling structural injection of symbolic priors, per-sample conditional generation, and principled latent autoregressive forecasting via MFVI iterations.
-
Identifying Neutron Sources using Recoil and Time-of-Flight Spectroscopy
A Bayesian protocol identifies single- and two-source neutron configurations from spectra with greater than 4 sigma significance at event counts as low as 1000.
-
Logo-LLM: Local and Global Modeling with Large Language Models for Time Series Forecasting
Logo-LLM improves time series forecasting by pulling local dynamics from shallow LLM layers and global trends from deeper layers, then aligning them via new Local-Mixer and Global-Mixer modules.
-
Streaming Adaptation of Deep Forecasting Models using Adaptive Recurrent Units
ARU embeds closed-form local linear models based on conditional Gaussian sufficient statistics into deep global forecasting networks for efficient streaming per-series adaptation.
-
MR-ImagenTime: Multi-Resolution Time Series Generation through Dual Image Representations
MR-CDM uses hierarchical multi-resolution decomposition and multi-scale conditional diffusion to generate forecasts that reduce MAE and RMSE by 6-10% versus baselines like CSDI and Informer on four datasets.
-
Fashion Retail: Forecasting Demand for New Items
Generalized ML models trained on past sales data forecast demand for new fashion items from their attributes, with experiments across neural architectures and loss functions showing robust performance.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.