Cover Image

BoLT: A Benchmark to Democratize Black-box Optimization Research for Expensive LLM Tasks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chew, Ruth Wan Theng, Chen, Zhiliang, Hemachandra, Apivich, Low, Bryan Kian Hsiang
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

BILBO: BILevel Bayesian Optimization
by: Chew, Ruth Wan Theng, et al.
Published: (2025)

PIED: Physics-Informed Experimental Design for Inverse Problems
by: Hemachandra, Apivich, et al.
Published: (2025)

PINNACLE: PINN Adaptive ColLocation and Experimental points selection
by: Lau, Gregory Kang Ruey, et al.
Published: (2024)

DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Tasks
by: Chen, Zhiliang, et al.
Published: (2025)

The Chicken and Egg Dilemma: Co-optimizing Data and Model Configurations for LLMs
by: Chen, Zhiliang, et al.
Published: (2026)

Broaden your SCOPE! Efficient Multi-turn Conversation Planning for LLMs with Semantic Space
by: Chen, Zhiliang, et al.
Published: (2025)

Dependency Structure Search Bayesian Optimization for Decision Making Models
by: Rajpal, Mohit, et al.
Published: (2023)

Decentralized Sum-of-Nonconvex Optimization
by: Liu, Zhuanghua, et al.
Published: (2024)

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
by: Verma, Arun, et al.
Published: (2024)

DETAIL: Task DEmonsTration Attribution for Interpretable In-context Learning
by: Zhou, Zijian, et al.
Published: (2024)

On Constructing Algorithm Portfolios in Algorithm Selection for Computationally Expensive Black-box Optimization in the Fixed-budget Setting
by: Yoshikawa, Takushi, et al.
Published: (2024)

Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
by: Verma, Arun, et al.
Published: (2024)

COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents
by: Verma, Arun, et al.
Published: (2025)

Data value estimation on private gradients
by: Zhou, Zijian, et al.
Published: (2024)

Prompt Optimization with Human Feedback
by: Lin, Xiaoqiang, et al.
Published: (2024)

BarrierSteer: LLM Safety via Learning Barrier Steering
by: Tran, Thanh Q., et al.
Published: (2026)

Paid with Models: Optimal Contract Design for Collaborative Machine Learning
by: Wang, Bingchen, et al.
Published: (2024)

ActiveDPO: Active Direct Preference Optimization for Sample-Efficient Alignment
by: Lin, Xiaoqiang, et al.
Published: (2025)

Uncovering Scaling Laws for Large Language Models via Inverse Problems
by: Verma, Arun, et al.
Published: (2025)

DeRDaVa: Deletion-Robust Data Valuation for Machine Learning
by: Tian, Xiao, et al.
Published: (2023)

INO-SGD: Addressing Utility Imbalance under Individualized Differential Privacy
by: Tian, Xiao, et al.
Published: (2026)

Understanding Domain Generalization: A Noise Robustness Perspective
by: Qiao, Rui, et al.
Published: (2024)

Self-Interested Agents in Collaborative Machine Learning: An Incentivized Adaptive Data-Centric Framework
by: Vijayan, Nithia, et al.
Published: (2024)

AutoSG: LLM-Driven Solver Generation Solely from Task Prompts for Expensive Optimization
by: Gu, Haoran, et al.
Published: (2026)

Fine-tuning Language Models with Generative Adversarial Reward Modelling
by: Yu, Zhang Ze, et al.
Published: (2023)

REFRAG: Rethinking RAG based Decoding
by: Lin, Xiaoqiang, et al.
Published: (2025)

Constrained Efficient Global Optimization of Expensive Black-box Functions
by: Xu, Wenjie, et al.
Published: (2022)

Localized Zeroth-Order Prompt Optimization
by: Hu, Wenyang, et al.
Published: (2024)

Helpful or Harmful Data? Fine-tuning-free Shapley Attribution for Explaining Language Model Predictions
by: Wang, Jingtan, et al.
Published: (2024)

TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding
by: Wu, Zhaoxuan, et al.
Published: (2025)

Ferret: Federated Full-Parameter Tuning at Scale for Large Language Models
by: Shu, Yao, et al.
Published: (2024)

Task-free Adaptive Meta Black-box Optimization
by: Wang, Chao, et al.
Published: (2026)

Group-robust Sample Reweighting for Subpopulation Shifts via Influence Functions
by: Qiao, Rui, et al.
Published: (2025)

EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions
by: Bliek, Laurens, et al.
Published: (2021)

How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning
by: Chen, Jiangwei, et al.
Published: (2026)

On Newton's Method to Unlearn Neural Networks
by: Bui, Nhung, et al.
Published: (2024)

Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplars
by: Wu, Zhaoxuan, et al.
Published: (2024)

Is Data Shapley Not Better than Random in Data Selection? Ask NASH
by: Tian, Xiao, et al.
Published: (2026)

Uncertainty Quantification for Multimodal Large Language Models with Incoherence-adjusted Semantic Volume
by: Lau, Gregory Kang Ruey, et al.
Published: (2026)

Incentivizing Truthfulness and Collaborative Fairness in Bayesian Learning
by: Sim, Rachael Hwee Ling, et al.
Published: (2026)