atlas

Research map / Learning theory and algorithms / Sample complexity

Improved Active Multi-Task Representation Learning via Lasso

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: PAC learnability theory · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace L2-regularized relevance (L2-A-MTRL) sampling with L1-regularized relevance (L1-A-MTRL) samplingactive multi-task representation learning on MNIST-C · MNIST-C full task scenario (linear head, regression loss)average accuracy: +0.54%Helped
Restrict sampling to at most 10 source tasks (sparse k-task selection) with L1-A-MTRL instead of uniform samplingL1-A-MTRL on MNIST-C · MNIST-C k-task selection scenario (ConvNet representation)average accuracy: +2.2% over uniform samplingHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy