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.
Neural Information Processing Systems
Feb-7-2026, 09:14:23 GMT
- Country:
- Technology: