Demo Data from VLDB 2026 / reviewers in the wild / expert
Matteo Ruffini
dblp:122/8733
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0003-0738-2198ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 67% Learning theory · 33% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 50% Mathematical optimization · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model |
0.3 | 1 | 2017 | Hierarchical Methods of Moments · NIPS 2017 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
method of moments |
0.3 | 1 | 2017 | Hierarchical Methods of Moments · NIPS 2017 |
Machine learning › Learning theory
spectral methods |
0.3 | 1 | 2017 | Hierarchical Methods of Moments · NIPS 2017 |
Mathematical optimization › numerical analysis
joint diagonalization |
0.3 | 1 | 2017 | Hierarchical Methods of Moments · NIPS 2017 |
Algorithms and data structures › numerical linear algebra › matrix and tensor decomposition
tensor decomposition |
0.3 | 1 | 2017 | Hierarchical Methods of Moments · NIPS 2017 |
Methods — techniques the papers use, named apart from their topics
tensor decomposition · 0.6method of moments · 0.6approximate joint diagonalization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Ranking Across Different Content Types: The Robust Beauty of Multinomial BlendingabstractAn increasing number of media streaming services have expanded their offerings to include entities of multiple content types. For instance, audio streaming services that started by offering music only, now also offer podcasts, merchandise items, and videos. Ranking items across different content types into a single slate poses a significant challenge for traditional learning-to-rank (LTR) algorithms due to differing user engagement patterns for different content types. We explore a simple method for cross-content-type ranking, called multinomial blending (MB), which can be used in conjunction with most existing LTR algorithms. We compare MB to existing baselines not only in terms of ranking quality but also from other industry-relevant perspectives such as interpretability, ease-of-use, and stability in dynamic environments with changing user behavior and ranking model retraining. Finally, we report the results of an A/B test from an Amazon Music ranking use-case. Jan Malte Lichtenberg, Giuseppe Di Benedetto, Matteo Ruffini |
RecSys | 3 |
| 2018 | A new method of moments for latent variable models
Matteo Ruffini, Marta Casanellas, Ricard Gavaldà |
Mach. Learn. | 1 |
| 2017 | Hierarchical Methods of MomentsabstractSpectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods of moments to circumvent such limitations. Our method is based on replacing the tensor decomposition step used in previous algorithms with approximate joint diagonalization. Experiments on topic modeling show that our method outperforms previous tensor decomposition methods in terms of speed and model quality. Matteo Ruffini, Guillaume Rabusseau, Borja Balle |
NIPS | 1 |