REVIEW 2 cited by
A Comprehensive Survey on Automated Machine Learning for Recommendations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Deep recommender systems (DRS) are critical for current commercial online service providers, which address the issue of information overload by recommending items that are tailored to the user's interests and preferences. They have unprecedented feature representations effectiveness and the capacity of modeling the non-linear relationships between users and items. Despite their advancements, DRS models, like other deep learning models, employ sophisticated neural network architectures and other vital components that are typically designed and tuned by human experts. This article will give a comprehensive summary of automated machine learning (AutoML) for developing DRS models. We first provide an overview of AutoML for DRS models and the related techniques. Then we discuss the state-of-the-art AutoML approaches that automate the feature selection, feature embeddings, feature interactions, and model training in DRS. We point out that the existing AutoML-based recommender systems are developing to a multi-component joint search with abstract search space and efficient search algorithm. Finally, we discuss appealing research directions and summarize the survey.
Forward citations
Cited by 2 Pith papers
-
Put Teacher in Student's Shoes: Cross-Distillation for Ultra-compact Model Compression Framework
EI-BERT compresses a Chinese NLU model to 1.91 MB with competitive accuracy using attention-based vocabulary pruning, cross-distillation, and module-wise INT8 quantization, and reports deployment at Alipay.
-
DANCE: Resource-Efficient Neural Architecture Search with Data-Aware and Continuous Adaptation
DANCE reformulates NAS as continuous evolution via learned stochastic gates over feature dimensions, but its headline 'consistently outperforms' claim fails on CIFAR-10 and is undermined by weak baselines.
Discussion (0). Continue with ORCID to comment.