Claim C10 · formal · entrylib:2026.000013@v3 · 2026-11-18

Corrected · 18 November 2026 at 13:08 UTC

Version 3 answers a reader's comments. Corrected: C3 no longer says sMAPE is minimised by the median for small errors, only near it, with a bound; C4 keeps the weighted median, and C12 now holds what was said about the ordinary median; the measure called msMAPE in version 2 is the Suilin loss. Added: how well a test set tells two forecasts apart as the actuals spread out (C18); the large-sample distribution of the sMAPE minimiser (C19); Smyl's msMAPE (C20) and what it rewards on intermittent demand (C21). Also added: sections, the definition of sMAPE first, and a limitation on C6.

By Ivan Svetunkov (ORCID 0000-0001-7826-0281)

What does sMAPE reward? An analytical and simulation study · C10

Principal claim C10 of this paper (Svetunkov, I. (guarantor), 2026), with what it rests on. Read the whole paper.

Text file for AI

Text file: the claim with what it rests on as plain text, to attach when your assistant cannot open the address.

The message

Read https://entrylib.org/p/2026.000013/C10, one claim of a research paper with the evidence it rests on. Tell me briefly what it says and how well it is supported. If you cannot open the link, tell me instead of guessing. Then wait for my questions.

The claim

SupportS 100C10 · formal · planned test · novelty: new, by the authors

Let ln⁡y=μ+σε\ln y = \mu + \sigma\varepsilon, where ε\varepsilon has a fixed density hh with bounded continuous first and second derivatives, and write a forecast as f=eμ+σcf = e^{\mu + \sigma c} (its quantile level, the probability that ε≤c\varepsilon \le c, does not depend on σ\sigma). As σ\sigma grows, E[s(y,f)]=1−4ln⁡2h(c)/σ+O(σ−3)\mathrm E[s(y,f)] = 1 - 4\ln 2\,h(c)/\sigma + O(\sigma^{-3}) uniformly in cc. (a) The expected sMAPE of every forecast tends to its bound 200, and the difference between forecasts at two fixed quantile levels shrinks like 1/σ1/\sigma. (b) When hh has a single highest point c0c_0, the quantile level of the sMAPE target tends to that of c0c_0, the mode of ln⁡y\ln y, which differs from 1/2 when the mode of ε\varepsilon is not its median. (c) As σ→0\sigma \to 0, when ε\varepsilon has a unique median and a finite E|ε|3\mathrm E|\varepsilon|^3, the quantile level of the target tends to 1/2: sMAPE targets the median for narrow distributions and the mode of ln⁡y\ln y for wide ones.

SupportS 100C1 · formal · planned test · novelty: extends earlier work, by the authors

For y>0y > 0 and f>0f > 0, the sMAPE term s(y,f)=|y−f|/(|y|+|f|)s(y,f) = |y-f|/(|y|+|f|) depends on yy and ff only through their ratio r=y/fr = y/f: s=|r−1|/(r+1)s = |r - 1|/(r + 1).

SupportS 100C3 · formal · planned test · novelty: extends earlier work, by the authors

For y>0y > 0 and f>0f > 0, the sMAPE term is s=tanh⁡(|ln⁡y−ln⁡f|/2)s = \tanh(|\ln y - \ln f|/2) (log error ln⁡y−ln⁡f\ln y - \ln f). (a) It is 0 when y=fy = f, strictly increasing and concave in |ln⁡y−ln⁡f||\ln y - \ln f|, and bounded by 1, which it approaches as |ln⁡y−ln⁡f||\ln y - \ln f| grows. (b) 0≤12|ln⁡y−ln⁡f|−s≤124|ln⁡y−ln⁡f|30 \le \tfrac12|\ln y - \ln f| - s \le \tfrac1{24}|\ln y - \ln f|^3; so when all log errors are small, sMAPE is about 100 times the mean absolute error of ln⁡f\ln f as a forecast of ln⁡y\ln y (log-MAE). (c) The log-MAE of a test set is minimised by its median; sMAPE is then minimised near the median, not in general at it. For positive actuals y1,…,yny_1, \dots, y_n with a median mm, a forecast f*f^* that minimises their sMAPE satisfies 1n∑t|ln⁡yt−ln⁡f*|−1n∑t|ln⁡yt−ln⁡m|≤112⋅1n∑t|ln⁡yt−ln⁡f*|3:\frac1n\sum_t|\ln y_t - \ln f^*| - \frac1n\sum_t|\ln y_t - \ln m| \le \frac1{12}\cdot\frac1n\sum_t|\ln y_t - \ln f^*|^3: its mean absolute log error exceeds the smallest possible by at most a twelfth of its mean cubed absolute log error. The minimiser is the median itself only under further conditions on the distribution of the actuals.

Evidence

E1 · quant · other · cited by C10, C1

