arXiv (OAI Expanded)
open access
Certifiably Interpretable Training of ReLU-MLPs for Boolean Tasks with Guaranteed Truth-Table Generalization
As compute scales, models evolve, and training algorithms advance, our ability to explain the increasingly powerful AI systems they enable is eroding. To help safeguard interpretability, we introduce a specialized training algorithm (MACCHIATO) that jointly constructs (i) an explicitly structured $\
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
- Autonomous Assessment of Generalizability of AI Agent Capabilities#1110150
- Knowing When to Critique: Task-Adaptive Metacognitive Regulation for Reliable LLM Reasoning#1118403
- SkillNet: Create, Evaluate, and Connect AI Skills#242879
- Do Reasoning Representations Help Humans Evaluate LLM Outputs?#986647
- Probabilistic scoring lists for interpretable machine learning#164141
Record · ID 1071227
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