arXiv (All)
open access
Task-Directed Residual AddUNet:Perfect-Reconstruction Routing for Full-Rate Representations
This paper establishes a perfect-reconstruction (PR) interpretation of AddUNet and its full-rate realization, and introduces a Residual Full-Rate PR architecture for task-directed representation learning. The survivor--skip structure of a constrained additive U-Net is shown to be exactly equivalent
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
- HiRAE: Hierarchical Representation Autoencoding with Residual Budgets#1142084
- Contrastive Representation Shaping for LLM Unlearning#1142612
- DRDN: Decoupled Representation Dynamic Network for From-Scratch ViT Class-Incremental Learning#1056362
- Rethinking the Information Bottleneck: Structured Decomposition under Label-Induced Partitions#1156110
- Versioned Late Materialization for Ultra-Long Sequence Training in Recommendation Systems at Scale#141577
Record · ID 1013703
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