Pith. sign in

REVIEW 2 cited by

TokenUnify: Scaling Up Autoregressive Pretraining for Neuron Segmentation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.16847 v2 pith:4GFYY2A6 submitted 2024-05-27 cs.CV cs.AI

classification cs.CVcs.AI
keywords tokenunifyautoregressivedatamodelsneuronpredictionpretrainingsegmentation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neuron segmentation from electron microscopy (EM) volumes is crucial for understanding brain circuits, yet the complex neuronal structures in high-resolution EM images present significant challenges. EM data exhibits unique characteristics including high noise levels, anisotropic voxel dimensions, and ultra-long spatial dependencies that make traditional vision models inadequate. Inspired by autoregressive pretraining in language models, we propose TokenUnify, a hierarchical predictive coding framework that captures multi-scale dependencies through three complementary learning objectives. TokenUnify integrates random token prediction, next-token prediction, and next-all token prediction to create a comprehensive representational space with emergent properties. From an information-theoretic perspective, these three tasks are complementary and provide optimal coverage of visual data structure, with our approach reducing autoregressive error accumulation from O(K) to O(sqrt(K)) for sequences of length K. We also introduce a large-scale EM dataset with 1.2 billion annotated voxels, offering ideal long-sequence visual data with spatial continuity. Leveraging the Mamba architecture's linear-time sequence modeling capabilities, TokenUnify achieves a 44% performance improvement on downstream neuron segmentation and outperforms MAE by 25%. Our approach demonstrates superior scaling properties as model size increases, effectively bridging the gap between pretraining strategies for language and vision models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dual form Complementary Masking for Domain-Adaptive Image Segmentation

    cs.CV 2025-07 reject novelty 5.0 of 10

    The paper proposes complementary masking consistency for UDA segmentation and reports empirical gains, but its theoretical proof contains a direct internal contradiction.

  2. Conditional Latent Coding with Learnable Synthesized Reference for Deep Image Compression

    cs.CV 2025-02 conditional novelty 5.0 of 10

    Conditional Latent Coding compresses images by synthesizing a per-image reference latent from a learned feature dictionary, improving low-bitrate rate-distortion over TCM, VTM, and BPG.

Pith tools