SearcharxivSearch

arXiv subjects

Abderrahmane Driouch

Publications and source records attributed to Abderrahmane Driouch.

2 recordsLinked to original sources

CG4AI: A Column Generation Framework for Training AI Models Under Constraints

Standard machine-learning training minimizes a loss function over a dataset, but does not guarantee that the resulting model will satisfy predefined rules or constraints on its outputs. In many real-world applications, ranging from autonomous systems to network routing, such guarantees are essential. We propose CG4AI, a framework that builds a convex combination of AI models while enforcing linear constraints on the combined output. A master linear program (LP) determines the optimal mixture weights, while a pricing subproblem generates new models guided by LP dual variables, focusing attention on the most violated constraints. A cutting-plane procedure extends feasibility guarantees beyond the training set. We apply CG4AI to two problems: (i) digit classification on MNIST, where we demonstrate four distinct uses of constraints, learning from constraints alone, improving adversarial robustness, correcting misclassified examples, and enforcing output relabeling; and (ii) the multi-commodity flow problem, where link capacity constraints are enforced on neural-network routing predictors. Experiments on MNIST and standard SNDLIB benchmark networks show that CG4AI reliably produces feasible predictors while achieving better accuracy than single-model baselines.

cs.LG

Bucket Brigades: Uniqueness of the Fixed Point and Three-Worker Asymptotics

A standard organization of production lines exhibiting self-balancing behavior is given by bucket brigades. Their study in operations research was initiated by the foundational work of Bartholdi and Eisenstein ({\em Operations Research}, 1996), where a simplified version of the model is considered. Their main result shows that when workers are ordered from the slowest to the fastest, the system is stable and converges to a ``fixed point,'' where each worker oscillates between two limiting positions. They also observe that the dynamics can become highly complex when this ordering condition is not satisfied. The {\em no-station} setting, in which work is distributed continuously and uniformly along the production line, is given special attention in their work. In a subsequent paper with Bunimovich ({\em Operations Research}, 1999), they characterize all stable behaviors of this setting for up to three workers. In this work, we extend their analysis for three workers beyond the stable regime, providing a complete description when workers are ordered from the fastest to the slowest. We also show that, due to their restrictive notion of stability, some of their conclusions must be revisited. Finally, for an arbitrary number of workers, we prove that the fixed point is always unique in the no-station setting.

math.DS