Benjamin Peherstorfer, Jules Berman, Tobias Blickhan
We lifted 5 functions out of this paper's own repositories and ran 5 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| julesberman/ngif | — | 5 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| precompute_moments | Ran | julesberman/ngif/ngif/rff.py pointer only (licence: NONE) · get_code("85d6a1e674071df4") |
| prepare_rff_features | Ran | julesberman/ngif/ngif/rff.py pointer only (licence: NONE) · get_code("c1de82ff1d2adfd9") |
| rff_phi | Ran | julesberman/ngif/ngif/rff.py pointer only (licence: NONE) · get_code("fcbc9dea15990668") |
| sample_frequencies | Ran | julesberman/ngif/ngif/rff.py pointer only (licence: NONE) · get_code("0dd7708580c9ddc6") |
| spline_time_derivative | Ran | julesberman/ngif/ngif/rff.py pointer only (licence: NONE) · get_code("535de7febd8fea53") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Existing work on population dynamics inference often focuses on flows arising from vector fields that are the gradients of scalar potentials. Among all admissible flows that are compatible with the population dynamics, gradient flows are optimal in a specific sense: they minimize kinetic energy. The selection of fields based on different criteria corresponds to a gauge freedom when determining population dynamics, which we leverage in this work. We propose Non-Gradient Inference Flows (NGIF), an algorithm to infer nongradient population dynamics using a weak formulation of the continuity equation. This allows us to parameterize general vector fields and choose other selection criteria beyond minimal kinetic energy. We demonstrate on a variety of low-and high-dimensional physics problems that this more general approach improves distributional accuracy over gradient-restricted baselines and better captures non-potential transport.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2605.25107")
get_code_for_paper("2605.25107")
have("2605.25107")
Connect an agent — have() is free.