# Operations research and optimization

Operations research is a discipline that applies mathematical modeling, statistical analysis, and optimization to resource-allocation and decision problems, often solved computationally.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Variational analysis of determinantal varieties

DevFeed: [Variational analysis of determinantal varieties](<https://devfeed.tech/articles/variational-analysis-of-determinantal-varieties-144866.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2511.22613>)

Author: Yan Yang, Bin Gao, Ya-xiang Yuan

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [applications](<https://devfeed.tech/tags/applications.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [low-rank](<https://devfeed.tech/tags/low-rank.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [matrix](<https://devfeed.tech/tags/matrix.md>), [np](<https://devfeed.tech/tags/np.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [tangent](<https://devfeed.tech/tags/tangent.md>)

### AI overview

The paper develops explicit first- and second-order tangent-set formulas for low-rank matrices, tensors, symmetric matrices, and positive semidefinite matrices, including an intersection rule under stated assumptions. It uses these tools to derive optimality conditions and a criterion for when a nonsmooth problem and its smooth parameterization have equivalent second-order stationary points; it also proves that checking second-order optimality is NP-hard. For low-rank semidefinite programs, it shows that fourth-order stationary points under the Burer-Monteiro parameterization map to second-order stationary points of the original problem. Separately, it characterizes tangent and normal cones to the graph of the normal cone for matrix varieties and applies these results to low-rank bilevel optimality conditions.

### Source excerpt

arXiv:2511.22613v3 Announce Type: replace-cross Abstract: Determinantal varieties---the sets of bounded-rank matrices or tensors---have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The second-order geometry, which encodes curvature information, is more intricate. In this work, we develop a unified framework to derive explicit formulas for both first- and second-order tangent sets to various low-rank sets, including low-rank matrices, tensors, symmetric matrices, and positive semidefinite matrices. The framework also accommodates the intersection of a low-rank set and another set satisfying some assumptions, thereby yielding a tangent intersection rule. Through the lens of tangent sets, we establish a necessary and sufficient condition under which a nonsmooth problem and its smooth parameterization share equivalent second-order stationary points. As applications, we exploit tangent sets to characterize optimality conditions for low-rank optimization and prove that verifying second-order optimality is NP-hard. Moreover, for low-rank semidefinite programs, the Burer--Monteiro parameterization maps fourth-order stationary points of the parameterized problem to second-order stationary points of the original problem. In a separate line of analysis, we investigate variational geometry of the graph of the normal cone to matrix varieties, deriving the explicit Bouligand tangent cone, Fr\'echet and Mordukhovich normal cones to the graph. These results are further applied to develop optimality conditions for low-rank bilevel programs.

## HapBO: Harnessed $\\alpha$-$\\pi$ Bayesian Optimization via Expert Natural Language Priors

DevFeed: [HapBO: Harnessed $\\alpha$-$\\pi$ Bayesian Optimization via Expert Natural Language Priors](<https://devfeed.tech/articles/hapbo-harnessed-alpha-pi-bayesian-optimization-via-expert-natural-language-priors-145008.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25100>)

Author: Jean-S\\'ebastien Giroux, Rose Guay Hottin, Marco Bonizzato

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [adversarial](<https://devfeed.tech/tags/adversarial.md>), [applications](<https://devfeed.tech/tags/applications.md>), [based](<https://devfeed.tech/tags/based.md>), [bayesian](<https://devfeed.tech/tags/bayesian.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dimensions](<https://devfeed.tech/tags/dimensions.md>), [family](<https://devfeed.tech/tags/family.md>), [function](<https://devfeed.tech/tags/function.md>), [gaussian](<https://devfeed.tech/tags/gaussian.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [large-language-model](<https://devfeed.tech/tags/large-language-model.md>), [natural-language](<https://devfeed.tech/tags/natural-language.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [probability](<https://devfeed.tech/tags/probability.md>), [queries](<https://devfeed.tech/tags/queries.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [solar](<https://devfeed.tech/tags/solar.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [token-cost](<https://devfeed.tech/tags/token-cost.md>), [token-costs](<https://devfeed.tech/tags/token-costs.md>)

### AI overview

HapBO turns natural-language expert or LLM knowledge into a structured, reusable belief function, elicited once and used as a bounded positive multiplier on nonnegative Bayesian optimization acquisitions. Its expressive representation is not limited to Gaussian priors, and optimization requires no further LLM calls. For Expected Improvement, the authors prove the standard simple-regret rate is preserved up to a bounded factor, even with adversarial beliefs. Across 40 HPOBench tasks, a synthetic suite in 6-15 dimensions, and applications in cortical neurostimulation and constrained solar design, HapBO reports the lowest aggregate HPOBench regret and strong real-world performance. The abstract says it improves real-world outcomes at budgets of 12-20 queries, with lower wall-clock and token costs than other LLM-based methods.

### Source excerpt

arXiv:2611.25100v1 Announce Type: new Abstract: Bayesian Optimization (BO) can be substantially more sample-efficient when informed by prior knowledge about the problem. In practice, however, such knowledge is often available only in natural language, e.g., expert intuitions or documentation, rather than as the explicit probability distribution landscape that prior-guided BO methods may require. Leveraging it effectively demands both an expressive mapping from language to priors and robustness to information that may be misleading. We propose HapBO (Harnessed $\alpha$-$\pi$ Bayesian Optimization), which elicits beliefs once from a human expert, a large language model (LLM), or both, and deterministically compiles a structured specification into a reusable belief function ($\pi: \mathcal{X} \to[0,1]$), with a rich representation not restricted to a Gaussian family. Building on $\alpha$-$\pi$BO, HapBO applies this belief function through a bounded positive multiplier on any nonnegative acquisition, preserving positive acquisition support and requiring no LLM calls during optimization. We prove that, for the Expected Improvement acquisition function (EI), HapBO preserves the standard simple-regret rate up to a bounded factor, even under adversarial beliefs. We evaluate HapBO on 40 HPOBench tasks, a synthetic suite in 6-15 dimensions and two real-world applications: cortical neurostimulation and constrained solar design. HapBO achieves the lowest aggregate HPOBench regret and strong real-world task performance, with zero in-loop token cost. In real-world applications it improves the optimization outcome even at budgets of 12-20 queries, and at a small fraction of the wall-clock and token costs of other LLM-based methods.

## Bayesian optimization on amortized search space

DevFeed: [Bayesian optimization on amortized search space](<https://devfeed.tech/articles/bayesian-optimization-on-amortized-search-space-145184.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26459>)

Author: Tristan Fauvel, Federico Pavone, Titouan Guillou, Pau Redon Mu\\~noz, Chlo\\'e Geoffroy

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [bayesian](<https://devfeed.tech/tags/bayesian.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [search](<https://devfeed.tech/tags/search.md>), [space](<https://devfeed.tech/tags/space.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The method uses an amortized inverse map of an approximate mechanistic simulator to constrain Bayesian optimization to a learned, low-dimensional search space, while a Gaussian process kernel retains awareness of the original problem geometry. The authors characterize approximation bias and information gain and derive a regret rate dependent on intrinsic dimension, under additional geometric and Gaussian process assumptions. In Parkinson's disease dosing personalization, a neural network is trained offline on a PK/PD model calibrated to population data with quantified parameter uncertainty; online optimization then searches the learned representation instead of raw dosages. Numerical simulations report improved performance in this application and under simulator misspecification.

### Source excerpt

arXiv:2611.26459v1 Announce Type: cross Abstract: In real-world black-box optimization problems, a mechanistic simulator is often available that approximately predicts the behavior of the system as a function of the parameters being optimized. Here, we show how an amortized inverse map of such a simulator can be used in Bayesian optimization to restrict the search space while using a Gaussian process kernel that is aware of the original problem geometry. This allows for efficiently leveraging the low intrinsic dimensionality of the optimization problem. We characterize its approximation bias and information gain, and derive an intrinsic-dimension-dependent regret rate under additional geometric and Gaussian Process assumptions. We illustrate the method with an application to drug dosing personalization in Parkinson's disease. We use, as a simulator, a pharmacokinetic/pharmacodynamic (PK/PD) model of a drug, a mechanistic model calibrated on population data with quantified parameter uncertainty. A dosing neural network is trained offline against the model, amortizing the map from patient PK/PD parameters to the regimen predicted to be optimal, and online Bayesian optimization then searches over this learned, low-dimensional representation rather than over raw dosages. Numerical simulations demonstrate the improved performance of our method in this application, as well as under simulator misspecification.

## Active Learning For Contextual Linear Optimization: A Margin-Based Approach

DevFeed: [Active Learning For Contextual Linear Optimization: A Margin-Based Approach](<https://devfeed.tech/articles/active-learning-for-contextual-linear-optimization-a-margin-based-approach-144847.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2305.06584>)

Author: Mo Liu, Paul Grigas, Heyuan Liu, Zuo-Jun Max Shen

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [applications](<https://devfeed.tech/tags/applications.md>), [batches](<https://devfeed.tech/tags/batches.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [gaussian](<https://devfeed.tech/tags/gaussian.md>), [learning](<https://devfeed.tech/tags/learning.md>), [linear](<https://devfeed.tech/tags/linear.md>), [margin](<https://devfeed.tech/tags/margin.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [pricing](<https://devfeed.tech/tags/pricing.md>), [shortest-path](<https://devfeed.tech/tags/shortest-path.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The paper proposes an active learning method for contextual linear optimization that requests objective-coefficient labels selectively from an unlabeled feature stream. It uses the distance to degeneracy as a margin criterion tied to Smart Predict-then-Optimize (SPO) loss, selecting samples below a threshold in batches. The authors derive non-asymptotic bounds for direct SPO-loss minimization over a general hypothesis class and surrogate-loss minimization over a linear prediction class. Under stated natural conditions, the method can achieve the same excess population risk as supervised learning with fewer labels; examples establish such conditions under continuous (sub-)Gaussian noise. Numerical results illustrate applications to personalized pricing and shortest-path problems.

### Source excerpt

arXiv:2305.06584v3 Announce Type: replace Abstract: We develop the first active learning method for contextual linear optimization. Specifically, we introduce a label acquisition algorithm that sequentially decides whether to request the ``labels'' of feature samples arriving in an unlabeled data stream, where the labels correspond to the objective coefficients in the linear optimization problem. The label acquisition rule is guided by the decision loss induced by the predicted coefficients, known as the Smart Predict-then-Optimize (SPO) loss. Motivated by the structure of the SPO loss, our algorithm uses the distance to degeneracy as a margin-based criterion for label acquisition. The algorithm processes incoming feature samples in batches, acquiring within each batch only the labels of samples whose distance to degeneracy falls below a rejection threshold. We derive non-asymptotic bounds for direct SPO-loss minimization over a general hypothesis class and for surrogate-loss minimization over a linear prediction class. These bounds demonstrate that, under certain natural conditions, our margin-based active learning algorithm requires fewer labels than supervised learning to achieve the same excess population risk for the chosen training loss. We provide concrete examples in which these conditions hold under continuous (sub-)Gaussian noise. Finally, we present numerical evidence demonstrating the practical value of our approach in applications such as personalized pricing and shortest-path problems.

## Learning with Local Search MCMC Layers

DevFeed: [Learning with Local Search MCMC Layers](<https://devfeed.tech/articles/learning-with-local-search-mcmc-layers-144853.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2505.14240>)

Author: Germain Vivier-Ardisson, Mathieu Blondel, Axel Parmentier

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [layers](<https://devfeed.tech/tags/layers.md>), [learning](<https://devfeed.tech/tags/learning.md>), [local](<https://devfeed.tech/tags/local.md>), [mcmc](<https://devfeed.tech/tags/mcmc.md>), [search](<https://devfeed.tech/tags/search.md>)

### AI overview

The paper turns local search neighborhoods into proposal distributions for MCMC over feasible solutions, yielding differentiable, stochastic combinatorial layers and associated loss functions for learning with inexact solvers. The approach is motivated by NP-hard problems where exact solvers are costly; the abstract reports that replacing them with local search strongly reduces learning computation. Demonstrations include dynamic vehicle routing with time windows, binary vector and k-subset prediction, and decision-focused learning for multidimensional knapsack. The excerpt does not provide details on theoretical guarantees or comparative results.

### Source excerpt

arXiv:2505.14240v4 Announce Type: replace Abstract: Integrating combinatorial optimization layers into neural networks has recently attracted significant research interest. However, many existing approaches lack theoretical guarantees or fail to perform adequately when relying on inexact solvers. This is a critical limitation, as many operations research problems are NP-hard, often necessitating the use of neighborhood-based local search heuristics. In this paper, we introduce a principled approach for learning with such inexact solvers. Inspired by the connection between simulated annealing and Metropolis-Hastings, we transform the problem specific neighborhood systems used in local search heuristics into proposal distributions, implementing MCMC on the set of feasible solutions. This allows us to construct differentiable, stochastic combinatorial layers and associated loss functions. Replacing an exact solver with a local search strongly reduces the computational burden of learning on many applications. We demonstrate our approach on a dynamic vehicle routing problem with time windows, binary vector and k-subset prediction tasks, as well as a multi-dimensional knapsack decision-focused learning problem.

## Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters

DevFeed: [Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters](<https://devfeed.tech/articles/quantum-annealing-with-a-quantum-neural-network-width-of-annealing-matters-143482.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24089>)

Author: Mojtaba Asadollahi, Danial Khajehzadeh, Abolfazl Ramezanpour

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [cond-mat-dis-nn](<https://devfeed.tech/tags/cond-mat-dis-nn.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>)

### AI overview

The paper extends quantum annealing with a quantum neural network to address limitations associated with exponentially shrinking energy gaps at discontinuous quantum phase transitions. In the quantum search problem, a random network of width W = 2 reportedly reduces the required annealing depth exponentially; with tuned parameters, a quantum perceptron of depth L = 1 and width W = 2 achieves exponentially small errors. The authors attribute improved success probability to the wider network's larger, learnable evolution space. These claims are based on the abstract's reported prototypical optimization problem results.

### Source excerpt

arXiv:2611.24089v1 Announce Type: cross Abstract: Quantum annealing is a promising quantum algorithm for dealing with computationally hard optimization problems. Currently available hardware can implement the algorithm for a significant class of Hamiltonian problems. However, its performance is especially limited in discontinuous quantum phase transitions, where the energy gap shrinks exponentially with system size. In this paper, we introduce an extension of quantum annealing to a quantum neural network and study its performance in a number of prototypical optimization problems. In particular, we observe that already a random quantum annealing network of width W = 2 can exponentially reduce the number of evolution layers or depth of the annealing process in the quantum search problem. By tuning the network parameters the search problem can be solved with exponentially small errors by a quantum perceptron of depth L = 1 and width W = 2. The findings show that width of a quantum annealing network is critical to enhance the success probability of the algorithm by providing a larger and learnable evolution space for the annealing process.

## CoSlice: Coordinated Multi-Agent Reinforcement Learning for 5G Network Slicing Allocation

DevFeed: [CoSlice: Coordinated Multi-Agent Reinforcement Learning for 5G Network Slicing Allocation](<https://devfeed.tech/articles/coslice-coordinated-multi-agent-reinforcement-learning-for-5g-network-slicing-allocation-142996.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23909>)

Author: Pengxin Wang, Nakjung Choi, Jingdi Chen

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>), [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [AI Networking](<https://devfeed.tech/topics/ai-networking.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [5g](<https://devfeed.tech/tags/5g.md>), [agent](<https://devfeed.tech/tags/agent.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [application](<https://devfeed.tech/tags/application.md>), [budget](<https://devfeed.tech/tags/budget.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [environment](<https://devfeed.tech/tags/environment.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [execution](<https://devfeed.tech/tags/execution.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [fast](<https://devfeed.tech/tags/fast.md>), [framework](<https://devfeed.tech/tags/framework.md>), [game](<https://devfeed.tech/tags/game.md>), [global](<https://devfeed.tech/tags/global.md>), [global-network](<https://devfeed.tech/tags/global-network.md>), [learning](<https://devfeed.tech/tags/learning.md>), [multi-agent](<https://devfeed.tech/tags/multi-agent.md>), [network](<https://devfeed.tech/tags/network.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>)

### AI overview

CoSlice combines fast, preference-conditioned slice agents with a slower LLM coordinator that adjusts their objectives using global network observations to allocate O-RAN physical resource blocks. The authors frame allocation as a multi-objective partially observable stochastic game, report a Preference Correlated Equilibrium and a sublinear regret bound, and train the system through multi-objective pretraining followed by joint optimization. In an evaluation environment built with ORANSlice and RFsim, experiments across diverse slice workloads found lower average and tail SLA violations than centralized and multi-agent baselines. The evidence provided is an abstract, so it does not specify effect sizes or implementation details.

### Source excerpt

arXiv:2611.23909v1 Announce Type: new Abstract: Radio Access Network (RAN) slicing is a shared resource allocation problem: each slice seeks to satisfy its Service Level Agreement (SLA) with minimal radio-resource consumption, while all slices compete for a limited resource budget. This creates both an intra-slice trade-off between SLA assurance and resource efficiency and an inter-slice conflict over shared resources, calling for specialized yet coordinated control. In this work, we present CoSlice, a coordinated multi-agent reinforcement learning framework for inter-slice physical resource block allocation in Open Radio Access Network (O-RAN). CoSlice uses preference-conditioned slice agents for fast resource allocation and an LLM-based coordinator to adapt their objectives using global network observations at a slower timescale. We formulate the problem as a multi-objective partially observable stochastic game (mo-POSG), establish the existence of a Preference Correlated Equilibrium, and derive a sublinear regret bound for the learning procedure. We implement the algorithm by using a two-stage training procedure that consists of multi-objective pretraining and joint optimization. We build a network slicing evaluation environment using ORANSlice and its radio-frequency simulator (RFsim), supporting realistic protocol-stack execution and application traffic across multiple slices. Experimental results show that CoSlice reduces both average and tail SLA violations compared with other centralized and multi-agent baselines under diverse slice workloads.

## When Exact Inference Changes Code Selection: A Decision-Theoretic Analysis of B4

DevFeed: [When Exact Inference Changes Code Selection: A Decision-Theoretic Analysis of B4](<https://devfeed.tech/articles/when-exact-inference-changes-code-selection-a-decision-theoretic-analysis-of-b4-142167.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23306>)

Author: Yanliang Cai (Independent Researcher)

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [mutation-testing](<https://devfeed.tech/topics/mutation-testing.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [decision](<https://devfeed.tech/tags/decision.md>), [inference](<https://devfeed.tech/tags/inference.md>), [model](<https://devfeed.tech/tags/model.md>), [selection](<https://devfeed.tech/tags/selection.md>), [software-testing](<https://devfeed.tech/tags/software-testing.md>), [validation](<https://devfeed.tech/tags/validation.md>)

### AI overview

In the B4 code-test model, exact candidate marginalization can be computed efficiently by grouping programs with identical execution signatures, while a prior-budget condition identifies when B4's whole-group rule already achieves joint MAP. A finite correction bound can certify when marginalization will preserve the selected group. In default settings, no candidate changes appeared in 2,421 development comparisons or 4,035 comparisons on a separate archive. Across 80 literature-derived priors, 85 of 107,600 comparisons changed top sets; only six coincided with failure of whole-group MAP. Finite-test proxy labels showed four changes increasing and five decreasing expected success, across seven snapshots, with per-prior mean differences from −0.074 to +0.045 percentage points. The reported findings are descriptive and do not recommend a tuned prior or new performance method.

### Source excerpt

arXiv:2611.23306v1 Announce Type: new Abstract: When generated programs are ranked using generated tests, a more exact posterior computation need not improve the selected program. We characterize this distinction in the published B4 code--test model. Identical execution signatures reduce exact candidate marginalization to N summands and nonempty joint maximum a posteriori (MAP) inference to two weights per group. A prior--budget condition guarantees that B4's whole-group rule already attains MAP; a sharp finite correction bound certifies when candidate marginals must select the same group. All 2,421 default-setting comparisons on 807 development matrices select the same candidates. A prospectively specified validation on 1,345 execution snapshots from a separate public archive also finds no changes in 4,035 default-setting comparisons. Across 80 literature-derived priors, this new archive yields 85 changed top sets in 107,600 comparisons; only six coincide with failure of whole-group MAP. Under finite-test proxy labels, four changes increase and five decrease expected success. These descriptive changes span seven snapshots; per-prior mean differences range from -0.074 to +0.045 percentage points. The results do not recommend a tuned prior or a new performance method. Exact enumeration and independent high-precision checks support the formulas and decision diagnostics. A supplementary fixed-test analysis separates asymptotic failure from observational ambiguity. The contribution is a model-specific account of when an inference intervention can change a software-testing decision, and when its effect must be sought in the priors or evidence instead.

## Hyperparameter Optimization via Budget Allocation in Lipschitz Spaces

DevFeed: [Hyperparameter Optimization via Budget Allocation in Lipschitz Spaces](<https://devfeed.tech/articles/hyperparameter-optimization-via-budget-allocation-in-lipschitz-spaces-143220.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2510.10605>)

Author: MohammadHossein Bateni, Hossein Esfandiari, Samira HosseinGhorban, Alireza Mirrokni, Radin Shahdaei

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [budget](<https://devfeed.tech/tags/budget.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [hyperparameter-optimization](<https://devfeed.tech/tags/hyperparameter-optimization.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [optimization](<https://devfeed.tech/tags/optimization.md>)

### AI overview

The paper studies how to allocate a limited evaluation budget across configurations whose performance changes with training or resources. It models the task as Unknown Value Probing, using similarity between configurations to relate their unknown performance curves. Its strategies combine exploration of the configuration space with greater budget allocation to regions supported by observed results. The authors report worst-case approximation guarantees that are near-optimal relative to matching hardness barriers, and experiments across more than 250 benchmark settings show gains over strong baselines in anytime behavior and final incumbent performance.

### Source excerpt

arXiv:2510.10605v3 Announce Type: replace Abstract: Hyperparameter optimization and model selection often require allocating a limited evaluation budget across many candidate configurations, where performance improves with additional training or resources. We study this setting when each configuration has an unknown performance curve over budget. Similarity between configurations induces similarity between their curves, capturing geometric structure in the search space. We formalize the resulting decision problem as Unknown Value Probing and propose budget allocation strategies that combine principled exploration of the configuration space with value-informed concentration on regions supported by observed evidence. We prove worst-case approximation guarantees for our approach and show these guarantees are near-optimal by matching corresponding hardness barriers. Extensive experiments on large benchmark suites spanning more than 250 experimental settings demonstrate consistent gains over strong baselines in both anytime behavior and final incumbent performance.

## A Free Lunch: Gradient Averaging Achieves Optimal Statistical Efficiency in Newton Sketch

DevFeed: [A Free Lunch: Gradient Averaging Achieves Optimal Statistical Efficiency in Newton Sketch](<https://devfeed.tech/articles/a-free-lunch-gradient-averaging-achieves-optimal-statistical-efficiency-in-newton-sketch-143428.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23671>)

Author: Haoxuan Wang, Jianliang Ye, Sen Na

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Covariance](<https://devfeed.tech/topics/covariance.md>), [linear-regression](<https://devfeed.tech/topics/linear-regression.md>)

Tags: [central-limit-theorem](<https://devfeed.tech/tags/central-limit-theorem.md>), [covariance](<https://devfeed.tech/tags/covariance.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [inference](<https://devfeed.tech/tags/inference.md>), [linear](<https://devfeed.tech/tags/linear.md>), [logistic-regression](<https://devfeed.tech/tags/logistic-regression.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [minimax](<https://devfeed.tech/tags/minimax.md>), [newton](<https://devfeed.tech/tags/newton.md>), [online](<https://devfeed.tech/tags/online.md>), [randomness](<https://devfeed.tech/tags/randomness.md>), [regression](<https://devfeed.tech/tags/regression.md>), [sketch](<https://devfeed.tech/tags/sketch.md>), [stat-co](<https://devfeed.tech/tags/stat-co.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>), [trade](<https://devfeed.tech/tags/trade.md>)

### AI overview

For online sketched Newton methods, moving-average gradient estimates can reduce the statistical cost of randomized sketching without extra oracle evaluations or changing the inner solver's contraction bound. The last iterate's limiting covariance is no larger than without gradient averaging, while the averaged iterate reaches the minimax optimal covariance matching exact Newton. The analysis handles the loss of the martingale difference structure by studying coupled two-timescale recursions; experiments on linear and logistic regression support the covariance results.

### Source excerpt

arXiv:2611.23671v1 Announce Type: cross Abstract: We study statistical inference for online sketched Newton methods, in which each Newton system is approximately solved by an inner randomized sketching solver. Existing work reveals a computational--statistical trade-off: the sketching solver (and its accelerated variants) reduces the per-step cost of Newton methods from $O(d^3)$ to $O(d^2)$, but the randomness introduced by sketching also inflates the limiting covariance of both the last and the averaged Newton iterates. In this work, we address this trade-off via gradient averaging. We show that simply replacing the stochastic gradient with a moving average at each step can mitigate, and in some cases eliminate, the trade-off in Newton sketch. Importantly, gradient averaging requires no additional oracle evaluations and leaves the contraction bound of the inner sketching solver unchanged. In particular, we prove that the last sketched Newton iterate with gradient averaging attains a limiting covariance no larger than that without gradient averaging, while the averaged iterate even attains the minimax optimal limiting covariance, matching that of the exact Newton method. To our knowledge, this is the first analysis showing that randomness introduced to improve computational efficiency need not compromise statistical efficiency as long as proper gradient estimates are used. The key analytical challenge is that gradient averaging destroys the crucial martingale difference structure underlying central limit theorem arguments. We overcome this challenge by analyzing the coupled two-timescale recursions governing the iterate and the gradient estimator. Numerical experiments on linear and logistic regression support our theoretical covariance comparisons.

## Coordinating integration of multidisciplinary design analysis and optimisation codes with design structure matrices

DevFeed: [Coordinating integration of multidisciplinary design analysis and optimisation codes with design structure matrices](<https://devfeed.tech/articles/coordinating-integration-of-multidisciplinary-design-analysis-and-optimisation-codes-with-design-structure-matrices-139609.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22522>)

Author: W. J. Rutten, L. F. P. Etman, F. Warmer

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [software-architecture](<https://devfeed.tech/topics/software-architecture.md>), [Programming Languages / Compilers](<https://devfeed.tech/topics/programming-languages-compilers.md>)

Tags: [aerospace](<https://devfeed.tech/tags/aerospace.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [automatically](<https://devfeed.tech/tags/automatically.md>), [cs-ce](<https://devfeed.tech/tags/cs-ce.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [design](<https://devfeed.tech/tags/design.md>), [dsm](<https://devfeed.tech/tags/dsm.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [framework](<https://devfeed.tech/tags/framework.md>), [fusion](<https://devfeed.tech/tags/fusion.md>), [future](<https://devfeed.tech/tags/future.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [integration](<https://devfeed.tech/tags/integration.md>), [large](<https://devfeed.tech/tags/large.md>), [loops](<https://devfeed.tech/tags/loops.md>), [matrices](<https://devfeed.tech/tags/matrices.md>), [model](<https://devfeed.tech/tags/model.md>), [optimisation](<https://devfeed.tech/tags/optimisation.md>), [physics-comp-ph](<https://devfeed.tech/tags/physics-comp-ph.md>), [structure](<https://devfeed.tech/tags/structure.md>)

### AI overview

Design Structure Matrices (DSMs) make coupling architecture in multidisciplinary design analysis and optimisation codes visible, helping identify structural assumptions and opportunities to improve computational efficiency. The work applies DSM methods to stellarator optimisation with SIMSOPT and the PROCESS systems code. In PROCESS, an automatically generated DSM exposed feedback loops that informed a solver architecture change, significantly reducing model evaluations. The authors see this approach as especially relevant to future frameworks combining high-fidelity models with many inexpensive models.

### Source excerpt

arXiv:2611.22522v1 Announce Type: cross Abstract: The integrated analysis and optimisation codes used to design nuclear fusion reactors need to become increasingly large scale, multidisciplinary and complex to computationally verify design requirements more thoroughly and earlier in the design process. Though the manner in which the integrated models are coupled can have significant implications for computational efficiency, the structure of couplings typically remains hidden in the implementation of a design framework. As this problem is not unique to fusion, we frame integrated design problems as applications of the broader field of Multidisciplinary Design Analysis and Optimisation (MDAO). Originally developed for complex system design problems in e.g. aerospace, the MDAO field uses (extended) Design Structure Matrices (DSMs) to display the architecture of integrated analysis and optimisation codes. The aim of this work is to introduce these DSM methods and demonstrate how they can be used to improve the transparency and efficiency of design codes in fusion. As a proof of concept, DSM methods are applied to two case studies: stellarator optimisation with SIMSOPT and the PROCESS systems code. With these cases, we illustrate how a DSM can help identify structural assumptions in the code, and how architectural insight can be used to improve computational efficiency. In particular, we demonstrate the computational impact by modifying the PROCESS solver architecture based on the feedback loops revealed in an automatically generated DSM, yielding a significant reduction in model evaluations. Such architectural changes are considered especially impactful for future design frameworks that combine higher fidelity models with large numbers of inexpensive models.

## High-Dimensional Black-Box Optimization via Guidance Sampling of Diffusion Models

DevFeed: [High-Dimensional Black-Box Optimization via Guidance Sampling of Diffusion Models](<https://devfeed.tech/articles/high-dimensional-black-box-optimization-via-guidance-sampling-of-diffusion-models-140097.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22965>)

Author: Xiaoyan Hu, Rohit Sonker, Jalal Butt, Jiayu Chen, Egemen Kolemen, Jeff Schneider

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [diffusers](<https://devfeed.tech/topics/diffusers.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [bayesian](<https://devfeed.tech/tags/bayesian.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [exploitation](<https://devfeed.tech/tags/exploitation.md>), [exploration](<https://devfeed.tech/tags/exploration.md>), [framework](<https://devfeed.tech/tags/framework.md>), [gaussian](<https://devfeed.tech/tags/gaussian.md>), [generation](<https://devfeed.tech/tags/generation.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [guidance](<https://devfeed.tech/tags/guidance.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [sampling](<https://devfeed.tech/tags/sampling.md>)

### AI overview

BReaD uses diffusion-model guidance to optimize black-box rewards when evaluations are limited, without requiring a labeled pretraining dataset or access to reward gradients. It fits a Gaussian process surrogate to queried labels from generated samples, then uses Upper Confidence Bound signals to balance exploration and exploitation. The abstract reports a theoretical analysis of the total-variation distance between generated and target distributions, and numerical experiments on scientific discovery and image generation that show effectiveness in low-data scenarios.

### Source excerpt

arXiv:2611.22965v1 Announce Type: cross Abstract: Many real-world optimization problems involve optimizing black-box objectives for which only a limited number of evaluations are available. Bayesian optimization (BO) is a powerful framework for such problems, but its effectiveness often deteriorates in high-dimensional spaces. Recent work leverages diffusion models for black-box optimization, often through pre-training a reward-conditioned score network to steer generation towards high-reward samples. Alternatively, gradient-based guidance methods assume access to a differentiable reward function from which guidance gradients are queried. However, these approaches either require large amounts of labeled data for offline training or access to exact reward gradients, limiting their applicability in black-box settings. We propose BReaD (Black-box Reward-guided Sampling of Diffusion Model), a guidance sampling framework for optimizing black-box rewards without assuming access to a labeled dataset or reward gradients. The proposed method uses a Gaussian process (GP) as a differentiable surrogate for the unknown objective and actively queries labels for the generated samples. We provide a theoretical analysis of the total-variation distance between the generated distribution and the target distribution. Using Upper Confidence Bound (UCB) as guidance signals, our method balances exploration and exploitation during generation and enables the discovery of high-reward regions in the data space. Numerical experiments on scientific discovery and image generation tasks demonstrate that our framework can effectively optimize black-box rewards in low-data scenarios.

## Physics-informed neural networks for spacecraft trajectory optimization with exact boundary conditions

DevFeed: [Physics-informed neural networks for spacecraft trajectory optimization with exact boundary conditions](<https://devfeed.tech/articles/physics-informed-neural-networks-for-spacecraft-trajectory-optimization-with-exact-boundary-conditions-141701.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21933>)

Author: Samuel Sch\\"onherr, G\\"unther Waxenegger-Wilfing, Sascha Ranftl

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [networks](<https://devfeed.tech/tags/networks.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [partial-differential-equations](<https://devfeed.tech/tags/partial-differential-equations.md>), [physics](<https://devfeed.tech/tags/physics.md>), [physics-informed](<https://devfeed.tech/tags/physics-informed.md>), [trajectory-optimization](<https://devfeed.tech/tags/trajectory-optimization.md>)

### AI overview

The approach embeds spacecraft trajectory boundary conditions directly into a neural network's position function through a transformation, so initial and terminal states are satisfied exactly. The network is trained without labeled trajectories by minimizing thrust while incorporating physical laws into the objective. Compared with standard physics-informed neural networks, which use weighted penalty terms for boundary conditions and can be sensitive to their weights, this reparameterization removes those penalties and makes optimization single-objective over admissible trajectories. The authors report improved convergence and solution accuracy in numerical experiments; the supplied excerpt does not give quantitative results.

### Source excerpt

arXiv:2611.21933v1 Announce Type: new Abstract: We use neural networks to optimize trajectories by modeling the position as a function of time and minimizing the thrust with respect to the network parameters. This corresponds to an unsupervised training procedure in which physical laws are incorporated directly into the optimization objective. In standard physics-informed neural networks, initial and terminal states are enforced through additional weighted loss terms, resulting in a multi-objective optimization problem that is highly sensitive to the choice of loss weights and can lead to poor convergence and reduced accuracy. To address this challenge, we construct a simple transformation, exploiting the mathematical structure of trajectory optimization problems, to enforce boundary conditions exactly a-priori. This transformation can be interpreted as a reparameterization of the solution space that embeds the boundary conditions directly into the function. This converts the original constrained optimization problem into an unconstrained one over admissible trajectories. I.e. the transformation eliminates the boundary condition penalty terms and reduces the problem to a single-objective optimization. Crucially, trajectory optimization comes with a low-dimensional boundary, which allows particularly simple and stable constructions of distance functions compared to general domains in partial differential equations. Numerical experiments demonstrate that the proposed approach meaningfully improves convergence behavior and solution accuracy.

## Colombo: A Frontier-to-Frontier Autoresearch System for Oracle-Based Optimization

DevFeed: [Colombo: A Frontier-to-Frontier Autoresearch System for Oracle-Based Optimization](<https://devfeed.tech/articles/colombo-a-frontier-to-frontier-autoresearch-system-for-oracle-based-optimization-140116.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23080>)

Author: Haihan Zhang, Wendao Wu, Chenheng Zhang, Chunyuan Zheng, Yanyi Li, Cong Fang, Haoxuan Li, Zhouchen Lin

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [AI for science](<https://devfeed.tech/topics/ai-for-science.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [adversarial](<https://devfeed.tech/tags/adversarial.md>), [ai](<https://devfeed.tech/tags/ai.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [atlas](<https://devfeed.tech/tags/atlas.md>), [autoresearch](<https://devfeed.tech/tags/autoresearch.md>), [certification](<https://devfeed.tech/tags/certification.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [formal](<https://devfeed.tech/tags/formal.md>), [frontier](<https://devfeed.tech/tags/frontier.md>), [independent](<https://devfeed.tech/tags/independent.md>), [lean](<https://devfeed.tech/tags/lean.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [memory](<https://devfeed.tech/tags/memory.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [research](<https://devfeed.tech/tags/research.md>), [science](<https://devfeed.tech/tags/science.md>), [system](<https://devfeed.tech/tags/system.md>)

### AI overview

Colombo is a self-organizing AI research system instantiated in oracle-based optimization. It maps gaps between achievable guarantees and unavoidable costs in a Complexity Atlas, then turns unresolved gaps into adaptive research programmes. Its Adversarial Co-Ascent develops algorithms alongside hard problem families to test information use and expose unavoidable costs. Independent review and Lean-based certification check claims, while long-term memory carries supported findings across settings. The abstract reports optimal or near-optimal rates for more than fifty Atlas settings; it does not provide details of those settings or the underlying proofs.

### Source excerpt

arXiv:2611.23080v1 Announce Type: new Abstract: Science advances from frontier to frontier as discoveries reshape what is known and create the basis for further discovery. We present Colombo, a self-organizing AI researcher that drives this renewal, first instantiated in oracle-based optimization. Here, the central question is how efficiently a problem class can be solved through a prescribed information interface and what costs no admissible algorithm can avoid. The gap between achievable guarantees and unavoidable limits defines the frontier recorded in its Complexity Atlas, a living map of frontier settings and the current state of knowledge. Self-Organization turns unresolved gaps into adaptive research programmes, coordinating conjecture formation, mathematical investigation, and replanning as evidence accumulates. Adversarial Co-Ascent develops algorithms and hard families through reciprocal challenge, exposing mechanisms of information use and concealment that guide stronger methods and proofs of unavoidable costs. Independent review and Lean-based formal certification check mathematical claims, while the Long-Term Memory carries supported findings and research experience across settings. To date, Colombo has established optimal or near-optimal rates for more than fifty settings in the Atlas. Colombo thus takes a concrete step toward Autopoietic Science: a scientific process whose validated advances regenerate the conditions of its own progress, continually reshaping how inquiry is organized and what it can discover.

## Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization

DevFeed: [Optimizer's Information Criterion: Dissecting and Correcting Bias in Data-Driven Optimization](<https://devfeed.tech/articles/optimizer-s-information-criterion-dissecting-and-correcting-bias-in-data-driven-optimization-141513.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2306.10081>)

Author: Garud Iyengar, Henry Lam, Tianyu Wang

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [machine learning overfitting](<https://devfeed.tech/topics/machine-learning-overfitting.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [bias](<https://devfeed.tech/tags/bias.md>), [cross-validation](<https://devfeed.tech/tags/cross-validation.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data-driven](<https://devfeed.tech/tags/data-driven.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [overfitting](<https://devfeed.tech/tags/overfitting.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [validation](<https://devfeed.tech/tags/validation.md>)

### AI overview

Data-driven optimization can make decisions look better on sample data than they perform in reality, due to the Optimizer's Curse. The paper proposes the Optimizer's Information Criterion (OIC), which analytically estimates and corrects this bias arising from the interaction between model fitting and downstream optimization. Extending the role of Akaike's Information Criterion from model evaluation to decision-performance evaluation, OIC avoids repeatedly solving optimization problems for cross-validation and is presented as more general than other bias-approximation schemes. The authors apply it to empirical and parametric models, regularized variants, and contextual optimization, reporting numerical validation on synthetic and real-world datasets.

### Source excerpt

arXiv:2306.10081v5 Announce Type: replace Abstract: In data-driven optimization, the sample performance of the obtained decision typically incurs an optimistic bias against the true performance, a phenomenon commonly known as the Optimizer's Curse and intimately related to overfitting in machine learning. We develop a general approach that we call \emph{Optimizer's Information Criterion (OIC)} to correct this bias. OIC generalizes the celebrated Akaike Information Criterion from the evaluation of model adequacy, used primarily for model selection, to objective performance in data-driven optimization, which is used for decision selection. Our approach analytically approximates and cancels out the bias that comprises the interplay between model fitting and downstream optimization. As such, it saves the computational need to repeatedly solve optimization problems in cross-validation, while operating more generally than other bias approximating scheme. We apply OIC to a range of data-driven optimization formulations comprising empirical and parametric models, their regularized counterparts, and furthermore contextual optimization. Finally, we provide numerical validation of the superior performance of our approach under synthetic and real-world datasets.

## Pareto-Informed Smart "Predict, then Optimize" for Multi-Objective Combinatorial Problems

DevFeed: [Pareto-Informed Smart "Predict, then Optimize" for Multi-Objective Combinatorial Problems](<https://devfeed.tech/articles/pareto-informed-smart-predict-then-optimize-for-multi-objective-combinatorial-problems-141840.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23076>)

Author: Aabhash Dhakal, Tim Lachner

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [combinatorial-optimization](<https://devfeed.tech/tags/combinatorial-optimization.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision](<https://devfeed.tech/tags/decision.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [frontier](<https://devfeed.tech/tags/frontier.md>), [logistics](<https://devfeed.tech/tags/logistics.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [planning](<https://devfeed.tech/tags/planning.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [routing](<https://devfeed.tech/tags/routing.md>), [shortest-path](<https://devfeed.tech/tags/shortest-path.md>), [stage](<https://devfeed.tech/tags/stage.md>), [vector](<https://devfeed.tech/tags/vector.md>)

### AI overview

The paper proposes a Pareto-aware extension of Smart "Predict, then Optimize" (SPO+) for multi-objective combinatorial optimization. Its loss uses the true Pareto Frontier to form a target decision aligned with a sampled preference vector, then minimizes regret against that target. On multi-objective shortest-path and knapsack problems, the method reportedly outperforms two-stage Mean Squared Error baselines and scalarization-based SPO+ approaches. The supplied abstract does not provide quantitative results or further implementation details.

### Source excerpt

arXiv:2611.23076v1 Announce Type: new Abstract: Many real-world planning applications, from logistics, routing to resource allocation, give rise to optimization problems that need to balance multiple, conflicting objectives. While machine learning is often used to predict the unknown parameters or costs of these problems, standard models trained on prediction accuracy can lead to suboptimal plans. Decision-Focused Learning (DFL) addresses this by integrating the downstream optimization task into the training objective. However, existing DFL methods for multi-objective problems rely on simple scalarization, which fails to capture the rich trade-offs of the Pareto Frontier. To address this gap, we propose a Pareto-aware extension to single-objective Smart "Predict, then Optimize" (SPO+) for multi-objective combinatorial optimization problems. Our loss function leverages the true Pareto Frontier, forming a target decision that aligns with a sampled preference vector, and minimizes regret against this target. Experiments on multi-objective shortest path and multi-objective knapsack problems show that our approach outperforms traditional two-stage Mean Squared Error (MSE) baselines. It also surpasses scalarization-based SPO+ approaches.

## Beyond Single Slot: Joint Optimization for Multi-Slot Guaranteed Display Advertising

DevFeed: [Beyond Single Slot: Joint Optimization for Multi-Slot Guaranteed Display Advertising](<https://devfeed.tech/articles/beyond-single-slot-joint-optimization-for-multi-slot-guaranteed-display-advertising-141564.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2605.21556>)

Author: Zhaoqi Zhang, Jiaming Deng, Miao Xie, Linyou Cai, Qianlong Xie, Xingxing Wang, Siqiang Luo, Gao Cong

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [advertising](<https://devfeed.tech/tags/advertising.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [bipartite-matching](<https://devfeed.tech/tags/bipartite-matching.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [deployments](<https://devfeed.tech/tags/deployments.md>), [display](<https://devfeed.tech/tags/display.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [framework](<https://devfeed.tech/tags/framework.md>), [matching](<https://devfeed.tech/tags/matching.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [meituan](<https://devfeed.tech/tags/meituan.md>), [monetization](<https://devfeed.tech/tags/monetization.md>), [online](<https://devfeed.tech/tags/online.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [platform](<https://devfeed.tech/tags/platform.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [redundancy](<https://devfeed.tech/tags/redundancy.md>), [revenue](<https://devfeed.tech/tags/revenue.md>), [robustness](<https://devfeed.tech/tags/robustness.md>)

### AI overview

The paper presents a joint allocation framework for guaranteed display ads across multiple page-view slots, targeting slot redundancy, contract imbalance, and concentrated exposure. It models allocation as offline bipartite matching, uses a contract roulette mechanism for slot exclusivity and Page View constraints to control impressions, and includes a scalable optimization algorithm. In Meituan online tests, A/B tests at 70% traffic reported a 28.99% increase in Average Revenue Per User; DID analysis also indicated improved contract stability. The supplied text does not detail the algorithm or evaluation methodology.

### Source excerpt

arXiv:2605.21556v2 Announce Type: replace Abstract: Guaranteed display advertising is crucial for platform monetization, yet existing methods often operate under a single-slot assumption, limiting their ability to optimize allocation across multi-slot page views. In this paper, we propose a novel joint optimization framework for multi-slot GD allocation, addressing key challenges such as slot-level redundancy, contract imbalance, and exposure concentration. Our approach formulates the allocation as an offline bipartite matching problem with a contract roulette mechanism for slot exclusivity and Page View constraints for impression control, and incorporates a scalable allocation optimization algorithm for efficient large-scale deployment. Extensive online tests on the Meituan advertising platform demonstrate that our method significantly improves merchant ROI, platform revenue efficiency, and contract fulfillment robustness. Specifically, online A/B tests show a 28.99% increase in Average Revenue Per User under 70% traffic, and DID analysis further indicates improved contract stability, demonstrating the strong applicability and effectiveness of our framework in real-world advertising deployments.

## Optimization-like Reasoning in LLMs over Expanding Search Spaces

DevFeed: [Optimization-like Reasoning in LLMs over Expanding Search Spaces](<https://devfeed.tech/articles/optimization-like-reasoning-in-llms-over-expanding-search-spaces-139778.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.05464>)

Author: Nicol\\'as Astorga, Nabeel Seedat, Mihaela van der Schaar

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [rlvr](<https://devfeed.tech/topics/rlvr.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [llms](<https://devfeed.tech/tags/llms.md>), [offline](<https://devfeed.tech/tags/offline.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [search](<https://devfeed.tech/tags/search.md>), [spaces](<https://devfeed.tech/tags/spaces.md>), [tasks](<https://devfeed.tech/tags/tasks.md>)

### AI overview

OPT* is a scalable family of optimization tasks for training and evaluating LLMs that must build high-value feasible plans among many valid alternatives. A feasibility checker and evaluator support verification, while a complexity parameter expands the search space without requiring new human labels. The work studies solver-guided online policy optimization, where a solver scores partial states and rank-based reward shaping encourages better next steps, and search-based offline RL for cases without such solvers. The authors relate large-search-space success to information gained per unit of search budget, ablate components for efficient search, and report that OPT* training improves step-by-step optimization-like reasoning.

### Source excerpt

arXiv:2606.05464v2 Announce Type: replace Abstract: Verifiable reward training has improved mathematical and coding reasoning, but these domains capture only part of step-by-step decision making. Many real-world tasks require finding a high-value feasible plan among many valid alternatives. We introduce OPT*, a scalable family of optimization-style tasks for training and evaluating LLM step-by-step optimization-like reasoning along a complexity axis: each task provides a feasibility checker and evaluator, while a complexity parameter expands the search space without requiring new human labels. This motivates studying these tasks in two regimes: (i) solver-guided online policy optimization, which uses a solver as a value oracle for partial states and applies rank-based reward shaping to reinforce better next steps, and (ii) search-based offline RL when such solvers are unavailable. Theoretically, we relate success in large search spaces to the information a reasoner extracts per unit of search budget. Empirically, we ablate the ingredients that make search efficient on OPT* and show that training on OPT* improves step-by-step optimization-like reasoning.

## Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization

DevFeed: [Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization](<https://devfeed.tech/articles/sampling-luck-masquerades-as-allocation-gain-auditing-test-time-budget-allocation-for-neural-combinatorial-optimization-139805.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.13087>)

Author: Jinhyung Bae

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [benchmark overfitting machine learning](<https://devfeed.tech/topics/benchmark-overfitting-machine-learning.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [auditing](<https://devfeed.tech/tags/auditing.md>), [bias](<https://devfeed.tech/tags/bias.md>), [budget](<https://devfeed.tech/tags/budget.md>), [combinatorial-optimization](<https://devfeed.tech/tags/combinatorial-optimization.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [headroom](<https://devfeed.tech/tags/headroom.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [neural](<https://devfeed.tech/tags/neural.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [out-of-sample](<https://devfeed.tech/tags/out-of-sample.md>), [phantom](<https://devfeed.tech/tags/phantom.md>), [reporting](<https://devfeed.tech/tags/reporting.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [statistics](<https://devfeed.tech/tags/statistics.md>), [tsp](<https://devfeed.tech/tags/tsp.md>)

### AI overview

On uniform TSP-100 workloads, apparent 2.2-2.6% gains from non-uniform test-time sampling allocation disappear out of sample: across POMO, AM, and SymNCO, measured gains are 0.457%, 0.015%, and −0.512%. The authors report that this in-sample bias persists across the tested sample and instance counts. Under a shifted workload mixing uniform and clustered instances, held-out-statistics-guided allocation improves best-of-k by 11.5% for AM and 12.0% for SymNCO at equal evaluation budget, though signal-acquisition cost is excluded. POMO, used as a negative control, shows −0.3%. A distribution-label baseline trails by 4.2 points; an exploratory policy that charges a 20-sample probe to the budget retains 3.4% and 4.6% gains for AM and SymNCO. The abstract also reports a correction procedure and reporting checklist.

### Source excerpt

arXiv:2608.13087v2 Announce Type: replace-cross Abstract: Neural combinatorial optimization (NCO) solvers report the best of many sampled solutions per instance, and the sample count is, by convention, identical for every instance. Whether a non-uniform allocation of a fixed total budget would buy anything has not been measured. We measure it, and we audit the measurement itself. First, on in-distribution workloads the allocation headroom is not detectable. Across three pretrained solvers (POMO, AM, SymNCO) on uniform TSP-100, an oracle allocation computed and evaluated on the same stored samples reports a 2.2-2.6% gain with intervals excluding zero; measured out of sample the same gain is indistinguishable from zero (0.457, 0.015, -0.512 percent). Following the customary in-sample procedure, all three solvers would have supported a published 2%-level gain that does not exist. We calibrate this bias against an instance-wise null in which the true gain is zero by construction; over the ranges we test it does not shrink with more samples or more instances. Second, the same correction that removes the phantom gains preserves a real one. Under distribution shift (a workload mixing uniform and clustered instances), a pre-registered confirmatory experiment finds that allocation guided by held-out sample statistics improves best-of-k by 11.5% (AM, primary endpoint; 95% CI [7.4, 19.7]) and 12.0% (SymNCO, replication) at equal evaluation budget, with the signal-acquisition cost not charged; a pre-registered negative control (POMO, an order of magnitude more robust to shift) shows -0.3% [-0.7, 0.24]. The gain exceeds a frozen distribution-label baseline by 4.2 points [1.9, 7.7]. An exploratory policy charging a 20-sample probe against the same budget retains 3.4% (AM) and 4.6% (SymNCO). We give a correction procedure and a reporting checklist, and release all data, code, and the pre-registration record.

## Decision-Aware Proximal Bridge Learning for Optimal Treatment Selection

DevFeed: [Decision-Aware Proximal Bridge Learning for Optimal Treatment Selection](<https://devfeed.tech/articles/decision-aware-proximal-bridge-learning-for-optimal-treatment-selection-141561.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2605.16989>)

Author: Tom\\\`as Garriga, Alejandro Almod\\'ovar, Axel Brando, Gerard Sanz, Eduard Serrahima de Cambra, Juan Parras

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [decision-making](<https://devfeed.tech/topics/decision-making.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [causal-inference](<https://devfeed.tech/tags/causal-inference.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision](<https://devfeed.tech/tags/decision.md>), [decision-making](<https://devfeed.tech/tags/decision-making.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [effect](<https://devfeed.tech/tags/effect.md>), [global](<https://devfeed.tech/tags/global.md>), [hidden](<https://devfeed.tech/tags/hidden.md>), [inference](<https://devfeed.tech/tags/inference.md>), [learning](<https://devfeed.tech/tags/learning.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [policy](<https://devfeed.tech/tags/policy.md>), [projection](<https://devfeed.tech/tags/projection.md>), [proxy](<https://devfeed.tech/tags/proxy.md>), [proxy-variables](<https://devfeed.tech/tags/proxy-variables.md>), [regions](<https://devfeed.tech/tags/regions.md>), [response](<https://devfeed.tech/tags/response.md>), [selection](<https://devfeed.tech/tags/selection.md>)

### AI overview

For continuous treatment selection under hidden confounding, estimating a causal response surface uniformly can misallocate effort away from treatments that determine the best decision. The paper proposes a policy-targeted weighted bridge loss for proximal causal inference, emphasizing decision-relevant treatment regions while retaining global stabilization. A regret bound links treatment-selection regret to a weighted ill-posedness constant. Decision-aware versions of several proximal bridge solvers alternate weighted bridge estimation, response-surface projection, policy updates, and weight refinement. The abstract reports reduced regret across several bridge solvers; identification relies on proxy variables and bridge functions under suitable assumptions.

### Source excerpt

arXiv:2605.16989v2 Announce Type: replace Abstract: Individualized treatment selection with continuous actions requires accurate causal response estimation in decision-relevant regions, rather than uniformly over the entire action space. Estimating a global causal response surface and then choosing the treatment that maximizes it can therefore be suboptimal, since standard estimation objectives allocate modeling effort according to the observed treatment distribution rather than the regions that determine the optimal decision. While decision-aware approaches have been studied in unconfounded settings, this problem remains underexplored in proximal causal inference, where proxy variables and bridge functions enable identification under suitable assumptions even in the presence of hidden confounding. Despite recent progress, proximal methods have primarily focused on treatment-effect and potential-outcome estimation rather than treatment selection and optimal decision-making. To bridge this gap, we introduce a policy-targeted weighted bridge loss that emphasizes decision-relevant treatment regions while retaining global stabilization. We prove a regret bound showing that the proposed weighted bridge loss controls treatment-selection regret through a weighted ill-posedness constant. We instantiate the framework in decision-aware variants of several proximal bridge solvers, yielding practical algorithms that alternate between weighted bridge estimation, response-surface projection, policy update, and weight refinement. Empirically, we find that decision-aware weighting reduces regret across several bridge solvers, suggesting improved treatment selection in proximal settings.

## Dynamic Spatio-Temporal Graph Attention Networks with Nested Clustered Optimization for Multi-Asset Portfolios

DevFeed: [Dynamic Spatio-Temporal Graph Attention Networks with Nested Clustered Optimization for Multi-Asset Portfolios](<https://devfeed.tech/articles/dynamic-spatio-temporal-graph-attention-networks-with-nested-clustered-optimization-for-multi-asset-portfolios-138957.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19903>)

Author: Supriadi

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [angular](<https://devfeed.tech/tags/angular.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [asset](<https://devfeed.tech/tags/asset.md>), [attention](<https://devfeed.tech/tags/attention.md>), [capital](<https://devfeed.tech/tags/capital.md>), [capture](<https://devfeed.tech/tags/capture.md>), [classes](<https://devfeed.tech/tags/classes.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [correlation](<https://devfeed.tech/tags/correlation.md>), [costs](<https://devfeed.tech/tags/costs.md>), [covariance](<https://devfeed.tech/tags/covariance.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [graph](<https://devfeed.tech/tags/graph.md>), [nested](<https://devfeed.tech/tags/nested.md>), [networks](<https://devfeed.tech/tags/networks.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [portfolios](<https://devfeed.tech/tags/portfolios.md>), [q-fin-pm](<https://devfeed.tech/tags/q-fin-pm.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

ST-GAT-NCO combines causal dilated 1D convolutions for temporal momentum and downside-risk signals with a multi-head graph attention network over changing market topologies. The learned asset embeddings define an angular distance used in two-stage downside Nested Clustered Optimization, with institutional constraints and turnover smoothing. In a reported non-anticipative walk-forward evaluation across 13 global asset classes from January 2020 to January 2026, net of 10 bps transaction costs, it achieved 5.32% CAGR, 37.06% cumulative net return, and a -13.07% maximum drawdown with 15.31% monthly one-way turnover. The abstract reports higher CAGR and Sharpe than Minimum Variance, Hierarchical Risk Parity, and Plain Symmetric NCO, and lower drawdown than Equal-Weight and Downside NCO. These are results reported for the study's evaluation period.

### Source excerpt

arXiv:2611.19903v1 Announce Type: cross Abstract: Nested Clustered Optimization (NCO) insulates asset allocation from Markowitz covariance ill-conditioning. However, classical tree clustering relies on static pairwise Pearson correlation, failing to capture time-varying, asymmetric downside risk contagion across multi-asset markets. We propose a unified deep graph machine learning architecture: Dynamic Spatio-Temporal Graph Attention Networks with Nested Clustered Optimization (ST-GAT-NCO) for multi-asset tactical allocation. The framework extracts temporal momentum and downside risk dynamics via causal dilated 1D-convolutions, then deploys a multi-head Graph Attention Network (GAT) over dynamic market topologies to learn latent spatial node representations. These learned embeddings define an angular metric distance space that guides two-stage downside NCO optimization under institutional constraints and turnover smoothing. Evaluated over a 73-month non-anticipative walk-forward out-of-sample window (January 2020 to January 2026) across 13 global asset classes net of 10 bps transaction costs, ST-GAT-NCO achieves a 5.32% CAGR and 37.06% cumulative net return, delivering an excess Sharpe ratio of 0.30 and a Sortino ratio of 0.48. This substantially outperforms classical Minimum Variance (3.68% CAGR, 0.08 Sharpe), Hierarchical Risk Parity (2.65% CAGR), and Plain Symmetric NCO (4.11% CAGR, 0.15 Sharpe), while restricting maximum drawdown to -13.07% (versus -19.44% for Equal-Weight and -16.36% for Downside NCO) under a controlled one-way turnover of 15.31%/month. Regime analysis confirms active capital preservation across the 2020 COVID-19 crash, 2022 monetary tightening, and 2023-2026 disinflation rallies.

## Chance-constrained Flow Matching for High-Fidelity Constraint-aware Generation

DevFeed: [Chance-constrained Flow Matching for High-Fidelity Constraint-aware Generation](<https://devfeed.tech/articles/chance-constrained-flow-matching-for-high-fidelity-constraint-aware-generation-138725.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2509.25157>)

Author: Jinhao Liang, Yixuan Sun, Anirban Samaddar, Sandeep Madireddy, Ferdinando Fioretto

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [constraint](<https://devfeed.tech/tags/constraint.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [flow-matching](<https://devfeed.tech/tags/flow-matching.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generative-models](<https://devfeed.tech/tags/generative-models.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [partial-differential-equations](<https://devfeed.tech/tags/partial-differential-equations.md>), [physics-informed](<https://devfeed.tech/tags/physics-informed.md>)

### AI overview

Chance-constrained Flow Matching (CCFM) enforces hard constraints during generative sampling through stochastic optimization, while retaining the feasibility guarantee of projection-based methods. It avoids projecting noisy intermediate samples onto a feasible set defined for clean samples, which the abstract says can disrupt sampling dynamics, and avoids the multi-stage clean-sample estimation and projection used by recent approaches. The abstract reports stronger feasibility and fidelity than current state-of-the-art constrained generative models across PDE-governed physical systems, molecular docking, and physics-informed motion generation. The supplied text does not provide quantitative results or implementation details.

### Source excerpt

arXiv:2509.25157v2 Announce Type: replace Abstract: Generative models excel at synthesizing high-fidelity samples from complex data distributions, but they often violate hard constraints arising from physical laws or task specifications. A common remedy is to project intermediate samples onto the feasible set at each sampling step. However, repeated projection can disrupt the learned sampling dynamics because this feasible set is defined for clean samples rather than noisy intermediate states. Thus, recent studies first estimate clean samples and then project them to the feasible set, but this increases algorithmic complexity and accumulates errors across steps. To address these issues, this paper proposes Chance-constrained Flow Matching (CCFM), a training-free method that formulates constraint enforcement during sampling as stochastic optimization while retaining the hard-constraint feasibility guarantee of projection-based methods. By avoiding direct projection of noisy intermediate states onto the clean-sample feasible set, CCFM mitigates the distributional distortion. Unlike approaches that first estimate and project clean samples, CCFM avoids complex multi-stage procedures. Experiments show that CCFM outperforms current state-of-the-art constrained generative models in modeling complex physical systems governed by partial differential equations, molecular docking problems, and physics-informed motion generation, delivering superior feasibility and fidelity.

## Budgeted Decision-Model-Guided Joint-Action Search for Satellite Edge Computing

DevFeed: [Budgeted Decision-Model-Guided Joint-Action Search for Satellite Edge Computing](<https://devfeed.tech/articles/budgeted-decision-model-guided-joint-action-search-for-satellite-edge-computing-137023.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19225>)

Author: Ziming Liu, Minghao Sun, Ran Tao, Xiaoli Chu

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [decision-model](<https://devfeed.tech/tags/decision-model.md>), [edge-computing](<https://devfeed.tech/tags/edge-computing.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [latency](<https://devfeed.tech/tags/latency.md>), [offloading](<https://devfeed.tech/tags/offloading.md>), [power](<https://devfeed.tech/tags/power.md>), [search](<https://devfeed.tech/tags/search.md>)

### AI overview

BJAS jointly searches satellite offloading and power allocation to reduce average task-completion latency under explicit search budgets. It uses bounded candidate pools that combine single-terminal updates with power-inheriting offload replacements, allowing batched selection and two-terminal coordination without enumerating extra power vectors. In 60 completed runs per method under each workflow's configuration, BJAS cut mean total solver time by 97.16% versus LLM-generated offloading while achieving similar mean task-completion latency. It also reported lower mean task-completion latency than the tested genetic algorithm and deep deterministic policy gradient baselines.

### Source excerpt

arXiv:2611.19225v1 Announce Type: new Abstract: Efficient task offloading in satellite edge computing requires coordinated allocation of communication and computing resources. Search methods based on large language models (LLMs) have been shown to generate high-quality resource allocations, but the latency of individual model requests and repeated model interactions can lead to substantial solver overhead. We propose budgeted joint-action search (BJAS), an integrated decision-model-guided solver that jointly optimizes satellite offloading and power allocation to minimize average task-completion latency under explicit search budgets. Its bounded candidate pools combine single-terminal updates with power-inheriting offload replacements for batched selection, retaining two-terminal coordination without enumerating additional power vectors. Across 60 completed runs per method under the workflows' respective configurations, BJAS reduces mean total solver time by 97.16% relative to LLM-generated offloading while achieving a mean task-completion latency close to that of the LLM baseline. BJAS also achieves lower mean task-completion latency than the tested genetic algorithm and deep deterministic policy gradient baselines.

## Ensemble Modeling for Time Series Forecasting: an Adaptive Robust Optimization Approach

DevFeed: [Ensemble Modeling for Time Series Forecasting: an Adaptive Robust Optimization Approach](<https://devfeed.tech/articles/ensemble-modeling-for-time-series-forecasting-an-adaptive-robust-optimization-approach-138704.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2304.04308>)

Author: L\\'eonard Boussioux, Henry Mao, Dimitris Bertsimas

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [linear-regression](<https://devfeed.tech/topics/linear-regression.md>), [Temporal data](<https://devfeed.tech/topics/temporal-data.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [air-pollution](<https://devfeed.tech/tags/air-pollution.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [energy-consumption](<https://devfeed.tech/tags/energy-consumption.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [linear](<https://devfeed.tech/tags/linear.md>), [linear-regression](<https://devfeed.tech/tags/linear-regression.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [methodology](<https://devfeed.tech/tags/methodology.md>), [model-weights](<https://devfeed.tech/tags/model-weights.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [models](<https://devfeed.tech/tags/models.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [regression](<https://devfeed.tech/tags/regression.md>), [risk](<https://devfeed.tech/tags/risk.md>), [robust](<https://devfeed.tech/tags/robust.md>), [robustness](<https://devfeed.tech/tags/robustness.md>), [shift](<https://devfeed.tech/tags/shift.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [time-series](<https://devfeed.tech/tags/time-series.md>), [time-series-forecasting](<https://devfeed.tech/tags/time-series-forecasting.md>)

### AI overview

The paper uses Adaptive Robust Optimization (ARO) to build linear regression ensembles with weights that adapt over time as time-series data shift. In real-world forecasting applications for air pollution, energy consumption, and tropical cyclone intensity, the method reports 16-26% lower RMSE and 14-28% lower 15% conditional value at risk than the best ensemble member in hindsight, and improves on other compared ensemble methods on most metrics. Across eight synthetic disturbance scenarios, it has lower mean RMSE than rolling ridge in seven, with statistically significant improvements in four. A limitation is that an abrupt regime shift appearing only after model selection remains difficult for the approach.

### Source excerpt

arXiv:2304.04308v2 Announce Type: replace Abstract: Accurate time-series forecasting is critical for many problems involving temporal data. Ensemble modeling is a well-established technique that leverages multiple predictive models to improve accuracy and robustness, since a single predictor's performance can vary widely due to shifts in the underlying data distribution. This paper proposes a new methodology for building robust ensembles of time series forecasting models. Our approach uses Adaptive Robust Optimization (ARO) to construct a linear regression ensemble whose model weights adapt over time. We demonstrate the effectiveness of our method through synthetic experiments covering eight disturbance scenarios, from no drift to abrupt regime shifts, and real-world applications, including air pollution management, energy consumption forecasting, and tropical cyclone intensity forecasting. In the real-world applications, our adaptive ensembles outperform the best ensemble member in hindsight by 16-26% in root mean square error (RMSE) and 14-28% in conditional value at risk at the 15% level and improve over the other ensemble methods we compare on most metrics. In the synthetic experiments, they have lower mean RMSE than a rolling-ridge comparator in seven of the eight scenarios, significantly in four, while an abrupt regime shift that first appears after model selection remains a limitation.

[Next page](<https://devfeed.tech/topics/operations-research-and-optimization.md?cursor=WyIyMDI2LTExLTE3VDA1OjAwOjAwKzAwOjAwIiwgIjZlYjg0YzBhLTVjYzAtNDJhOS05Y2RiLTcyM2E3OTM3MzFkNCJd>)