{"url":"/method/llm-rank","slug":"llm-rank","name":"LLM-Rank","full_name":"Large Language Model pruning based on weighted PageRank","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"LLM-Rank: A Graph Theoretical Approach to Pruning Large Language Models","paper":"/paper/llm-rank-a-graph-theoretical-approach-to","first_author":"David Hoffmann","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/llm-rank-a-graph-theoretical-approach-to"},"source":{"url":"https://arxiv.org/abs/2410.13299v2","title":"LLM-Rank: A Graph Theoretical Approach to Pruning Large Language Models","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Pruning","url":"/methods/category/pruning","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/llm-rank-a-graph-theoretical-approach-to","title":"LLM-Rank: A Graph Theoretical Approach to Pruning Large Language Models","date":"2024-10-17","arxiv_id":"2410.13299","n_code_links":1,"syntology":null}],"papers_shown":1,"tasks":[{"task":"/task/inference-optimization","name":"Inference Optimization","papers":1},{"task":"/task/network-pruning","name":"Network Pruning","papers":1}],"tasks_shown":2,"n_tasks":2,"usage_by_year":[{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/llm-rank"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}