Representational geometry of dynamic programs described as shortest paths on DAGs, tropical polynomials, and Newton polyhedra isomorphic as semirings
Read the original at arxiv.org→arXiv:2608.25034v1 Announce Type: new Abstract: Standard neural architectures often fail to generalize to longer inputs for dynamic programming (DP) targets. We investigate what makes this hard geometrically. Every...
Original headline: "On the Representational Geometry of Dynamic Programs"
Coverage timeline
- Aug 27, 04:00 UTC arXiv cs.LG lead source On the Representational Geometry of Dynamic Programs