قارن الطرق

	منحنى التعلم (قانون الممارسة الأسي)	تتبع المعرفة (Knowledge Tracing)	البرمجة غير الخطية
المجال	تحليلات التعليم	تحليلات التعليم	التحسين
العائلة	Regression model	Machine learning	Process / pipeline
سنة النشأة	1936	1994	2006
صاحب الطريقة	Theodore Wright	Albert Corbett & John Anderson	Jorge Nocedal & Stephen Wright
النوع	Power-law regression model	Probabilistic student modeling	Continuous mathematical optimization
المصدر التأسيسي	Wright, T. P. (1936). Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences, 3(4), 122–128.	Corbett, A. T., & Anderson, J. R. (1994). Knowledge tracing: Modeling the acquisition of procedural knowledge. User Modeling and User-Adapted Interaction, 4(4), 253–278.	Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1
الأسماء البديلة	Power Law of Practice, Experience Curve, Wright's Law, Öğrenme Eğrisi	BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme	NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama
ذات صلة	3	3	3
الملخص	The learning curve models how performance improves predictably as cumulative experience accumulates. Formalized by Theodore Wright in 1936 using aircraft manufacturing data, it expresses the relationship between the number of practice trials (or production units) and the time or cost per unit as a power-law function. It is widely applied in educational psychology, industrial engineering, health professions training, and human factors research whenever repeated task execution is the mechanism of skill acquisition.	Knowledge Tracing (KT) is a student-modeling technique that estimates, at each moment in time, the probability that a learner has mastered a target knowledge component. Introduced by Corbett and Anderson in 1994, the classical Bayesian Knowledge Tracing (BKT) model treats skill acquisition as a two-state Hidden Markov Model driven by four interpretable parameters: prior knowledge, learning rate, slip, and guess. Deep variants (DKT, DKVMN, AKT) later replaced HMMs with recurrent and transformer architectures.	Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences.