{"list":"other","total":54,"rows":[{"id":"2407.21783","title":"The Llama 3 Herd of Models","created":"2024-07-31","cited_by_count":14715},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"1803.05457","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","created":"2018-03-14","cited_by_count":4886},{"id":"1910.01108","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","created":"2019-10-02","cited_by_count":4307},{"id":"2108.07258","title":"On the Opportunities and Risks of Foundation Models","created":"2021-08-16","cited_by_count":4033},{"id":"2202.05262","title":"Locating and Editing Factual Associations in GPT","created":"2022-02-10","cited_by_count":2691},{"id":"2206.07682","title":"Emergent Abilities of Large Language Models","created":"2022-06-15","cited_by_count":2512},{"id":"1412.6550","title":"FitNets: Hints for Thin Deep Nets","created":"2014-12-19","cited_by_count":1653},{"id":"2409.12186","title":"Qwen2.5-Coder Technical Report","created":"2024-09-18","cited_by_count":1203},{"id":"1909.10351","title":"TinyBERT: Distilling BERT for Natural Language Understanding","created":"2019-09-23","cited_by_count":1167},{"id":"1912.03817","title":"Machine Unlearning","created":"2019-12-09","cited_by_count":1061},{"id":"2209.10652","title":"Toy Models of Superposition","created":"2022-09-21","cited_by_count":971},{"id":"2209.11895","title":"In-context Learning and Induction Heads","created":"2022-09-24","cited_by_count":964},{"id":"2301.05217","title":"Progress measures for grokking via mechanistic interpretability","created":"2023-01-12","cited_by_count":839},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650},{"id":"1712.00409","title":"Deep Learning Scaling is Predictable, Empirically","created":"2017-12-01","cited_by_count":582},{"id":"1608.03665","title":"Learning Structured Sparsity in Deep Neural Networks","created":"2016-08-12","cited_by_count":541},{"id":"2403.03218","title":"The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearning","created":"2024-03-05","cited_by_count":509},{"id":"1908.09355","title":"Patient Knowledge Distillation for BERT Model Compression","created":"2019-08-25","cited_by_count":508},{"id":"2403.19647","title":"Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models","created":"2024-03-28","cited_by_count":435},{"id":"2404.14082","title":"Mechanistic Interpretability for AI Safety -- A Review","created":"2024-04-22","cited_by_count":422},{"id":"2310.06694","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","created":"2023-10-10","cited_by_count":415},{"id":"2005.07683","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","created":"2020-05-15","cited_by_count":403},{"id":"2310.10683","title":"Large Language Model Unlearning","created":"2023-10-14","cited_by_count":302},{"id":"2504.21801","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","created":"2025-04-30","cited_by_count":287},{"id":"2310.20150","title":"Unlearn What You Want to Forget: Efficient Unlearning for LLMs","created":"2023-10-31","cited_by_count":215},{"id":"2310.10348","title":"Attribution Patching Outperforms Automated Circuit Discovery","created":"2023-10-16","cited_by_count":209},{"id":"2207.08799","title":"Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit","created":"2022-07-18","cited_by_count":187},{"id":"2501.16496","title":"Open Problems in Mechanistic Interpretability","created":"2025-01-27","cited_by_count":179},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170},{"id":"1601.03764","title":"Linear Algebraic Structure of Word Senses, with Applications to Polysemy","created":"2016-01-14","cited_by_count":165},{"id":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143},{"id":"2303.13506","title":"The Quantization Model of Neural Scaling","created":"2023-03-23","cited_by_count":138},{"id":"2307.14430","title":"Skill-it! A Data-Driven Skills Framework for Understanding and Training Language Models","created":"2023-07-26","cited_by_count":121},{"id":"2309.02390","title":"Explaining grokking through circuit efficiency","created":"2023-09-05","cited_by_count":111},{"id":"1608.08225","title":"Why does deep and cheap learning work so well?","created":"2016-08-29","cited_by_count":100},{"id":"2405.06624","title":"Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems","created":"2024-05-10","cited_by_count":96},{"id":"2310.09336","title":"Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task","created":"2023-10-13","cited_by_count":93},{"id":"2410.19750","title":"The Geometry of Concepts: Sparse Autoencoder Feature Structure","created":"2024-10-10","cited_by_count":52},{"id":"2501.04952","title":"Open Problems in Machine Unlearning for AI Safety","created":"2025-01-09","cited_by_count":51},{"id":"2406.19370","title":"Emergence of Hidden Capabilities: Exploring Learning Dynamics in Concept Space","created":"2024-06-27","cited_by_count":35},{"id":"2410.12949","title":"Mechanistic Unlearning: Robust Knowledge Unlearning and Editing via Mechanistic Localization","created":"2024-10-16","cited_by_count":35},{"id":"2410.04332","title":"Gradient Routing: Masking Gradients to Localize Computation in Neural Networks","created":"2024-10-06","cited_by_count":34},{"id":"2206.01198","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","created":"2022-06-02","cited_by_count":32},{"id":"2504.21039","title":"Llama-3.1-FoundationAI-SecurityLLM-Base-8B Technical Report","created":"2025-04-28","cited_by_count":31},{"id":"2309.01933","title":"Provably safe systems: the only path to controllable AGI","created":"2023-09-05","cited_by_count":29},{"id":"2311.12997","title":"Compositional Capabilities of Autoregressive Transformers: A Study on Synthetic, Interpretable Tasks","created":"2023-11-21","cited_by_count":22},{"id":"2404.17563","title":"An exactly solvable model for emergence and scaling laws in the multitask sparse parity problem","created":"2024-04-26","cited_by_count":22},{"id":"2312.03096","title":"What Causes Polysemanticity? An Alternative Origin Story of Mixed Selectivity from Incidental Causes","created":"2023-12-05","cited_by_count":19},{"id":"2403.10557","title":"Second-Order Information Matters: Revisiting Machine Unlearning for Large Language Models","created":"2024-03-13","cited_by_count":18},{"id":"2501.12391","title":"Physics of Skill Learning","created":"2025-01-21","cited_by_count":8},{"id":"2501.00817","title":"Hardness of Learning Fixed Parities with Neural Networks","created":"2025-01-01","cited_by_count":7},{"id":"2406.08658","title":"Pruning is Optimal for Learning Sparse Features in High-Dimensions","created":"2024-06-12","cited_by_count":5}],"next_cursor":null}