Original title: Consensus-based optimization for linearly separable functions
Christian Fiedler, Tim Roith · September 2026
Finding the absolute best solution to complex math problems gets harder when you add many variables. Consensus-based optimization, or CBO, uses a group of interacting particles to explore and find this best point. Researchers often add anisotropic noise—random exploration along coordinate axes—to help it handle many variables. However, this trick fails if the problem is rotated even slightly, because it depends on the variables being cleanly separable. To fix this, the authors studied functions that become separable only after a linear coordinate shift. They built a reparametrisation method that provably discovers this rotated coordinate system, letting CBO work in the new variables. This approach also acts as noise adaptation, yielding significant performance improvements on tough benchmark tests.
Imagine sorting laundry in a dark room by touch alone. Normally you can feel the difference between socks and shirts, but when clothes are twisted and tangled, your hands get confused and you waste time. Here, the optimization tool is like sorting by touch, and the problem is that the clothes are twisted in a way that makes sorting hard. The new scheme is like turning on a light to straighten the clothes first, so you can group them correctly from the start.
Scientists and engineers using optimization for complex, high-dimensional problems often face slowdowns when variables aren't independent. This method makes optimization more reliable when problems are rotated, saving computational time in real-world applications.
The abstract doesn't specify limitations, but the method is designed for linearly separable functions, so it may not handle non-separable or non-linear problems. The approach adds a step of estimating the transformation, which could introduce complexity.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
Consensus-based optimization for linearly separable functions — Christian Fiedler, Tim Roith
Abstract licence: CC0
Explanation generated by Synthesis from the abstract — it is not the original paper. This is a preprint, so it hasn't necessarily been peer reviewed.