{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/parameter-efficient-fine-tuning/papers/2","list_of":"/task/parameter-efficient-fine-tuning","task":"parameter-efficient fine-tuning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":10,"rows_per_page":100,"rows":[101,200],"of":935,"counts":{"archive_papers_tagged":935,"with_a_code_link":441,"where_syntology_ran_a_sample":198,"not_listed_spam_title":0,"listed":935,"listed_where_code_ran":198,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":176,"every_run_a_failure_of_syntologys_instrument":22,"listed_with_a_run_with_no_instrument_failure":176,"listed_every_run_a_failure_of_syntologys_instrument":22,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/parameter-efficient-fine-tuning","prev":"/task/parameter-efficient-fine-tuning","next":"/task/parameter-efficient-fine-tuning/papers/3","papers":[{"url":"/paper/coeff-tuning-a-graph-filter-subspace-view-for","slug":"coeff-tuning-a-graph-filter-subspace-view-for","title":"Coeff-Tuning: A Graph Filter Subspace View for Tuning Attention-Based Large Models","date":"2025-03-24","arxiv_id":"2503.18337","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/coeff-tuning-a-graph-filter-subspace-view-for#ran","syntology_url":"https://syntology.ai/paper/2503.18337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.18337"}},"official":{"repos":["ZichenMiao/Coeff_Tuning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/efficient-self-supervised-adaptation-for","slug":"efficient-self-supervised-adaptation-for","title":"Efficient Self-Supervised Adaptation for Medical Image Analysis","date":"2025-03-24","arxiv_id":"2503.18873","repositories_listed":1,"syntology":null},{"url":"/paper/hiding-images-in-diffusion-models-by-editing","slug":"hiding-images-in-diffusion-models-by-editing","title":"Hiding Images in Diffusion Models by Editing Learned Score Functions","date":"2025-03-24","arxiv_id":"2503.18459","repositories_listed":1,"syntology":null},{"url":"/paper/most-efficient-monarch-sparse-tuning-for-3d","slug":"most-efficient-monarch-sparse-tuning-for-3d","title":"MoST: Efficient Monarch Sparse Tuning for 3D Representation Learning","date":"2025-03-24","arxiv_id":"2503.18368","repositories_listed":1,"syntology":null},{"url":"/paper/spmtrack-spatio-temporal-parameter-efficient","slug":"spmtrack-spatio-temporal-parameter-efficient","title":"SPMTrack: Spatio-Temporal Parameter-Efficient Fine-Tuning with Mixture of Experts for Scalable Visual Tracking","date":"2025-03-24","arxiv_id":"2503.18338","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spmtrack-spatio-temporal-parameter-efficient#ran","syntology_url":"https://syntology.ai/paper/2503.18338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.18338"}},"official":{"repos":["wenruicai/spmtrack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lora-subtraction-for-drift-resistant-space-in","slug":"lora-subtraction-for-drift-resistant-space-in","title":"LoRA Subtraction for Drift-Resistant Space in Exemplar-Free Continual Learning","date":"2025-03-23","arxiv_id":"2503.18985","repositories_listed":1,"syntology":null},{"url":"/paper/salt-singular-value-adaptation-with-low-rank","slug":"salt-singular-value-adaptation-with-low-rank","title":"SALT: Singular Value Adaptation with Low-Rank Transformation","date":"2025-03-20","arxiv_id":"2503.16055","repositories_listed":1,"syntology":null},{"url":"/paper/vision-speech-models-teaching-speech-models","slug":"vision-speech-models-teaching-speech-models","title":"Vision-Speech Models: Teaching Speech Models to Converse about Images","date":"2025-03-19","arxiv_id":"2503.15633","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-smaller-models-tuning-llama-and","slug":"empowering-smaller-models-tuning-llama-and","title":"Empowering Smaller Models: Tuning LLaMA and Gemma with Chain-of-Thought for Ukrainian Exam Tasks","date":"2025-03-18","arxiv_id":"2503.13988","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-federated-fine-tuning-of-large","slug":"a-survey-on-federated-fine-tuning-of-large","title":"A Survey on Federated Fine-tuning of Large Language Models","date":"2025-03-15","arxiv_id":"2503.12016","repositories_listed":1,"syntology":null},{"url":"/paper/molex-mixture-of-layer-experts-for-finetuning","slug":"molex-mixture-of-layer-experts-for-finetuning","title":"MoLEx: Mixture of Layer Experts for Finetuning with Sparse Upcycling","date":"2025-03-14","arxiv_id":"2503.11144","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-few-shot-adaptation-of-vision","slug":"rethinking-few-shot-adaptation-of-vision","title":"Rethinking Few-Shot Adaptation of Vision-Language Models in Two Stages","date":"2025-03-14","arxiv_id":"2503.11609","repositories_listed":1,"syntology":{"n":12,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/rethinking-few-shot-adaptation-of-vision#ran","syntology_url":"https://syntology.ai/paper/2503.11609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.11609"}},"official":{"repos":["farinamatteo/rethinking_fewshot_vlms"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/privacy-preserved-automated-scoring-using","slug":"privacy-preserved-automated-scoring-using","title":"Privacy-Preserved Automated Scoring using Federated Learning for Educational Research","date":"2025-03-12","arxiv_id":"2503.11711","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-semi-supervised-learning-in-the","slug":"revisiting-semi-supervised-learning-in-the","title":"Revisiting semi-supervised learning in the era of foundation models","date":"2025-03-12","arxiv_id":"2503.09707","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/revisiting-semi-supervised-learning-in-the#ran","syntology_url":"https://syntology.ai/paper/2503.09707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09707"}},"official":{"repos":["OSU-MLB/SSL-Foundation-Models"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-overprescribing-challenges-fine","slug":"addressing-overprescribing-challenges-fine","title":"Addressing Overprescribing Challenges: Fine-Tuning Large Language Models for Medication Recommendation Tasks","date":"2025-03-05","arxiv_id":"2503.03687","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/addressing-overprescribing-challenges-fine#ran","syntology_url":"https://syntology.ai/paper/2503.03687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03687"}},"official":{"repos":["zzhustc2016/lamo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/state-offset-tuning-state-based-parameter","slug":"state-offset-tuning-state-based-parameter","title":"State-offset Tuning: State-based Parameter-Efficient Fine-Tuning for State Space Models","date":"2025-03-05","arxiv_id":"2503.03499","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/state-offset-tuning-state-based-parameter#ran","syntology_url":"https://syntology.ai/paper/2503.03499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03499"}},"official":{"repos":["furiosa-ai/ssm-state-tuning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/re-imagining-multimodal-instruction-tuning-a","slug":"re-imagining-multimodal-instruction-tuning-a","title":"Re-Imagining Multimodal Instruction Tuning: A Representation View","date":"2025-03-02","arxiv_id":"2503.00723","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/re-imagining-multimodal-instruction-tuning-a#ran","syntology_url":"https://syntology.ai/paper/2503.00723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.00723"}},"official":{"repos":["comeandcode/MRT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/make-lora-great-again-boosting-lora-with","slug":"make-lora-great-again-boosting-lora-with","title":"Make LoRA Great Again: Boosting LoRA with Adaptive Singular Values and Mixture-of-Experts Optimization Alignment","date":"2025-02-24","arxiv_id":"2502.16894","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":3,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/make-lora-great-again-boosting-lora-with#ran","syntology_url":"https://syntology.ai/paper/2502.16894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16894"}},"official":{"repos":["facico/goat-peft"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/r-lora-random-initialization-of-multi-head","slug":"r-lora-random-initialization-of-multi-head","title":"R-LoRA: Random Initialization of Multi-Head LoRA for Multi-Task Learning","date":"2025-02-21","arxiv_id":"2502.15455","repositories_listed":1,"syntology":null},{"url":"/paper/sparsity-may-be-all-you-need-sparse-random","slug":"sparsity-may-be-all-you-need-sparse-random","title":"Sparsity May Be All You Need: Sparse Random Parameter Adaptation","date":"2025-02-21","arxiv_id":"2502.15975","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sparsity-may-be-all-you-need-sparse-random#ran","syntology_url":"https://syntology.ai/paper/2502.15975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.15975"}},"official":{"repos":["IBM/SpaRTA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/nlora-nystrom-initiated-low-rank-adaptation","slug":"nlora-nystrom-initiated-low-rank-adaptation","title":"NLoRA: Nyström-Initiated Low-Rank Adaptation for Large Language Models","date":"2025-02-20","arxiv_id":"2502.14482","repositories_listed":1,"syntology":null},{"url":"/paper/token-adaptation-via-side-graph-convolution","slug":"token-adaptation-via-side-graph-convolution","title":"Token Adaptation via Side Graph Convolution for Temporally and Spatially Efficient Fine-tuning of 3D Point Cloud Transformers","date":"2025-02-19","arxiv_id":"2502.14142","repositories_listed":1,"syntology":null},{"url":"/paper/minimal-ranks-maximum-confidence-parameter","slug":"minimal-ranks-maximum-confidence-parameter","title":"Minimal Ranks, Maximum Confidence: Parameter-efficient Uncertainty Quantification for LoRA","date":"2025-02-17","arxiv_id":"2502.12122","repositories_listed":1,"syntology":null},{"url":"/paper/softcot-soft-chain-of-thought-for-efficient","slug":"softcot-soft-chain-of-thought-for-efficient","title":"SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs","date":"2025-02-17","arxiv_id":"2502.12134","repositories_listed":1,"syntology":null},{"url":"/paper/citecheck-towards-accurate-citation","slug":"citecheck-towards-accurate-citation","title":"CiteCheck: Towards Accurate Citation Faithfulness Detection","date":"2025-02-15","arxiv_id":"2502.10881","repositories_listed":1,"syntology":null},{"url":"/paper/copeft-fast-adaptation-framework-for-multi","slug":"copeft-fast-adaptation-framework-for-multi","title":"CoPEFT: Fast Adaptation Framework for Multi-Agent Collaborative Perception with Parameter-Efficient Fine-Tuning","date":"2025-02-15","arxiv_id":"2502.10705","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/copeft-fast-adaptation-framework-for-multi#ran","syntology_url":"https://syntology.ai/paper/2502.10705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10705"}},"official":{"repos":["fengxueguiren/CoPEFT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/music-for-all-exploring-multicultural","slug":"music-for-all-exploring-multicultural","title":"Music for All: Representational Bias and Cross-Cultural Adaptability of Music Generation Models","date":"2025-02-11","arxiv_id":"2502.07328","repositories_listed":1,"syntology":null},{"url":"/paper/ssmlora-enhancing-low-rank-adaptation-with","slug":"ssmlora-enhancing-low-rank-adaptation-with","title":"SSMLoRA: Enhancing Low-Rank Adaptation with State Space Model","date":"2025-02-07","arxiv_id":"2502.04958","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/ssmlora-enhancing-low-rank-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/2502.04958","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04958"}},"official":{"repos":["yuhkalhic/ssmlora"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-localization-and-activation-editing-for","slug":"joint-localization-and-activation-editing-for","title":"Joint Localization and Activation Editing for Low-Resource Fine-Tuning","date":"2025-02-03","arxiv_id":"2502.01179","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-fine-tuning-of-segment","slug":"parameter-efficient-fine-tuning-of-segment","title":"Parameter Efficient Fine-Tuning of Segment Anything Model","date":"2025-02-01","arxiv_id":"2502.00418","repositories_listed":1,"syntology":null},{"url":"/paper/speech-translation-refinement-using-large","slug":"speech-translation-refinement-using-large","title":"Speech Translation Refinement using Large Language Models","date":"2025-01-25","arxiv_id":"2501.15090","repositories_listed":1,"syntology":null},{"url":"/paper/domain-expansion-parameter-efficient-modules","slug":"domain-expansion-parameter-efficient-modules","title":"Domain Expansion: Parameter-Efficient Modules as Building Blocks for Composite Domains","date":"2025-01-24","arxiv_id":"2501.14321","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-adapters-meet-neural-architecture","slug":"low-rank-adapters-meet-neural-architecture","title":"Low-Rank Adapters Meet Neural Architecture Search for LLM Compression","date":"2025-01-23","arxiv_id":"2501.16372","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-fine-tuning-for","slug":"parameter-efficient-fine-tuning-for","title":"Parameter-Efficient Fine-Tuning for Foundation Models","date":"2025-01-23","arxiv_id":"2501.13787","repositories_listed":1,"syntology":null},{"url":"/paper/edora-efficient-weight-decomposed-low-rank","slug":"edora-efficient-weight-decomposed-low-rank","title":"EDoRA: Efficient Weight-Decomposed Low-Rank Adaptation via Singular Value Decomposition","date":"2025-01-21","arxiv_id":"2501.12067","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-tune-a-multilingual-encoder-model-for","slug":"how-to-tune-a-multilingual-encoder-model-for","title":"How to Tune a Multilingual Encoder Model for Germanic Languages: A Study of PEFT, Full Fine-Tuning, and Language Adapters","date":"2025-01-10","arxiv_id":"2501.06025","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-aware-low-rank-adaptation-for","slug":"spectral-aware-low-rank-adaptation-for","title":"Spectral-Aware Low-Rank Adaptation for Speaker Verification","date":"2025-01-07","arxiv_id":"2501.03829","repositories_listed":1,"syntology":null},{"url":"/paper/adept-adaptive-decomposed-prompt-tuning-for","slug":"adept-adaptive-decomposed-prompt-tuning-for","title":"ADePT: Adaptive Decomposed Prompt Tuning for Parameter-Efficient Fine-tuning","date":"2025-01-06","arxiv_id":"2501.03291","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adept-adaptive-decomposed-prompt-tuning-for#ran","syntology_url":"https://syntology.ai/paper/2501.03291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.03291"}},"official":{"repos":["hungerpway/adept"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/halo-hadamard-assisted-lossless-optimization","slug":"halo-hadamard-assisted-lossless-optimization","title":"HALO: Hadamard-Assisted Lower-Precision Optimization for LLMs","date":"2025-01-05","arxiv_id":"2501.02625","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-addressing-in-language-models-via","slug":"rethinking-addressing-in-language-models-via","title":"Rethinking Addressing in Language Models via Contexualized Equivariant Positional Encoding","date":"2025-01-01","arxiv_id":"2501.00712","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-addressing-in-language-models-via#ran","syntology_url":"https://syntology.ai/paper/2501.00712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.00712"}},"official":{"repos":["vita-group/tape"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-token-reduction-with-parameter","slug":"rethinking-token-reduction-with-parameter","title":"Rethinking Token Reduction with Parameter-Efficient Fine-Tuning in ViT for Pixel-Level Tasks","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/velora-a-low-rank-adaptation-approach-for","slug":"velora-a-low-rank-adaptation-approach-for","title":"VELoRA: A Low-Rank Adaptation Approach for Efficient RGB-Event based Recognition","date":"2024-12-28","arxiv_id":"2412.20064","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-weight-normalized-low-rank","slug":"gradient-weight-normalized-low-rank","title":"Gradient Weight-normalized Low-rank Projection for Efficient LLM Training","date":"2024-12-27","arxiv_id":"2412.19616","repositories_listed":1,"syntology":null},{"url":"/paper/kalahash-knowledge-anchored-low-resource","slug":"kalahash-knowledge-anchored-low-resource","title":"KALAHash: Knowledge-Anchored Low-Resource Adaptation for Deep Hashing","date":"2024-12-27","arxiv_id":"2412.19417","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/kalahash-knowledge-anchored-low-resource#ran","syntology_url":"https://syntology.ai/paper/2412.19417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.19417"}},"official":{"repos":["Tree-Shu-Zhao/KALAHash.pytorch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/interweaving-memories-of-a-siamese-large","slug":"interweaving-memories-of-a-siamese-large","title":"Interweaving Memories of a Siamese Large Language Model","date":"2024-12-23","arxiv_id":"2412.17383","repositories_listed":1,"syntology":null},{"url":"/paper/hate-speech-detection-and-target","slug":"hate-speech-detection-and-target","title":"LLMsAgainstHate @ NLU of Devanagari Script Languages 2025: Hate Speech Detection and Target Identification in Devanagari Languages via Parameter Efficient Fine-Tuning of LLMs","date":"2024-12-22","arxiv_id":"2412.17131","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-hierarchical-prompt-tuning-for","slug":"semantic-hierarchical-prompt-tuning-for","title":"Semantic Hierarchical Prompt Tuning for Parameter-Efficient Fine-Tuning","date":"2024-12-22","arxiv_id":"2412.16956","repositories_listed":1,"syntology":null},{"url":"/paper/label-privacy-in-split-learning-for-large","slug":"label-privacy-in-split-learning-for-large","title":"Label Privacy in Split Learning for Large Models with Parameter-Efficient Training","date":"2024-12-21","arxiv_id":"2412.16669","repositories_listed":1,"syntology":null},{"url":"/paper/customttt-motion-and-appearance-customized","slug":"customttt-motion-and-appearance-customized","title":"CustomTTT: Motion and Appearance Customized Video Generation via Test-Time Training","date":"2024-12-20","arxiv_id":"2412.15646","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-fine-tuning-for-improved","slug":"parameter-efficient-fine-tuning-for-improved","title":"Parameter-efficient Fine-tuning for improved Convolutional Baseline for Brain Tumor Segmentation in Sub-Saharan Africa Adult Glioma Dataset","date":"2024-12-18","arxiv_id":"2412.14100","repositories_listed":1,"syntology":null},{"url":"/paper/extending-llms-to-new-languages-a-case-study","slug":"extending-llms-to-new-languages-a-case-study","title":"Extending LLMs to New Languages: A Case Study of Llama and Persian Adaptation","date":"2024-12-17","arxiv_id":"2412.13375","repositories_listed":1,"syntology":null},{"url":"/paper/train-more-parameters-but-mind-their","slug":"train-more-parameters-but-mind-their","title":"Train More Parameters But Mind Their Placement: Insights into Language Adaptation with PEFT","date":"2024-12-17","arxiv_id":"2412.12674","repositories_listed":1,"syntology":null},{"url":"/paper/visual-instruction-tuning-with-500x-fewer","slug":"visual-instruction-tuning-with-500x-fewer","title":"LLaVA Steering: Visual Instruction Tuning with 500x Fewer Parameters through Modality Linear Representation-Steering","date":"2024-12-16","arxiv_id":"2412.12359","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/visual-instruction-tuning-with-500x-fewer#ran","syntology_url":"https://syntology.ai/paper/2412.12359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12359"}},"official":{"repos":["bibisbar/LLaVA-Steering"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-principal-components-allocation-with","slug":"adaptive-principal-components-allocation-with","title":"Adaptive Principal Components Allocation with the $\\ell_{2,g}$-regularized Gaussian Graphical Model for Efficient Fine-Tuning Large Models","date":"2024-12-11","arxiv_id":"2412.08592","repositories_listed":1,"syntology":null},{"url":"/paper/kasa-knowledge-aware-singular-value","slug":"kasa-knowledge-aware-singular-value","title":"KaSA: Knowledge-Aware Singular-Value Adaptation of Large Language Models","date":"2024-12-08","arxiv_id":"2412.06071","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/kasa-knowledge-aware-singular-value#ran","syntology_url":"https://syntology.ai/paper/2412.06071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.06071"}},"official":{"repos":["juyongjiang/kasa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sora-singular-value-decomposed-low-rank","slug":"sora-singular-value-decomposed-low-rank","title":"SoRA: Singular Value Decomposed Low-Rank Adaptation for Domain Generalizable Representation Learning","date":"2024-12-05","arxiv_id":"2412.04077","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-detection-of-queried-event-start","slug":"streaming-detection-of-queried-event-start","title":"Streaming Detection of Queried Event Start","date":"2024-12-04","arxiv_id":"2412.03567","repositories_listed":1,"syntology":null},{"url":"/paper/unified-parameter-efficient-unlearning-for","slug":"unified-parameter-efficient-unlearning-for","title":"Unified Parameter-Efficient Unlearning for LLMs","date":"2024-11-30","arxiv_id":"2412.00383","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-parameter-efficient-fine-tuning-of","slug":"enhancing-parameter-efficient-fine-tuning-of","title":"Enhancing Parameter-Efficient Fine-Tuning of Vision Transformers through Frequency-Based Adaptation","date":"2024-11-28","arxiv_id":"2411.19297","repositories_listed":1,"syntology":null},{"url":"/paper/fonts-text-rendering-with-typography-and","slug":"fonts-text-rendering-with-typography-and","title":"FonTS: Text Rendering with Typography and Style Controls","date":"2024-11-28","arxiv_id":"2412.00136","repositories_listed":1,"syntology":null},{"url":"/paper/pretrained-llm-adapted-with-lora-as-a","slug":"pretrained-llm-adapted-with-lora-as-a","title":"Pretrained LLM Adapted with LoRA as a Decision Transformer for Offline RL in Quantitative Trading","date":"2024-11-26","arxiv_id":"2411.17900","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-foundation-models-fine-tuning-for","slug":"exploring-foundation-models-fine-tuning-for","title":"Exploring Foundation Models Fine-Tuning for Cytology Classification","date":"2024-11-22","arxiv_id":"2411.14975","repositories_listed":1,"syntology":null},{"url":"/paper/mapsam-adapting-segment-anything-model-for","slug":"mapsam-adapting-segment-anything-model-for","title":"MapSAM: Adapting Segment Anything Model for Automated Feature Detection in Historical Maps","date":"2024-11-11","arxiv_id":"2411.06971","repositories_listed":1,"syntology":null},{"url":"/paper/robust-and-efficient-fine-tuning-of-llms-with","slug":"robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","arxiv_id":"2411.04358","repositories_listed":1,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":9,"n_instrument":5,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/robust-and-efficient-fine-tuning-of-llms-with#ran","syntology_url":"https://syntology.ai/paper/2411.04358","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.04358"}},"official":{"repos":["lcs2-iiitd/monteclora"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/mambapeft-exploring-parameter-efficient-fine","slug":"mambapeft-exploring-parameter-efficient-fine","title":"MambaPEFT: Exploring Parameter-Efficient Fine-Tuning for Mamba","date":"2024-11-06","arxiv_id":"2411.03855","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mambapeft-exploring-parameter-efficient-fine#ran","syntology_url":"https://syntology.ai/paper/2411.03855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03855"}},"official":{"repos":["sony/MambaPEFT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/expanding-sparse-tuning-for-low-memory-usage","slug":"expanding-sparse-tuning-for-low-memory-usage","title":"Expanding Sparse Tuning for Low Memory Usage","date":"2024-11-04","arxiv_id":"2411.01800","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":1,"n_ran_checked":7,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/expanding-sparse-tuning-for-low-memory-usage#ran","syntology_url":"https://syntology.ai/paper/2411.01800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01800"}},"official":{"repos":["ssfgunner/snell"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/c2a-client-customized-adaptation-for","slug":"c2a-client-customized-adaptation-for","title":"C2A: Client-Customized Adaptation for Parameter-Efficient Federated Learning","date":"2024-11-01","arxiv_id":"2411.00311","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/c2a-client-customized-adaptation-for#ran","syntology_url":"https://syntology.ai/paper/2411.00311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00311"}},"official":{"repos":["yeachan-kr/c2a"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/clear-towards-robust-and-generalized","slug":"clear-towards-robust-and-generalized","title":"CleaR: Towards Robust and Generalized Parameter-Efficient Fine-Tuning for Noisy Label Learning","date":"2024-10-31","arxiv_id":"2411.00873","repositories_listed":1,"syntology":null},{"url":"/paper/capacity-control-is-an-effective-memorization","slug":"capacity-control-is-an-effective-memorization","title":"Capacity Control is an Effective Memorization Mitigation Mechanism in Text-Conditional Diffusion Models","date":"2024-10-29","arxiv_id":"2410.22149","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/capacity-control-is-an-effective-memorization#ran","syntology_url":"https://syntology.ai/paper/2410.22149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22149"}},"official":{"repos":["raman1121/diffusion_memorization_hpo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/intlora-integral-low-rank-adaptation-of","slug":"intlora-integral-low-rank-adaptation-of","title":"IntLoRA: Integral Low-rank Adaptation of Quantized Diffusion Models","date":"2024-10-29","arxiv_id":"2410.21759","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/intlora-integral-low-rank-adaptation-of#ran","syntology_url":"https://syntology.ai/paper/2410.21759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21759"}},"official":{"repos":["csguoh/intlora"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/kd-lora-a-hybrid-approach-to-efficient-fine","slug":"kd-lora-a-hybrid-approach-to-efficient-fine","title":"KD-LoRA: A Hybrid Approach to Efficient Fine-Tuning with LoRA and Knowledge Distillation","date":"2024-10-28","arxiv_id":"2410.20777","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-pathology-foundation-models","slug":"benchmarking-pathology-foundation-models","title":"Benchmarking Pathology Foundation Models: Adaptation Strategies and Scenarios","date":"2024-10-21","arxiv_id":"2410.16038","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":15,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/benchmarking-pathology-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2410.16038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16038"}},"official":{"repos":["quiil/benchmarkingpathologyfoundationmodels"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/natural-galore-accelerating-galore-for-memory","slug":"natural-galore-accelerating-galore-for-memory","title":"Natural GaLore: Accelerating GaLore for memory-efficient LLM Training and Fine-tuning","date":"2024-10-21","arxiv_id":"2410.16029","repositories_listed":1,"syntology":null},{"url":"/paper/the-effect-of-fine-tuning-on-language-model","slug":"the-effect-of-fine-tuning-on-language-model","title":"The effect of fine-tuning on language model toxicity","date":"2024-10-21","arxiv_id":"2410.15821","repositories_listed":1,"syntology":null},{"url":"/paper/lora-ir-taming-low-rank-experts-for-efficient","slug":"lora-ir-taming-low-rank-experts-for-efficient","title":"LoRA-IR: Taming Low-Rank Experts for Efficient All-in-One Image Restoration","date":"2024-10-20","arxiv_id":"2410.15385","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lora-ir-taming-low-rank-experts-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2410.15385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15385"}},"official":{"repos":["shallowdream204/lora-ir"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unlearning-backdoor-attacks-for-llms-with","slug":"unlearning-backdoor-attacks-for-llms-with","title":"Unlearning Backdoor Attacks for LLMs with Weak-to-Strong Knowledge Distillation","date":"2024-10-18","arxiv_id":"2410.14425","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/unlearning-backdoor-attacks-for-llms-with#ran","syntology_url":"https://syntology.ai/paper/2410.14425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14425"}},"official":{"repos":["shuaizhao95/Unlearning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/loldu-low-rank-adaptation-via-lower-diag","slug":"loldu-low-rank-adaptation-via-lower-diag","title":"LoLDU: Low-Rank Adaptation via Lower-Diag-Upper Decomposition for Parameter-Efficient Fine-Tuning","date":"2024-10-17","arxiv_id":"2410.13618","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/loldu-low-rank-adaptation-via-lower-diag#ran","syntology_url":"https://syntology.ai/paper/2410.13618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13618"}},"official":{"repos":["skddj/loldu"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unlocking-the-capabilities-of-masked","slug":"unlocking-the-capabilities-of-masked","title":"Unlocking the Capabilities of Masked Generative Models for Image Synthesis via Self-Guidance","date":"2024-10-17","arxiv_id":"2410.13136","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":3,"n_instrument":8,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unlocking-the-capabilities-of-masked#ran","syntology_url":"https://syntology.ai/paper/2410.13136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13136"}},"official":{"repos":["jiwanhur/unlockmgm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/lora-soups-merging-loras-for-practical-skill","slug":"lora-soups-merging-loras-for-practical-skill","title":"LoRA Soups: Merging LoRAs for Practical Skill Composition Tasks","date":"2024-10-16","arxiv_id":"2410.13025","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lora-soups-merging-loras-for-practical-skill#ran","syntology_url":"https://syntology.ai/paper/2410.13025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13025"}},"official":{"repos":["aksh555/lora-soups"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/layer-wise-importance-matters-less-memory-for","slug":"layer-wise-importance-matters-less-memory-for","title":"Layer-wise Importance Matters: Less Memory for Better Performance in Parameter-efficient Fine-tuning of Large Language Models","date":"2024-10-15","arxiv_id":"2410.11772","repositories_listed":1,"syntology":null},{"url":"/paper/alphalora-assigning-lora-experts-based-on","slug":"alphalora-assigning-lora-experts-based-on","title":"AlphaLoRA: Assigning LoRA Experts Based on Layer Training Quality","date":"2024-10-14","arxiv_id":"2410.10054","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/alphalora-assigning-lora-experts-based-on#ran","syntology_url":"https://syntology.ai/paper/2410.10054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10054"}},"official":{"repos":["morelife2017/alphalora"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/rocoft-efficient-finetuning-of-large-language","slug":"rocoft-efficient-finetuning-of-large-language","title":"RoCoFT: Efficient Finetuning of Large Language Models with Row-Column Updates","date":"2024-10-14","arxiv_id":"2410.10075","repositories_listed":1,"syntology":null},{"url":"/paper/dare-the-extreme-revisiting-delta-parameter","slug":"dare-the-extreme-revisiting-delta-parameter","title":"DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models","date":"2024-10-12","arxiv_id":"2410.09344","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":17,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dare-the-extreme-revisiting-delta-parameter#ran","syntology_url":"https://syntology.ai/paper/2410.09344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09344"}},"official":{"repos":["vengdeng/darex"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","slug":"mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","arxiv_id":"2410.09437","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mtl-lora-low-rank-adaptation-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2410.09437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09437"}},"official":{"repos":["pumpkin-co/mtl-lora"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/slim-one-shot-quantized-sparse-plus-low-rank","slug":"slim-one-shot-quantized-sparse-plus-low-rank","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","date":"2024-10-12","arxiv_id":"2410.09615","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/slim-one-shot-quantized-sparse-plus-low-rank#ran","syntology_url":"https://syntology.ai/paper/2410.09615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09615"}},"official":{"repos":["mohammad-mozaffari/slim"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-efficient-visual-language-alignment","slug":"towards-efficient-visual-language-alignment","title":"Towards Efficient Visual-Language Alignment of the Q-Former for Visual Reasoning Tasks","date":"2024-10-12","arxiv_id":"2410.09489","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-fine-tuning-of-state","slug":"parameter-efficient-fine-tuning-of-state","title":"Parameter-Efficient Fine-Tuning of State Space Models","date":"2024-10-11","arxiv_id":"2410.09016","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parameter-efficient-fine-tuning-of-state#ran","syntology_url":"https://syntology.ai/paper/2410.09016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09016"}},"official":{"repos":["furiosa-ai/ssm-peft"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/qeft-quantization-for-efficient-fine-tuning","slug":"qeft-quantization-for-efficient-fine-tuning","title":"QEFT: Quantization for Efficient Fine-Tuning of LLMs","date":"2024-10-11","arxiv_id":"2410.08661","repositories_listed":1,"syntology":null},{"url":"/paper/accept-adaptive-codebook-for-composite-and","slug":"accept-adaptive-codebook-for-composite-and","title":"ACCEPT: Adaptive Codebook for Composite and Efficient Prompt Tuning","date":"2024-10-10","arxiv_id":"2410.12847","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-zeroth-order-fine-tuning-for","slug":"enhancing-zeroth-order-fine-tuning-for","title":"Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structures","date":"2024-10-10","arxiv_id":"2410.07698","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-zeroth-order-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/2410.07698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07698"}},"official":{"repos":["optsuite/LOZO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/motionaura-generating-high-quality-and-motion","slug":"motionaura-generating-high-quality-and-motion","title":"MotionAura: Generating High-Quality and Motion Consistent Videos using Discrete Diffusion","date":"2024-10-10","arxiv_id":"2410.07659","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/motionaura-generating-high-quality-and-motion#ran","syntology_url":"https://syntology.ai/paper/2410.07659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07659"}},"official":{"repos":["CandleLabAI/MotionAura-ICLR-2025"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-efficient-fine-tuning-in-spectral","slug":"parameter-efficient-fine-tuning-in-spectral","title":"Parameter-Efficient Fine-Tuning in Spectral Domain for Point Cloud Learning","date":"2024-10-10","arxiv_id":"2410.08114","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parameter-efficient-fine-tuning-in-spectral#ran","syntology_url":"https://syntology.ai/paper/2410.08114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08114"}},"official":{"repos":["jerryfeng2003/pointgst"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparsegrad-a-selective-method-for-efficient","slug":"sparsegrad-a-selective-method-for-efficient","title":"SparseGrad: A Selective Method for Efficient Fine-tuning of MLP Layers","date":"2024-10-09","arxiv_id":"2410.07383","repositories_listed":1,"syntology":null},{"url":"/paper/are-large-language-models-state-of-the-art","slug":"are-large-language-models-state-of-the-art","title":"Are Large Language Models State-of-the-art Quality Estimators for Machine Translation of User-generated Content?","date":"2024-10-08","arxiv_id":"2410.06338","repositories_listed":1,"syntology":null},{"url":"/paper/llama-slayer-8b-shallow-layers-hold-the-key","slug":"llama-slayer-8b-shallow-layers-hold-the-key","title":"Llama SLayer 8B: Shallow Layers Hold the Key to Knowledge Injection","date":"2024-10-03","arxiv_id":"2410.02330","repositories_listed":1,"syntology":null},{"url":"/paper/dlp-lora-efficient-task-specific-lora-fusion","slug":"dlp-lora-efficient-task-specific-lora-fusion","title":"DLP-LoRA: Efficient Task-Specific LoRA Fusion with a Dynamic, Lightweight Plugin for Large Language Models","date":"2024-10-02","arxiv_id":"2410.01497","repositories_listed":1,"syntology":null},{"url":"/paper/imaging-foundation-model-for-universal","slug":"imaging-foundation-model-for-universal","title":"Imaging foundation model for universal enhancement of non-ideal measurement CT","date":"2024-10-02","arxiv_id":"2410.01591","repositories_listed":1,"syntology":null},{"url":"/paper/tpp-llm-modeling-temporal-point-processes-by","slug":"tpp-llm-modeling-temporal-point-processes-by","title":"TPP-LLM: Modeling Temporal Point Processes by Efficiently Fine-Tuning Large Language Models","date":"2024-10-02","arxiv_id":"2410.02062","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tpp-llm-modeling-temporal-point-processes-by#ran","syntology_url":"https://syntology.ai/paper/2410.02062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02062"}},"official":{"repos":["zefang-liu/TPP-LLM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sqft-low-cost-model-adaptation-in-low","slug":"sqft-low-cost-model-adaptation-in-low","title":"SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Models","date":"2024-10-01","arxiv_id":"2410.03750","repositories_listed":1,"syntology":null},{"url":"/paper/reference-trustable-decoding-a-training-free","slug":"reference-trustable-decoding-a-training-free","title":"Reference Trustable Decoding: A Training-Free Augmentation Paradigm for Large Language Models","date":"2024-09-30","arxiv_id":"2409.20181","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/reference-trustable-decoding-a-training-free#ran","syntology_url":"https://syntology.ai/paper/2409.20181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.20181"}},"official":{"repos":["shiluohe/referencetrustabledecoding"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}],"record_sha256":"3794b3d011b77121d3abb984a7262478f08ba7e3bae4a630ef81fd4bce7f5d36","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}