2 Projectiononthe(n,k)-simplex Weconsiderthefollowingprojectionproblem: pα(z)=argmin

Neural Information Processing Systems 

Usually, this is done by projecting the score vector onto a probability simplex, and such projections are often characterized as Lipschitz continuous approximations of the argmax function, whose Lipschitz constant is controlled by a parameter that is similar to a softmax temperature.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found