Computational  Learning  Theory

 

¼öÇÐÀûÀÎ °üÁ¡¿¡¼­ ÇнÀ°úÁ¤ (learning process)¸¦ ¼³¸íÇÏ·Á´Â ½Ãµµ.

Wikipedia : Computational learning theory (COLT) : Åë°èÇп¡¼­ COLT ´Â ±â°èÇнÀ (Machine Learning) ¾Ë°í¸®ÁòÀÇ ºÐ¼®°ú °ü·ÃµÈ ¼öÇÐ ºÐ¾ßÀÌ´Ù. ±â°èÇнÀÀº ÈÆ·ÃÁýÇÕÀ» ÃëÇؼ­, °¡¼³ ¶Ç´Â ¸ðµ¨À» ¸¸µé°í, ¹Ì·¡¿¡ ´ëÇÑ ¿¹ÃøÀ» ÇÑ´Ù. ÈÆ·ÃÁýÇÕÀº À¯ÇÑÇÏ°í ¹Ì·¡´Â ºÒÈ®½ÇÇϱ⠶§¹®¿¡, ÇнÀÀÌ·ÐÀº º¸Åë ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀ» ¿ÏÀüÇÏ°Ô º¸ÀåÇÏ´Â °á°ú¸¦ ³»Áö´Â ¸øÇÑ´Ù. ´ë½Å¿¡, ±â°èÇнÀ ¾Ë°í¸®ÁòÀÇ ¼º´É¿¡ ´ëÇÑ È®·üÀû ÇѰ踦 ÁÖ´Â ¹æ¹ýÀÌ ÈçÈ÷ »ç¿ëµÈ´Ù.

¼º´ÉÀÇ ÇÑ°è¿¡ ´õÇؼ­, °è»êÇнÀ À̷а¡µéÀº ÇнÀÀÇ ½Ã°£º¹Àâµµ (time complexity) ¿Í ½ÇÇö°¡´É¼º (feasibility) ¸¦ ¿¬±¸ÇÑ´Ù. COLT ¿¡¼­´Â, ¸¸ÀÏ °è»êÀÌ ploynomial time ³»¿¡ ÀÌ·ç¾î Áú ¼ö ÀÖ´Ù¸é ½ÇÇö°¡´É (feasible) ÇÏ´Ù°í ÇÑ´Ù. ½Ã°£º¹Àâµµ °è»ê °á°ú µÎ°¡Áö Á¾·ù°¡ ÀÖ´Ù.

  1. positive results : ¾î¶² ºÎ·ù (class) °¡ polynomial time ³»¿¡ ÇнÀ °¡´ÉÇÏ´Ù (learnable, classifiable) ´Â °ÍÀ» º¸¿©ÁØ´Ù.
  2. negative results : ¾î¶² ºÎ·ù (class) °¡ polynomial time ³»¿¡ ÇнÀ ºÒ°¡´ÉÇÏ´Ù ´Â °ÍÀ» º¸¿©ÁØ´Ù.

Negative results ´Â °¡Á¤¿¡ ÀÇÇؼ­¸¸ Áõ¸íµÈ´Ù. negative results¿¡¼­ ÈçÇÑ °¡Á¤Àº ´ÙÀ½°ú °°´Ù :

COLT ÀÇ ¸î°¡Áö ´Ù¸¥ ºÐ¾ß°¡ Àִµ¥, ±×°ÍµéÀº ¼öÇÐÀûÀ¸·Î´Â ¸ð¼øÀÎ °ÍµéÀÌ ÀÖ´Ù. ÀÌ·¯ÇÑ ¸ð¼øÀº ´Ù¸¥ Ãß·Ð ¿øÄ¢µéÀ» (Áï Á¦ÇÑµÈ µ¥ÀÌÅ͸¦ »ç¿ëÇؼ­ ¾î¶»°Ô ÀϹÝÈ­ ÇÒ °ÍÀΰ¡ ÇÏ´Â ¿øÄ¢µé) »ç¿ëÇϱ⠶§¹®¿¡ »ý±â´Â °ÍÀÌ´Ù. COLT ÀÇ ´Ù¸¥ ºÐ¾ß´Â ´ÙÀ½°ú °°´Ù.

COLT ´Â »õ·Î¿î ½Ç¿ëÀûÀÎ ¾Ë°í¸®ÁòÀ» À¯µµÇß´Ù. ¿¹¸¦µé¸é PAC ÀÌ·ÐÀº boostingÀ» ³º°ÔÇß°í, VC ÀÌ·ÐÀº support vector machinesÀ» ³º°ÔÇßÀ¸¸ç, Bayesian inference Àº belief networks (by Judea Pearl)À» ³º°ÔÇß´Ù.  

External links