arXiv (All)
open access
Representational Simplicity and Circuit Size Dissociate in a Threshold-Dependent Way: A Controlled Test via Adversarial Training
Sparse-autoencoder decomposability and concentrated feature attribution are increasingly treated as evidence that a model's computation is easier to reverse-engineer. Whether this representational and attributional cleanliness actually predicts a smaller or more tractable causal circuit remains an o
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
- Neither Adversarial Training Nor Purification: Emergent Adversarial Robustness from Oscillatory Predictive Learning#986014
- Small-Perturbation Adversarial Example Detection via Proactive Decision Boundary Bending#387395
- From Detection to Refusal: Safer LLMs via Circuit-Guided Weight Scaling#819535
- From Detection to Refusal: Safer LLMs via Circuit-Guided Weight Scaling#809539
- Sparse Autoencoders Reveal Interpretable Features in Single-Cell Foundation Models#369713
Record · ID 1130732
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