Pith. sign in

REVIEW 3 major objections 5 minor 31 references

Computation of the largest Lyapunov exponent using recursive estimation with variable factor

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A variable weighting factor inside a recursive least squares estimator shifts largest Lyapunov exponent estimates closer to literature values in three of five chaotic systems.

desk verdict A sensible but unsupported incremental tweak to an LLE estimator; the reported gains are within noise and the one free parameter is tuned on the same systems used for evaluation. read the letter →

arxiv 1908.10789 v1 pith:BXR44BYX submitted 2019-08-19 math.NA cs.NAcs.SYeess.SPeess.SY

E. A. Sousa , E. G. Nepomuceno , M. F. S. Barroso This is my paper · ORCID
classification math.NAcs.NAcs.SYeess.SPeess.SY MSC 37M2565G50
keywords largestLyapunovexponentrecursiveleastsquaresvariableforgettingfactorchaoticsystemsfiniteprecisioncomputerarithmeticroundingmodelowerbounderror
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Computing the largest Lyapunov exponent from finite-precision simulations is sensitive to error that accumulates as iteration proceeds. This paper proposes a variable weighting factor, $\lambda(k) = 1 + 1.02/k$, inside the recursive least squares estimator so that early, more trustworthy data count more than later data. On five classic chaotic systems, the weighted estimator returns means closer to literature values for the Hénon, Sine, and Tent maps, while being slightly worse for the Logistic and Mackey-Glass maps. The paper's point is that treating all data equally is not the only defensible choice, and that a simple forgetting schedule can improve accuracy, though it also raises variance in some cases.

What carries the argument

The central object is the variable forgetting factor $\lambda(k) = 1 + 1.02/k$ inserted into the recursive least squares estimator, replacing the fixed denominator gain with a time-dependent weight that gives early samples more influence. It is applied to the natural-log lower bound error (LBE) signal produced by simulating the system twice under different IEEE 754-2008 rounding modes (round-to-nearest and round-toward-plus-infinity). The slope of the least-squares line fit to this error signal is the estimate of the largest Lyapunov exponent, and the paper claims that the variable factor adjusts that slope toward the literature value in most of the tested systems.

What would settle it

Run the same five-system comparison with $\lambda(k) = 1 + c/k$ for several values of $c$, and also on a chaotic system not used in this study (for example, the Lorenz system); if no single $c$ outperforms uniform weighting across the new set, or if the winning $c$ differs sharply from 1.02, the claim that variable weighting is broadly beneficial fails.

Watch

Extended reading notes

Core claim

Working from the lower-bound-error approach and the earlier rounding-mode method for computing the largest Lyapunov exponent, the paper argues that the recursive least squares line fit used to extract the exponent should not weight all observations equally. Because floating-point errors accumulate, earlier samples are more precise, so the estimator is modified with a forgetting factor $\lambda(k) = 1 + 1.02/k$ that decreases toward one as $k$ grows. Applied to the Logistic, Hénon, Sine, Tent, and Mackey-Glass systems, the modified estimator yields average LLE values closer to published values in three of the five systems (Hénon, Sine, Tent) and lower standard deviation in three (Logistic, Hénon, Sine), while standard deviation increases for Tent and Mackey-Glass. The paper presents this as evidence that variable weighting can improve recursive LLE computation, with the caveat that the schedule was chosen heuristically.

Load-bearing premise

The load-bearing premise is that the constant 1.02 in the forgetting schedule $\lambda(k) = 1 + 1.02/k$ is a sound choice; the paper states it was adjusted heuristically, so if it was tuned on the same five systems used for evaluation, the observed improvements may reflect fitting rather than a general rule.

Editorial extensions

If this is right

  • For the Hénon, Sine, and Tent maps, the variable forgetting factor shifts the mean LLE estimate closer to the literature value than uniform weighting.
  • For the Logistic and Mackey-Glass systems, uniform weighting remains closer to the literature value, so the benefit is not universal.
  • The standard deviation of the LLE estimate falls for Logistic, Hénon, and Sine when the factor is used, but rises for Tent and Mackey-Glass.
  • The method inherits the simplicity of the rounding-mode approach: it needs no parameterization, embedding dimension, or linearized flow, only the original equations and a chosen forgetting schedule.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the constant 1.02 was selected by trying values on the same five systems, the reported gains may partly reflect tuning rather than a general principle; testing on systems not used in the heuristic search would separate the two.
  • A natural extension is to make $\lambda(k)$ depend on an error estimate rather than only on $k$, so systems with slower error accumulation would not down-weight later data as aggressively.
  • The variance increase for Tent and Mackey-Glass suggests a bias-variance trade-off: the schedule improves the mean but can make individual estimates less stable, which matters when LLE is computed from a single trajectory.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes a small modification to the recursive least squares (RLS) estimator for the largest Lyapunov exponent (LLE) introduced by Peixoto et al. (2018). Instead of weighting all observations equally, the authors introduce a time-varying factor λ(k) = 1 + 1.02/k that gives higher weight to earlier data, motivated by the hypothesis that later data carry more accumulated floating-point error. The method is applied to five chaotic systems (Logistic map, Hénon map, Sine map, Tent map, and Mackey-Glass system). The authors report that, compared with the uniform-weighting RLS estimator, the proposed method gives mean estimates closer to literature values for three systems (Hénon, Sine, Tent) and larger variance for two systems (Tent and Mackey-Glass). The paper concludes that the variable-weighting method is more accurate in three systems and has only small variation in the other two.

