torch in 60min
本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来源 Lesereinの小木屋！
微信
支付宝
相关推荐
2025-04-02
李宏毅ml note
Intro Traning Function 使用 model: y=b+wx1y = b+wx_{1}y=b+wx1 其中，www 表示 weight，bbb 表示 bias Loss function 表示： L(b,w)L(b,w)L(b,w) Optimization 一般性方法： 梯度下降法（gradient descent） 选择起始点 w0w_0w0 计算梯度 η∂L∂w∣w=w0\eta\frac{\partial L}{\partial w}|_{w = w^0}η∂w∂L∣w=w0 (η\etaη 表示学习率 learning rate) 更新 w: w1←w0−η∂L∂w∣w=w0w_1 \leftarrow w_{0 }-\eta\frac{\partial L}{\partial w}|_{w = w^0}w1←w0−η∂w∂L∣w=w0 b 作同样操作使 L 最小 More sophisticated models 多个 model 叠加 线性叠加 使用多个线性 model 叠加即可得到更为复杂的函数拟合曲线 Sigmoid...
2025-02-24
AI基础 笔记I
Intro Search: Formulation and Solution (s) Agent categories Rational agent Reflex agent Planning agent Have the model of how the world evolves. Optimal and replannning. Formulation Basic Elements of Search Problem State Space world state search state Successor Function Start state (to start the search) and goal test (to terminate the search) Solution Search graph A mathematical formulation of Search Problem: G={V, E} Nodes V: States IN State Space Edges/Arcs E: Successor Functions...
2025-03-24
AI基础 笔记II
CSP 概述 组成 A special subset of search problems. State is defined by variables XiX_iXi with values from a domain DDD (sometimes D depends on i). Goal test is a set of constraints specifying allowable combinations of values for subsets of variables 分类 Binary CSP: each constraint relates (at most) two variables. Binary constraint graph: nodes are variables, arcs show constraints. General-purpose CSP algorithms use the graph structure to speed up...
评论
