1 views collected around this technical thread.
This article explains the theoretical foundations of CTR modeling, why click‑through rates are intrinsically unpredictable at the micro level, the simplifying assumptions that make binary classification feasible, and how evaluation metrics like AUC, contradictory samples, theoretical AUC bounds, and calibration affect model performance.
This article provides a comprehensive summary of machine learning model evaluation metrics, covering accuracy, precision, recall, F1, RMSE, ROC/AUC, KS test, and scoring cards, with explanations, formulas, code examples, and practical considerations for model performance assessment.
CTR modeling predicts click probabilities despite inherent microscopic randomness, treating each impression as an i.i.d. Bernoulli event and framing the task as binary classification; because data are noisy and imbalanced, evaluation relies on AUC rather than accuracy, with theoretical upper bounds set by feature quality, and calibration is needed to align predicted values with observed frequencies.
The article surveys typical challenges in recommendation systems, including ambiguous evaluation metrics, the trade‑off between precise algorithms and user experience, the exploration‑exploitation dilemma, and why offline AUC improvements often lead to online CTR/CPM drops due to data leakage, feature inconsistency, and distribution shifts.
This article provides a comprehensive overview of the AUC metric used in ranking tasks, discussing its various interpretations, key properties such as score‑independence and sampling robustness, its relationship to business metrics, common pitfalls, and advanced variations like group AUC.
This article explains the challenges of testing machine‑learning models for strategy projects, outlines the overall testing workflow, describes key offline and online evaluation metrics such as AUC and AB‑testing, and summarizes best‑practice procedures for assessing model performance, user experience, and effect differences.