20 results for “Knowledge of optimization techniques”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Helena Stegherr, Michael Heider, Nils Meyer, Tobias Thummerer +6 more
This paper analyzes the performance and explainability requirements of evolutionary algorithms when applied to complex, real-world physics-informed optimization problems, identifying a gap between cur…
Shuoming Zhang, Qiuchu Yu, Yangyu Zhang, Ruiyuan Xu +5 more
KLineage introduces a novel method to teach LLMs when and how to apply GPU kernel optimizations by reverse-engineering expert kernel lineages, resulting in superior optimization skills compared to exi…
Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more
The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
The paper improves the optimization problem at the core of the laser method for obtaining matrix multiplication bounds, yielding a new upper bound of ω < 2.371177.
This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.
This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.
The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…
This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…
The paper establishes a lower bound for the improvement of linear dependence on the restricted condition number in sparse convex optimization, using the Small-Set Expansion Hypothesis.
This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.
A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.
This paper rigorously proves that a Reinforcement Learning Hyper-heuristic (RLHH) optimizes the LeadingOnes benchmark function with optimal expected runtime using two random local search operators, ou…
Jing-Zhe Xu, Zhi-Wei Liu, Ming-Feng Ge, Yan-Wu Wang +1 more
A new algorithm is developed for distributed optimization in networked nonlinear systems with input delays and consensus constraints.
This paper provides theoretical analysis of parameter settings for the bat algorithm using dynamical systems and population variance theory, and validates the results through numerical experiments.