ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2104.03514
  4. Cited By
Low-Complexity Probing via Finding Subnetworks

Low-Complexity Probing via Finding Subnetworks

North American Chapter of the Association for Computational Linguistics (NAACL), 2021
8 April 2021
Steven Cao
Victor Sanh
Alexander M. Rush
ArXiv (abs)PDFHTML

Papers citing "Low-Complexity Probing via Finding Subnetworks"

3 / 53 papers shown
PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition
PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech RecognitionNeural Information Processing Systems (NeurIPS), 2021
Cheng-I Jeff Lai
Yang Zhang
Alexander H. Liu
Shiyu Chang
Yi-Lun Liao
Yung-Sung Chuang
Kaizhi Qian
Sameer Khurana
David D. Cox
James R. Glass
VLM
305
86
0
10 Jun 2021
Probing Classifiers: Promises, Shortcomings, and Advances
Probing Classifiers: Promises, Shortcomings, and AdvancesInternational Conference on Computational Logic (ICCL), 2021
Yonatan Belinkov
767
600
0
24 Feb 2021
Parameter-Efficient Transfer Learning with Diff Pruning
Parameter-Efficient Transfer Learning with Diff PruningAnnual Meeting of the Association for Computational Linguistics (ACL), 2020
Demi Guo
Alexander M. Rush
Yoon Kim
331
472
0
14 Dec 2020
Previous
12
Page 2 of 2