Biblio Discovery — Demo Discovery Service

15,610 results for "Optimization"

Showing 1–20 · 0.15 seconds · RSS

  1. Preprint Full text

    Quality-Diversity Optimization as Multi-Objective Optimization

    Lin, Xi; Guo, Ping; Liu, Yilu et al.

    arXiv · 2026 · English · arXiv

    The Quality-Diversity (QD) optimization aims to discover a collection of high-performing solutions that simultaneously exhibit diverse behaviors within a user-defined behavior space. This paradigm has stimulated significant research interest and demonstrated practical utility in domains including…

  2. Preprint Full text

    Quantum Optimization

    Hogg, Tad; Portnov, Dmitriy

    arXiv · 2000 · English · arXiv

    We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with randomly generated problem instances show each step of the…

  3. Preprint Full text

    Amortized Molecular Optimization via Group Relative Policy Optimization

    Javaid, Muhammad bin; Hussain, Hasham; Khanna, Ashima et al.

    arXiv · 2026 · English · arXiv

    …via sequential atom-and-bond additions. We employ Group Relative Policy Optimization (GRPO) for goal-directed fine-tuning to mitigate variance by normalizing rewards relative to the starting structure. Empirically, GRXForm generalizes to out-of-distribution molecular scaffolds without…

From your institution’s collections

Perpustakaan Kampus · 12 print titlesShow all
  1. Preprint Full text

    Dynamic Priors in Bayesian Optimization for Hyperparameter Optimization

    Fehring, Lukas; Wever, Marcel; Spliethöver, Maximilian et al.

    arXiv · 2025 · English · arXiv

    Bayesian optimization (BO) is a widely used approach to hyperparameter optimization (HPO). However, most existing HPO methods only incorporate expert knowledge during initialization, limiting practitioners' ability to influence the optimization process as new insights emerge. This limits the…

  2. Preprint Full text

    Quantum Approximate Optimization Algorithm for Test Case Optimization

    Wang, Xinyi; Ali, Shaukat; Yue, Tao et al.

    arXiv · 2023 · English · arXiv

    Test case optimization (TCO) reduces software testing cost while preserving its effectiveness, but solving TCO problems for large-scale and complex systems requires substantial computational resources. Quantum approximate optimization algorithms (QAOAs) are promising combinatorial optimization…

  3. Preprint Full text

    A Representation Optimization Dichotomy, Lie-Algebraic Policy Optimization

    KC, Sooraj; Mishra, Vivek

    arXiv · 2026 · English · arXiv

    Structured reinforcement learning and stochastic optimization often involve parameters evolving on matrix Lie groups such as rotations and rigid-body transformations. We establish a representation-optimization dichotomy for Lie-algebra-parameterized Gaussian policy objectives in the Lie Group MDP…

  4. Preprint Full text

    A partitioned optimization framework for structure-aware optimization

    Audet, Charles; Bouchet, Pierre-Yves; Bourdin, Loïc

    arXiv · 2024 · English · arXiv

    This work tackles a class of optimization problems in which fixing some well-chosen combinations of the variables makes the problem substantially easier to solve. We consider that the variables space may be partitioned into subsets that fix these combinations to given values, so that the…

  5. Preprint Full text

    Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm

    Uotila, Valter; Ripatti, Julia; Zhao, Bo

    arXiv · 2025 · English · arXiv

    Portfolio optimization is one of the most studied optimization problems at the intersection of quantum computing and finance. In this work, we develop the first quantum formulation for a portfolio optimization problem with higher-order moments, skewness and kurtosis. Including higher-order moments…

  6. Preprint Full text

    Evolutionary Optimization Trumps Adam Optimization on Embedding Space Exploration

    Neto, Domício Pereira; Correia, João; Machado, Penousal

    arXiv · 2025 · English · arXiv

    …without altering the model weights. We explore prompt-embedding search optimization for the Stable Diffusion XL Turbo model, comparing a gradient-free evolutionary approach, the Separable Covariance Matrix Adaptation Evolution Strategy (sep-CMA-ES), against the widely used gradient-based optimizer…

  7. Preprint Full text

    Performative Scenario Optimization

    Zhu, Quanyan; Han, Zhengye

    arXiv · 2026 · English · arXiv

    This paper introduces a performative scenario optimization framework for decision-dependent chance-constrained problems. Unlike classical stochastic optimization, we account for the feedback loop where decisions actively shape the underlying data-generating process. We define performative solutions…

  8. Preprint Full text

    Log-Polynomial Optimization

    Choi, Jiyoung; Nie, Jiawang; Tang, Xindong et al.

    arXiv · 2026 · English · arXiv

    We study an optimization problem in which the objective is given as a sum of logarithmic-polynomial functions. This formulation is motivated by statistical estimation principles such as maximum likelihood estimation, and by loss functions including cross-entropy and Kullback-Leibler divergence. We…

  9. Preprint Full text

    Fibration Policy Optimization

    Li, Chang; Tsu, Tshihao; Zhang, Yaren et al.

    arXiv · 2026 · English · arXiv

    …establishing that clipping-based surrogate design and trust-region optimization are dual formulations of the same problem. Building on this foundation, we develop Fiber Bundle Gating (FBG), an algebraic framework that organizes sampled RL data as a fiber bundle and decomposes ratio gating into a…

  10. Preprint Full text

    Mean Robust Optimization

    Wang, Irina; Becker, Cole; Van Parys, Bart et al.

    arXiv · 2022 · English · arXiv

    Robust optimization is a tractable and expressive technique for decision-making under uncertainty, but it can lead to overly conservative decisions when pessimistic assumptions are made on the uncertain parameters. Wasserstein distributionally robust optimization can reduce conservatism by being…

  11. Preprint Full text

    Target Policy Optimization

    Kaddour, Jean

    arXiv · 2026 · English · arXiv

    …clipping, and other optimizer choices. We introduce \emph{Target Policy Optimization} (TPO), which separates the two questions. Given scored completions, TPO constructs a target distribution $q_i \propto p_i^{\,\mathrm{old}} \exp(u_i)$ and fits the policy to it by cross-entropy. The loss gradient…

  12. Preprint Full text

    Optimization with SpotOptim

    Bartz-Beielstein, Thomas

    arXiv · 2026 · English · arXiv

    The `spotoptim` package implements surrogate-model-based optimization of expensive black-box functions in Python. Building on two decades of Sequential Parameter Optimization (SPO) methodology, it provides a Kriging-based optimization loop with Expected Improvement, support for continuous, integer…

  13. Preprint Full text

    Quantum Optimization Problems

    Yamakami, Tomoyuki

    arXiv · 2002 · English · arXiv

    Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a quantum optimization problem using polynomial-time quantum…

  14. Preprint Full text

    Can an Actor-Critic Optimization Framework Improve Analog Design Optimization?

    Dutta, Sounak; Amin, Fin; Panda, Sushil et al.

    arXiv · 2026 · English · arXiv

    …when deciding where to search next. This paper presents an actor-critic optimization framework (ACOF) for analog sizing that brings that form of guidance into the loop. Rather than treating optimization as a purely black-box search problem, ACOF separates the roles of proposal and evaluation: an…

  15. Preprint Full text

    Reference-guided Policy Optimization for Molecular Optimization via LLM Reasoning

    Li, Xuan; Zhou, Zhanke; Li, Zongze et al.

    arXiv · 2026 · English · arXiv

    …However, these recipes perform poorly in instruction-based molecular optimization, where each data point typically provides only a single optimized reference molecule and no step-by-step optimization trajectory. We reveal that answer-only SFT on the reference molecules collapses reasoning, and RLVR…

  16. Preprint Full text

    Heterogeneous Adaptive Policy Optimization: Tailoring Optimization to Every Token's Nature

    Liu, Zheng; Liu, Mengjie; Wen, Siwei et al.

    arXiv · 2025 · English · arXiv

    Using entropy as a measure of heterogeneity to guide optimization has emerged as a crucial research direction in Reinforcement Learning for LLMs. However, existing methods typically treat it as a discrete filter or post-hoc regulator rather than a core optimization driver. To fully leverage the…

  17. Preprint Full text

    Sequential Quadratic Optimization for Solving Expectation Equality Constrained Stochastic Optimization Problems

    Shen, Haoming; Zeng, Yang; Zhou, Baoyu

    arXiv · 2025 · English · arXiv

    A sequential quadratic programming method is designed for solving general smooth nonlinear stochastic optimization problems subject to expectation equality constraints. We consider the setting where the objective and constraint function values, as well as their derivatives, are not directly…

Showing at most 50 pages. Narrow your search with filters for more specific results.