First, using the demonstrations significantly outperforms the no demonstrations method
even with small k (k = 4), and performance drop
from using gold labels to using random labels is
consistently small across varying k, in the range of
0.8–1.6%.7
Interestingly, model performance does
not increase much as k increases when k ≥ 8, both
with gold labels and with random labels.
BrisquelyBrusque writes "I think what he's getting at is, we'll never have an algorithm that is
1. fast, distributed, easily deployed
2. interpretable
3. able to converge quickly for most problems
4. robust to noise, outliers, multicollinearity, class imbalance, and the curse of dimensionality
5. optimized for any combination of numeric variables and factors
6. self-supervised (no need for extensive parameter tuning)
7. capable of probability estimates as well as predictions
8. able to issue predictions for multiple targets
9. comfortable with structured, unstructured data (text, 2D, 3D, audio, tabular)
10. open-source
Besides, a recent analysis by Amazon Web Services found that 50 to 95% of all ML applications in an organization are based on traditional ML (random forests, regression models). That's why these application papers matter -- we're learning to make progress in certain areas where traditional ML fails."
Bookmarks on this page are managed by an admin user. 