Preprint Article Version 1 This version is not peer-reviewed

Interpretable Conversation Routing with Latent Embeddings Approach

Version 1 : Received: 29 October 2024 / Approved: 29 October 2024 / Online: 30 October 2024 (07:49:14 CET)

How to cite: Maksymenko, D.; Turuta, O. Interpretable Conversation Routing with Latent Embeddings Approach. Preprints 2024, 2024102295. https://doi.org/10.20944/preprints202410.2295.v1 Maksymenko, D.; Turuta, O. Interpretable Conversation Routing with Latent Embeddings Approach. Preprints 2024, 2024102295. https://doi.org/10.20944/preprints202410.2295.v1

Abstract

Large language models (LLMs) get quickly implemented into question answering and support systems to automate customer experience across all domains even including medical use cases. Models in such environments should solve multiple problems like general knowledge questions, queries to external sources, function calling and many others. Some cases might not even require a full-on text generation. They possibly need different prompts or even models. All of it can be managed by a routing step. This paper focuses on interpretable few-shot approaches for conversation routing like latent embeddings retrieval. The work here presents a benchmark, a sorrow analysis, and a set of visualizations of the way latent embeddings routing works for long-context conversations in a multilingual, domain-specific environment. The results presented here show that latent embeddings router is able to achieve performance on the same level as LLM-based routers with additional interpretability and higher level of control over model decision making.

Keywords

Generative AI; Semantic Routing; LLM; Dataset; Benchmark; Interpretability

Subject

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.