analiza aiqbench
This paper links linear recommenders to topic models, showing that latent topics can be read from the weight matrix of a closed-form linear autoencoder without extra training. It also proposes item and user normalizations to keep popular items and very active users from dominating those topics. The results on six datasets are reported as stronger topic quality than dedicated topic models while keeping recommendation accuracy competitive, which makes the approach a practical option for interpretable recommenders, though the gains are benchmark-specific.
Discovering Topics from Linear Autoencoders
arXiv:2610.34739v1 Announce Type: cross Abstract: Linear recommenders and topic models are similar in that they implicitly learn from co-occurrences of items. However, there has been little study of how these two model families are related. In this work, we show that, under a latent-factor model of the user-item interactions, the latent topics can be discovered from the weight matrix of a closed-form linear autoencoder. These topics provide a basis for interpreting the recommendations, and can be obtained directly from the trained recommender without additional training. Building on our analysis, we further propose novel item and user normalizations that prevent popular items and very active users from dominating the topics. Our experiments on six public datasets demonstrate that our method achieves significantly higher topic quality than every dedicated topic model and matches or exceeds the best linear autoencoder on all six datasets, while its recommendation performance is competitive with the best tuned recommender.
Abstract:Linear recommenders and topic models are similar in that they implicitly learn from co-occurrences of items. However, there has been little study of how these two model families are related. In this work, we show that, under a latent-factor model of the user-item interactions, the latent topics can be discovered from the weight matrix of a closed-form linear autoencoder. These topics provide a basis for interpreting the recommendations, and can be obtained directly from the trained recommender without additional training. Building on our analysis, we further propose novel item and user normalizations that prevent popular items and very active users from dominating the topics. Our experiments on six public datasets demonstrate that our method achieves significantly higher topic quality than every dedicated topic model and matches or exceeds the best linear autoencoder on all six datasets, while its recommendation performance is competitive with the best tuned recommender.
12 pages. Comments are welcome
Information Retrieval (cs.IR); Machine Learning (cs.LG)
arXiv:2610.34739 [cs.IR]
(or arXiv:2610.34739v1 [cs.IR] for this version)
https://doi.org/10.48550/arXiv.2610.34739 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 249 cuvinte
Subiecte conexe
DifFRACT: Diffusion Feature Reconstruction and Attribution for Circuit Tracing
arXiv · 16 iun. 2026
A Geometric Unification of Concept Learning with Concept Cones
arXiv · 9 iun. 2026
Routing Without Embeddings: Fast And Interpretable Routing With Regular Expressions
arXiv · 30 sept. 2026
What Do Sparse Autoencoder Feature Discovery Scores Identify? From Activations to Interventions
arXiv · 14 oct. 2026