{"as_of":"2026-08-15T15:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7906c0d0c2da8d4f9efc935b74bc1d919802cb0138c7ee040c09e4083ed5fa59","coverage":[{"denominator":100,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:35:47.079331Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.12115/citation-record","integrity":"/paper/2501.12115/integrity","json":"/paper/2501.12115/citation-record.json","paper":"/paper/2501.12115"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:45.971618Z","title":"Learning to learn by gradient descent by gradient descent","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:45.971618Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:09d38dc1d4b5f4a7b5835bc427b3126ca5d3e9d51bd10bd28173176f01d17df3","observation_id":"a5501b37-11b3-4f3f-9bdf-89d65010107c","resolution":{"observed_at":"2026-08-10T17:35:45.971618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:45.981513Z","title":"Multi-task feature learning","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:45.981513Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:feb6890f99e8955cc8e412ef698b6618ad4d233bfcdedf1f5e9193fed4fe983d","observation_id":"d486b4e4-e7eb-4846-adb5-9fac7b259e2b","resolution":{"observed_at":"2026-08-10T17:35:45.981513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:45.997939Z","title":"Optimization with sparsity-inducing penalties","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:45.997939Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a9854d0b85d53d9912a2935c60bd276e8a6519532ed9e64270337e0e57957374","observation_id":"4d3f9188-c2ac-4119-a774-704c8111ce9f","resolution":{"observed_at":"2026-08-10T17:35:45.997939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.007251Z","title":"Meta-learning with adaptive hyperparameters","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.007251Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:f6b01e7b6bc93cbe137d3ad7e4c8515cd6a4e5c311c7fe223a95d403717d080a","observation_id":"d0e8a0e6-dc8b-4703-8f6b-2118393c36c4","resolution":{"observed_at":"2026-08-10T17:35:46.007251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.014768Z","title":"Theoretical models of learning to learn","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.014768Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:d9c1a4d1930df8b78de62ebcd400eee78b8dbc3ce3084e95383eba7734528550","observation_id":"f500c83e-6517-4497-a847-791af7ae1049","resolution":{"observed_at":"2026-08-10T17:35:46.014768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.023228Z","title":"Meta learning via learned loss","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.023228Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:d4ebfe27eaee9f4feb01bda3969b4a3e135d4c912f99230d1106782507cd659e","observation_id":"955d7226-facc-475b-a9cf-61a31b33c9d8","resolution":{"observed_at":"2026-08-10T17:35:46.023228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1991.15562","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.756361Z","title":"Bengio, S","venue":null,"work_id":"bbc1805c-a6a3-46af-a08d-daf676dc90f7","year":1991},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.038617Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a2451d44e8c50ef31c7d49334045fdef6dcdb066b00254d916293eb1db53e1cc","observation_id":"76f6c6e5-d761-4a38-a689-4456a27c035a","resolution":{"observed_at":"2026-08-10T17:35:48.766357Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.053508Z","title":"What is the state of neural network pruning? Proceedings of machine learning and systems, 2: 0 129--146, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.053508Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4705422452b9f2681246c66cc4a99a4cb0fa7a86c985c2a800cf0f243af87111","observation_id":"0b1b94be-1077-4470-a906-1151169ada58","resolution":{"observed_at":"2026-08-10T17:35:46.053508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.059775Z","title":"Evograd: Efficient gradient-based meta-learning and hyperparameter optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.059775Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:03288f867f46441fc5c2c588cc6706b93854599413f43433527498cdb623fbe9","observation_id":"38cc9345-abcc-4244-8522-b327252f1941","resolution":{"observed_at":"2026-08-10T17:35:46.059775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.070903Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.070903Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:44d74f788c4ea182fb2e3e7393fa91c36965ea106d45e54eee2830c6fcc7b3e4","observation_id":"0299793a-a5d0-46bb-9bba-e2491b09af16","resolution":{"observed_at":"2026-08-10T17:35:46.070903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.00890","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.664560Z","title":"learning-compression","venue":null,"work_id":"b6d5a4ae-fa3b-425b-84d9-5e5b4db54952","year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.078333Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:cbc748dbcea1a8275ea9d6a9367941ae2def83b711c56a589f3757275450baf9","observation_id":"a123e2d8-da70-4ebf-ae96-6d36571df79c","resolution":{"observed_at":"2026-08-10T17:35:48.672716Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.085433Z","title":"Multitask learning","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.085433Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1019f26968bbd8b3fd75e31d00c6d113fbb325c718aaa3e41978abde17075b00","observation_id":"128c7dbc-d6f2-46d6-a9d7-0b8efaf68a63","resolution":{"observed_at":"2026-08-10T17:35:46.085433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.092165Z","title":"A convex formulation for learning shared structures from multiple tasks","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.092165Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a74907ff2f9393905b99b8d5c3d088dc4a5058f95edad6f35ff1fc2a268bb230","observation_id":"7e6c1cef-04f7-470c-91bc-66e95cad81a6","resolution":{"observed_at":"2026-08-10T17:35:46.092165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.05587","last_updated":"2017-12-05T18:06:21Z","snapshot_observed_at":"2026-08-07T13:44:53.690521Z","submitted_at":"2017-06-17T22:48:57Z","title":"Rethinking Atrous Convolution for Semantic Image Segmentation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05587","snapshot_observed_at":"2026-08-10T17:35:46.098571Z","title":"Rethinking atrous convolution for semantic image segmentation, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.098571Z"},"links":{"cited_paper":"/paper/1706.05587","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:73a5754e9cbcbf453d48d002ed81739a36dbc0585f38a589765c2cb30b13e3cb","observation_id":"f0735859-352e-4012-acf4-c4dc7398121a","resolution":{"observed_at":"2026-08-10T17:35:46.098571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.106232Z","title":"Metalr: Meta-tuning of learning rates for transfer learning in medical imaging","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.106232Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:161a2433d41c0dfda2d804461b8c5c663ebeaab11bfc6830adba638b61eafc11","observation_id":"08ea65b5-ee92-4c51-b2c5-3846c1268c34","resolution":{"observed_at":"2026-08-10T17:35:46.106232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.112001Z","title":"Signal recovery by proximal forward-backward splitting","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.112001Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:74bb6a3acd35ee902bdd08334240aebc3038a6f153b11bd40711968513a80207","observation_id":"0d957536-3ebd-49f2-bdb1-39cd03575933","resolution":{"observed_at":"2026-08-10T17:35:46.112001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.09796","last_updated":"2020-09-10T19:31:04Z","snapshot_observed_at":"2026-08-09T08:30:49.737024Z","submitted_at":"2020-09-10T19:31:04Z","title":"Multi-Task Learning with Deep Neural Networks: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.09796","snapshot_observed_at":"2026-08-10T17:35:46.120525Z","title":"Multi-task learning with deep neural networks: A survey","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.120525Z"},"links":{"cited_paper":"/paper/2009.09796","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:364bb93f85ea47f4ac838096f27a70d265edddea169998840064503b66634812","observation_id":"715e2960-90fb-4b40-821e-009d0cc46d34","resolution":{"observed_at":"2026-08-10T17:35:46.120525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.03869","last_updated":"2023-01-05T15:44:31Z","snapshot_observed_at":"2026-08-13T20:18:21.295892Z","submitted_at":"2021-02-07T18:06:23Z","title":"Structured Sparsity Inducing Adaptive Optimizers for Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.03869","snapshot_observed_at":"2026-08-10T17:35:46.128312Z","title":"Structured sparsity inducing adaptive optimizers for deep learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.128312Z"},"links":{"cited_paper":"/paper/2102.03869","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:b5878c8c2e2448dfbebb4326ece434b7695410e650dadb063bb181240a70477d","observation_id":"0374493a-2575-4fe4-87de-41aea308133c","resolution":{"observed_at":"2026-08-10T17:35:46.128312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.29764","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.345172Z","title":"Model compression and hardware acceleration for neural networks: A comprehensive survey","venue":null,"work_id":"3e3685a4-8878-4824-97f6-b373ad7b67f4","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.146018Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a5f6324b52f16e75b26d275917cb01975e303f5f191a014777c4c52bb816a0f2","observation_id":"bf015dc3-3e89-406f-ae79-c3efc6c32188","resolution":{"observed_at":"2026-08-10T17:35:48.356903Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11611","last_updated":"2023-10-17T22:08:01Z","snapshot_observed_at":"2026-08-14T23:40:12.653361Z","submitted_at":"2023-10-17T22:08:01Z","title":"In defense of parameter sharing for model-compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11611","snapshot_observed_at":"2026-08-10T17:35:46.155869Z","title":"In defense of parameter sharing for model-compression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.155869Z"},"links":{"cited_paper":"/paper/2310.11611","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:04d957775316995375217271cbdaab6b99627cf0b8358c73f96535d9bb9cf9b1","observation_id":"486df19c-f9a3-444e-9994-84207b81f30e","resolution":{"observed_at":"2026-08-10T17:35:46.155869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04840","last_updated":"2019-08-23T18:30:16Z","snapshot_observed_at":"2026-08-14T21:54:21.093715Z","submitted_at":"2019-07-10T17:40:20Z","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04840","snapshot_observed_at":"2026-08-10T17:35:46.162929Z","title":"Sparse networks from scratch: Faster training without losing performance","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.162929Z"},"links":{"cited_paper":"/paper/1907.04840","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:67862eb9a4fd7290b17c8957faf98c9e2e3ce760b0938a73104a10218e1bd6db","observation_id":"313e0097-fb47-4a5f-a9c5-94426ccf93ef","resolution":{"observed_at":"2026-08-10T17:35:46.162929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.173320Z","title":"Learning to learn by jointly optimizing neural architecture and weights","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.173320Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:ff8be67f4450694623b7b4c425d04e878c271ad80bbdf1c738f999c2f1f8a8e1","observation_id":"9b689112-4639-464c-ab79-711d1fb7a76d","resolution":{"observed_at":"2026-08-10T17:35:46.173320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.181986Z","title":"Neural architecture search: A survey","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.181986Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:78046a51a6aa63530969e2cf3776ffca331372834ae0d6b6186c3321593a3a71","observation_id":"6d27601d-c64e-4100-aeba-59bedc9be097","resolution":{"observed_at":"2026-08-10T17:35:46.181986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.188252Z","title":"Meta-learning of neural architectures for few-shot learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.188252Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:b89c5714d2da0bf7fa342e2b100feeb0e896b5020ad4551d8b580790bb0a46d4","observation_id":"51bedce8-bd43-4b1f-9db8-f176d0c6de22","resolution":{"observed_at":"2026-08-10T17:35:46.188252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.199005Z","title":"Rigging the lottery: Making all tickets winners","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.199005Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1dc338c93a308b29370cd004fb40c233cb5aa7a48b14354b8a640a536f6a6ca2","observation_id":"8bf25e6b-b28e-41cd-a32d-4c0a298d3587","resolution":{"observed_at":"2026-08-10T17:35:46.199005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.206007Z","title":"Model-agnostic meta-learning for fast adaptation of deep networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.206007Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:90ac75ed45d2ca9c6343667be1d83facca40698e3580153be8d4afbac73b071a","observation_id":"a6862044-44c8-4043-9992-f2dfed85ede5","resolution":{"observed_at":"2026-08-10T17:35:46.206007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.214606Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.214606Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:c205c242045957ab0850677f8ff7649f5ec579678791b07cc8da1a44ff38b105","observation_id":"f6a89aab-4752-4bd7-b084-6e82ab5173ed","resolution":{"observed_at":"2026-08-10T17:35:46.214606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.220727Z","title":"The lottery ticket hypothesis: Finding sparse, trainable neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.220727Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e5f47893bea6788e51184726ae81cd4319eb072a0ea79af61c4552b2db1e8297","observation_id":"063261ee-56fb-4261-9294-0987a9e81574","resolution":{"observed_at":"2026-08-10T17:35:46.220727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.09574","last_updated":"2019-02-25T19:18:40Z","snapshot_observed_at":"2026-08-15T00:50:07.769538Z","submitted_at":"2019-02-25T19:18:40Z","title":"The State of Sparsity in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.09574","snapshot_observed_at":"2026-08-10T17:35:46.237458Z","title":"The state of sparsity in deep neural networks","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.237458Z"},"links":{"cited_paper":"/paper/1902.09574","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:af1c16a08b39d67da9994d1aebc0d8c23980aed94227bb38249dc09be64e08c2","observation_id":"ddcde12d-6cfd-4def-975b-995732b15bdb","resolution":{"observed_at":"2026-08-10T17:35:46.237458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.248840Z","title":"Searching for robustness: Loss learning for noisy classification tasks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.248840Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:981e2726c0273bb39d016ec02037bedf011ecc4e3eb4e2c0bfdaacc1b87a89c0","observation_id":"dd6e6939-b6ca-4e7a-b93e-157938e12e07","resolution":{"observed_at":"2026-08-10T17:35:46.248840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02711","last_updated":"2022-03-05T11:41:13Z","snapshot_observed_at":"2026-08-15T12:09:21.691214Z","submitted_at":"2022-03-05T11:41:13Z","title":"Meta Mirror Descent: Optimiser Learning for Fast Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02711","snapshot_observed_at":"2026-08-10T17:35:46.255291Z","title":"Meta mirror descent: Optimiser learning for fast convergence","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.255291Z"},"links":{"cited_paper":"/paper/2203.02711","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4013323368b7a922253358381c05ac57b95eea62f6ea980125cdd724e346cbeb","observation_id":"2e51fcfe-df6d-4316-8917-56b6b481fa62","resolution":{"observed_at":"2026-08-10T17:35:46.255291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.958061Z","title":"Loss function learning for domain generalization by implicit gradient","venue":null,"work_id":"d7728516-530a-4e70-a66f-400ef24cd53c","year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.262580Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:50697e36a7dab356d93df3341173123abc9cf454c8b9bdfe9e115493e580bf1a","observation_id":"38fb3a02-b716-4d68-bce6-f5b5577f133a","resolution":{"observed_at":"2026-08-10T17:35:49.966273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.935611Z","title":"Understanding the difficulty of training deep feedforward neural networks","venue":null,"work_id":"0d85c8cf-4a06-4524-a9b6-79fb8331bf2e","year":2010},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.268774Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:f98be6b2f8836ee1eff69d6708aa8f474276bed560526962e32c83678762aeda","observation_id":"1f78339a-71d6-4311-9f61-6fd54f7d1efe","resolution":{"observed_at":"2026-08-10T17:35:49.942453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.911533Z","title":"Gon c alves, Fernando J","venue":null,"work_id":"ce8e047f-04d6-4030-9806-62bb90135281","year":2016},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.275714Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:86af3fdb122ce24801ba8b5b958171551dedf2bf2a6be247d9cbe304681ff913","observation_id":"96ee0780-707a-43de-807e-2fd1a9f961f0","resolution":{"observed_at":"2026-08-10T17:35:49.918102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.892393Z","title":"Deep Learning","venue":null,"work_id":"6f0ab903-bcc9-44a8-930c-75c7e10a6b95","year":2016},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.281045Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:925c1d2210da2bfdbc4ce8c838804445405a5634340cfbd96ecdd8da468d100a","observation_id":"97015cf5-aec3-461d-9445-11edfb3bb461","resolution":{"observed_at":"2026-08-10T17:35:49.898760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.286331Z","title":"Learning both weights and connections for efficient neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.286331Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e02152550071a4d5a5eb3b85ab24657bdfed2738c8ecbad17a5000099d0299ea","observation_id":"e082c71d-fea7-4e8e-aeb3-7a3a84cdd868","resolution":{"observed_at":"2026-08-10T17:35:46.286331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.839780Z","title":"A closer look at learned optimization: Stability, robustness, and inductive biases","venue":null,"work_id":"f4a0a20a-b8ad-432a-b5c3-868d3bb99003","year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.293299Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4fc72263a8b27a420cde7dbeabdcbff2328748453acabf6c2e0d48f0445819be","observation_id":"e29d90b9-a5e5-41ba-bf5d-c8cfe45ea59e","resolution":{"observed_at":"2026-08-10T17:35:49.848896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.299009Z","title":"Statistical learning with sparsity: the lasso and generalizations","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.299009Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1d8b673eff5136d164cf9a2cb68627e315e1937ba876ebffa8b7b04dc3ad2fd5","observation_id":"4e34c0b4-c4e2-46e1-a096-f892e64bd521","resolution":{"observed_at":"2026-08-10T17:35:46.299009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-08-14T22:57:08.956233Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-10T17:35:46.304526Z","title":"Distilling the knowledge in a neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.304526Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:7d434ea0be3890cf1281a59f90b940e8d36cd70e70300be0067249b706a40753","observation_id":"e7e922c2-d122-4465-940e-326b748c4e67","resolution":{"observed_at":"2026-08-10T17:35:46.304526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.789499Z","title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","venue":null,"work_id":"ce2dc167-e9be-452c-8062-6e8207c305a9","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.312186Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:bddd8bebb3f4dc8717acda1d69ccaaff1ef7d7e25c8919ea6a0f4e27238d1e3a","observation_id":"82b19305-5016-43d6-8a2a-052f977c737c","resolution":{"observed_at":"2026-08-10T17:35:49.796590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.318977Z","title":"Hospedales, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.318977Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:5fb5b86dd51f18b9c30ee368b6a6965a3808ce27546ccf36ac4d60e89078257a","observation_id":"fe15ffd3-bca4-45b9-afb4-664e8c1c8ba5","resolution":{"observed_at":"2026-08-10T17:35:46.318977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.758551Z","title":"Revisiting single image depth estimation: Toward higher resolution maps with accurate object boundaries","venue":null,"work_id":"e0f003c0-a956-4b94-94ef-24258b016dda","year":2019},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.324940Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a96f9e34cc8c81cad316c534c789b4f13e2c8b62b67c3bcd2b1ace8201d6c64e","observation_id":"04e8e200-7527-4044-9102-5fcfa5b4a3b2","resolution":{"observed_at":"2026-08-10T17:35:49.765355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.737447Z","title":"Neural network pruning","venue":null,"work_id":"8ed4bf04-cbad-4a9c-92bf-bdac380d279b","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.334336Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e12f7d5c197a86ac7cb7c6a2d2653ec60426a33947e8bb92c84f97deefe855b3","observation_id":"8cea7d69-3c5c-47c1-a6d6-7322d17c4d74","resolution":{"observed_at":"2026-08-10T17:35:49.744479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.707887Z","title":"A survey of deep meta-learning","venue":null,"work_id":"b8109b42-a8e7-4270-aa8c-ddfc55f26702","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.342340Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e1f4a962c538020610f2978c326e369c32ed9ad53460c973b85b46aeaadde644","observation_id":"84edbc99-194c-4708-85e2-b2955c7e495b","resolution":{"observed_at":"2026-08-10T17:35:49.718702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.39.6600","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:47.140376Z","title":"Janowsky","venue":null,"work_id":"30a07284-c7b1-4f96-83fa-939351e68371","year":1989},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.349789Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:724dbe014d08936345e5c8bb0b3b0fb330eec165ea60aaba409e79ab88dd1237","observation_id":"53bcd990-fb01-4ade-8adb-345773240117","resolution":{"observed_at":"2026-08-10T17:35:47.148303Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.685892Z","title":"Multi-task learning using uncertainty to weigh losses for scene geometry and semantics","venue":null,"work_id":"24616fb6-5178-4e47-addb-69a75a7a2ef1","year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.356071Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:ffe1ef1195ca13edc5e6cac57a150eb3779f9e612040f3e7442abea5fa347ed9","observation_id":"b11b92d5-979c-4570-9d8f-bdb773868c61","resolution":{"observed_at":"2026-08-10T17:35:49.691919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.04886","last_updated":"2017-09-15T02:03:26Z","snapshot_observed_at":"2026-08-15T13:54:39.591606Z","submitted_at":"2017-05-13T21:16:13Z","title":"Learning task structure via sparsity grouped multitask learning","version":2},"cited_work":{"arxiv_id":"1705.04886","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.04886","snapshot_observed_at":"2026-08-10T17:35:48.050947Z","title":"Learning task structure via sparsity grouped multitask learning","venue":"stat.ML","work_id":"ee24408f-1e44-4a81-9716-202071a01c96","year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.362065Z"},"links":{"cited_paper":"/paper/1705.04886","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:80dd5658d8d34929a557857371d0f41a9d0a8806cf9a72535af64ef7f0dff46e","observation_id":"313e9252-3ac5-4fc0-b208-01655e15f204","resolution":{"observed_at":"2026-08-10T17:35:48.058203Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.666414Z","title":"Soft threshold weight reparameterization for learnable sparsity","venue":null,"work_id":"0efd8831-44e7-4529-9b1c-f83cce0192b6","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.372442Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4370e89847afc004a37e10d9a48fea9433259065a171def41bf5128deb12ffb2","observation_id":"4e804674-9fac-4df2-be2a-a69226b7b558","resolution":{"observed_at":"2026-08-10T17:35:49.672711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.643594Z","title":"Maskgan: Towards diverse and interactive facial image manipulation","venue":null,"work_id":"58cfd7ad-ca86-4879-a6aa-af8eb57c41d7","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.380351Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:fe198e5279bb35442ab2633430a2ccdc722409d616ec1c4ba289dd33d6fa8fdc","observation_id":"4e532850-b7cf-4c80-9d7c-95541764bd70","resolution":{"observed_at":"2026-08-10T17:35:49.651550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.613293Z","title":"Layer-adaptive sparsity for the magnitude-based pruning","venue":null,"work_id":"f2789d10-de48-46fc-b9ff-b77b9c05d8bf","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.389474Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1de9ae951d5419605ef0dbc38356b24a59c3522d661bbb1d7a67acac6d7884e4","observation_id":"2a225eea-6109-459c-b6ee-6df208c9a857","resolution":{"observed_at":"2026-08-10T17:35:49.625736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00441","last_updated":"2017-11-30T18:59:01Z","snapshot_observed_at":"2026-08-14T21:14:03.193111Z","submitted_at":"2017-03-01T18:52:23Z","title":"Learning to Optimize Neural Nets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00441","snapshot_observed_at":"2026-08-10T17:35:46.399009Z","title":"Learning to optimize neural nets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.399009Z"},"links":{"cited_paper":"/paper/1703.00441","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:2608477ed8f13f14acb26e1533b2b901a8c8163d26e0764a4e026768fe2cd406","observation_id":"ce83794c-4505-46c0-a53a-f987f6f4552a","resolution":{"observed_at":"2026-08-10T17:35:46.399009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.09835","last_updated":"2017-09-28T15:59:41Z","snapshot_observed_at":"2026-08-14T20:44:16.339472Z","submitted_at":"2017-07-31T13:08:11Z","title":"Meta-SGD: Learning to Learn Quickly for Few-Shot Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.09835","snapshot_observed_at":"2026-08-10T17:35:46.404773Z","title":"Meta-sgd: Learning to learn quickly for few-shot learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.404773Z"},"links":{"cited_paper":"/paper/1707.09835","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:6cc1cca52b054c1152e00b0d7d93ee71fa07b6ae8f4241ef265fa84bcf86ebc0","observation_id":"ce39489b-ce26-4a82-86ef-88e9ecbff95f","resolution":{"observed_at":"2026-08-10T17:35:46.404773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.590250Z","title":"Towards fast adaptation of neural architectures with meta learning","venue":null,"work_id":"89b280b1-9532-431b-87b4-86634325f044","year":2019},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.412555Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:b2e770f15e1ca5a53fe2a28d61e06698a7c2ce8a8cca617e823d51a5e943d42c","observation_id":"516b0f6d-aacc-4373-9c17-154870620a61","resolution":{"observed_at":"2026-08-10T17:35:49.597845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.06334","last_updated":"2018-05-17T16:12:16Z","snapshot_observed_at":"2026-08-14T19:14:39.502319Z","submitted_at":"2018-05-16T13:59:20Z","title":"Auxiliary Tasks in Multi-task Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.06334","snapshot_observed_at":"2026-08-10T17:35:46.418558Z","title":"Auxiliary tasks in multi-task learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.418558Z"},"links":{"cited_paper":"/paper/1805.06334","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:da846054313ee1a4bbfd1409e5b61cdd01f2b6362bfb8f54a62eef3acbad4b77","observation_id":"9b51486e-fce1-4ed0-ae56-cf8f509dd7fd","resolution":{"observed_at":"2026-08-10T17:35:46.418558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.565424Z","title":"sparseland","venue":null,"work_id":"47f62869-de0b-4aa0-a734-a71bdd008741","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.428166Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:afeaa2055bdb490bd0dac4da9a770bfe78d6ec8c664f2ca5f88789d145c84b92","observation_id":"175be6e5-34da-441f-8646-7ce2264d894e","resolution":{"observed_at":"2026-08-10T17:35:49.573763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.440752Z","title":"Learning efficient convolutional networks through network slimming","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.440752Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:86fbe216c563a5b1e51060d917dc3a9cf82178dc2d261a5a6de87cd8d33eb513","observation_id":"878019d0-5cec-4dd5-8d87-a3eb53b81443","resolution":{"observed_at":"2026-08-10T17:35:46.440752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05270","last_updated":"2019-03-05T05:58:11Z","snapshot_observed_at":"2026-08-14T18:15:55.919265Z","submitted_at":"2018-10-11T22:15:28Z","title":"Rethinking the Value of Network Pruning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05270","snapshot_observed_at":"2026-08-10T17:35:46.449770Z","title":"Rethinking the value of network pruning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.449770Z"},"links":{"cited_paper":"/paper/1810.05270","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a1d9bec91f7563966f592a86f53175cad7561cc6fee4bb7a79dab8769303ab2d","observation_id":"c723d388-2245-4615-baec-5a4547645e30","resolution":{"observed_at":"2026-08-10T17:35:46.449770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.518015Z","title":"Learning gradient descent: Better generalization and longer horizons","venue":null,"work_id":"8102a743-0d34-40b9-bde6-b1c7223e55f8","year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.457421Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:efc808075edb6be0984c3ac68012d877e93375ebff7bca93f70e692b522d8f08","observation_id":"2cb1b7ec-a4cc-4efc-b44d-08b4c3361694","resolution":{"observed_at":"2026-08-10T17:35:49.529860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.485567Z","title":"Pruning filter in filter","venue":null,"work_id":"1d116a28-9a77-41f2-bdb8-8ebf2e1f78b4","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.464232Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e7bbc0f19cf0f4f1bfeb9da9f0ec465ebe7a787bfa103544b86e7bc52dcc24d0","observation_id":"1836e164-72df-4bac-9aa9-71271fbd9f9f","resolution":{"observed_at":"2026-08-10T17:35:49.496895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11243","last_updated":"2020-09-23T16:35:09Z","snapshot_observed_at":"2026-08-14T04:10:37.267605Z","submitted_at":"2020-09-23T16:35:09Z","title":"Tasks, stability, architecture, and compute: Training more effective learned optimizers, and using them to train themselves","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11243","snapshot_observed_at":"2026-08-10T17:35:46.475611Z","title":"Tasks, stability, architecture, and compute: Training more effective learned optimizers, and using them to train themselves","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.475611Z"},"links":{"cited_paper":"/paper/2009.11243","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:35533109d26935a40ae231f18ee46357ed3f7dd110e9ab1ec2a453b68e3fb7a9","observation_id":"cd516bb9-96a0-47d6-9402-4d43cbb745bc","resolution":{"observed_at":"2026-08-10T17:35:46.475611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09760","last_updated":"2022-11-17T18:39:07Z","snapshot_observed_at":"2026-08-13T13:40:11.559725Z","submitted_at":"2022-11-17T18:39:07Z","title":"VeLO: Training Versatile Learned Optimizers by Scaling Up","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.09760","snapshot_observed_at":"2026-08-10T17:35:46.484497Z","title":"Velo: Training versatile learned optimizers by scaling up","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.484497Z"},"links":{"cited_paper":"/paper/2211.09760","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:7d26d76a1c108c901881084db2d98ea84c2c85f7c0791cb4d5b42ae13734b1bf","observation_id":"b774d028-b852-4e02-966b-11a54953899f","resolution":{"observed_at":"2026-08-10T17:35:46.484497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.494276Z","title":"Indoor segmentation and support inference from rgbd images","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.494276Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:654588334877ba5f48ce07ff1131904390b57c0b4b16cd8afc8a678b4cbf298c","observation_id":"1985698e-968d-416c-b56a-ba3301432489","resolution":{"observed_at":"2026-08-10T17:35:46.494276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02999","last_updated":"2018-10-22T16:11:14Z","snapshot_observed_at":"2026-08-14T19:38:16.450214Z","submitted_at":"2018-03-08T08:29:38Z","title":"On First-Order Meta-Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.02999","snapshot_observed_at":"2026-08-10T17:35:46.513093Z","title":"On first-order meta-learning algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.513093Z"},"links":{"cited_paper":"/paper/1803.02999","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:d8640d73f9f668198d061537e3ae6931af559b9d722a541fdc8102fbef848c75","observation_id":"09a5c9b1-6460-4bde-a66b-1978e228310d","resolution":{"observed_at":"2026-08-10T17:35:46.513093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.436772Z","title":"Joint covariate selection and joint subspace selection for multiple classification problems","venue":null,"work_id":"0d432d79-b541-44ea-b20d-ea4a6923daab","year":2010},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.525380Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:6ae9a36667a3e6d267ed9b5808a9ecd22a46dcc19f0f08f6e67c07d082f20954","observation_id":"068b1062-29e0-4c07-8f94-01ee729c5d40","resolution":{"observed_at":"2026-08-10T17:35:49.446782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.531804Z","title":"Proximal algorithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.531804Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:233ea1a664aab5c69d0f74d9eaae8ad4653315ac48c2c2b7f2db1b526b1add09","observation_id":"c14e9650-5e8f-4fdf-a911-828e3853902d","resolution":{"observed_at":"2026-08-10T17:35:46.531804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.550673Z","title":"Senthil Kumar","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.550673Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4c5badda57a738cac261cb0009299b0dfd3b796d5a724c9917a3c94ce468cf47","observation_id":"a82e38a8-e95f-44d3-9cab-cb944a53eb3f","resolution":{"observed_at":"2026-08-10T17:35:46.550673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.09157","last_updated":"2020-02-12T15:29:39Z","snapshot_observed_at":"2026-08-09T17:12:58.580827Z","submitted_at":"2019-09-19T16:30:42Z","title":"Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAML","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.09157","snapshot_observed_at":"2026-08-10T17:35:46.565385Z","title":"Rapid learning or feature reuse? towards understanding the effectiveness of maml","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.565385Z"},"links":{"cited_paper":"/paper/1909.09157","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:7343ffb823936765195c6ffed79905e3474c51f9e9cc731acb4c8fbea4bdc61d","observation_id":"259da896-6dd6-4f07-bb7b-0349d946b7d9","resolution":{"observed_at":"2026-08-10T17:35:46.565385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.399283Z","title":"Learning symbolic model-agnostic loss functions via meta-learning","venue":null,"work_id":"350e1cfb-c637-40f3-8f76-8e5583cf5e83","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.572643Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1fc931e9eaa78a3b3ba802594e96d1e69d39eb54f2f461ec14585d7f3a2613c5","observation_id":"fdd22e15-0d57-4cb8-9e96-99bf9709655b","resolution":{"observed_at":"2026-08-10T17:35:49.405153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2301.13247","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:47.722255Z","title":"Online loss function learning","venue":null,"work_id":"8505ca60-72dc-4e14-966a-4fe95644adb5","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.583091Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:10d4b1d521a03c95328a725a3e9881baed27b3f6f7e4dd41cbd172e36834f337","observation_id":"c5c91938-3b79-4ed9-90e3-d1e02a45bae8","resolution":{"observed_at":"2026-08-10T17:35:47.732752Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.376219Z","title":"A comprehensive survey of neural architecture search: Challenges and solutions","venue":null,"work_id":"9903dd61-aed9-4a53-90c8-001d19431d52","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.590763Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:0448e66973855818fd5f16e69e11adba147f989cfc902dcc66b6a454b6b9ee95","observation_id":"feed63eb-6fe1-4b66-88fa-504917e086c5","resolution":{"observed_at":"2026-08-10T17:35:49.384336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.342608Z","title":"Across-task neural architecture search via meta learning","venue":null,"work_id":"7dc2f32e-677a-4400-8f2c-ec282d393132","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.597104Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:ba24d5b37389fcd1dd42eae81c475e6258221b2c001831fd281ee6bc43a7ae51","observation_id":"fb9ffae2-6cfc-489c-a769-4b0b822d83fb","resolution":{"observed_at":"2026-08-10T17:35:49.352752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.833060Z","title":"Low-rank matrix factorization for deep neural network training with high-dimensional output targets","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.833060Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:cb0c6475d265481abad6b35cae51b49bd55cdc228962f52c679794ddad6338e4","observation_id":"7b2128b9-f0a6-449f-8d0b-1db1e6feedd8","resolution":{"observed_at":"2026-08-10T17:35:46.833060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.85870","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:47.612756Z","title":"Towards stochasticity of regularization in deep neural networks","venue":null,"work_id":"1f13e604-3833-4bcd-8f2a-e8d155eba755","year":2018},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.849672Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:4148876cc3153090b84d9257fdd45d7716341e340b10828fb1fb4a587298a5fe","observation_id":"2f79635e-f6bc-4b2c-ba16-7dea9453fb2a","resolution":{"observed_at":"2026-08-10T17:35:47.626376Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.856764Z","title":"Group sparse regularization for deep neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.856764Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:37777ab8d5ef8a0d13e05627207be67c362093f2ec120f16efedae484bf8916d","observation_id":"fab8df72-841e-46b6-9f58-ad913bd1a84d","resolution":{"observed_at":"2026-08-10T17:35:46.856764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.278287Z","title":"Evolutionary principles in self-referential learning","venue":null,"work_id":"0b0f783a-0ef7-4bf8-8cfe-5980f63dc379","year":1987},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.862773Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1e1c24a4c96c26236bbde1040cf68e4c24c70e4b2d53f38dd1bf3a2e665f978f","observation_id":"0036e8d9-2abc-469f-9844-0fb4dcdc158a","resolution":{"observed_at":"2026-08-10T17:35:49.284399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.256392Z","title":"Meta-learning sparse compression networks","venue":null,"work_id":"3adf8b2d-6cea-41de-a026-95ffd52baca4","year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.868302Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:17e45230cf8ab8e6c99265008e90ea6352c9932a3adcf492f482c9fea0b4597f","observation_id":"3505617a-eb6f-4b36-aae8-9b3fcafe9529","resolution":{"observed_at":"2026-08-10T17:35:49.264983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.234750Z","title":"Meta architecture search","venue":null,"work_id":"867fac36-d688-4d8f-a53f-be2ab9d0e213","year":2019},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.875338Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:852749113ae0e32980baa5f6ceb0be3acfab70372c803c15091385947c8d223d","observation_id":"2a30661a-0142-4238-87be-e7ff40d79a01","resolution":{"observed_at":"2026-08-10T17:35:49.241465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.212224Z","title":"Learning a minimax optimizer: A pilot study","venue":null,"work_id":"402fbe53-d878-4b49-8b67-b4931ec4e2a3","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.882270Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:00c3ed55ad7646ce77901485c81816fdeaabf029921fe7bcc93cd425d36f4097","observation_id":"4f3eee3a-9885-4e1b-8a39-9de13f1cb938","resolution":{"observed_at":"2026-08-10T17:35:49.220952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.187568Z","title":"LEARNED LEARNING RATE SCHEDULES FOR DEEP NEURAL NETWORK TRAINING USING REINFORCEMENT LEARNING , 2023","venue":null,"work_id":"083c3d8c-acfd-4891-8f05-aa3d590a806e","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.887917Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:47177242f9e76c9f833398ff3a293f4e12010b9c12679eb576d3b92537e7e837","observation_id":"311a3727-9a7a-4eb5-8462-a3007e598a01","resolution":{"observed_at":"2026-08-10T17:35:49.194446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.165664Z","title":"Learning sparse sharing architectures for multiple tasks","venue":null,"work_id":"526b5d27-c210-4680-ae7c-38727a2522ce","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.894474Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:f5cea5fb99a53ab3dbaeb5202fab518cc9827f326dde12303f6ee7323766a3e3","observation_id":"f85775fc-e675-4b1d-8dd6-a30e3a07a223","resolution":{"observed_at":"2026-08-10T17:35:49.173406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.144316Z","title":"Adashare: Learning what to share for efficient deep multi-task learning","venue":null,"work_id":"615095b2-809f-4160-9d7c-a6489b1b0c79","year":2020},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.903025Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1b00b8edf0a53dfd5b47ab0c8faa9d1e79d92dda8839dc90b67b4e2271b031f2","observation_id":"4be01b0a-c06c-485e-89ff-d00f98461c11","resolution":{"observed_at":"2026-08-10T17:35:49.152239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.124481Z","title":null,"venue":null,"work_id":"acf1fa17-da87-45d6-aaf2-f76a73eb09f5","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.913907Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:703f6707e21eb6e95363cf669ee52ab7beb9cb9bb7592317aa487db9c735bace","observation_id":"cd6d2cc1-ba67-44aa-a62f-56cfde8538cb","resolution":{"observed_at":"2026-08-10T17:35:49.130948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.105160Z","title":"Thrun and L.Y","venue":null,"work_id":"2a52c237-cdad-44d8-918d-f366b2601836","year":1998},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.923301Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:1034eb51ddc839a852dbb02663385299185fe3a1176738d3031d07bfb3ad0aef","observation_id":"1e3ab091-cea5-491d-a5a1-df08120b278f","resolution":{"observed_at":"2026-08-10T17:35:49.110810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.930010Z","title":"Learning to learn","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.930010Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:e36b1e00b20f3d0f624b9ddfd93ebed7acf1388735ecccb640525abb225b0b7c","observation_id":"9b4de533-0bb8-4d92-ace8-64e40595407e","resolution":{"observed_at":"2026-08-10T17:35:46.930010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.067405Z","title":"Meta-learning approaches for learning-to-learn in deep learning: A survey","venue":null,"work_id":"d1f6b4f6-ece6-4640-9152-7279873d819d","year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.939901Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:b5accf79a5e8635589bb3c4b034d533a8765465f74042396c9bbfd9a9de6def0","observation_id":"d4c47114-0f68-4cbc-a96f-4e3b36c30e4f","resolution":{"observed_at":"2026-08-10T17:35:49.074316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.947515Z","title":"Multi-task meta learning: learn how to adapt to unseen tasks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.947515Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:aefd8599fb194bb7c8baf001590f88de3d97d8de32ab826ab4f150ad05862f57","observation_id":"4123d499-20f5-4ab0-b340-db3cf3f20e98","resolution":{"observed_at":"2026-08-10T17:35:46.947515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.037284Z","title":"Less is more towards parsimonious multi-task models using structured sparsity","venue":null,"work_id":"792dcab0-beb0-4b76-90a3-0b419e178477","year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.956078Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:cd339a70e76f8af19617618743db12e39332fc3c4ead6cb7c5b91bf6adc6e88e","observation_id":"9eca7683-04e5-41ba-a6d2-9c79c977df74","resolution":{"observed_at":"2026-08-10T17:35:49.045921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.962538Z","title":"Sharing to learn and learning to share; fitting together meta, multi-task, and transfer learning: A meta review","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.962538Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:6394d312dcf984c7fe45a0acbaed76cbab891c80105d7b6de70dcfd077893fa2","observation_id":"b9b0c907-2cfd-4c2a-ba72-2400ba860aea","resolution":{"observed_at":"2026-08-10T17:35:46.962538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:49.014940Z","title":"Neural pruning via growing regularization","venue":null,"work_id":"309004f3-a974-422c-9985-d4b532b026a2","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.969333Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:cafdaab4ca793311890da7cbe8be3e81e3a284bb7e6c620460b5bf843caadbe1","observation_id":"5868162c-bf86-4cb8-9c87-6864415fd174","resolution":{"observed_at":"2026-08-10T17:35:49.020856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.988331Z","title":"Learning structured sparsity in deep neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.988331Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:c87af9f6feb9ed2996ed091664cb288ebffcaa098c73ac5824e2aa08f3cb7a9b","observation_id":"b57b5a3c-6f2c-4ab5-82e3-c4ba423f4514","resolution":{"observed_at":"2026-08-10T17:35:46.988331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:46.996696Z","title":"Learned optimizers that scale and generalize","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.996696Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:83fae5739c5f3b5998ddf2d4da527a183886adb3524d38863d665807a2c8e2aa","observation_id":"6d7e6a4f-0ef9-430c-bffc-1901ad07209e","resolution":{"observed_at":"2026-08-10T17:35:46.996696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.959858Z","title":"Learning to learn how to learn: Self-adaptive visual navigation using meta-learning","venue":null,"work_id":"c771512d-8718-479b-8448-a5db89d21a37","year":2019},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.002907Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:a176e9c31660d2a642002eb688bab8f307495850e83b4426f06362d154dd90b7","observation_id":"7a912c47-4bcd-440d-8128-ef25ded90e2e","resolution":{"observed_at":"2026-08-10T17:35:48.967397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.935728Z","title":"Learning to schedule learning rate with graph neural networks","venue":null,"work_id":"54e5bb3f-d0c3-4261-ad7f-6909fc40d93c","year":2022},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.010494Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:5f1e56cf30d0bf390b904e74be7bbb75cfef6038cafd3dfa2613ec5baa9a90e5","observation_id":"cabc4718-ada4-490a-862f-9267027ada03","resolution":{"observed_at":"2026-08-10T17:35:48.944643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.908570Z","title":"Dilated residual networks","venue":null,"work_id":"976ba540-6edd-4933-bac7-8bb30d9b7ac2","year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.020602Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:3fa947b4fd22179a62bd5ad0429c61b2102f2854ae649a559e176b6f212748f1","observation_id":"5aafcdc1-fe8e-4112-b7ce-4386d1c3f836","resolution":{"observed_at":"2026-08-10T17:35:48.916181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:47.035104Z","title":"Model Selection and Estimation in Regression with Grouped Variables","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.035104Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:44b02e54a1c43a320b3d096c0914b0522db3c84f8012de8cc9a5bdaa9f4c5b02","observation_id":"5068a2d2-825f-4235-8797-5bc33ad9d5ae","resolution":{"observed_at":"2026-08-10T17:35:47.035104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.879351Z","title":"Two heads are better than one: Boosting graph sparse training via semantic and topological awareness, 2024","venue":null,"work_id":"ab8ed81c-e6e9-4c96-9471-932d1de0a072","year":2024},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.044176Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:5412ccaf88877869ebf1cfd6d5adf9a5b697bf1e0e10dd789f72b6874124c630","observation_id":"32f5d32c-2984-465b-80cd-57577318e54e","resolution":{"observed_at":"2026-08-10T17:35:48.891428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04010","last_updated":"2021-04-18T10:18:00Z","snapshot_observed_at":"2026-08-14T18:17:15.787177Z","submitted_at":"2021-02-08T05:55:47Z","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04010","snapshot_observed_at":"2026-08-10T17:35:47.051917Z","title":"Learning n: m fine-grained structured sparse neural networks from scratch","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.051917Z"},"links":{"cited_paper":"/paper/2102.04010","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:c2a0ec39350d93b22f672a5300f21795f10064a49f3f4385dfee3e2ada958431","observation_id":"aca49ff5-7e9e-4c51-b1c4-77cf7840e904","resolution":{"observed_at":"2026-08-10T17:35:47.051917Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:48.841359Z","title":"Effective sparsification of neural networks with global sparsity constraint","venue":null,"work_id":"4bb0b701-5deb-4220-b056-dfde1e9473fc","year":2021},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.059058Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:884df32105fc906b69906f75d62541319353337e4287bda49bcf80adcb44d3de","observation_id":"a6cf58f5-654d-44a7-858f-c5dfc3b032cf","resolution":{"observed_at":"2026-08-10T17:35:48.849869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.01878","last_updated":"2017-11-13T18:40:16Z","snapshot_observed_at":"2026-08-15T03:14:52.303459Z","submitted_at":"2017-10-05T04:26:49Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.01878","snapshot_observed_at":"2026-08-10T17:35:47.068784Z","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.068784Z"},"links":{"cited_paper":"/paper/1710.01878","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:dff69da2385a45f1c20e5e6eccd3cf4ffba554e8ca9dbbcb1a8eac508b7f66b0","observation_id":"330aaf2f-17be-456c-a66c-c81ecfed5533","resolution":{"observed_at":"2026-08-10T17:35:47.068784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:35:47.079331Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:47.079331Z"},"links":{"citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:bf940af7892a42a534623423b2c937a9256ea176022464359f547f3ca91e2407","observation_id":"ee18222e-58a5-4954-822d-b7c67e26be17","resolution":{"observed_at":"2026-08-10T17:35:47.079331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":56,"verified_exact":4,"verified_fuzzy":37},"total_outbound_references":100},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 100 outbound references and 0 inbound Pith citation observations for arXiv:2501.12115."}