Numerical checks of the formulas of the formal claims (formula checks), lab run RN8 under the formal plan that decided them; every check is within the plan's tolerances. They check the formulas on concrete numbers; the proofs are the evidence for the claims. The rows are labelled by the hypotheses of the record's first plan, whose wording kept the factor 200: H1 checks C1; H2 and H10 check C2; H5 checks C5; H7 checks C6; H8 checks C7; H12 checks C8; H13 checks C9; H14 checks C10. H3 and H9 checked C3, and H4 and H6 checked C4, as version 2 worded them; C3, C4 and C12 as now worded are checked in E31. The two results E1.R1 and E1.R2 compare a simulated variance with the large-sample variance that C19 now proves.

  • R1 simulated n Var(ln sMAPE minimiser) / large-sample value, lognormal sigma=1 = 0.9944 99% confidence interval 0.9354 to 1.0598 (hypothesis: H11, test-set size: 1000, test sets: 4000)
  • R2 simulated n Var(ln sMAPE minimiser) / large-sample value, lognormal sigma=1 = 1.022 99% confidence interval 0.9396 to 1.0982 (hypothesis: H11, test-set size: 10000, test sets: 2000)
  • R3 maximum absolute difference from the ratio form = 0.0000 (hypothesis: H1)
  • R4 maximum absolute difference between the ratio and its reciprocal = 0.0000 (hypothesis: H2)
  • R5 maximum absolute difference from 200 tanh(|z|/2) = 0.0000 (hypothesis: H3)
  • R6 violations of monotonicity, concavity or the bound 200 on 0 <= |z| <= 12 = 0 (hypothesis: H3)
  • R7 violations of 0 <= 100|z| - s <= 25|z|^3/3 = 0 (hypothesis: H9)
  • R8 maximum of |s - 100|z| + 25|z|^3/3| / |z|^5 for 0.05 < |z| < 0.5 = 0.8331 (hypothesis: H9)
  • R9 violations of s(y, y+e) < s(y, y-e) = 0 (hypothesis: H10)
  • R10 maximum absolute difference between s(y, ky) and s(y, y/k) = 0.0000 (hypothesis: H10)
  • R11 maximum relative difference between the formula for S' and a numerical derivative = 0.0000 (hypothesis: H4)
  • R12 maximum distance in ln f between the minimiser and the median = 0.0000 (hypothesis: H5)
  • R13 number of local minima, lognormal sigma=1 and log-Laplace b=1 = 1 (hypothesis: H5)
  • R14 maximum balance residual at the minimiser (pull below minus pull above) = 0.0000 (hypothesis: H6)
  • R15 settings with one local minimum where the sign of D misplaces the target = 0 (hypothesis: H6)
  • R16 maximum distance between the one-step and the exact quantile level = 0.0025 (hypothesis: H6)
  • R17 2 g(m) - E[sech^2(Z/2) tanh(|Z|/2)] for the equal-mode bimodal setting (negative: median a local maximum) = -0.3475 (hypothesis: H7)
  • R18 number of local minima of the equal-mode bimodal setting = 2 (hypothesis: H7)
  • R19 difference between the two minimal expected sMAPEs, equal-mode bimodal setting = 0.0000 (hypothesis: H7)
  • R20 maximum distance between the formula and the bisected threshold = 0.0000 (hypothesis: H8)
  • R21 opposite-sign or one-zero pairs not scoring 200 = 0 (hypothesis: H8)
  • R22 relative distance between the 1/y-weighted median and the minimiser of expected MAPE = 0.0001 (hypothesis: H12)
  • R23 difference of expected squared errors minus (f1-f2)(f1+f2-2E[y]) = 0 (hypothesis: H12)
  • R24 sMAPE terms outside [0, 200] = 0 (hypothesis: H13)
  • R25 expected sMAPE at f = 1e-6 and f = 1e10 (both near 200) = 200 (hypothesis: H13)
  • R26 the proof's bound on the error times sigma^3, 600 zeta(3) max|g''|, log-Gumbel = 309.9 (hypothesis: H14)
  • R27 limit of sigma^3 times the relative efficiency for normal log-outcomes, from the proof = 7.226 (hypothesis: H14)
E1.T1 · zero threshold by setting; hypothesis: H8 (lab runs RN8) (hypothesis: H8)
Rowsettingzero threshold
r1lognormal sigma=0.30.4687
r2lognormal sigma=0.50.4469
r3lognormal sigma=10.394
r4lognormal sigma=20.3075
E1.T2 · maximum |S - (200 - 800 ln2 h)| times sigma^3, log-Gumbel right, sigma^3 times the asymptotic relative efficiency, lognormal by sigma; hypothesis: H14 (lab runs RN8) (hypothesis: H14)
Rowsigmamaximum |S - (200 - 800 ln2 h)| times sigma^3, log-Gumbel rightsigma^3 times the asymptotic relative efficiency, lognormal
r15.0264.55.613
r210.0292.36.743
r320.0300.17.099
r440.0302.17.193

E31 · quant · other · cited by C3

Numerical checks of the formulas of the claims new or reworded in version 3 (formula checks), lab run RN13 (check_v3.py, seed 8) under the formal plan that decided C3, C4, C12, C17 and C20; every check is within the plan's tolerances. They check the formulas on concrete numbers; the proofs are the evidence for the claims. The tables are labelled by the hypotheses the run's script names: H3 (T1 and T2) checks C3; H4 (T3) checks C4; H34 (T4 and T5) checks C12; H35 (T6 and T7) checks C17; H42 (T8 and T9) checks C20. The tables of H39 (T10 to T12) and H40 (T13 to T17) check the formulas of C18 and C19, whose wording was decided after later checks (E32, E33).

