arXiv:2606. 00862v1 Announce Type: cross Abstract: Surrogate-assisted evolutionary algorithms (SAEAs) have been widely used for expensive black-box optimization problems.
By Xiao Jin, Yongxiong Wang, Haobo Liu, Yudong Du, Yukun Du
arXiv:2607. 24516v1 Announce Type: cross Abstract: While data curation for Vision Language Models (VLMs) is increasingly active, public practice for constructing pretraining mixtures remains largely heuristic: practitioners stack datasets that pass quality filters, set cross-domain ratios by intuition, and lack a principled, attributable criterion for admitting new data, while frontier recipes remain undisclosed.
By Jiahao Xie, Zhongbin Guo, Qianle Wang, Ruiqi Lu, Dongling Xiao, Wanxuan Sun, Cheng Yang
The paper introduces an amortized learning framework for selecting bandwidths in kernel density estimation by optimizing the logarithmic score across a distribution of tasks. It uses a truncated-and-renormalized bounded-support formulation and affine standardization to achieve stable learning and transferability across different intervals. Experiments on Gaussian samples, a multi-family benchmark, and randomized Gaussian mixtures demonstrate that the learned selector outperforms traditional methods such as Silverman’s rule, Sheather–Jones, and least‑squares cross‑validation, especially for small or heterogeneous samples.
By Junyi Liang, Hailiang Du
The paper introduces KENDO, a unified framework that combines Ensemble Gaussian Processes with disagreement‑aware acquisition strategies to address hyperparameter selection in Bayesian optimization and active learning. By replacing costly hyperparameter sampling with a kernel ensemble and adaptive Bayesian weighting, KENDO‑BO and KENDO‑AL provide self‑correcting mechanisms tailored to their respective tasks. Experiments on synthetic and real‑world benchmarks show that KENDO‑BO matches or outperforms state‑of‑the‑art methods while cutting computational cost up to fivefold, and KENDO‑AL delivers better predictive calibration with up to 27‑times speedup compared to MCMC‑based baselines.
By Heng Zhang, Haotian Xiang, Qin Lu, Konstantinos D. Polyzos, Tara Javidi
arXiv:2606. 15115v1 Announce Type: new Abstract: Multi-objective optimization (MOO) has emerged as a powerful approach to solving complex optimization problems involving multiple objectives.
By Yiyi Zhu, Yaolin Wen, Xiang Xia, Xin An, Hanyi Si, Xiang Shu, Yangde Fu, Liang Dou, Hong Qian
arXiv:2609.00647v1 Announce Type: new
Abstract: Multiple kernel $k$-means integrates complementary nonlinear similarities by learning a combination of base kernels. Its pointwise optimization, howeve...
By Xiaoyu Lian, Yuchao Zhang, Shuyin Xia, Siqi Zhong, Xuzhao Xiang