paper
Task Decomposition for Efficient Annotation
paperactiveprovisional
task-decomposition-for-efficient-annotation-f3768cd3·1 events·first seen 6d agoAliases: Task Decomposition for Efficient Annotation
Co-occurring entities
More like this (12)
Task Decomposition Hierarchical Analysis FrameworkIterative Skill-Aware DecompositionInter-Annotator Agreementhuman-LLM collaborative annotationMap-Reduce DecompositionCross-Annotator Preference Optimization (CAPO)Block-Compositional Caption Supervisionannotator disagreementDivide-and-Conquer PartitioningTrace Only What You Need: Structure-Aware On-Demand Hypergraph Memory for Long-Document Question AnsweringContext-Aware Distillation and Ablation for Text2DSLArtificial Analysis Text to Image
Recent events (1)
Task decomposition framework for reducing inferential load in structured annotation
A new arXiv preprint proposes decomposing complex structured annotation tasks into sub-tasks to reduce aggregate inferential load across heterogeneous annotator pools that mix human experts and models. The authors introduce a formal model of inferential load grounded in centering theory, using 'centers' (salient anchor entities) to constrain output space complexity. They provide decomposition guidelines and a budget-aware sub-task allocation procedure, with cost-efficiency gains demonstrated from prior work.