CORTEXA
← Browse
arxivcs.LGmath.OCstat.ML2026-06-26

Dangerous Liaisons of Convex Learning and Non-Affine Aggregation

Thomas Boudou, Batiste Le Bars, Nirupam Gupta, Aurélien Bellet

Last-iterate convergence and generalization guarantees in first-order convex learning hinge on the monotonicity of the update operator. While linear averaging preserves the monotonicity of gradient updates, this property is often violated when gradients are aggregated non-affinely, as in modern pipelines enforcing constraints like adaptivity, privacy, robustness or fairness. Whether it is possible to design non-affine aggregation rules that maintain monotonicity has remained an open question. We answer this question negatively: we prove that the monotonicity of aggregated gradients is preserved if and only if the aggregation rule is positively affine. Consequently, non-affine aggregation prevents steady convergence and substantially degrade algorithmic stability. We quantify these drawbacks and propose a path forward by identifying sufficient conditions under which monotonicity can be restored. Our results provide a unified theoretical framework explaining the disparate failure modes observed in modern learning systems.

View free PDFSource page

Related papers

arxivcs.LGmath.OCstat.ML2026-06-29

Curvature-Weighted Gradient Diversity: A Noise Measure for Geometry-Adaptive SGD Schedules

Muhammad Hamza, Ayush Goel

The standard convergence analysis of mini-batch stochastic gradient descent (SGD) models gradient noise using a single variance term that treats all parameter directions equally, ignoring the fact that noise in high-curvature directions has less impact because learning rates are…

View free PDFSource page
arxivmath.OCcs.LGstat.ML2026-07-08

Mathematical methods of reinforcement learning

Denis Belomestny, Alexander Gasnikov, Egor Gladin, Alexey Naumov, Artemy Rubtsov, Yuri Sapronov, et al.

Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) an…

View free PDFSource page
arxivstat.APcs.LGmath.OCstat.MLstat.OT2026-07-16

Proactive Inpatient Bed Requests for Emergency Department Admissions

QIan Cheng, Nilay Tanik Argon, Aniruddhan Ganesaraman, Serhan Ziya

Emergency department (ED) boarding occurs when admitted patients remain in the ED while awaiting inpatient beds. Boarding is a major driver of ED crowding and has been associated with poor patient outcomes. We propose a framework to help EDs reduce boarding time and length of sta…

View free PDFSource page
arxivstat.MLcs.LGmath.OC2026-07-08

Expressivity and Statistical Trade-offs in Diffusion Policy Learning

Viet Vu, Renyuan Xu, Jiacheng Zhang, Yufei Zhang

Diffusion-based policies have recently emerged as powerful policy parameterizations for reinforcement learning, representing state-conditioned action distributions as terminal laws of diffusion processes with parameterized drifts. This terminal-law representation has shown substa…

View free PDFSource page