arXiv:1807.10068
공식 코드 · Papers with Code
A Linear Constrained Optimization Benchmark For Probabilistic Search Algorithms: The Rotated Klee-Minty Problem
원문 초록
The development, assessment, and comparison of randomized search algorithms heavily rely on benchmarking. Regarding the domain of constrained optimization, the number of currently available benchmark environments bears no relation to the number of distinct problem features. The present paper advances a proposal of a scalable linear constrained optimization problem that is suitable for benchmarking Evolutionary Algorithms. By comparing two recent EA variants, the linear benchmarking environment is demonstrated.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SenseShift6D: Multimodal RGB-D Benchmarking for Robust 6D Pose Estimation across Environment and Sensor Variations
DVFL-Net: A Lightweight Distilled Video Focal Modulation Network for Spatio-Temporal Action Recognition
DCR: Quantifying Data Contamination in LLMs Evaluation
FLsim: A Modular and Library-Agnostic Simulation Framework for Federated Learning
DrafterBench: Benchmarking Large Language Models for Tasks Automation in Civil Engineering
Ref-Long: Benchmarking the Long-context Referencing Capability of Long-context Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.