2 papers
cs.GT2026
Self-Bounding Regret Matching+ in Potential Games and Product-Simplex Optimization
Pahan Dewasurendra, Subhashini Jayawardhana
Regret matching+ (RM+) is parameter free, scale invariant, and central to large game solving, but its only general individual-regret guarantee grows as . A recent ICLR re…
cs.CC2026
Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants
Pahan Dewasurendra, Subhashini Jayawardhana
Input-convex neural networks permit globally tractable minimization over their inputs, so one might expect their global regularity to be tractable in low input dimension. We prove…