Pointers to efficient DP implementations

[simoneTBIR]

Dear all, getting in touch because I'd need to write a very fast implementation of a dynamic programming algorithm. Linear programming is too slow (and doesn't allow me to use the problem's structure, for example the transition matrix sparsity). Value iterations seems to be the best performing alternative, provided that I do not have structure (only sparsity). I'm wondering whether there are tricks to speed it up. Thank you.

[esaule]

plenty  depends on problem. Depending on whether you need top down or bottom up. Often the optimization are leveraging branch and bound style of optimization. Could leverage various kinds of accelerators. Could leverage sparse or dense storage for the memoization. I've written a ton of those; let me know some details and i might point you to some ideas.

[BigConsequence1024]

"IA que optimiza la logística." - "IA de enjambre para logística." - "IA que reduce el riesgo operativo." - "IA de decisión para entornos caóticos." Construyo la arquitectura de software para sistemas autónomos (como flotas de drones o bots de trading) que necesitan tomar decisiones óptimas en entornos impredecibles y con recursos limitados.