AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Logistic Boosting Regression for Label Distribution Learning

CVPR 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Data attribution and recourse · 75 citations (OpenAlex)

Check 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 an adaptive one-vs-one vector-tree base learner instead of weighted regression treesLDLogitBoost · s-BU 3DFEK-L: .0515±.0027 -> .0491±.0023Helped
Use an adaptive one-vs-one vector-tree base learner instead of weighted regression treesLDLogitBoost · COPMK-L: .0900±.0038 -> .0855±.0037Helped
Predict an age distribution using apparent-age mean and standard deviation rather than a single ageLogitBoost · ChaLearn Age EstimationMAE: 9.0458 -> 7.3449Helped
Predict an age distribution using apparent-age mean and standard deviation rather than a single ageAOSO-LogitBoost · ChaLearn Age EstimationMAE: 8.0361 -> 7.2949Helped
Use a vector-tree base learner rather than a weighted regression treeLDLogitBoost · s-BU 3DFEEuclidean: .1297±.0039 -> .1263±.0033Helped
Use a vector-tree base learner rather than a weighted regression treeLDLogitBoost · COPMEuclidean: .1585±.0032 -> .1547±.0030Helped

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