E31.T1 · violations of the bound on the log-MAE of the sMAPE minimiser, largest excess of the minimiser's log-MAE over the median's, minus the bound; hypothesis: H3, test_sets: 2000 (lab runs RN13) (hypothesis: H3, test_sets: 2000)
Rowviolations of the bound on the log-MAE of the sMAPE minimiserlargest excess of the minimiser's log-MAE over the median's, minus the bound
r100.0000
E31.T2 · sum of sMAPE terms, forecast at the median, actuals 1, 1, e, e^4, e^4, sum of sMAPE terms, forecast at 1, actuals 1, 1, e, e^4, e^4; hypothesis: H3 (lab runs RN13) (hypothesis: H3)
Rowsum of sMAPE terms, forecast at the median, actuals 1, 1, e, e^4, e^4sum of sMAPE terms, forecast at 1, actuals 1, 1, e, e^4, e^4
r12.7352.39
E31.T3 · largest difference of the weights below and above the target, over their sum; hypothesis: H4, distributions: 6 (lab runs RN13) (hypothesis: H4, distributions: 6)
Rowlargest difference of the weights below and above the target, over their sum
r10.0000
E31.T4 · distributions with more than one local minimum, distributions where the target is not on the side of the median that carries more weight; hypothesis: H34, distributions: 6 (lab runs RN13) (hypothesis: H34, distributions: 6)
Rowdistributions with more than one local minimumdistributions where the target is not on the side of the median that carries more weight
r100
E31.T5 · largest distance in logs between the target and the median, lognormal and log-Laplace; hypothesis: H34, distributions: 16 (lab runs RN13) (hypothesis: H34, distributions: 16)
Rowlargest distance in logs between the target and the median, lognormal and log-Laplace
r10.0000
E31.T6 · Suilin term of a zero forecast of a zero actual; hypothesis: H35 (lab runs RN13) (hypothesis: H35)
RowSuilin term of a zero forecast of a zero actual
r10
E31.T7 · largest error of the identity of (a), largest error of the identity of (b), values of the Suilin term outside [0, 1); hypothesis: H35, pairs: 200000 (lab runs RN13) (hypothesis: H35, pairs: 200000)
Rowlargest error of the identity of (a)largest error of the identity of (b)values of the Suilin term outside [0, 1)
r10.000000
E31.T8 · largest error of the identity of (a), largest error of the identity of (b), values of the msMAPE term outside [0, 1], values of the msMAPE term not below 1 for actuals below nu, pairs with a count of at least 1 where the msMAPE and sMAPE terms differ by nu; hypothesis: H42, pairs: 200000 (lab runs RN13) (hypothesis: H42, pairs: 200000)
Rownulargest error of the identity of (a)largest error of the identity of (b)values of the msMAPE term outside [0, 1]values of the msMAPE term not below 1 for actuals below nupairs with a count of at least 1 where the msMAPE and sMAPE terms differ
r10.100000
r20.500000
r31.000000
E31.T9 · msMAPE term of a forecast of 1e-9 for a zero actual by nu; hypothesis: H42 (lab runs RN13) (hypothesis: H42)
RownumsMAPE term of a forecast of 1e-9 for a zero actual
r10.10.0000
r20.50.0000
r31.00.0000
E31.T10 · signal-to-noise ratio of sMAPE over its large-spread formula, signal-to-noise ratio of the absolute error over its limit by error_distribution, c1, c2; hypothesis: H39, sigma: 200 (lab runs RN13) (hypothesis: H39, sigma: 200)
Rowerror_distributionc1c2signal-to-noise ratio of sMAPE over its large-spread formulasignal-to-noise ratio of the absolute error over its limit
r1normal0.00.50.99990.9913
r2normal0.01.010.9956
r3normal-0.51.51.0010.9966
r4Gumbel0.00.50.99980.9647
r5Gumbel0.01.010.9937
r6Gumbel-0.51.510.9967
E31.T11 · relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50 by error_distribution, c1, c2; hypothesis: H39 (lab runs RN13) (hypothesis: H39)
Rowerror_distributionc1c2relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50
r1normal0.00.50.0000
r2normal0.01.00.0000
r3normal-0.51.50.0000
r4Gumbel0.00.50.0000
r5Gumbel0.01.00.0000
r6Gumbel-0.51.50.0000
E31.T12 · signal-to-noise ratio of the squared error over its formula, lognormal, exp(sigma^2 / 2) times the squared error's ratio, lognormal, formula by c1, c2, sigma; hypothesis: H39 (lab runs RN13) (hypothesis: H39)
Rowc1c2sigmasignal-to-noise ratio of the squared error over its formula, lognormalexp(sigma^2 / 2) times the squared error's ratio, lognormal, formula
r10.00.50.51
r20.01.00.51
r3-0.51.50.51
r40.00.51.01
r50.01.01.01
r6-0.51.51.01
r70.00.52.01
r80.01.02.01
r9-0.51.52.01
r100.01.04.00.9907
r110.01.06.01
E31.T13 · distributions compared with the asymptotic values recorded by RN7; hypothesis: H40 (lab runs RN13) (hypothesis: H40)
Rowdistributions compared with the asymptotic values recorded by RN7
r116
E31.T14 · distributions where A is not below 2 g at the median, largest difference from the asymptotic values recorded by RN7; hypothesis: H40, distributions: 16 (lab runs RN13) (hypothesis: H40, distributions: 16)
Rowdistributions where A is not below 2 g at the medianlargest difference from the asymptotic values recorded by RN7
r100.0001
E31.T15 · large-sample relative efficiency, formula by family, spread; hypothesis: H40 (lab runs RN13) (hypothesis: H40)
Rowfamilyspreadlarge-sample relative efficiency, formula
r1lognormal0.250.9696
r2lognormal0.50.8881
r3lognormal1.00.6601
r4lognormal1.50.454
r5lognormal2.00.3073
r6lognormal3.00.1474
r7lognormal4.00.0778
r8lognormal6.00.0279
r9log-Laplace0.250.9969
r10log-Laplace0.50.9765
r11log-Laplace1.00.8953
r12log-Laplace1.50.8036
r13log-Laplace2.00.7207
r14log-Laplace3.00.5903
r15log-Laplace4.00.4969
r16log-Laplace6.00.3755
E31.T16 · distance of the large-sample relative efficiency from 1 at spread 0.01 by family; hypothesis: H40 (lab runs RN13) (hypothesis: H40)
Rowfamilydistance of the large-sample relative efficiency from 1 at spread 0.01
r1lognormal0.0001
r2log-Laplace0.0000
E31.T17 · large-sample relative efficiency times sigma^3 over 6 (ln 2)^2 sqrt(2 pi), lognormal, large-sample relative efficiency times b over 3, log-Laplace; hypothesis: H40, spread: 200 (lab runs RN13) (hypothesis: H40, spread: 200)
Rowlarge-sample relative efficiency times sigma^3 over 6 (ln 2)^2 sqrt(2 pi), lognormallarge-sample relative efficiency times b over 3, log-Laplace
r10.99980.9906

