15.8 kB
Ctrl+K
Update logbook: Reproduction: A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization
2072fca verified - claim-1-c1-scent-s-stochastic-proximal-mirror-descent-update-for-the-dual-variabl
- claim-2-c2-theorem-3-6-proves-scent-achieves-an-o-1-sqrt-t-convergence-rate-for
- claim-3-c3-lemma-3-3-proves-the-dual-iterates-nu-i-t-remain-bounded-within-an-i
- claim-4-c4-theorem-4-3-shows-that-for-fixed-w-spmd-s-convergence-is-characterize
- claim-5-c5-on-extreme-classification-benchmarks-glint360k-and-treeoflife-10m-sce
- claim-6-c6-on-partial-auc-maximization-over-cifar-10-and-cifar-100-scent-matches
- conclusion
- executive-summary
- 1.26 kB