Optimization

TL;DR for operators If every conflicting pair in an allocation system must already be separated by at least $k$ units, the unresolved question is often not how far apart assignments can be pushed. It is how little total capacity is required to satisfy that rule. Hieu Truong Xuan and Khanh To Van formalize that question as Minimum Span Antibandwidth Labeling and Minimum Span Cyclic Antibandwidth Labeling.1 For a fixed separation requirement, feasibility moves monotonically with the candidate label-domain size: once a candidate range is large enough, every larger one is feasible as well. That structure lets an exact solver treat capacity as an ordered sequence of feasibility tests rather than a generic optimization variable. ...

TL;DR for operators A model has already fit its training set, held-out performance is still poor, and the training curve has entered a long plateau. The usual operational question is whether more updates are buying anything. The paper examined here gives a more specific answer: some plateaued runs can still be changing in a way that prepares later generalization. Pracher and colleagues’ A Spectral Theory of Grokking: Weight Decay induces Feature Learning1 argues that coupled L2 weight decay leaves structured residual error after an initially near-fixed-feature fit. The remaining error is larger in task components that the model’s current geometry represents weakly. Under the paper’s theoretical conditions, that residual can then push the geometry itself toward those task-relevant directions. ...

TL;DR for operators A business user can ask an optimization copilot for a schedule, allocation, or planning model while leaving objectives, constraints, or policy boundaries partly unstated. Two plausible interpretations can then produce different mathematical formulations even when both look coherent. The risk is not bad algebra. It is premature formulation. OR-Clarify, introduced in Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization,1 evaluates whether an agent identifies formulation-critical missing information before modeling, recovers it through questioning, avoids filling gaps with unconfirmed defaults, and stops at an appropriate point. ...

TL;DR for operators A deception system that responds the same way whether a session looks routine or highly suspicious leaves useful threat information unused. Chameleon tests a different design: estimated threat severity changes how aggressively the honeypot searches for engagement settings and which deception paths receive reinforcement, rather than merely changing the terminal reply. ...

TL;DR for operators LoRA is usually sold as a rank-and-cost compromise: train a small low-rank adapter instead of updating the whole model, accept some performance gap, and enjoy the budget meeting. The paper behind SDS-LoRA argues that this explanation is incomplete. The gap is not only because the adapter is low-rank. It is also because standard LoRA can distort the training signal that flows into that adapter.1 ...

Scheduling a factory, routing a fleet, pricing airline seats, allocating scarce capacity: these are not “write me a Python script” problems with nicer stationery. In real operations research, the useful answer is not merely a correct mathematical model. It is a method that stays feasible, keeps solution quality high, and finishes before the business context has expired. ...

No Easy A: Why AI Training Needs Hard-Case Routing AI teams like to say they are “improving the model.” Very noble. Also conveniently vague. In practice, “improvement” usually means one of three things: collect more data, buy a larger model, or run another round of fine-tuning and hope the loss curve behaves like a polite employee. The two papers in this cluster suggest a less glamorous, more useful idea: the scarce resource is not only data or parameters. It is learning pressure. ...

GPU memory is the part of AI strategy that does not care about adjectives. A team can say it is building a domain LLM, a private copilot, a long-context research assistant, or a fine-tuned enterprise model. The budget spreadsheet eventually asks a colder question: what actually fits on the available hardware? Model weights need memory. Gradients need memory. Activations need memory. Checkpoints need memory. And the optimizer — the quiet machinery that decides how parameters move during training — can require multiple additional copies of the model itself. ...

A developer asks an LLM to “write a better algorithm.” The LLM obliges. It writes code. The code runs, perhaps after a few rounds of apologetic debugging. The result is slightly better than the baseline, or at least sufficiently mysterious to be called “novel.” Everyone nods politely. Another benchmark table is born. ...

A warehouse manager does not ask for “a constraint optimization problem.” She asks whether tomorrow’s orders can be shipped without overtime. A university administrator does not request “a mixed-integer formulation.” He asks whether lectures can be scheduled without room conflicts. A retail planner does not want “a MiniZinc model.” She wants to know which stores should receive scarce inventory before the promotion starts. ...