[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fCYIo6VNTgWOi3_IgUbeMlik6pWpbEqC87LtvFqzx3pE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":24,"type":40},[],"2024-12-06 09:35:33",997976105,[8,9,10,11],"推断","扩展","反向传播","模拟",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd7ea7086329261ddbccb0e9e00c955b1.jpg","[智慧共享课]人工智能引论","下列哪项不是蒙特卡洛树搜索算法的步骤( )",[17,26,31,41,49,58,61,70,80,89],{"answer":18,"createTime":5,"id":19,"options":20,"question":23,"source":24,"type":25},[],997975804,[21,22],"对","错","皮尔逊相关系数的取值范围为0到正无穷.( )","v2",3,{"answer":27,"createTime":5,"id":28,"options":29,"question":30,"source":24,"type":25},[],997975874,[21,22],"令评价函数和启发函数取值相等的启发式搜索算法被称为贪婪最佳优先搜索算法.( )",{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":24,"type":40},[],997975917,[35,36,37,38],"主成分分析","图像分类","气温预测","围棋AI","下列任务属于无监督学习的是( )",0,{"answer":42,"createTime":5,"id":43,"options":44,"question":48,"source":24,"type":40},[],997976016,[45,46,47,10],"Dropout","Softmax","ReLU","下列哪项属于神经网络正则化的方式.( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":24,"type":40},[],997976087,[53,54,55,56],"蒙特卡洛树算法一定要找到最优解作为预测结果","以最小最大算法为基础的蒙特卡洛树搜索算法也被称为上限置信区间树搜索算法","蒙特卡洛树算法通过准确推断来估计每个可能步骤的优劣","蒙特卡洛树算法无法采用神经网络实现","下列关于蒙特卡洛树搜索算法的描述正确的是( )",{"answer":59,"createTime":5,"id":6,"options":60,"question":15,"source":24,"type":40},[],[8,9,10,11],{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":24,"type":40},[],997976123,[65,66,67,68],"静态博弈和动态博弈","合作博弈和非合作博弈","完全信息博弈和不完全信息博弈","零和博弈和非零和博弈","按照博弈过程中参与者对信息的了解程度可以划分为( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":24,"type":79},[],997976138,[74,75,76,77],"结构因果模型又叫关系推理模型","这一模型追溯到"潜在结果的概念"","结果因果模型又叫因果模型","结构因果模型是因果图的一种","下列哪项关于结构因果模型的叙述是正确的( )",1,{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":24,"type":79},[],997976150,[84,85,86,87],"Alpha-Beta剪枝算法是一种常用在最小最大搜索算法中的剪枝算法","最小最大搜索算法交替探索两名玩家之间的决策博弈","最小最大搜索算法只能采用深度学习的方式实现","最小最大搜索算法是一种强化学习算法","下列哪项关于最小最大搜索算法的描述不正确( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":93,"source":24,"type":25},[],997976332,[21,22],"强化学习的目标是学习一个使奖励最大化的策略.( )"]