You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
thanks for this cool little package. I have a feature request/question. In discrete choice models (for example in this paper equation 14 ) we often have a smoothed version of the log sum function. that is, instead of
alpha + log( sum (exp( x - alpha ) ) )
we'd have
alpha + σ log( sum (exp( (x - alpha)/σ ) ) )
I was trying to think how to add this to the package (maybe in my own fork if this turns out non of interest here), but I'm not totally sure where. My best guess would have been to do the division by sigma in places like here, but not totally certain. thanks for any hints!
The text was updated successfully, but these errors were encountered:
Unfortunately, the implementation of logsumexp is not as simple and straightforward to read as I would like it to be, mainly because it is supposed to cover a variety of different use cases in an optimal way, e.g., regular arrays, iterators, and GPU arrays (JuliaStats/StatsFuns.jl#97). It's an implementation of the one-pass algorithm. To me it seems one would have to change
thanks for this cool little package. I have a feature request/question. In discrete choice models (for example in this paper equation 14 ) we often have a smoothed version of the log sum function. that is, instead of
we'd have
I was trying to think how to add this to the package (maybe in my own fork if this turns out non of interest here), but I'm not totally sure where. My best guess would have been to do the division by sigma in places like here, but not totally certain. thanks for any hints!
The text was updated successfully, but these errors were encountered: