Pith. sign in

REVIEW 2 cited by

Variance Reduced Training with Stratified Sampling for Forecasting Models

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

arxiv 2103.02062 v2 pith:XJH7MLGB submitted 2021-03-02 cs.LG stat.ML

classification cs.LGstat.ML
keywords timeforecastingscottseriesvariancegradientstratifiedtraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In large-scale time series forecasting, one often encounters the situation where the temporal patterns of time series, while drifting over time, differ from one another in the same dataset. In this paper, we provably show under such heterogeneity, training a forecasting model with commonly used stochastic optimizers (e.g. SGD) potentially suffers large variance on gradient estimation, and thus incurs long-time training. We show that this issue can be efficiently alleviated via stratification, which allows the optimizer to sample from pre-grouped time series strata. For better trading-off gradient variance and computation complexity, we further propose SCott (Stochastic Stratified Control Variate Gradient Descent), a variance reduced SGD-style optimizer that utilizes stratified sampling via control variate. In theory, we provide the convergence guarantee of SCott on smooth non-convex objectives. Empirically, we evaluate SCott and other baseline optimizers on both synthetic and real-world time series forecasting problems, and demonstrate SCott converges faster with respect to both iterations and wall clock time.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Online Variance Reduction for Domain Adaptation on Streaming Data

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ARROW is a new streaming algorithm that reduces minibatch variance for MMD and CORAL by reweighting each incoming batch to match an exponential moving average of alignment statistics.

  2. Variance-reduced Domain Adaptation using Paired Sampling

    cs.LG 2026-07 conditional novelty 5.0 of 10

    PSDA pairs source-target examples into quadruplets via linear assignment problems, reducing the variance of MMD/CORAL minibatch gradient estimates and improving target-domain accuracy on Spawrious, Office-Home, and Humpbacks.

Pith tools