Research map / Learning theory and algorithms / Prediction and decision losses
A Non-generative Framework and Convex Relaxations for Unsupervised 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
- Robust Unsupervised Learning via L-statistic Minimization (ICML 2021 · similarity 0.86)
- On the Provable Advantage of Unsupervised Pretraining (ICLR 2024 · similarity 0.85)
- Towards Generalization beyond Pointwise Learning: A Unified Information-theoretic Perspective (ICML 2024 · similarity 0.84)
- Machine Unlearning under Overparameterization (NeurIPS 2025 · similarity 0.84)
- Near-Optimal Solutions of Constrained Learning Problems (ICLR 2024 · similarity 0.84)
- Generative Cross-Entropy: A Strictly Proper Loss for Data-Efficient Classification (NeurIPS 2026 · similarity 0.84)
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.