{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PM37YQCH7AMHBFGFBQZ3Z5TERM","short_pith_number":"pith:PM37YQCH","schema_version":"1.0","canonical_sha256":"7b37fc4047f8187094c50c33bcf6648b169764513e1fa937766a88926179ed59","source":{"kind":"arxiv","id":"2309.15223","version":2},"attestation_state":"computed","paper":{"title":"Low-rank Adaptation of Large Language Model Rescoring for Parameter-Efficient Speech Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE","cs.SD","eess.AS"],"primary_cat":"cs.CL","authors_text":"Aditya Gourav, Andreas Stolcke, Ankur Gandhe, Ariya Rastow, Chao-Han Huck Yang, Denis Filimonov, I-Fan Chen, Ivan Bulyko, Jari Kolehmainen, Prashanth G. Shivakumar, Qi Luo, Roger Ren, Shalini Ghosh, Sungho Ryu, Tuan Dinh, Yi-Chieh Liu, Yile Gu, Yu Yu","submitted_at":"2023-09-26T19:41:34Z","abstract_excerpt":"We propose a neural language modeling system based on low-rank adaptation (LoRA) for speech recognition output rescoring. Although pretrained language models (LMs) like BERT have shown superior performance in second-pass rescoring, the high computational cost of scaling up the pretraining stage and adapting the pretrained models to specific domains limit their practical use in rescoring. Here we present a method based on low-rank decomposition to train a rescoring BERT model and adapt it to new domains using only a fraction (0.08%) of the pretrained parameters. These inserted matrices are opti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.15223","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-09-26T19:41:34Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE","cs.SD","eess.AS"],"title_canon_sha256":"f625c059d52331f8eea915766bf808270df3724cb33604fc9b985b1fff672e51","abstract_canon_sha256":"9e46b4ac1e252f1be9b30fe6cb48062ba9ddf3581cbf5d1a57f18037a5cbe2e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:51.955530Z","signature_b64":"kETbLtEOBnAnznsW8KyAcZs3qGncpwFViNSEfRf7zE2EUp84osDoHQlwdobR9xzjrm3/slm5+Pf0O/7uoW07CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b37fc4047f8187094c50c33bcf6648b169764513e1fa937766a88926179ed59","last_reissued_at":"2026-07-05T07:37:51.954998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:51.954998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Adaptation of Large Language Model Rescoring for Parameter-Efficient Speech Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE","cs.SD","eess.AS"],"primary_cat":"cs.CL","authors_text":"Aditya Gourav, Andreas Stolcke, Ankur Gandhe, Ariya Rastow, Chao-Han Huck Yang, Denis Filimonov, I-Fan Chen, Ivan Bulyko, Jari Kolehmainen, Prashanth G. Shivakumar, Qi Luo, Roger Ren, Shalini Ghosh, Sungho Ryu, Tuan Dinh, Yi-Chieh Liu, Yile Gu, Yu Yu","submitted_at":"2023-09-26T19:41:34Z","abstract_excerpt":"We propose a neural language modeling system based on low-rank adaptation (LoRA) for speech recognition output rescoring. Although pretrained language models (LMs) like BERT have shown superior performance in second-pass rescoring, the high computational cost of scaling up the pretraining stage and adapting the pretrained models to specific domains limit their practical use in rescoring. Here we present a method based on low-rank decomposition to train a rescoring BERT model and adapt it to new domains using only a fraction (0.08%) of the pretrained parameters. These inserted matrices are opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15223","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.15223/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.15223","created_at":"2026-07-05T07:37:51.955057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15223v2","created_at":"2026-07-05T07:37:51.955057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15223","created_at":"2026-07-05T07:37:51.955057+00:00"},{"alias_kind":"pith_short_12","alias_value":"PM37YQCH7AMH","created_at":"2026-07-05T07:37:51.955057+00:00"},{"alias_kind":"pith_short_16","alias_value":"PM37YQCH7AMHBFGF","created_at":"2026-07-05T07:37:51.955057+00:00"},{"alias_kind":"pith_short_8","alias_value":"PM37YQCH","created_at":"2026-07-05T07:37:51.955057+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.07285","citing_title":"Non-Intrusive Automatic Speech Recognition Refinement: A Survey","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM","json":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM.json","graph_json":"https://pith.science/api/pith-number/PM37YQCH7AMHBFGFBQZ3Z5TERM/graph.json","events_json":"https://pith.science/api/pith-number/PM37YQCH7AMHBFGFBQZ3Z5TERM/events.json","paper":"https://pith.science/paper/PM37YQCH"},"agent_actions":{"view_html":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM","download_json":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM.json","view_paper":"https://pith.science/paper/PM37YQCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15223&json=true","fetch_graph":"https://pith.science/api/pith-number/PM37YQCH7AMHBFGFBQZ3Z5TERM/graph.json","fetch_events":"https://pith.science/api/pith-number/PM37YQCH7AMHBFGFBQZ3Z5TERM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM/action/storage_attestation","attest_author":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM/action/author_attestation","sign_citation":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM/action/citation_signature","submit_replication":"https://pith.science/pith/PM37YQCH7AMHBFGFBQZ3Z5TERM/action/replication_record"}},"created_at":"2026-07-05T07:37:51.955057+00:00","updated_at":"2026-07-05T07:37:51.955057+00:00"}