Skip to content

Author

Tesfay Zemuy Gebrekidan

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#software testing Open access Sep 2026

Silent Loss of SBML Algebraic Constraints in COPASI

Reaction-network simulation software is commonly checked only by aggregate signals such as time course run without error or the plausibility of tracked species. This work shows this is insufficient for a specific construct within SBML (the standard encoding format for reaction-network models), the AlgebraicRule, which...

Tesfay Zemuy Gebrekidan, Hadush Hailu Gebrerufael · 0 citations
#software testing Open access Sep 2026

Silent Loss of SBML Algebraic Constraints in COPASI

Reaction-network simulation software is commonly checked only by aggregate signals such as time course run without error or the plausibility of tracked species. This work shows this is insufficient for a specific construct within SBML (the standard encoding format for reaction-network models), the AlgebraicRule, which...

Tesfay Zemuy Gebrekidan, Hadush Hailu Gebrerufael · 0 citations
#reinforcement learning Open access Sep 2026

Diagnosing Faults in Reinforcement Learning Simulators and World Models with Canonical Polynomial Invariants

A large literature builds physical structure into learned dynamics on the premise that models respecting the underlying physics predict better. This work tests that premise using exact polynomial invariants recovered from trajectories and canonicalised as reduced Gröbner bases over ℚ. On Acrobot, exactness provides lit...

Tesfay Zemuy Gebrekidan, Hadush Hailu Gebrerufael · 0 citations
#reinforcement learning Open access Sep 2026

Diagnosing Faults in Reinforcement Learning Simulators and World Models with Canonical Polynomial Invariants

A large literature builds physical structure into learned dynamics on the premise that models respecting the underlying physics predict better. This work tests that premise using exact polynomial invariants recovered from trajectories and canonicalised as reduced Gröbner bases over ℚ. On Acrobot, exactness provides lit...

Tesfay Zemuy Gebrekidan, Hadush Hailu Gebrerufael · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.