Papers for

industrial optimization teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Reinforcement learning guides multi-objective design optimizations effectively

MOON-RL: Multi-Objective Optimization via Objective Space Navigation with Reinforcement Learning

Abstract: Many engineering design problems involve multiple conflicting objectives and strict feasibility constraints. They are typically solved with population-based optimizers that require many evaluations and offer limited online control over where the search is focused. We present MOON-RL, a reinforcement-learning-based optimization framework that formulates constrained multi-objective search as preference-directed navigation in the objective space. In MOON-RL, a lightweight PPO policy receives objective-space and constraint-related observations and acts as an instance-specific adaptive search process. It learns how to update the design so that the current solution advances along a user-specified trade-off direction, while a simple meta-algorithm periodically resets the policy, resamples starting designs from a continuously updated archive of non-dominated solutions, and adjusts step-size and penalty schedules. We evaluate MOON-RL on real-world actuator-design problems and additional convergence-hard constrained benchmarks, comparing against established evolutionary algorithms under matched evaluation budgets. In focused search scenarios, MOON-RL achieves competitive performance in the region of interest, and ablation studies show that both the RL-driven adaptive sampling process and the meta-algorithm contribute to this behaviour, suggesting that repurposing RL training as objective-space navigation is a viable building block for interactive, preference-guided design tools. Additional experiments show that the framework also accommodates adaptive non-RL samplers, while PPO remains a strong choice for fixed-target, preference-directed objective-space navigation.

Wed 11 NovMachine Learning
The gist
Many engineering problems involve deciding between several competing goals while making sure the design stays feasible. The paper presents MOON-RL, a new method that uses reinforcement learning to navigate through possible solutions by focusing search efforts based on user preferences. This approach adapts to each specific problem and learns how to improve designs toward desired trade-offs between objectives. The authors tested MOON-RL on real engineering tasks and found it competes well with traditional methods, especially when focusing on certain parts of the design space.
Open → 2611.15227v1

Thompson sampling improved by diffusion transformers with flexible priors

Thompson Sampling using Prior-fitted Diffusion Transformers

Abstract: Thompson sampling is natural randomized strategy for optimizing unknown functions in a black-box manner. In continuous global optimization, Thompson sampling has largely been restricted to Gaussian process priors, as these are essentially the only class for which computing the posterior distribution has been tractable in practice. In this work, we introduce \emph{prior-fitted diffusion transformers}, which are diffusion models that perform Thompson sampling in-context at inference time, after being pre-trained using the prior-fitted network paradigm. To apply these models, we develop a set of practical non-Gaussian priors for general black-box functions---including those that have characteristics that cannot be achieved under Gaussianity, such as priors over unimodal functions. We also quantify the tradeoff between model size and the number of pre-training iterations, and show that these models follow scaling laws akin to those observed in transformers defined over other modalities. Across a set of global optimization benchmarks, we show that prior-fitted diffusion transformers with non-Gaussian priors can achieve improved performance compared to traditional pipelines built on Gaussian processes.

Tue 10 NovMachine LearningArtificial Intelligence
The gist
Thompson sampling is a method used to find the best option when you don't know much about what you are testing. Traditionally, it worked mainly with simple assumptions called Gaussian processes, which limited how well it could model complex situations. The authors introduced a new way using diffusion transformers—advanced AI models—trained on more flexible assumptions that can describe a wider range of functions. Their approach allows better guessing about unknown functions and improves finding the best solutions in tests compared to traditional methods.
Open → 2611.14656v1

Preference aware training boosts solution search in optimization tasks

APO2CS: Advantage-Aware Preference Optimization for Two-Level Constructive Search in Combinatorial Optimization

Abstract: Preference optimization has emerged as a promising alternative to reward-based training for neural combinatorial optimization. However, existing methods typically rely on binary pairwise labels, which discard the magnitude of solution-quality differences and provide supervision only at the complete-solution level. We propose Advantage-aware Preference Optimization for Two-level Constructive Search (APO2CS), a preference-based training objective for constructive neural solvers that integrates both macro-level and micro-level supervision. At the macro level, APO2CS enriches pairwise preferences with an advantage term derived from objective-value differences. At the micro level, it compares partial trajectories, thereby providing denser supervision throughout the sequential construction process. The resulting objective can be used either to train a policy from scratch or to fine-tune a pretrained one. Experimental results show that APO2CS improves the expressiveness and search capability of preference learning for combinatorial optimization, while demonstrating strong effectiveness and adaptability across multiple combinatorial optimization tasks.

Mon 9 NovMachine Learning
The gist
Combinatorial optimization involves finding the best arrangement or combination out of many possibilities, which is often very complex. Traditional neural approaches use simple yes-or-no comparisons of complete solutions to guide learning, ignoring how much better one solution is compared to another. The authors propose APO2CS, a new method that considers both the degree of difference between complete solutions and intermediate steps during solution construction. This allows the training to provide more detailed guidance at multiple levels, helping the solver learn better strategies and improve its performance across different optimization problems.
Open → 2611.11792v1

Verification strength does not improve ai-driven discovery quality