Significance. If the claimed improvement were real and robust, the contribution would be a simple, computationally cheap enhancement to an existing LLE estimator, with potential value in applications where only finite-precision implementations are available. The paper has a commendable feature: it reports means and standard deviations over 100 initial conditions for every system and both methods, which allows the reader to assess variability directly. However, as presented, the evidence is not statistically sufficient to support the central claim, and the manuscript contains an internal contradiction about the standard deviations. The work is better read as a preliminary numerical experiment than as an established methodological result; with significant additional analysis it could become publishable.

major comments (3)
  1. [Section 4, Table 2] The text states that 'os valores calculados do desvio padrão são menores quando o fator λ é empregado' (the computed standard deviations are smaller when λ is employed). This is contradicted by the table itself: the standard deviation for the Tent map increases from 0.0051 to 0.0054 and for Mackey-Glass from 0.0020 to 0.0023 when the variable factor is used. The abstract and the conclusion correctly acknowledge increases in variance for two systems, so Section 4's blanket statement is internally inconsistent and should be corrected.
  2. [Section 4, Table 2] The central claim that 'the method obtained more accurate results in three systems' is supported only by point-estimate shifts that are small relative to the reported standard deviations. For Hénon, the mean moves from 0.4088 to 0.4174 (target 0.4180) with σ ≈ 0.085; for Sine, from 0.7487 to 0.7598 (target 0.7730) with σ ≈ 0.078; for Tent, from 0.6898 to 0.6891 (target 0.6880) with σ ≈ 0.005. Each shift is roughly 0.1σ to 0.15σ, and the two systems that move away from the literature values (Logistic and Mackey-Glass) shift by comparable amounts. No significance tests, confidence intervals, or paired comparisons are provided. The observed differences are fully consistent with sampling noise, so the stated conclusion is not statistically supported.
  3. [Section 3] The forgetting-factor schedule λ(k) = 1 + 1.02/k is introduced as 'ajustado heuristicamente' (heuristically adjusted), but no sensitivity analysis is given and no validation is performed on systems other than the five used in the comparison. If the constant 1.02 was chosen with knowledge of these systems' literature values, then Table 2 compares the tuned method against the untuned uniform-weighting baseline on the same data, making the comparison partly self-confirming. A sensitivity sweep over the constant (e.g., λ(k) = 1 + c/k for a range of c) and evaluation on at least one system not used during tuning are necessary to establish that the reported improvements are not an artifact of the heuristic choice.
minor comments (5)
  1. [Abstract / Section 4] The terms 'accurate' (preciso) and 'precise' are used interchangeably, but the paper's quantitative evidence concerns closeness to literature values (accuracy) and standard deviation (precision). The wording should be aligned with the statistical meaning, especially because the abstract says 'more accurate' while the conclusion emphasizes 'small variation.'
  2. [Equation (2)] In the recursive least squares equations, λ appears as a scalar in the denominator of the gain K_k and as λ(k) in the covariance update P_k. The notation should be made consistent, and the dependence of λ on k should be stated explicitly in all occurrences.
  3. [Table 1 / Section 4] The Mackey-Glass system is a delay differential equation, but the manuscript does not state the integration scheme, step size, or time delay discretization used. Without this information, the reported LLE values are not reproducible.
  4. [Figure 1] The caption states 'a linha vermelha é o ajuste de mínimos quadrados' (the red line is the least squares fit), but the printed figure appears in grayscale and the line is not clearly identified in panels (f)–(j). The caption or the figure should make the fitted line visually distinct.
  5. [Conclusion] The phrase 'com pequena variação nos outros dois' (with small variation in the other two) minimizes the fact that for the Logistic map and the Mackey-Glass system the mean estimate moves away from the literature value, not just varies. This should be stated explicitly as a deterioration or as a statistically indistinguishable change.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the heuristic λ(k) schedule is a robustness concern, not a reduction of the method to its own inputs.

full rationale

