GenOR-Twin: A Semantic Middleware for Integrating Operational Discourse with Mathematical Optimization

• URL: http://arxiv.org/abs/2609.12863v1
• Date: Fri, 11 Sep 2026 13:49:03 GMT
• Title: GenOR-Twin: A Semantic Middleware for Integrating Operational Discourse with Mathematical Optimization
• Abstract summary: We introduce GenOR-Twin, a neuro-symbolic framework that bridges the translation gap between unstructured operational logs and rigorous mathematical optimization.<n>Our architecture positions Large Language Models as semantic translators rather than direct solvers.<n>We demonstrate the generalization of this approach across six distinct optimization domains.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We introduce GenOR-Twin, a neuro-symbolic framework that bridges the translation gap between unstructured operational logs and rigorous mathematical optimization. Our architecture uniquely positions Large Language Models as semantic translators rather than direct solvers, ensuring that the system retains the feasibility guarantees of exact combinatorial methods. { \color{red}We design a dynamic constraint injection mechanism (the runtime translation of qualitative disruption events into formal mathematical constraints) that allows the system to structurally modify the optimization problem's feasibility region in real-time based on qualitative human inputs. The resulting bidirectional coupling---where operational observations update the virtual model state and optimized decisions are reflected back into the Knowledge Graph---satisfies the synchronization requirement of a proper Digital Twin. The framework features an adaptive decision policy} that automatically selects between low-complexity schedule repair and full re-optimization by analyzing the available system slack. Finally, we demonstrate the generalization of this approach across six distinct optimization domains, {\color{red}turning static models into resilient systems that adapt to the operational uncertainty and variability of real-world environments.}

Related papers

• OptiAgent: End-to-End Optimization Modeling via Multi-Agent Iterative Refinement [0.0]
  OptiAgent is a multi-agent framework that is able to output a solver-ready mathematical formulation as well as executable code.<n>Our architecture prioritizes the mathematical modeling step, where dedicated agents extract structures.<n>We introduce a novel multi-loop validation architecture with four specialized feedback mechanisms, each targeting a distinct failure mode.
  arXiv  Detail & Related papers  (2026-07-06T17:27:16Z)
• Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches [14.24802309734814]
  This paper introduces an agentic re-optimization framework in which a large language model (LLM) acts as an OR expert.<n>The proposed framework enables interactive and continuous adaptation of deployed optimization models.
  arXiv  Detail & Related papers  (2026-05-18T17:28:25Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• A General and Streamlined Differentiable Optimization Framework [10.851559133306196]
  This paper presents the DiffOptl interface for Julia optimization framework.<n>A first-class JuMP-native API allows users to obtain named parameters derivatives directly with respect to them.<n>Results demonstrate that differentiing a routine can be as a training tool for experimentation, learning, and design-without deviating from standard JuMP modeling practices.
  arXiv  Detail & Related papers  (2025-10-29T21:42:36Z)
• Tuning for Trustworthiness -- Balancing Performance and Explanation Consistency in Neural Network Optimization [49.567092222782435]
  We introduce the novel concept of XAI consistency, defined as the agreement among different feature attribution methods.<n>We create a multi-objective optimization framework that balances predictive performance with explanation.<n>Our research provides a foundation for future investigations into whether models from the trade-off zone-balancing performance loss and XAI consistency-exhibit greater robustness.
  arXiv  Detail & Related papers  (2025-05-12T13:19:14Z)
• Localized Physics-informed Gaussian Processes with Curriculum Training for Topology Optimization [3.6352820455705372]
  We introduce a simultaneous and meshfree topology optimization (TO) framework based on physics-informed Gaussian processes (GPs)<n>Our framework endows all design and state variables via GP priors which have a shared, multi-output mean function that is parametrized via a customized deep neural network (DNN)<n>Our TO approach yields well-defined material interfaces and has a built-in continuation nature that promotes global optimality.
  arXiv  Detail & Related papers  (2025-03-18T22:59:16Z)
• Context-Aware Neural Gradient Mapping for Fine-Grained Instruction Processing [0.0]
  This paper introduces a dynamic gradient adjustment mechanism, incorporating contextual embeddings directly into the optimization process.<n>The proposed framework consistently outperforms baseline models across various metrics, including accuracy, robustness to noise, and computational efficiency.<n>The integration of context-specific embeddings allows for a more complex understanding of language, thereby improving the model's ability to handle diverse linguistic phenomena.
  arXiv  Detail & Related papers  (2025-01-24T21:49:24Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• Bayesian Prompt Learning for Image-Language Model Generalization [64.50204877434878]
  We use the regularization ability of Bayesian methods to frame prompt learning as a variational inference problem. Our approach regularizes the prompt space, reduces overfitting to the seen prompts and improves the prompt generalization on unseen prompts. We demonstrate empirically on 15 benchmarks that Bayesian prompt learning provides an appropriate coverage of the prompt space.
  arXiv  Detail & Related papers  (2022-10-05T17:05:56Z)
• Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces [54.58348769621782]
  Tree ensembles can be well-suited for black-box optimization tasks such as algorithm tuning and neural architecture search. Two well-known challenges in using tree ensembles for black-box optimization are (i) effectively quantifying model uncertainty for exploration and (ii) optimizing over the piece-wise constant acquisition function. Our framework performs as well as state-of-the-art methods for unconstrained black-box optimization over continuous/discrete features and outperforms competing methods for problems combining mixed-variable feature spaces and known input constraints.
  arXiv  Detail & Related papers  (2022-07-02T16:59:37Z)
• Slimmable Domain Adaptation [112.19652651687402]
  We introduce a simple framework, Slimmable Domain Adaptation, to improve cross-domain generalization with a weight-sharing model bank. Our framework surpasses other competing approaches by a very large margin on multiple benchmarks.
  arXiv  Detail & Related papers  (2022-06-14T06:28:04Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)

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.