arXiv (All)
open access
Neural networks as decision trees: an analytical solution for learning and neural selectivity
Nonlinear neural networks develop structured internal representations, yet how their geometry is determined by the tasks being learned remains poorly understood. Here, we develop an analytical framework for piecewise-linear feedforward and recurrent networks that links learning, activation-region st
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
- Decision Titan: Test-Time Training for Long-Term Memory in Offline Reinforcement Learning#1156785
- Does Learning Recurrent Networks Matter in Partially Observable RL?#1297549
- On the Number of Observation Nodes in Recurrent Neural Networks with Linear Threshold and ReLU Functions#798288
- On the Number of Observation Nodes in Recurrent Neural Networks with Linear Threshold and ReLU Functions#796875
- From Causal Graphs to Markovian States: Multi-Order State Exposure for Deep RL#1354900
Record · ID 1217963
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