E32 · quant · other

Numerical checks of the formulas of C18 (formula checks), lab run RN18 (check_h39.py) under the formal plan that decided C18; every check is within the plan's tolerances. They check the formulas on concrete numbers; the proof is the evidence for the claim. The run's script labels the checks H39, the record's first wording of C18; the formulas are those of C18.

E32.T1 · distance of sMAPE's signal-to-noise ratio over its large-spread formula from 1, distance of the absolute error's signal-to-noise ratio over its limit from 1 by error_distribution, c1, c2, sigma; hypothesis: H39 (lab runs RN18) (hypothesis: H39)
Rowerror_distributionc1c2sigmadistance of sMAPE's signal-to-noise ratio over its large-spread formula from 1distance of the absolute error's signal-to-noise ratio over its limit from 1
r1normal0.00.52000.00010.0087
r2normal0.00.520000.00000.0009
r3normal0.01.02000.00040.0044
r4normal0.01.020000.00000.0004
r5normal-0.51.52000.00120.0034
r6normal-0.51.520000.00010.0003
r7Gumbel0.00.52000.00020.0353
r8Gumbel0.00.520000.00000.0035
r9Gumbel0.01.02000.00020.0063
r10Gumbel0.01.020000.00000.0006
r11Gumbel-0.51.52000.00040.0033
r12Gumbel-0.51.520000.00000.0003
E32.T2 · relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50 by error_distribution, c1, c2; hypothesis: H39 (lab runs RN18) (hypothesis: H39)
Rowerror_distributionc1c2relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50
r1normal0.00.50.0000
r2normal0.01.00.0000
r3normal-0.51.50.0000
r4Gumbel0.00.50.0000
r5Gumbel0.01.00.0000
r6Gumbel-0.51.50.0000
E32.T3 · distance of the squared error's signal-to-noise ratio over its formula from 1, lognormal, distance of exp(sigma^2 / 2) times the squared error's ratio from 1, lognormal, formula by c1, c2, sigma; hypothesis: H39 (lab runs RN18) (hypothesis: H39)
Rowc1c2sigmadistance of the squared error's signal-to-noise ratio over its formula from 1, lognormaldistance of exp(sigma^2 / 2) times the squared error's ratio from 1, lognormal, formula
r10.00.50.50.0000
r20.01.00.50.0000
r3-0.51.50.50.0000
r40.00.51.00.0000
r50.01.01.00.0000
r6-0.51.51.00.0000
r70.00.52.00.0000
r80.01.02.00.0000
r9-0.51.52.00.0000
r100.01.04.00.0093
r110.01.06.00.0000
r120.01.08.00.0000

E33 · quant · other

Numerical checks of the formulas of C19 (formula checks), lab run RN16 (check_corrected.py, seed 8) under the formal plan that decided C19; every check is within the plan's tolerances. They check the formulas on concrete numbers; the proof is the evidence for the claim. The run's script labels the checks by the record's first wordings: H40 (T4 to T7 and the result R1) checks C19; H39 (T1 to T3) checks the formulas of C18, which the same plan tested in an earlier wording.

  • R1 distributions compared with the asymptotic values recorded by RN7 = 16 (hypothesis: H40)
