We lifted 13 functions out of this paper's own repositories and ran 0 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 |
|---|---|---|
| samholt/HDTwinGen | canonical | 0 of 13 |
| Function | Status | Where it lives |
|---|---|---|
| cache_or_compute | Not yet run | samholt/HDTwinGen/summarizer_and_modifier.py code served (permissive licence) · get_code("9dff9ca6cae1cd18") |
| count_total_characters | Not yet run | samholt/HDTwinGen/summarizer_and_modifier.py code served (permissive licence) · get_code("2bf09f668a861e18") |
| extract_exception | Not yet run | samholt/HDTwinGen/executor.py code served (permissive licence) · get_code("43b96b1bda587e4e") |
| extract_failed_tests | Not yet run | samholt/HDTwinGen/agents.py code served (permissive licence) · get_code("6b82026785a72f30") |
| get_code_from_message | Not yet run | samholt/HDTwinGen/agents.py code served (permissive licence) · get_code("0f907827b93b54c8") |
| get_llm_config | Not yet run | samholt/HDTwinGen/llm_utils.py code served (permissive licence) · get_code("aa2815e67d1228fc") |
| get_model_max_tokens | Not yet run | samholt/HDTwinGen/llm_utils.py code served (permissive licence) · get_code("44b26a365fe7a95b") |
| load_code_files_into_dict | Not yet run | samholt/HDTwinGen/summarizer_and_modifier.py code served (permissive licence) · get_code("fbdf887d06f6847f") |
| protectedDiv | Not yet run | samholt/HDTwinGen/sr.py code served (permissive licence) · get_code("2ad9f27dc4062f06") |
| protectedExp | Not yet run | samholt/HDTwinGen/sr.py code served (permissive licence) · get_code("b9c05edc52147478") |
| protectedLog | Not yet run | samholt/HDTwinGen/sr.py code served (permissive licence) · get_code("9066f32f75a5e92d") |
| replace_zeros_with_ones | Not yet run | samholt/HDTwinGen/utils/models.py code served (permissive licence) · get_code("7add23f40c3b1269") |
| setup_chat_rate_limiter | Not yet run | samholt/HDTwinGen/llm_utils.py code served (permissive licence) · get_code("2bf6f0758841816f") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Digital Twins (DTs) are computational models that simulate the states and temporal dynamics of real-world systems, playing a crucial role in prediction, understanding, and decision-making across diverse domains. However, existing approaches to DTs often struggle to generalize to unseen conditions in data-scarce settings, a crucial requirement for such models. To address these limitations, our work begins by establishing the essential desiderata for effective DTs. Hybrid Digital Twins ($\textbf{HDTwins}$) represent a promising approach to address these requirements, modeling systems using a composition of both mechanistic and neural components. This hybrid architecture simultaneously leverages (partial) domain knowledge and neural network expressiveness to enhance generalization, with its modular design facilitating improved evolvability. While existing hybrid models rely on expert-specified architectures with only parameters optimized on data, $\textit{automatically}$ specifying and optimizing HDTwins remains intractable due to the complex search space and the need for flexible integration of domain priors. To overcome this complexity, we propose an evolutionary algorithm ($\textbf{HDTwinGen}$) that employs Large Language Models (LLMs) to autonomously propose, evaluate, and optimize HDTwins. Specifically, LLMs iteratively generate novel model specifications, while offline tools are employed to optimize emitted parameters. Correspondingly, proposed models are evaluated and evolved based on targeted feedback, enabling the discovery of increasingly effective hybrid models. Our empirical results reveal that HDTwinGen produces generalizable, sample-efficient, and evolvable models, significantly advancing DTs' efficacy in real-world applications.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.23691")
get_code_for_paper("2410.23691")
have("2410.23691")
Connect an agent — have() is free.