LARS

خوارزمية LARS

خوارزمية فعّالة تحسب مسار حل Lasso الكامل (كل المعاملات كدالة في λ) بتكلفة تقارب تكلفة تقدير واحد بالمربعات الصغرى.

An efficient algorithm that computes the full Lasso solution path (all coefficients as a function of λ) at roughly the cost of a single least squares fit.

Also translated asالانحدار بأصغر زاوية

First appears in this corpus in: Large Batch Optimization for Deep Learning: Training BERT in 76 Minutes (2019)

Appears in these papers

Large Batch Optimization for Deep Learning: Training BERT in 76 Minutes2019 in the sky ✦