AI Paper Atlas

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

Nonparametric Online Regression while Learning the Metric

Ilja Kuzborskij, Nicolò Cesa-Bianchi

NeurIPS 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 a fixed Mahalanobis metric aligned with directions of greater smoothness instead of the identity metricOnline nonparametric regression · Online nonparametric regressionregret upper boundImproved
Learn the Mahalanobis metric from the gradient outer product matrix on the same data sequencePhased online metric learning and regression · Stochastic online nonparametric regressionregret upper boundMixed
Use the identity matrix as the fixed metricMahalanobis ellipsoid-packing algorithm · Online nonparametric regressionregret upper boundNo clear effect

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