Research map / Learning theory and algorithms / Prediction and decision losses
Generalizing Linear Autoencoder Recommenders with Decoupled Expected Quadratic Loss
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
- DR-VAE: Debiased and Representation-enhanced Variational Autoencoder for Collaborative Recommendation (AAAI 2025 · similarity 0.86)
- Objective Shaping with Hard Negatives: Windowed Partial AUC Optimization for RL-based LLM Recommenders (NeurIPS 2026 · similarity 0.85)
- Learning-Efficient Yet Generalizable Collaborative Filtering for Item Recommendation (ICML 2024 · similarity 0.84)
- Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization (ICML 2025 · similarity 0.83)
- Advancing Loss Functions in Recommender Systems: A Comparative Study with a Rényi Divergence-Based Solution (AAAI 2025 · similarity 0.83)
- Language Ranker: A Lightweight Ranking framework for LLM Decoding (NeurIPS 2025 · similarity 0.83)
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.
