arXiv:2402.16565
공식 코드 · Papers with Code
Partial Rankings of Optimizers
원문 초록
We introduce a framework for benchmarking optimizers according to multiple criteria over various test functions. Based on a recently introduced union-free generic depth function for partial orders/rankings, it fully exploits the ordinal information and allows for incomparability. Our method describes the distribution of all partial orders/rankings, avoiding the notorious shortcomings of aggregation. This permits to identify test functions that produce central or outlying rankings of optimizers and to assess the quality of benchmarking suites.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.