arXiv (All)
open access
Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming
We study the problem of learning accurate and cognitively simple binary classifiers that are directly interpretable as Boolean rules. We propose mixed integer linear programming (MILP) formulations for training sparse disjunctive normal form (DNF) networks, viewed as small networks with a conjunctiv
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
- Learning Capacity Constraints with Convex Neural Networks in Lot-Sizing Problems#1235837
- A semantics for Boolean networks consistent with regulatory threshold constraints#8375
- Size-optimal Boolean matrix factorization#179378
- Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming#785147
- Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming#783557
Record · ID 1355103
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