2 ms·
So, two observations. First, how does this compare to the naive method of SGD with differentiation defined using something like simplex search? The second ques
by mpoteat 7y ago
So, two observations. First, how does this compare to the naive method of SGD with differentiation defined using something like simplex search?
The second question, if this is fully differentiate, how do you define the existence of an polytope in a scene in differentiable way? Is the input space for a given parameter optimization limited to material or phong / specular parameters?
- marmaduke 7y agoGradient based algorithms are more efficient for large parameter spaces. For second question, the discussion mentions that there are lots of non-differentiable parameters and they don't handle that.