E33.T1 · distance of sMAPE's signal-to-noise ratio over its large-spread formula from 1, distance of the absolute error's signal-to-noise ratio over its limit from 1 by error_distribution, c1, c2, sigma; hypothesis: H39 (lab runs RN16) (hypothesis: H39)
Rowerror_distributionc1c2sigmadistance of sMAPE's signal-to-noise ratio over its large-spread formula from 1distance of the absolute error's signal-to-noise ratio over its limit from 1
r1normal0.00.52000.00010.0087
r2normal0.00.520000.00000.0009
r3normal0.01.02000.00040.0044
r4normal0.01.020000.00000.0004
r5normal-0.51.52000.00120.0034
r6normal-0.51.520000.00010.0003
r7Gumbel0.00.52000.00020.0353
r8Gumbel0.00.520000.00000.0035
r9Gumbel0.01.02000.00020.0063
r10Gumbel0.01.020000.00000.0006
r11Gumbel-0.51.52000.00040.0033
r12Gumbel-0.51.520000.00000.0003
E33.T2 · relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50 by error_distribution, c1, c2; hypothesis: H39 (lab runs RN16) (hypothesis: H39)
Rowerror_distributionc1c2relative spread of the absolute log error's signal-to-noise ratio over sigma = 2, 10, 50
r1normal0.00.50.0000
r2normal0.01.00.0000
r3normal-0.51.50.0000
r4Gumbel0.00.50.0000
r5Gumbel0.01.00.0000
r6Gumbel-0.51.50.0000
E33.T3 · distance of the squared error's signal-to-noise ratio over its formula from 1, lognormal, distance of exp(sigma^2 / 2) times the squared error's ratio from 1, lognormal, formula by c1, c2, sigma; hypothesis: H39 (lab runs RN16) (hypothesis: H39)
Rowc1c2sigmadistance of the squared error's signal-to-noise ratio over its formula from 1, lognormaldistance of exp(sigma^2 / 2) times the squared error's ratio from 1, lognormal, formula
r10.00.50.50.0000
r20.01.00.50.0000
r3-0.51.50.50.0000
r40.00.51.00.0000
r50.01.01.00.0000
r6-0.51.51.00.0000
r70.00.52.00.0000
r80.01.02.00.0000
r9-0.51.52.00.0000
r100.01.04.00.0093
r110.01.06.00.0000
r120.01.08.00.0000
E33.T4 · large-sample relative efficiency, formula by family, spread; hypothesis: H40 (lab runs RN16) (hypothesis: H40)
Rowfamilyspreadlarge-sample relative efficiency, formula
r1lognormal0.250.9696
r2lognormal0.50.8881
r3lognormal1.00.6601
r4lognormal1.50.454
r5lognormal2.00.3073
r6lognormal3.00.1474
r7lognormal4.00.0778
r8lognormal6.00.0279
r9log-Laplace0.250.9969
r10log-Laplace0.50.9765
r11log-Laplace1.00.8953
r12log-Laplace1.50.8036
r13log-Laplace2.00.7207
r14log-Laplace3.00.5903
r15log-Laplace4.00.4969
r16log-Laplace6.00.3755
E33.T5 · distance of the large-sample relative efficiency from 1 at spread 0.01 by family; hypothesis: H40 (lab runs RN16) (hypothesis: H40)
Rowfamilydistance of the large-sample relative efficiency from 1 at spread 0.01
r1lognormal0.0001
r2log-Laplace0.0000
E33.T6 · distributions where A is not below 2 g at the median, largest difference from the asymptotic values recorded by RN7; hypothesis: H40, distributions: 16 (lab runs RN16) (hypothesis: H40, distributions: 16)
Rowdistributions where A is not below 2 g at the medianlargest difference from the asymptotic values recorded by RN7
r100.0001
E33.T7 · large-sample relative efficiency times sigma^3 over 6 (ln 2)^2 sqrt(2 pi), lognormal, large-sample relative efficiency times b over 3, log-Laplace; hypothesis: H40, spread: 200 (lab runs RN16) (hypothesis: H40, spread: 200)
Rowlarge-sample relative efficiency times sigma^3 over 6 (ln 2)^2 sqrt(2 pi), lognormallarge-sample relative efficiency times b over 3, log-Laplace
r10.99980.9906

E18 · formal · cited by C1

Proof of C1 (section H1 of the proof document A1, rendered in A2). Only the ratio of the actual to the forecast matters, not their size.

  1. Since yy and ff are positive, |y|+|f|=y+f|y| + |f| = y + f. So s=|y−f|/(y+f)s = |y - f|/(y + f). (algebra; from D1)
  2. Dividing the numerator and the denominator by f>0f > 0 gives |y−f|/f(y+f)/f\dfrac{|y-f|/f}{(y+f)/f}. Since f>0f > 0, |y−f|/f=|(y−f)/f|=|r−1||y - f|/f = |(y - f)/f| = |r - 1|. And (y+f)/f=r+1(y+f)/f = r + 1. (algebra; from S1)
  3. So s=|r−1|/(r+1)s = |r - 1|/(r + 1). The contribution depends only on the ratio of actual to forecast. (conclusion; from S2)

E20 · formal · cited by C3

Proof of C3 (section H3 of the proof document A1, rendered in A2). sMAPE measures the error on the log scale. For small errors it is half the absolute log error; for large errors it levels off.

  1. Write z=ln⁡y−ln⁡fz = \ln y - \ln f, so that r=y/f=ezr = y/f = e^z. By C1, s=|ez−1|ez+1s = \dfrac{|e^z - 1|}{e^z + 1}. (definition; from C1)
  2. Multiplying the numerator and the denominator of ez−1ez+1\dfrac{e^z - 1}{e^z + 1} by e−z/2e^{-z/2} gives ez/2−e−z/2ez/2+e−z/2=tanh⁡(z/2)\dfrac{e^{z/2} - e^{-z/2}}{e^{z/2} + e^{-z/2}} = \tanh(z/2). The denominator is positive, so s=|tanh⁡(z/2)|s = |\tanh(z/2)|. (algebra; from S1)
  3. tanh⁡\tanh changes only its sign when its argument changes sign: tanh⁡(−x)=−tanh⁡(x)\tanh(-x) = -\tanh(x), as the definition shows. So |tanh⁡(z/2)|=tanh⁡(|z|/2)|\tanh(z/2)| = \tanh(|z|/2), which is the stated form. (algebra; from S2)
  4. For (a): tanh⁡\tanh is 0 at 0. On [0,∞)[0, \infty) it is strictly increasing and concave, and it approaches 1 as its argument grows; its derivative 1−tanh2⁡x1 - \tanh^2 x is positive and decreasing for x>0x > 0. With the argument |ln⁡y−ln⁡f|/2|\ln y - \ln f|/2, ss has these properties in |ln⁡y−ln⁡f||\ln y - \ln f|. (monotonicity; from S3)
  5. For (b): for every x≥0x \ge 0, x−x3/3≤tanh⁡x≤xx - x^3/3 \le \tanh x \le x. The upper bound holds because tanh⁡\tanh has slope at most 1; the lower one because the derivative of tanh⁡x−x+x3/3\tanh x - x + x^3/3 is x2−tanh2⁡x≥0x^2 - \tanh^2 x \ge 0, and the difference is 0 at x=0x = 0. Putting x=|ln⁡y−ln⁡f|/2x = |\ln y - \ln f|/2 gives the bounds. (algebra; from S4)
  6. For (c), the median: the mean of |ln⁡yt−ln⁡f||\ln y_t - \ln f| over a test set is minimised when ln⁡f\ln f is a median of the ln⁡yt\ln y_t. Since the logarithm is increasing, this is when ff is a median mm of the yty_t. (monotonicity; from S5)
  7. For (c), the bound: with zt=ln⁡yt−ln⁡fz_t = \ln y_t - \ln f the log errors of the test set, write |z|‾(f)=1n∑t|ln⁡yt−ln⁡f|\overline{|z|}(f) = \frac1n\sum_t|\ln y_t - \ln f|, |z|3‾(f)=1n∑t|ln⁡yt−ln⁡f|3\overline{|z|^3}(f) = \frac1n\sum_t|\ln y_t - \ln f|^3 and s¯(f)\bar s(f) for the mean of the sMAPE terms of the test set. Averaging the bounds of step 5 over the test set gives s¯(f)≤12|z|‾(f)≤s¯(f)+124|z|3‾(f)\bar s(f) \le \tfrac12\overline{|z|}(f) \le \bar s(f) + \tfrac1{24}\overline{|z|^3}(f) for every f>0f > 0. Let f*f^* minimise s¯\bar s, so that s¯(f*)≤s¯(m)\bar s(f^*) \le \bar s(m). Then 12|z|‾(f*)≤s¯(f*)+124|z|3‾(f*)≤s¯(m)+124|z|3‾(f*)≤12|z|‾(m)+124|z|3‾(f*).\tfrac12\overline{|z|}(f^*) \le \bar s(f^*) + \tfrac1{24}\overline{|z|^3}(f^*) \le \bar s(m) + \tfrac1{24}\overline{|z|^3}(f^*) \le \tfrac12\overline{|z|}(m) + \tfrac1{24}\overline{|z|^3}(f^*). Multiplying by 2 gives |z|‾(f*)−|z|‾(m)≤112|z|3‾(f*)\overline{|z|}(f^*) - \overline{|z|}(m) \le \tfrac1{12}\overline{|z|^3}(f^*), the stated inequality. (algebra; from S5)
  8. For (c), not the median in general: take the five actuals 1,1,e,e4,e41, 1, e, e^4, e^4, whose median is ee. With the forecast at ee the log errors are 1,1,0,3,31, 1, 0, 3, 3 in size and the sMAPE terms sum to 2tanh⁡(0.5)+2tanh⁡(1.5)=2.7342\tanh(0.5) + 2\tanh(1.5) = 2.734. With the forecast at 1 the log errors are 0,0,1,4,40, 0, 1, 4, 4 and the terms sum to tanh⁡(0.5)+2tanh⁡(2)=2.390\tanh(0.5) + 2\tanh(2) = 2.390, which is lower. So the median does not minimise the sMAPE of this test set, although it minimises its log-MAE (step 6). (algebra; from S6)
  9. So s=tanh⁡(|ln⁡y−ln⁡f|/2)s = \tanh(|\ln y - \ln f|/2). It rises from 0 like half the absolute log error and levels off at 1. For small errors sMAPE is close to the log-MAE, and its minimiser is close to the median without in general being the median. (conclusion; from S8)

E28 · formal · cited by C10

Proof of C10 (section H11 of the proof document A1, rendered in A2). For widely spread actuals, every forecast scores close to the worst value. The differences between forecasts shrink, and the target moves from the median to the mode of ln⁡y\ln y.

  1. Rewrite the expectation. By C3, and since tanh⁡(|x|/2)=1−21+e|x|\tanh(|x|/2) = 1 - \dfrac{2}{1 + e^{|x|}}, E[s(y,f)]=1−E[2/(1+e|ln⁡y−ln⁡f|)]\mathrm E[s(y,f)] = 1 - \mathrm E\big[2/(1 + e^{|\ln y - \ln f|})\big]. The density of ln⁡y\ln y at xx is h((x−μ)/σ)/σh\big((x - \mu)/\sigma\big)/\sigma. Substituting x=ln⁡f+vx = \ln f + v in the integral gives E[s(y,f)]=1−1σ∫21+e|v|h(c+vσ)dv.\mathrm E[s(y,f)] = 1 - \frac1\sigma\int \frac{2}{1 + e^{|v|}}\,h\Big(c + \frac v\sigma\Big)\,dv. (change of variables; from C3)
  2. Expand hh. By Taylor's theorem, h(c+v/σ)=h(c)+h′(c)v/σ+12h′′(ξ)v2/σ2h(c + v/\sigma) = h(c) + h'(c)\,v/\sigma + \tfrac12 h''(\xi)\,v^2/\sigma^2 for some ξ\xi between cc and c+v/σc + v/\sigma. (Taylor's theorem; from S1)
  3. The first term integrates to 4ln⁡2h(c)4\ln 2\,h(c), since ∫21+e|v|dv=4ln⁡2\int \frac{2}{1+e^{|v|}}\,dv = 4\ln 2. Over v>0v > 0, ∫2/(1+ev)dv=2ln⁡2\int 2/(1 + e^v)\,dv = 2\ln 2. (algebra; from S2)
  4. The second term integrates to 0: its factor vv changes sign with vv, while the rest does not. (algebra; from S3)
  5. The third term is at most 12max⁡|h′′|\tfrac12\max|h''| times ∫2v21+e|v|dv=6ζ(3)≈7.21\int \frac{2v^2}{1+e^{|v|}}\,dv = 6\zeta(3) \approx 7.21, divided by σ2\sigma^2. This integral is a standard Fermi–Dirac integral. With the factor 1/σ1/\sigma of step 1, this gives the expansion. (standard integral; from S1)
  6. (a). The expansion tends to 1, so the expected sMAPE tends to 200. Two forecasts at fixed quantile levels have fixed positions c1c_1 and c2c_2. So their difference is 4ln⁡2[h(c2)−h(c1)]/σ+O(σ−3)4\ln 2\,[h(c_2) - h(c_1)]/\sigma + O(\sigma^{-3}). (algebra; from S5)
  7. (b). Minimising the expansion over cc is maximising h(c)h(c), up to a term that shrinks like σ−2\sigma^{-2} for every cc at once. A density with a bounded derivative tends to 0 far out. So its single highest point c0c_0 stands clear of every other point, and the minimisers' positions tend to c0c_0. So do their quantile levels. (algebra; from S6)
  8. (c). By C3 (b), 12σ|ε−c|−s\tfrac12\sigma|\varepsilon - c| - s lies between 0 and 124σ3|ε−c|3\tfrac1{24}\sigma^3|\varepsilon - c|^3. So for cc in any bounded range, E[s]/σ=12E|ε−c|+O(σ2)\mathrm E[s]/\sigma = \tfrac12\mathrm E|\varepsilon - c| + O(\sigma^2). This uses E|ε|3<∞\mathrm E|\varepsilon|^3 < \infty. And E|ε−c|\mathrm E|\varepsilon - c| is smallest at the median of ε\varepsilon. (earlier result; from C3)
  9. The minimisers also stay in a bounded range. For large |c||c|, most actuals have ε\varepsilon at least |c|/2|c|/2 from cc. And tanh⁡x≥xtanh⁡1\tanh x \ge x\tanh 1 for 0≤x≤10 \le x \le 1. So E[s]/σ\mathrm E[s]/\sigma grows with |c||c|, or exceeds a multiple of 1/σ1/\sigma, beyond its value at the median. So the minimisers' positions tend to the median of ε\varepsilon, whose quantile level is 1/21/2. (algebra; from S8)
  10. So as the actuals spread out, the expected sMAPE flattens towards its bound. Differences between forecasts vanish like 1/σ1/\sigma. The target moves from the median to the mode of ln⁡y\ln y. (conclusion; from S9)

Definitions

Methods 1

D31 formula checks: Numerical checks of the formulas of the formal claims (claimset-code/smape-target/check_formulas.py, seed 6; check_jump.py for C11): identities and inequalities on 200000 random pairs, derivatives against finite differences, minimisers, balances and thresholds against quadrature and bisection on every setting of the selection design, and the large-spread expansion against its bound. For the claims new or reworded in version 3 (C3, C4, C12, C17 to C20): check_v3.py (seed 8), check_h39.py and check_corrected.py (seed 8), in the same way.

Variables and measures 13

D2 sMAPE: Symmetric mean absolute percentage error of a point forecast ff over a test set of actuals y1,…,yny_1, \dots, y_n: 200n∑t|yt−f|/(|yt|+|f|)\frac{200}{n}\sum_t |y_t - f|/(|y_t|+|f|), where a term with yt=f=0y_t = f = 0 counts as 0. Introduced as the symmetric MAPE by Makridakis (1993), whose denominator had no absolute values; for positive actuals and forecasts the two agree. Source: Makridakis (1993).

D1 sMAPE term: The contribution of one actual yy and one point forecast ff to sMAPE: s(y,f)=|y−f|/(|y|+|f|)s(y,f) = |y-f|/(|y|+|f|), between 0 and 1, with s=0s = 0 when y=fy = f (including y=f=0y = f = 0, where the fraction is 0/00/0).

D3 expected sMAPE: The expected sMAPE of a fixed forecast ff under the distribution of the actual yy: 200E[s(y,f)]200\,\mathrm{E}[s(y, f)], where E\mathrm E is the expectation over the random actual yy. Computed from the distribution (by integration or exact sums), never from a sample.

D4 log error: For a positive actual yy and a positive forecast ff, z=ln⁡y−ln⁡fz = \ln y - \ln f.

D5 weight: For a positive actual yy and a positive forecast ff, w(y,f)=y/(y+f)2w(y,f) = y/(y+f)^2: how much the actual pulls the forecast that minimises expected sMAPE, since the derivative of E[s(y,f)]\mathrm E[s(y,f)] in ff is 2E[w(y,f)(𝟏{y<f}−𝟏{y>f})]2\,\mathrm E[w(y,f)(\mathbf 1\{y<f\} - \mathbf 1\{y>f\})]. Largest at y=fy = f, the same for y/f=ry/f = r and 1/r1/r.

D10 RMSE: Root mean squared error of a point forecast ff over a test set of actuals y1,…,yny_1, \dots, y_n: 1n∑t(yt−f)2\sqrt{\frac1n\sum_t (y_t-f)^2}.

D11 MAE: Mean absolute error of a point forecast ff over a test set of actuals y1,…,yny_1, \dots, y_n: 1n∑t|yt−f|\frac1n\sum_t |y_t-f|.

D19 log-MAE: 100 times the mean absolute error of ln⁡f\ln f as a forecast of ln⁡y\ln y: 100n∑t|ln⁡yt−ln⁡f|\frac{100}{n}\sum_t |\ln y_t - \ln f|. Unbounded; sMAPE's small-error limit (C3); minimised by the median.

D28 Suilin term: The contribution of one actual yy and one forecast ff to the Suilin loss: s~(y,f)=|y−f|max⁡(|y|+|f|+δ,0.5+δ),δ=0.1;\tilde s(y,f) = \frac{|y-f|}{\max(|y|+|f|+\delta,\ 0.5+\delta)}, \qquad \delta = 0.1; the Suilin loss is 200 times its mean over a test set. It replaces the denominator |y|+|f||y|+|f| of the sMAPE term. Proposed by Suilin (2017) in code for a Kaggle competition, as a smoothed variant of sMAPE; defined in print by Hewamalage, Bergmeir and Bandara (2021, Eq. 15), who write the constant δ\delta as ϵ\epsilon and the factor 2 into the measure differently (a constant factor changes no property here). Hewamalage, Ackermann and Bergmeir (2023) call it msMAPE; Smyl (2025) gives that name to a different measure, so this study follows Kolassa (2026) and calls it the Suilin loss. Version 2 of this paper called it msMAPE. Source: Hewamalage et al. (2021).

D33 msMAPE term: The contribution of one actual y≥0y \ge 0 and one forecast f≥0f \ge 0 to the sparse-proof sMAPE (msMAPE) of Smyl (2025), as Kolassa (2026, Definition 4) states it, for a small constant ν>0\nu > 0 (Kolassa writes it mm, which is the median here): sν(y,f)=|f−y|f+max⁡{y,ν},s_\nu(y,f) = \frac{|f-y|}{f+\max\{y, \nu\}}, which is 0 when y=f=0y = f = 0; msMAPE is 200 times its mean over a test set (Kolassa writes the factor 2 into the term). It replaces the actual in the denominator of the sMAPE term by ν\nu when the actual is below ν\nu. Source: Kolassa (2026).

D8 sMAPE minimiser of a test set: The forecast that minimises the sMAPE of one test set y1,…,yny_1, \dots, y_n, f^n=arg⁡minf⁡1n∑ts(yt,f)\hat f_n = \arg\min_f \frac1n\sum_t s(y_t, f), found numerically (the sample counterpart of the sMAPE target).

D9 relative efficiency: For a test-set size nn and an outcome distribution where sMAPE and MAE both target the median: RE(n)=Var⁡(ln⁡m^n)/Var⁡(ln⁡f^n)\mathrm{RE}(n) = \operatorname{Var}(\ln \hat m_n) / \operatorname{Var}(\ln \hat f_n) over test sets, where m^n\hat m_n is the sample median (the MAE minimiser) and f^n\hat f_n the sMAPE minimiser of the same test set. Above 1, sMAPE's minimiser varies less; below 1, MAE's does.

D32 signal-to-noise ratio of a comparison: For a measure with term L(y,f)L(y,f), two forecasts f1f_1 and f2f_2 and a distribution of the actual yy: |E[D]|/sd(D)|\mathrm E[D]|/\mathrm{sd}(D), where D=L(y,f2)−L(y,f1)D = L(y,f_2) - L(y,f_1) is the difference of the two forecasts' scores on one actual. Over a test set of nn independent actuals the mean of DD is n\sqrt n times this many of its standard errors from zero: the larger the ratio, the smaller the test set that tells the two forecasts apart.

Concepts 1

D6 sMAPE target: The value or values of ff that minimise expected sMAPE for a given distribution of the actual yy, arg⁡minf⁡E[s(y,f)]\arg\min_f \mathrm E[s(y,f)]: the functional sMAPE rewards. It may be a single value or several.

Context

Supports B6 · from C10
C6 recommends against sMAPE for point forecasts; C10 shows that on widely spread actuals every forecast scores close to the worst value and the target moves to the mode of ln y.
Supports Kolassa (2026) · from C10
Kolassa (2026) concludes that sMAPE should not be used; C10 shows that on widely spread actuals every forecast scores close to the worst value.
Extends B12 · from C1
Tofallis (2015) lists the sMAPE term, |y-f|/[(|y|+|f|)/2], among Tornqvist et al.'s measures of relative change; C1 shows it depends on the actual and the forecast only through their ratio.
Extends B12 · from C3
Tofallis (2015) relates sMAPE to the log accuracy ratio among relative measures; C3 shows the sMAPE term is exactly the hyperbolic tangent of half the absolute log ratio.

References

  1. Hewamalage, H., Bergmeir, C., Bandara, K., 2021. Recurrent Neural Networks for Time Series Forecasting: Current status and future directions. International Journal of Forecasting 37, 388–427. https://doi.org/10.1016/j.ijforecast.2020.06.008 Used by: D28
  2. Kolassa, S., 2026. The Symmetric Mean Absolute Percentage Error: Unnecessary or Dangerous. Forecasting 8, 24. https://doi.org/10.3390/forecast8020024 Used by: Context, D33
  3. Makridakis, S., 1993. Accuracy measures: theoretical and practical concerns. International Journal of Forecasting 9, 527–529. https://doi.org/10.1016/0169-2070(93)90079-3 Used by: D2

Artefacts

  • A1 · proof Proofs of the formal claims, version 3, in Markdown with LaTeX: section H3 with part (c); H5 shortened to the weighted median; new sections H12 (the ordinary median, with the checker's example), H13 (signal-to-noise ratios) and H14 (large-sample efficiency). Checked independently by AC6 (CK27 to CK31, CK34 to CK37) and corrected as it proposed; after its checks the notation was made consistent (no second meaning for k, a, G), which AC6 read and found to change nothing. Sections H1 to H14 prove C1, C2, C3, C9, C4, C5, C6, C7, C11, C8, C10, C12, C18 and C19, in that order. Sections H1 to H11 were also checked independently by lab actor AC4 (proof-check-report.md) and by the supervisor. proofs.md
  • A2 · proof The same proofs, version 3, rendered as PDF. proofs.pdf
  • A6 · data Every result of the lab record (17182 results of 17 runs) at full precision: the lab result's ID, its run, the quantity as the run's script named it, its conditions and its value (both as JSON). The evidence's tables give the values to four significant digits. smape-target.results.csv

Score

Scores are computed by rules from the claimset file (EntryLib rubric 0.7): they check the record, not the science, and may change as the rubric and reviews develop. The rubric.

C10: 100, Well supported

Novelty: new, by the authors

Nothing lost.

C1: 100, Well supported

Novelty: extends earlier work, by the authors

Nothing lost.

C3: 100, Well supported

Novelty: extends earlier work, by the authors

Nothing lost.