Skip to content

Author

Elena Tutubalina

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Jul 2026

From Queries to Playlists: An LLM-Driven Architecture for Semantic Music Search at Scale

A core task for music streaming platforms is retrieving and ranking tracks in response to user queries over multi-million-track catalogs. Existing approaches either rely on tag-based, entity-centric retrieval and recommendation, which struggle with implicit and subjective queries that fall outside a predefined tag vocabulary, or on recent LLM-based generative methods that circumvent this limitation but are prone to hallucinations and factual errors. We introduce a semantic playlist generation service that retrieves and ranks tracks based on meaning rather than keyword overlap, while avoiding hallucination-related failures. Each track is represented as structured text combining metadata, lyrics, and descriptive attributes, and both user queries and track representations are encoded into a shared embedding space using an LLM. A cross-encoder reranker built on the same backbone refines candidate ranking, and its signals are distilled into the embedder to reduce serving cost. In offline and production evaluations, our semantic vector-search pipeline achieves the highest playlist quality, improving Precision@10 from 64% with faceted search and 74% with direct LLM generation to 81%, while remaining compatible with low-latency, large-scale deployment. In an online A/B test on smart-speaker traffic, routing a share of playlist requests to our system yields a consistent double-digit relative uplift in Average Time Spent, indicating that meaning-aware retrieval substantially enhances user engagement and supports broader production rollout.

Rinat Mullakhmetov, Fedor Buzaev, R. Bogachev et al. · 0 citations
Preprint Aug 2026

The More Popular, The Harder to Forget: Adaptive Popularity for LLM Unlearning

Popular facts are memorised more deeply during pretraining and resist removal longer than rare ones, yet existing LLM unlearning methods apply uniform gradient pressure regardless of training-data frequency. We propose the AdaPop (Adaptive Popularity) method, which combines local token confidence with a per-fact popularity-dependent exponent derived from an external proxy (e.g., Wikidata sitelinks, LLM-as-Judge), and automates the forget-retain balance via a dual-ascent controller that adjusts the retain penalty each epoch. Across three model families and two benchmarks, AdaPop leaks ~5x less forgotten content than competing methods under paraphrased queries and ~1.6x less under adversarial reformulations. We support our analysis with internal metrics: under our method, forget-set hidden states move further from the pre-unlearning model's states than under other methods, while retain-set representations remain close.

Anna Borisiuk, A. Savchenko, Alexander Panchenko et al. · 0 citations