Pith. sign in

REVIEW 1 cited by

Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering

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 1711.00108 v2 pith:RG6RVB6C submitted 2017-10-31 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords orderingdeepsharedlayerslearningparallelsoftdifferent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Existing deep multitask learning (MTL) approaches align layers shared between tasks in a parallel ordering. Such an organization significantly constricts the types of shared structure that can be learned. The necessity of parallel ordering for deep MTL is first tested by comparing it with permuted ordering of shared layers. The results indicate that a flexible ordering can enable more effective sharing, thus motivating the development of a soft ordering approach, which learns how shared layers are applied in different ways for different tasks. Deep MTL with soft ordering outperforms parallel ordering methods across a series of domains. These results suggest that the power of deep MTL comes from learning highly general building blocks that can be assembled to meet the demands of each task.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Towards Anytime Retrieval: A Benchmark for Anytime Person Re-Identification

    cs.CV 2025-09 conditional novelty 6.0 of 10

    AT-USTC, a 403k-image RGB/IR dataset covering six time-based ReID scenarios, and Uni-AT, a multi-scenario model, are proposed, with Uni-AT achieving 55.8% any-time Rank-1 on the new benchmark.

Pith tools