Verifier strength does not buy discovery quality: a pre-registered two-domain test of LLM-based automated research, with post-hoc evidence pointing to proposer-pool composition

Abstract: Automated research pipelines pair an LLM proposer with a verifier on an implicit bet: discovery quality rises with verification strength. Under a pre-registered protocol we test this bet in two real-data domains -- job-shop scheduling and vehicular edge offloading on Beijing T-Drive trajectories -- across 100 matched LLM/random pairs per domain and three verifier tiers. The manipulation binds -- a 429-case mutation battery shows scores rising across tiers -- yet the paired LLM-over-random advantage does not scale with it (A, one-sided p=0.1115; D, p=0.9994), and in D shrinks under the strict tier (margin contrast -0.040, p=0.0013). The two lower gates promote identical candidates in 100/100 and 99/100 pairs, so the strict order is untestable when they coincide. Constructively, LLM proposals carry a real paired advantage over random controls, but a post-hoc union-pool analysis shows the fastest path to better discovery is widening the pool, not tightening the gate: mixing the two pools adds +1.52 holdout-value units in domain A (one-sided Wilcoxon, n=100, p=0.0002) -- evidence that pool composition, not verification strength, is the lever. Criteria, ledgers and scripts are archived on Zenodo (DOI: 10.5281/zenodo.23308866).

Tue 3 NovArtificial IntelligenceSoftware Engineering
The gist
Finding valuable new solutions with AI often involves a system that suggests ideas and another that checks them carefully. The authors tested whether making the checking step stronger really helps find better results in two complex problems. They found that while AI-generated ideas are better than random guesses, making the verifier stronger did not lead to better discoveries. Instead, having a wider variety of suggestions from different sources helped improve the quality more than stricter checking.
Open → 2611.04420v1

Optimization method improves search on unknown shapes from sample points

Riemannian Optimization on Unknown Manifolds via Stochastic Proximal Refinement

Abstract: We study Riemannian optimization on an unknown manifold accessed only through feasible samples. The central challenge is to turn feasible samples into optimization steps, i.e., the samples are drawn from the unknown feasible manifold, but do not directly provide the tangent spaces, projections, or retractions required by classic Riemannian methods. Moreover, regions with low objective values may be sparsely represented in the data, so directly sampling from a distribution fitted to these observations can require many draws to find better feasible solutions. We introduce Proximal Refinement on Implicit Smooth Manifolds (PRISM), which turns feasible-sample access into an iterative optimization procedure by repeatedly sampling an objective-aware proximal distribution conditioned on the current iterate. Theoretically, we show that PRISM recovers the effect of Riemannian-gradient refinement, leading to provable objective descent, feasibility (manifold adherence), and convergence toward first-order stationarity. We demonstrate the effectiveness of our approach through synthetic experiments illustrating its geometric properties and applications to data-driven building control and diverse real world optimization tasks, highlighting its potential as a general framework for data-driven optimization across scientific and engineering domains.

Fri 30 OctMachine Learning
The gist
Sometimes people want to find the best solution that fits certain rules defined by a complicated shape, but they only have a few examples that follow the rules instead of a clear description of the shape. The authors designed a way called PRISM that uses these example points to take smart steps toward better solutions without needing to know the shape’s details. Their method keeps solutions valid and gradually improves the objective being optimized. They tested their idea on made-up examples and real control and optimization tasks, showing it works well in practice.
Open → 2610.41379v1

Learning-based method decides when to use cooperative coevolution

WCC: A Learning-Based Framework for Deciding When to Apply Cooperative Coevolution in Large-Scale Optimization

Abstract: Cooperative Coevolution (CC) and Non-Decomposition Algorithms (NDAs) are two primary approaches for large-scale global optimization (LSGO). Although both have achieved success, they exhibit markedly different performance across problem types and each faces approach-specific limitations, leaving the question of "when to use CC" unresolved. We address this gap with WCC, a novel learning-based framework that dynamically decides when to deploy CC in LSGO. WCC employs a streamlined design for efficient adaptive learning. We formulate the decision as a Markov decision process, designing a targeted feature set, a robust reward, and a tailored network architecture to provide the agent with rich information about the problem state and optimization progress. Our auto-regressive policy enables WCC to perform fine-grained, dynamic switching between CC and NDAs while conditionally allocating the computational budget without expert specifications. WCC shows strong competitiveness and superior generalization across problems, optimization horizons, and baseline optimizers. It realizes a "train-once and reuse" paradigm under a low budget, significantly curbing LSGO cost. Additionally, in-depth analyses yield insights not captured by existing theory, offering practical guidance on when and how to effectively deploy CC.

Tue 27 OctMachine LearningArtificial Intelligence
The gist
Large-scale optimization problems are hard to solve because they involve many variables and different strategies work better for different problems. The authors developed WCC, a smart system that learns during optimization to decide when to use a method called Cooperative Coevolution or another approach. WCC switches between methods dynamically to save computing effort without needing experts to tell it how. It performs well across various problems and lets users train once and reuse the strategy, reducing costs and offering helpful advice on applying Cooperative Coevolution effectively.
Open → 2610.37329v1