So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Thử nghiệm A/B thí điểm× | Thử nghiệm A/B Thích ứng× | |
|---|---|---|
| Lĩnh vực | Thiết kế thí nghiệm | Thiết kế thí nghiệm |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 2000s–2010s (formalized in digital experimentation literature) | 1952 (Robbins); applied to A/B testing from ~2010s onward |
| Người khởi xướng≠ | Derived from pilot study methodology (Kraemer et al., 2006) applied to A/B testing practice | Herbert Robbins (bandit framework); Thompson Sampling formalized by William R. Thompson |
| Loại≠ | Experimental design — feasibility study | Adaptive experimental design |
| Công trình gốc≠ | Thabane, L., Ma, J., Chu, R., Cheng, J., Ismaila, A., Rios, L. P., Robson, R., Thabane, M., Giangregorio, L., & Goldsmith, C. H. (2010). A tutorial on pilot studies: The what, why and how. BMC Medical Research Methodology, 10(1), 1. DOI ↗ | Russo, D., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018). A Tutorial on Thompson Sampling. Foundations and Trends in Machine Learning, 11(1), 1–96. DOI ↗ |
| Tên gọi khác | pilot split test, feasibility A/B test, preliminary A/B experiment, pilot randomized comparison | adaptive AB test, bandit A/B test, multi-armed bandit testing, online adaptive experiment |
| Liên quan≠ | 5 | 6 |
| Tóm tắt≠ | A Pilot A/B test is a small-scale, preliminary split-test experiment run before a full A/B test to assess feasibility, estimate effect sizes, detect operational problems, and validate measurement instruments. Participants are randomly assigned to a control condition (A) and a treatment condition (B), but the study is explicitly underpowered — its purpose is to inform the design of the definitive test, not to yield a conclusive comparison. | An Adaptive A/B test is an experimental design that dynamically reallocates traffic or participants toward better-performing variants during the experiment itself, rather than holding allocations fixed until the end. Drawing on multi-armed bandit algorithms such as Thompson Sampling or Upper Confidence Bound (UCB), it balances the exploration of uncertain variants with the exploitation of those already showing superior performance, typically yielding higher aggregate outcomes while still producing valid inferential conclusions. |
| ScholarGateBộ dữ liệu ↗ |
|
|