2507.06817
Designing Robust Software Sensors for Nonlinear Systems via Neural Networks and Adaptive Sliding Mode Control
Ayoub Farkane, Mohamed Boutayeb, Mustapha Oudani, Mounir Ghogho
wronghigh confidence
- Category
- math.DS
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper’s proof of Theorem 1 hinges on an incorrect inequality for the tanh nonlinearity (claiming s^T tanh(s) ≥ σ||s||^2 with a uniform σ>0), and imposes gain conditions that depend on the unknown estimation error ||e_k||, making the conditions non-operational. These issues occur in Step 8 and the subsequent conditions (30)–(33), and they undermine the claimed Lyapunov decrease and the stated exponential convergence result . By contrast, the model’s solution uses standard LTV-Lyapunov arguments, bounds tanh conservatively via ||tanh(s)|| ≤ ||s||, and obtains practical exponential stability to a bounded region; under decaying NN error it correctly tightens to exponential convergence to 0, provided a standard small-gain margin is ensured. The model’s argument is consistent with the paper’s own Assumption 3 (uniform observability implying the existence of a stabilizing observer gain) and avoids the paper’s flawed tanh step.
Referee report (LaTeX)
\textbf{Recommendation:} major revisions \textbf{Journal Tier:} specialist/solid \textbf{Justification:} The theoretical section contains a critical flaw: the global lower bound claimed for s\^T tanh(s) does not hold and leads to non-operational gain conditions that depend on the unknown error. These issues prevent the current proof from establishing the main convergence claim. Nonetheless, the problem addressed is relevant and the empirical section is promising. With corrected small-gain arguments, explicit local/invariance assumptions, and precise Lyapunov design conditions, the results can likely be salvaged and strengthened.