arXiv (All)
open access
A Learning Algorithm for Threshold Boolean Networks with Prescribed Fixed Points
We present a learning algorithm for inferring threshold Boolean networks (TBNs) with a prescribed set of fixed points. The proposed method employs a custom differentiable loss function that jointly enforces fixed point preservation, penalizes spurious attractors, encourages binary outputs, and promo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Permutation theory governs long-term dynamics of critical Boolean networks#821473
- Consensus Tree Estimation with False Discovery Control via Partially Ordered Sets#652139
- Consensus Tree Estimation with False Discovery Control via Partially Ordered Sets#650686
- Multi-Attractor GNNs: Set-Valued Expressivity Beyond Unique Equilibria#1129868
- Switching Constraints as a Design Tool for Predictive Control Based on K-Invariant Sets#137621
Record · ID 1034066
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive