Accurately computing the log-sum-exp and softmax functions
From MaRDI portal
Recommendations
Cited in
(18)- logsumexp-softmax-tests
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- An approximation scheme for distributionally robust PDE-constrained optimization
- A note on generalized second-order value iteration in Markov decision processes
- Variational Bayes estimation of hierarchical Dirichlet-multinomial mixtures for text clustering
- Accurate Computation of the Log-Sum-Exp and Softmax Functions
- An adaptive covariance parameterization technique for the ensemble Gaussian mixture filter
- LN: a flexible algorithmic framework for layered queueing network analysis
- A charge-preserving method for solving graph neural diffusion networks
- Marked Cox models for IBNR claims count: continuous and discretized approaches with Dirichlet-driven reporting delays
- Laplace meets Moreau: smooth approximation to infimal convolutions using Laplace's method
- Mechanical state estimation with a polynomial-chaos-based statistical finite element method
- Differentiable neural network representation of multi-well, locally-convex potentials
- Formally verified roundoff error bounds on LogSumExp-based computations
- On the modulus of Lipschitz smoothness of log-sum-exp function
- Branch-and-bound method for calculating Viterbi path in triplet Markov models
- Solving hypervolume scalarizations for MOCO problems
- A Taylor-Bernstein inner approximation algorithm for path-constrained dynamic optimization
This page was built for publication: Accurately computing the log-sum-exp and softmax functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077058)