I walked the paper's derivation chain. Section 3 defines the variable forgetting factor λ(k) = 1 + 1.02/k and states that it was adjusted heuristically; Section 4 then compares the resulting LLE estimates, averaged over 100 initial conditions, with literature values. The claimed improvement in three of five systems is an empirical observation based on Table 2, not a quantity that is equal to the method's inputs by construction. The constant 1.02 is not shown to be fitted to the literature LLE values, nor is any equation used in the comparison that contains the target value as an input. The absence of a sensitivity analysis is a legitimate statistical robustness concern, but it does not make the derivation circular. The self-citations (Peixoto et al. 2018, Mendes and Nepomuceno 2016, Nepomuceno et al. 2017) supply the base recursive estimator and the error-accumulation hypothesis, but the central comparison is against external literature values and the reported numbers can stand or fall independently of those citations. No step in the paper reduces to its own inputs by definition or by fitted-parameter renaming. Therefore no circularity is identified.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The central claim rests on one tuned free parameter and two domain assumptions inherited from prior work; no new entities are postulated.

free parameters (1)
  • Coefficient c in λ(k)=1+c/k = 1.02
    Set heuristically in Section 3; no sensitivity analysis, so the claimed benefit is only demonstrated for this single value.
assumptions (3)
  • domain assumption The logarithmic slope of the absolute difference between two rounding-mode simulations equals the largest Lyapunov exponent.
    Inherited from Mendes and Nepomuceno (2016) and Peixoto et al. (2018); not re-derived in this paper.
  • domain assumption Finite-precision error accumulates with each iteration, so early simulated data are more accurate than later data.
    Motivates the variable weighting in Sections 1 and 3; no quantitative error model or measurement is provided.
  • standard math The recursive least squares estimator with the time-varying λ(k) in Eq. (2) converges to the correct slope for the test systems.
    Standard RLS convergence is assumed; the nonstandard λ(k)>1 schedule is not analyzed for convergence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Computation of the largest Lyapunov exponent using recursive estimation with variable factor." pith.science (2026). https://pith.science/paper/BXR44BYX

@misc{pith2026190810789,
  author       = {Pith},
  title        = {Pith review of: Computation of the largest Lyapunov exponent using recursive estimation with variable factor},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BXR44BYX}},
  note         = {Machine review of arXiv:1908.10789}
}
read the original abstract

Chaotic systems have been investigated in the most diverse areas. One of the first steps in chaotic system research is the detection of chaos. The largest Lyapunov exponent (LLE) is one of the most widely used techniques for this purpose. Recently, techniques for calculating LLE have been developed taking into account the error due to the finite precision of computers. Recursive methods were employed to improve such algorithms. However, this method uniformly weighed the data used to calculate the LLE. This paper investigates the different weighing of the data based on the hypothesis that the initial data have a higher precision than the last data processed by the algorithm, since the process is subject to error accumulation. In five tested systems, the proposed method obtained more accurate results in three. However, there was an increase in the variance of the result obtained for two of the evaluated systems.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 27 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter edition editor howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sentence := ...

  4. [4]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize ":" * " " *...

  5. [5]

    Aguirre, L.A. (2015). Introdu c \ ao a Identifica c \ ao de Sistemas- T \' e cnicas Lineares e N\ ao- Lineares Aplicadas a Sistemas Reais . Editora UFMG

    work page 2015

  6. [6]

    Barros, M.E.S., Aguirre, L.A., and Teixeira, B.O.S. (2017). M \' e todos recursivos de subespa c os com fator de esquecimento vari \' a vel para identifica c \ ao de sistemas variantes no tempo. XIII Simp\'osio Brasileiro de Automa c \ ao Inteligente - SBAI

    work page 2017

  7. [7]

    and Bongiorno, M

    Beza, M. and Bongiorno, M. (2014). Application of recursive least squares algorithm with variable forgetting factor for frequency component estimation in a generic input signal. IEEE Transactions on Industry Applications, 50(2), 1168--1176

    work page 2014

  8. [8]

    and Oppenheim, A.V

    Cuomo, K.M. and Oppenheim, A.V. (1993). Circuit implementation of synchronized chaos with applications to communications kevin. Physical Review Letters, 71(1), 65--68

    work page 1993

Show all 31 references
  1. [9]

    Gauss, C.F. (1821). Theoria Combinationis Observationum errooribus minimis obnoxiae. Societati Regiae Scientiarum Exhibita

  2. [10]

    Goldberg, D. (1991). What every computer scientist should know about floating-point arithmetic. Computing Surveys, 23(1), 5--48

    1991

  3. [11]

    IEEE Standard for Floating-Point Arithmetic

    Institute of Electrical and Electronics Engineers (IEEE) (2008). IEEE Standard for Floating-Point Arithmetic . IEEE Std 754-2008, 1--70

    2008

  4. [12]

    Kantz, H. (1994). A robust method to estimate the maximal Lyapunov exponent of a time series . Physics Letters A, 185(1), 77--87

    1994

  5. [13]

    Machado, O.F., Silva, S.R., and Aguirre, L.A. (2008). Uma abordagem pr\'atica sobre a estima c \ ao de harm\^onicos variantes no tempo utilizando estimadores recursivos. In Anais do XVII Congresso Brasileiro de Autom\'atica, 1--6

    2008

  6. [14]

    and Hiraide, K

    Matsuoka, C. and Hiraide, K. (2015). Computation of entropy and Lyapunov exponent by a shift transform . Chaos, 25(10)

    2015

  7. [15]

    and Nepomuceno, E.G

    Mendes, E.M.A.M. and Nepomuceno, E.G. (2016). A Very Simple Method to Calculate thr (Positive) Largest Lyapunov Expoebt Using Interval Extensions . International Journal of Bifurcation an Chaos, 26(13)

    2016

  8. [16]

    Nardo, L.G., Nepomuceno, E.G., Arias-Garcia, J., and Butusov, D.N. (2019). Image encryption using finite-precision error . Chaos, Solitons & Fractals , 123, 69--78

    2019

  9. [17]

    Nepomuceno, E., Martins, S., Amaral, G., and Riveret, R. (2017). On the lower bound error for discrete maps using associative property . Systems Science & Control Engineering , 5(1), 462--473

    2017

  10. [18]

    Nepomuceno, E.G. (2014). Convergence of recursive functions on computers . The Journal of Engineering, 2014(10), 560--562

    2014

  11. [19]

    and Martins, S.A.M

    Nepomuceno, E.G. and Martins, S.A.M. (2016). A lower bound error for free-run simulation of the polynomial NARMAX . Syst. Sci. Contr. Eng., 4(1), 50--58

    2016

  12. [20]

    Oseledets, V.I. (1968). A multiplicative ergodic theorem. characteristic ljapunov, exponents of dynamical systems. Trudy Moskovskogo Matematicheskogo Obshchestva, 19, 179--210

    1968

  13. [21]

    Ott, E., Grebogi, C., and Yorke, J.A. (1990). Controlling chaos . Physical Review Letters, 64(11), 1196--1199

    1990

  14. [22]

    Overton, M.L. (2001). Numerical Computing with IEEE Floating Point Arithmetic . Society for Industrial and Applied Mathematics

    2001

  15. [23]

    Pecora, L.M., Carroll, T.L., Johnson, G.A., Mar, D.J., and Heagy, J.F. (1997). Fundamentals of synchronization in chaotic systems, concepts, and applications . Chaos: An Interdisciplinary Journal of Nonlinear Science, 7(4), 520--543

    1997

  16. [24]

    Peixoto, M.L., Nepomuceno, E.G., Martins, S.A., and Lacerda, M.J. (2018). Computation of the largest positive lyapunov exponent using rounding mode and recursive least square algorithm. Chaos, Solitons & Fractals, 112, 36 -- 43

    2018

  17. [25]

    and Marhl, M

    Perc, M. and Marhl, M. (2004). Detecting and controlling unstable periodic orbits that are not part of a chaotic attractor . Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 70(1), 10

    2004

  18. [26]

    Rosenstein, M.T., Collins, J.J., and De Luca , C.J. (1993). A practical method for calculating largest Lyapunov exponents from small data sets . Physica D, 65, 117--134

    1993

  19. [27]

    Rump, S.M. (2005). High precision evaluation of nonlinear functions . In Proceedings of 2005 International Symposium on Nonlinear Theory and its Applications, Bruge, Belgium, October 18, volume 21, 733--736

    2005

  20. [28]

    Souza, F.O., Palhares, R.M., Mendes, E.M.A.M., and Torres, L.A.B. (2012). Synchronizing Continuous Time Chaotic Systems Over Nondeterministic Networks With Packet Dropouts . International Journal of Bifurcation and Chaos, 22(12), 1250300

    2012

  21. [29]

    and Aguirre, L.A

    T \^ o rres, L.A.B. and Aguirre, L.A. (2005). Pcchua — a Laboratory Setup for Real-Time Control and Synchronization of Chaotic Oscillations . International Journal of Bifurcation and Chaos, 15(08), 2349--2360

    2005

  22. [30]

    Wolf, A., Swift, J.B., Swinney, H.L., and Vastano, J.A. (1985). Determining Lyapunov exponents from a time series . Physica D: Nonlinear Phenomena, 16(3), 285--317

    1985

  23. [31]

    Yeh, C.Y., Shiu, J., and Yau, H.T. (2012). Circuit implementation of coronary artery chaos phenomenon and optimal PID synchronization controller design . Mathematical Problems in Engineering, 2012

    2012

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.