Research map / Probabilistic and scientific modeling / Variational and generative sampling
Pseudo-Mallows for Efficient Probabilistic Preference Learning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Generalized Top-k Mallows Model for Ranked Choices (NeurIPS 2025 · similarity 0.86)
- Mallows ranking models: maximum likelihood estimate and regeneration (ICML 2019 · similarity 0.86)
- Preference Diffusion for Recommendation (ICLR 2025 · similarity 0.85)
- Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization (ICML 2025 · similarity 0.84)
- Fading to Grow: Growing Preference Ratios via Preference Fading Discrete Diffusion for Recommendation (NeurIPS 2025 · similarity 0.84)
- Mult-DPO: Multinomial Direct Preference Optimization for Recommender Systems (NeurIPS 2026 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.