REVIEW 3 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
Signed reviews
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.
Forward citations
Cited by 3 Pith papers
-
Learning in Deep Networks under Dale's Constraint
An on-off two-channel network with fixed-sign synapses and local Hebbian learning is claimed to recover backpropagation exactly under symmetric weights and to beat comparable vanilla networks on Tiny ImageNet.
-
Towards Anytime Retrieval: A Benchmark for Anytime Person Re-Identification
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.
-
Feature Partitioning for Efficient Multi-Task Architectures
A channel-level feature-partitioning search space with a distillation proxy lets multi-task architecture search quickly find efficient sharing patterns.
Discussion (0). Continue with ORCID to comment.