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

~ similar to 2606.12382· 17 results

math.OCcs.AIcs.NERecentMay 27, 2026

Preference-Shaped Expected Hypervolume and R2 Improvement: Exact Computation and Monotonicity

Michael T. M. Emmerich

The paper analyzes preference-shaped expected improvement criteria for Bayesian multiobjective optimization, precisely characterizing when transformations preserve key properties like exact computatio…

View →
cs.LGcs.AIcs.NERecentJun 3, 2026

ParetoPilot: Zero-Surrogate Offline Multi-Objective Optimization via Infer-Perturb-Guide Diffusion

Ruiqing Sun, Sen Yang, Dawei Feng, Bo Ding +2 more

ParetoPilot introduces a novel zero-surrogate diffusion framework for offline multi-objective optimization, achieving state-of-the-art performance by directly guiding the generation process without re…

View →
cs.LGcs.AImath.OCRecentMay 28, 2026

A Unified Framework for Gradient Aggregation in Multi-Objective Optimization

Zeou Hu, Kelvin Ho, Yaoliang Yu

The paper introduces a unified theoretical framework for gradient aggregation in multi-objective optimization, establishing convergence rates and sufficient conditions for achieving Pareto stationarit…

View →
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.NEcs.AIcs.DSRecentMay 27, 2026

A Fresh Look at Lamarckian Evolution and the Baldwin Effect

Inès Benito, Johannes F. Lutzeyer, Benjamin Doerr

The paper empirically and theoretically demonstrates that incorporating Lamarckian and Baldwinian mechanisms into evolutionary algorithms significantly outperforms standard Darwinian evolution, especi…

View →
cs.CLcs.AIcs.LGRecentMay 28, 2026

Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits

Sixue Xing, Haoyu He, Kerui Wu, Zhuo Yang +3 more

The paper proposes BaSE, a multi-armed bandit approach, to optimally allocate a fixed budget of LLM calls across parallel evolutionary search trajectories, significantly improving mean fitness and rel…

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.AIRecentMay 28, 2026

LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning

Elliot Gestrin, Jendrik Seipp

This paper introduces the first LLM-generated, domain-independent heuristics for symbolic AI planning, using evolutionary search to surpass the performance of hand-engineered state-of-the-art methods.

View →
cs.CRcs.AIcs.LGRecentMay 18, 2026

MoCo-EA: Exploiting Adversarial Mode Connectivity for Efficient Evolutionary Attacks

Hyo Seo Kim, Gang Luo, Can Chen, Binghui Wang +2 more

The paper introduces MoCo-EA, an evolutionary attack method that replaces standard crossover with a continuous Bézier curve interpolation to efficiently exploit the connected manifold structure of adv…

View →
cs.NEcs.CRRecentApr 19, 2026

Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity

Claude Carlet, Marko Čupić, Marko Ðurasevic, Domagoj Jakobovic +2 more

The paper investigates the ability of evolutionary computation to discover monotone Boolean functions with high nonlinearity, demonstrating that genetic programming is a highly effective encoding for…

View →
cs.LGstat.MLRecentJun 1, 2026

Local Preferential Bayesian Optimization

Johanna Menn, Miriam Kober, Paul Brunzema, David Stenger +1 more

The paper introduces local Preferential Bayesian Optimization (PBO) methods that adapt high-dimensional Bayesian Optimization techniques, such as trust-region and derivative-informed local search, to…

View →
cs.NEcs.AIcs.SCRecentMay 27, 2026

Improving Evaluation of Recombination-based Cartesian Genetic Programming

Duy Long Tran, Anja Jankovic, Marie Anastacio, Holger Hoos +1 more

This paper demonstrates that optimizing hyperparameters for two specific recombination operators can significantly improve the performance of Cartesian Genetic Programming, which traditionally relies…

View →
cs.NEcs.CRRecentMay 20, 2026

Privacy-Preserving Distributed Optimization Under Time Constraints Using Secure Multi-Party Computation and Evolutionary Algorithms

Sebastian Gruber, Tobias Harzfeld, Christoph G. Schuetz, Florian Wohner +1 more

The paper proposes a novel framework combining evolutionary algorithms and Secure Multi-Party Computation (MPC) to enable privacy-preserving distributed optimization that meets strict time deadlines.

View →
cs.SDcs.AIcs.CRRecentApr 1, 2026

Evolutionary Multi-Objective Fusion of Deepfake Speech Detectors

Vojtěch Staněk, Martin Perešíni, Lukáš Sekanina, Anton Firc +1 more

The paper proposes an evolutionary multi-objective score fusion framework that efficiently combines multiple deepfake speech detectors to achieve state-of-the-art accuracy while significantly reducing…

View →
cs.LGcs.AIRecentJun 1, 2026

How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning

Jiangwei Chen, Xinyuan Niu, Rachael Hwee Ling Sim, Zhengyuan Liu +2 more

The paper proposes a novel, theoretically-grounded algorithm (HAMU) that addresses the challenge of machine unlearning by guaranteeing specified improvements in forget quality while minimizing retain…

View →
cs.GTcs.CRRecentMay 8, 2026

Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation

Zhaoyang Cheng, Guanpu Chen, Yiguang Hong, Ming Cao +1 more

This paper proposes using a zero-determinant (ZD) strategy to construct an effective Moving Target Defense (MTD) that maintains performance comparable to the optimal Stackelberg equilibrium while dras…

View →
cs.NEcs.AIRecentMay 29, 2026

Linear Ordering Problem: Time for a Change

Fabrizio Fagiolo, Marco Baioletti, Valentino Santucci

The paper addresses limitations in the Linear Ordering Problem (LOP) by introducing a novel benchmark suite derived from current economic data and an algorithmic scheme to generate diverse, high-quali…

View →