A Methodology for Effective Surrogate Learning in Complex Optimization

• URL: http://arxiv.org/abs/2602.08825v1
• Date: Mon, 09 Feb 2026 15:57:50 GMT
• Title: A Methodology for Effective Surrogate Learning in Complex Optimization
• Abstract summary: We introduce the PTME methodology to study deep learning surrogates by analyzing their Precision, Time, Memory, and Energy consumption.<n>We propose different surrogates for a real problem in optimally organizing the network of traffic lights in European cities.<n>We use the built surrogates in new optimization metaheuristics for decision-making in real cities.
• Score: 0.4231181719953952
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Solving complex problems requires continuous effort in developing theory and practice to cope with larger, more difficult scenarios. Working with surrogates is normal for creating a proxy that realistically models the problem into the computer. Thus, the question of how to best define and characterize such a surrogate model is of the utmost importance. In this paper, we introduce the PTME methodology to study deep learning surrogates by analyzing their Precision, Time, Memory, and Energy consumption. We argue that only a combination of numerical and physical performance can lead to a surrogate that is both a trusted scientific substitute for the real problem and an efficient experimental artifact for scalable studies. Here, we propose different surrogates for a real problem in optimally organizing the network of traffic lights in European cities and perform a PTME study on the surrogates' sampling methods, dataset sizes, and resource consumption. We further use the built surrogates in new optimization metaheuristics for decision-making in real cities. We offer better techniques and conclude that the PTME methodology can be used as a guideline for other applications and solvers.

Related papers

• AI Agents for Inventory Control: Human-LLM-OR Complementarity [12.448705668487852]
  Large language models (LLMs) have generated interest in AI agents that can reason flexibly and incorporate rich contextual signals.<n>We study how OR algorithms, LLMs, and humans can interact and complement each other in a multi-period inventory control setting.<n>We show that, on average, human-AI teams achieve higher profits than either humans or AI agents operating alone.
  arXiv  Detail & Related papers  (2026-02-13T05:23:46Z)
• Opportunities in AI/ML for the Rubin LSST Dark Energy Science Collaboration [63.61423859450929]
  This white paper surveys the current landscape of AI/ML across DESC's primary cosmological probes and cross-cutting analyses.<n>We identify key methodological research priorities, including Bayesian inference at scale, physics-informed methods, validation frameworks, and active learning for discovery.
  arXiv  Detail & Related papers  (2026-01-20T18:46:42Z)
• Energy and Quality of Surrogate-Assisted Search Algorithms: a First Analysis [2.0099933815960256]
  We study how surrogates are helping metaheuristics from an important and understudied point of view: their energy profile.<n>Our conclusions shed new light on this topic and could be understood as the first step towards a methodology for assessing surrogate-assisted algorithms.
  arXiv  Detail & Related papers  (2025-08-11T07:07:55Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Towards Sample-Efficiency and Generalization of Transfer and Inverse Reinforcement Learning: A Comprehensive Literature Review [43.27239522837257]
  This paper is devoted to a comprehensive review of realizing the sample efficiency and generalization of RL algorithms through transfer and inverse reinforcement learning (T-IRL)<n>Our findings denote that a majority of recent research works have dealt with the aforementioned challenges by utilizing human-in-the-loop and sim-to-real strategies.<n>Under the IRL structure, training schemes that require a low number of experience transitions and extension of such frameworks to multi-agent and multi-intention problems have been the priority of researchers in recent years.
  arXiv  Detail & Related papers  (2024-11-15T15:18:57Z)
• A Tutorial on the Design, Experimentation and Application of Metaheuristic Algorithms to Real-World Optimization Problems [16.890440704820367]
  In spite of decades of historical advancements on the design and use of metaheuristics, large difficulties still remain in regards to the understandability, algorithmic design uprightness, and performance verifiability of new technical achievements. This work aims at providing the audience with a proposal of good practices which should be embraced when conducting studies about metaheuristics methods used for optimization.
  arXiv  Detail & Related papers  (2024-10-04T07:41:23Z)
• Machine Learning Insides OptVerse AI Solver: Design Principles and Applications [74.67495900436728]
  We present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI solver. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. We detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance.
  arXiv  Detail & Related papers  (2024-01-11T15:02:15Z)
• Enhancing Inverse Problem Solutions with Accurate Surrogate Simulators and Promising Candidates [0.7499722271664147]
  The impact of surrogate simulators' accuracy on the solutions in the neural adjoint (NA) method remains uncertain. We develop an extension of the NA method, named Neural Lagrangian (NeuLag) method, capable of efficiently optimizing a sufficient number of solution candidates.
  arXiv  Detail & Related papers  (2023-04-26T23:05:57Z)
• Learning (Local) Surrogate Loss Functions for Predict-Then-Optimize Problems [58.954414264760956]
  Decision-Focused Learning (DFL) is a paradigm for tailoring a predictive model to a downstream optimisation task. We present an approach to learn faithful task-specific surrogates which (a) only requires access to a black-box oracle that can solve the optimisation problem and is thus generalizable, and (b) can be convex by gradients and so can be easily optimized over.
  arXiv  Detail & Related papers  (2022-03-30T05:46:54Z)
• A Field Guide to Federated Optimization [161.3779046812383]
  Federated learning and analytics are a distributed approach for collaboratively learning models (or statistics) from decentralized data. This paper provides recommendations and guidelines on formulating, designing, evaluating and analyzing federated optimization algorithms.
  arXiv  Detail & Related papers  (2021-07-14T18:09:08Z)
• An Online Method for A Class of Distributionally Robust Optimization with Non-Convex Objectives [54.29001037565384]
  We propose a practical online method for solving a class of online distributionally robust optimization (DRO) problems. Our studies demonstrate important applications in machine learning for improving the robustness of networks.
  arXiv  Detail & Related papers  (2020-06-17T20:19:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.