{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:58:03Z","timestamp":1781675883171,"version":"3.54.5"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032056061","type":"print"},{"value":"9783032056078","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05607-8_22","type":"book-chapter","created":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T20:30:02Z","timestamp":1757277002000},"page":"232-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dialogue Style Transfer with\u00a0Reinforcement Learning and\u00a0Parameter Efficient Fine-Tuning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9450-5515","authenticated-orcid":false,"given":"Ruslan","family":"Pravosud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3586-1649","authenticated-orcid":false,"given":"Oleksii","family":"Adamov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5408-5279","authenticated-orcid":false,"given":"Oleksandr","family":"Marchenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"key":"22_CR1","unstructured":"Keskar, N.S., et al.: Ctrl: A conditional transformer language model for controllable generation. arXiv preprint arXiv:1909.05858 (2019)"},{"key":"22_CR2","unstructured":"Stiennon, N., et al.: Learning to summarize with human feedback. Adv. Neural Inf. Process. Syst. 33, 3008\u20133021 (2020)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Luo, F., et al.: A dual reinforcement learning framework for unsupervised text style transfer. arXiv preprint arXiv:1905.10060 (2019)","DOI":"10.24963\/ijcai.2019\/711"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Pfeiffer, J., et al.: AdapterFusion: Non-destructive task composition for transfer learning. arXiv preprint arXiv:2005.00247 (2020)","DOI":"10.18653\/v1\/2021.eacl-main.39"},{"key":"22_CR5","unstructured":"Hu, E.J., et al.: LoRA: Low-rank adaptation of large language models. arXiv preprint arXiv:2106.09685 (2021)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Schick, T., Sch\u00fctze, H.: It\u2019s not just size that matters: Small language models are also few-shot learners. arXiv preprint arXiv:2009.07118 (2020)","DOI":"10.18653\/v1\/2021.naacl-main.185"},{"key":"22_CR7","unstructured":"Hypersniper philosophy dialog. https:\/\/huggingface.co\/datasets\/Hypersniper\/philosophy_dialogue. Accessed 26 Jan 2025"},{"key":"22_CR8","unstructured":"Sanh, V.: DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108 (2019)"},{"key":"22_CR9","unstructured":"Radford, A., et al.: Language models are unsupervised multitask learners. OpenAI Blog 1(8), 9 (2019)"},{"key":"22_CR10","unstructured":"Zhang, T., et al.: BERTScore: Evaluating text generation with BERT. arXiv preprint arXiv:1904.09675 (2019)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Zhu, Y., et al.: Texygen: a benchmarking platform for text generation models. The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval (2018)","DOI":"10.1145\/3209978.3210080"},{"key":"22_CR12","unstructured":"Schulman, J., et al.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05607-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:42:09Z","timestamp":1781674929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05607-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"ISBN":["9783032056061","9783032056078"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05607-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"8 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"FQAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Flexible Query Answering Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Burgas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fqas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fqas2025.uniburgas.bg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}