SciML / SciML/StructuralIdentifiability.jl
Working directly on expressions for local identifiability
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 129
- Forks
- 23
- Avg merge
- 9h 35m
- Merged PRs (30d)
- 17
Description
Sometimes (see #128) the equations have the nested structure which, after unfolding into a rational function, becomes prohibitively large. For these cases it would be cool to have the local identifiability test working directly on expressions via symbols automatic differentiation, I believe that the original Sedoglavic algorithm we use can be extended to do this.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing issue #128 and the linked Sedoglavic algorithm paper to understand the nested-expression case and the proposed automatic-differentiation approach. Done means the local identifiability test can operate directly on expressions without first expanding them into a prohibitively large rational function.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100