atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Low-Dimensional Metrics

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 10 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ℓ1,2 regularization instead of nuclear-norm regularizationMetric learning · Sparse low-rank metric simulationrelative excess riskHelped
Use nuclear-norm regularization instead of ℓ1,2 regularizationMetric learning · Dense low-rank metric simulationrelative excess riskHelped
Constrain the metric with nuclear-norm or ℓ1,2 regularization rather than only requiring it to be PSDMetric learning · Sparse and dense low-rank metric simulationsrelative excess riskHelped
Use nuclear-norm regularization rather than ℓ1,2 regularizationMetric learning · Sparse and dense low-rank metric simulationsrelative excess riskMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy