atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

A scaled Bregman theorem with applications

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 6 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 DN-pLMS instead of p-LMSAdaptive filtering · Noisy signal processingprediction error: exceeding 40%Mixed
Initialize spherical k-means with GKM seeding instead of using SKM aloneSKM · Clustering on the spherek-means potential: almost divide the k-means potential by a factor 2 on some runsHelped
Use GKM seeding instead of Forgy initializationSpherical clustering · Clustering on the spherek-means potential: by at least a factor 2Helped
Use GKM seeding rather than waiting for converged SKMSpherical clustering · Clustering on the spherek-means potentialMixed

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