ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Knowledge of optimization techniques”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEcs.AIRecentMay 27, 2026

Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization

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…

View →
cs.AIRecentMay 27, 2026

Learning When to Optimize: Verified Optimization Skills from Expert GPU-Kernel Lineages

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…

View →
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

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.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.DScs.AIcs.CCTheoreticalRecentAug 17, 2026

Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii, Abbas Mehrabian +6 more

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.

View →
cs.NEcs.AIcs.LGEmpiricalRecentJun 10, 2026

Mathematical perspective on genetic algorithms with optimization guided operators

Anna Brandenberger, Ilan Doron-Arad, Elchanan Mossel

This paper introduces a general model of genetic algorithms and studies their optimization problems using reinforcement learning.

View →
cs.CCTheoreticalRecentJun 14, 2026

Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry

Ali Ahmadi, Kiarash Banihashem, Iman Gholami, Mohammad Taghi Hajiaghayi +1 more

This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

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…

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

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…

View →
cs.DScs.LGTheoreticalRecentAug 3, 2026

The Condition-Number Barrier in Sparse Least Squares

Honghao Lin, Vahab Mirrokni, David P. Woodruff

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.

View →
cs.NEEmpiricalRecentJun 19, 2026

On the Use of Survival Selection Methods for Evolutionary Diversity Optimisation

Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann

This paper investigates the benefits of generating multiple solutions in each generation for Evolutionary Diversity Optimisation (EDO) and proposes efficient methods to achieve it.

View →
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View →
cs.NEEmpiricalRecentJul 24, 2026

On the Runtime Analysis of Reinforcement Learning Hyper-Heuristics

Pietro S. Oliveto, Zhenyu Wang, Peizhou Wu, Mengqing Xu

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…

View →
math.OCcs.MAeess.SYTheoreticalRecentJun 18, 2026

Semiglobal Input-Delay Tolerance Algorithm for Distributed Nonconvex Optimization of Networked Nonlinear Systems

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.

View →
cs.NEcs.AIcs.LGTheoreticalRecentJun 26, 2026

Analysis of Parameter Settings for the Bat Algorithm Using Variance Evolution

Xin-She Yang, Mehmet Karamanoglu

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.

View →