TL;DR
This paper introduces Flash-SemiCRF, a memory-efficient method for exact semi-Markov CRF inference on long sequences, enabling scalable segment-level labeling with principled uncertainty estimates.
Contribution
It replaces large edge potential tensors with on-the-fly prefix-sum evaluations and employs streaming algorithms to handle long sequences efficiently.
Findings
Reduces memory footprint by replacing edge tensors with prefix-sum lookup.
Enables exact inference on sequences exceeding 100,000 positions.
Provides a GPU-accelerated implementation with sublinear memory usage.
Abstract
Semi-Markov Conditional Random Fields (semi-CRFs) assign labels to segments of a sequence rather than to individual positions, enabling exact inference over segment-level features and principled uncertainty estimates at their boundaries. However, existing implementations must materialize a large edge potential tensor whose size grows with sequence length, maximum segment length, and label count, becoming prohibitive for speech-scale state spaces and intractable at genomic scales where sequences can exceed 100,000 positions. This memory bottleneck has limited the adoption of exact segment-level inference for long sequences and large label sets. We identify that the core inefficiency is materializing edge potentials that can instead be evaluated on-the-fly from a compact prefix-sum array, and make several improvements. First, replacing the stored edge tensor with prefix-sum lookup reduces…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
