54 slp_assert(wrt.
cols() == 1);
59 if (m_top_list.empty()) {
64 m_top_list[0]->adjoint_expr = make_expression_ptr<ConstExpression>(1.0);
70 for (
auto& node : m_top_list) {
71 auto& lhs = node->args[0];
72 auto& rhs = node->args[1];
75 lhs->adjoint_expr += node->grad_expr_l(lhs, rhs, node->adjoint_expr);
77 rhs->adjoint_expr += node->grad_expr_r(lhs, rhs, node->adjoint_expr);
84 for (
int row = 0; row < grad.rows(); ++row) {
85 grad[row] =
Variable{std::move(wrt[row].expr->adjoint_expr)};
91 for (
auto& node : m_top_list) {
92 node->adjoint_expr =
nullptr;
108 gch::small_vector<Eigen::Triplet<double>>& triplets,
int row,
114 if (
static_cast<size_t>(wrt.
rows()) < m_top_list.size()) {
115 for (
const auto& elem : wrt) {
116 elem.expr->adjoint = 0.0;
120 if (m_top_list.empty()) {
125 m_top_list[0]->adjoint = 1.0;
128 for (
auto& node : m_top_list | std::views::drop(1)) {
136 for (
const auto& node : m_top_list) {
137 auto& lhs = node->args[0];
138 auto& rhs = node->args[1];
140 if (lhs !=
nullptr) {
141 if (rhs !=
nullptr) {
142 lhs->adjoint += node->grad_l(lhs->val, rhs->val, node->adjoint);
143 rhs->adjoint += node->grad_r(lhs->val, rhs->val, node->adjoint);
145 lhs->adjoint += node->grad_l(lhs->val, 0.0, node->adjoint);
151 if (
static_cast<size_t>(wrt.
rows()) < m_top_list.size()) {
152 for (
int col = 0; col < wrt.
rows(); ++col) {
153 const auto& node = wrt[col].expr;
156 if (node->adjoint != 0.0) {
157 triplets.emplace_back(row, col, node->adjoint);
161 for (
const auto& [col, node] : std::views::zip(m_col_list, m_top_list)) {
163 if (col != -1 && node->adjoint != 0.0) {
164 triplets.emplace_back(row, col, node->adjoint);