On the Representational Geometry of Dynamic Programs

arXiv:2608.25034 · cs.LG, cs.DM, math.AG, math.CO · Submitted 2026-08-25 · Read on arXiv

cs.LG, cs.DM, math.AG, math.CO

Submitted: 2026-08-25

Updated: 2026-08-25

Terminology

• Generalization — 5× in this paper · explained in 13 episodes
• Alignment — 1× in this paper · explained in 1 episode
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Redundancy — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks