{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:26:50Z","timestamp":1781018810079,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,3,23]]},"DOI":"10.1145\/3748522.3779742","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:17:49Z","timestamp":1781014669000},"page":"1117-1124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Bank Compression for Continual Adaptation of Large Language Models"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1378-9377","authenticated-orcid":false,"given":"Thomas","family":"Katraouras","sequence":"first","affiliation":[{"name":"University of Thessaly, Volos, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7366-3716","authenticated-orcid":false,"given":"Dimitrios","family":"Rafailidis","sequence":"additional","affiliation":[{"name":"University of Thessaly, Volos, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Y. Bengio N. L\u00e9onard and A. Courville. 2013. Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation. (2013). arXiv: 1308.3432."},{"key":"e_1_3_2_1_2_1","volume-title":"On Tiny Episodic Memories in Continual Learning. (2019). arXiv","author":"Chaudhry A.","year":"1902","unstructured":"A. Chaudhry, M. Rohrbach, M. Elhoseiny, T. Ajanthan, P. K. Dokania, P. H. S. Torr, and M'A. Ranzato. 2019. On Tiny Episodic Memories in Continual Learning. (2019). arXiv: 1902.10486."},{"key":"e_1_3_2_1_3_1","first-page":"10088","article-title":"Qlora: efficient finetuning of quantized llms","volume":"36","author":"Dettmers T.","year":"2023","unstructured":"T. Dettmers, A. Pagnoni, A. Holtzman, and L. Zettlemoyer. 2023. Qlora: efficient finetuning of quantized llms. NeurIPS, 36, 10088\u201310115.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_4_1","unstructured":"T. Gunter et al. 2024. Apple Intelligence Foundation Language Models. (2024). arXiv: 2407.21075."},{"key":"e_1_3_2_1_5_1","unstructured":"K. Guu K. Lee Z. Tung P. Pasupat and M. Chang. 2020. Retrieval Augmented Language Model Pre-Training. In ICML. PMLR 3929\u20133938."},{"key":"e_1_3_2_1_6_1","unstructured":"Z. He L. Karlinsky D. Kim J. McAuley D. Krotov and R. Feris. 2024. CAMELoT: Towards Large Language Models with Training-Free Consolidated Associative Memory. (2024). arXiv: 2402.13449."},{"key":"e_1_3_2_1_7_1","unstructured":"N. Houlsby A. Giurgiu S. Jastrzebski B. Morrone Q. D. Laroussilhe A. Gesmundo M. Attariyan and S. Gelly. 2019. Parameter-Efficient Transfer Learning for NLP. In ICML. PMLR 2790\u20132799."},{"key":"e_1_3_2_1_8_1","unstructured":"E. J. Hu Y. Shen P. Wallis Z. Allen-Zhu Y. Li S. Wang L. Wang and W. Chen. 2021. LoRA: Low-Rank Adaptation of Large Language Models. (2021). arXiv: 2106.09685."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"N. Hu E. Mitchell C. D. Manning and C. Finn. 2023. Meta-Learning Online Adaptation of Language Models. (2023). arXiv: 2305.15076.","DOI":"10.18653\/v1\/2023.emnlp-main.268"},{"key":"e_1_3_2_1_10_1","unstructured":"J. Jang S. Ye S. Yang J. Shin J. Han G. Kim S. J. Choi and M. Seo. 2022. Towards Continual Knowledge Learning of Language Models. (2022). arXiv: 2110.03215."},{"key":"e_1_3_2_1_11_1","unstructured":"H. Kim A. Mnih J. Schwarz M. Garnelo A. Eslami D. Rosenbaum O. Vinyals and Y. W. Teh. 2019. Attentive Neural Processes. (2019). arXiv: 1901.05761."},{"key":"e_1_3_2_1_12_1","volume-title":"Adam: A Method for Stochastic Optimization.","author":"Kingma D. P.","year":"2017","unstructured":"D. P. Kingma and J. Ba. 2017. Adam: A Method for Stochastic Optimization. (2017). arXiv: 1412.6980."},{"key":"e_1_3_2_1_13_1","unstructured":"M. Kulkarni P. Tangarajan K. Kim and A. Trivedi. 2024. Reinforcement Learning for Optimizing RAG for Domain Chatbots. (2024). arXiv: 2401.06800."},{"key":"e_1_3_2_1_14_1","unstructured":"P. Lewis et al. 2020. Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks. In NeurIPS. Vol. 33. Curran Associates Inc. 9459\u20139474."},{"key":"e_1_3_2_1_15_1","unstructured":"X. L. Li and P. Liang. 2021. Prefix-Tuning: Optimizing Continuous Prompts for Generation. (2021). arXiv: 2101.00190."},{"key":"e_1_3_2_1_16_1","unstructured":"A. Liska et al. 2022. StreamingQA: A Benchmark for Adaptation to New Knowledge over Time in Question Answering Models. In ICML. PMLR 13604\u201313622."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"X. Liu K. Ji Y. Fu W. L. Tam Z. Du Z. Yang and J. Tang. 2022. P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks. (2022). arXiv: 2110.07602.","DOI":"10.18653\/v1\/2022.acl-short.8"},{"key":"e_1_3_2_1_18_1","volume-title":"Connectionist Networks: The Sequential Learning Problem. In Psychology of Learning and Motivation.","author":"McCloskey M.","year":"1989","unstructured":"M. McCloskey and N. J. Cohen. 1989. Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem. In Psychology of Learning and Motivation. Vol. 24. Elsevier, 109\u2013165. isbn: 978-0-12-543324-2."},{"key":"e_1_3_2_1_19_1","unstructured":"A. Misrahi N. Chirkova M. Louis and V. Nikoulina. 2025. Adapting Large Language Models for Multi-Domain Retrieval-Augmented-Generation. (2025). arXiv: 2504.02411."},{"key":"e_1_3_2_1_20_1","unstructured":"OpenAI et al. 2024. GPT-4 Technical Report. (2024). arXiv: 2303.08774."},{"key":"e_1_3_2_1_21_1","volume-title":"Memoria: Resolving Fateful Forgetting Problem through Human-Inspired Memory Architecture.","author":"Park S.","year":"2024","unstructured":"S. Park and J. Bak. 2024. Memoria: Resolving Fateful Forgetting Problem through Human-Inspired Memory Architecture. (2024). arXiv: 2310.03052."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"J. Pfeiffer A. Kamath A. R\u00fcckl\u00e9 K. Cho and I. Gurevych. 2021. AdapterFusion: Non-Destructive Task Composition for Transfer Learning. (2021). arXiv: 2005.00247.","DOI":"10.18653\/v1\/2021.eacl-main.39"},{"key":"e_1_3_2_1_23_1","unstructured":"A. Radford J. Wu R. Child D. Luan D. Amodei and I. Sutskever. [n. d.] Language Models are Unsupervised Multitask Learners."},{"key":"e_1_3_2_1_24_1","unstructured":"C. Raffel N. Shazeer A. Roberts K. Lee S. Narang M. Matena Y. Zhou W. Li and P. J. Liu. 2020. Exploring the limits of transfer learning with a unified text-to-text transformer. JMLR 21 140 1\u201367."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"P. Rajpurkar J. Zhang K. Lopyrev and P. Liang. 2016. SQuAD: 100 000+ Questions for Machine Comprehension of Text. (2016). arXiv: 1606.05250.","DOI":"10.18653\/v1\/D16-1264"},{"key":"e_1_3_2_1_26_1","first-page":"e26752","article-title":"The new york times annotated corpus","volume":"6","author":"Sandhaus E.","year":"2008","unstructured":"E. Sandhaus. 2008. The new york times annotated corpus. Linguistic Data Consortium, Philadelphia, 6, 12, e26752.","journal-title":"Linguistic Data Consortium, Philadelphia"},{"key":"e_1_3_2_1_27_1","unstructured":"V. Sanh L. Debut J. Chaumond and T. Wolf. 2019. Distilbert a distilled version of bert: smaller faster cheaper and lighter. In NeurIPS EMC2 Workshop."},{"key":"e_1_3_2_1_28_1","unstructured":"J. Schwarz W. Czarnecki J. Luketina A. Grabska-Barwinska Y. W. Teh R. Pascanu and R. Hadsell. 2018. Progress & Compress: A scalable framework for continual learning. In ICML. PMLR 4528\u20134537."},{"key":"e_1_3_2_1_29_1","volume-title":"Adafactor: Adaptive Learning Rates with Sub-linear Memory Cost. In ICML. PMLR, 4596\u20134604.","author":"Shazeer N.","year":"2018","unstructured":"N. Shazeer and M. Stern. 2018. Adafactor: Adaptive Learning Rates with Sub-linear Memory Cost. In ICML. PMLR, 4596\u20134604."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"H. Shi Z. Xu H. Wang W. Qin W. Wang Y. Wang Z. Wang S. Ebrahimi and H. Wang. 2025. Continual Learning of Large Language Models: A Comprehensive Survey. ACM Computing Surveys 3735633.","DOI":"10.1145\/3735633"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41591-024-03423-7"},{"key":"e_1_3_2_1_32_1","first-page":"130109","article-title":"Online adaptation of language models with a memory of amortized contexts","volume":"37","author":"Tack J.","year":"2024","unstructured":"J. Tack, J. Kim, E. Mitchell, J. Shin, Y. W. Teh, and J. R. Schwarz. 2024. Online adaptation of language models with a memory of amortized contexts. NeurIPS, 37, 130109\u2013130135.","journal-title":"NeurIPS"},{"key":"e_1_3_2_1_33_1","unstructured":"H. Touvron et al. 2023. Llama 2: Open Foundation and Fine-Tuned Chat Models. (2023). arXiv: 2307.09288."},{"key":"e_1_3_2_1_34_1","volume-title":"kavukcuoglu","author":"van den Oord A.","year":"2017","unstructured":"A. van den Oord, O. Vinyals, and k. kavukcuoglu. 2017. Neural Discrete Representation Learning. In NeurIPS. Vol. 30. Curran Associates, Inc."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41591-024-02855-5"},{"key":"e_1_3_2_1_36_1","unstructured":"A. Vaswani N. Shazeer N. Parmar J. Uszkoreit L. Jones A. N. Gomez \u0141. Kaiser and I. Polosukhin. 2017. Attention is All you Need. In NeurIPS. Vol. 30. Curran Associates Inc."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"J. Wang A. Jatowt and M. Yoshikawa. 2022. ArchivalQA: A Large-scale Benchmark Dataset for Open-Domain Question Answering over Historical News Collections. In SIGIR. ACM Madrid Spain 3025\u20133035. isbn: 978-1-4503-8732-3.","DOI":"10.1145\/3477495.3531734"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3487352"},{"key":"e_1_3_2_1_39_1","volume-title":"MEMORYLLM: Towards Self-Updatable Large Language Models.","author":"Wang Y.","year":"2024","unstructured":"Y. Wang et al. 2024. MEMORYLLM: Towards Self-Updatable Large Language Models. (2024). arXiv: 2402.04624."},{"key":"e_1_3_2_1_40_1","unstructured":"S. Wu et al. 2024. Retrieval-Augmented Generation for Natural Language Processing: A Survey. (2024). arXiv: 2407.13193."},{"key":"e_1_3_2_1_41_1","unstructured":"L. Xu H. Xie S-Z. J. Qin X. Tao and F. L. Wang. 2023. Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment. (2023). arXiv: 2312.12148."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3363240"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3705725"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"S. Yao D. Yu J. Zhao I. Shafran T. Griffiths Y. Cao and K. Narasimhan. 2023. Tree of Thoughts: Deliberate Problem Solving with Large Language Models. In NeurIPS. Vol. 36. Curran Associates Inc. 11809\u201311822.","DOI":"10.52202\/075280-0517"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Z. Zhang Q. Dai X. Bo C. Ma R. Li X. Chen J. Zhu Z. Dong and J-R. Wen. 2025. A Survey on the Memory Mechanism of Large Language Model based Agents. ACM Transactions on Information Systems 3748302.","DOI":"10.1145\/3748302"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"S. Zhao Y. Shao Y. Huang J. Song Z. Wang C. Wan and L. Ma. 2025. Understanding the Design Decisions of Retrieval-Augmented Generation Systems. (2025). arXiv: 2411.19463.","DOI":"10.1145\/3802824"},{"key":"e_1_3_2_1_47_1","unstructured":"Y. Zhu et al. 2024. Large Language Models for Information Retrieval: A Survey. (2024). arXiv: 2308.07107."}],"event":{"name":"SAC '26: 41st ACM\/SIGAPP Symposium on Applied Computing","location":"Grand Hotel Palace Thessaloniki Greece","acronym":"SAC '26","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 41st ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748522.3779742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:24:37Z","timestamp":1781015077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748522.3779742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":47,"alternative-id":["10.1145\/3748522.3779742","10.1145\/3748522"],"URL":"https:\/\/doi.org\/10.1145\/3748522.3779742","relation":{},"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}