ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Bayesian A-optimal design (Bayesian AOD) denote the problem of selecting a subset of design vectors to minimize the regularized trace objective

f(S):=tr⁡((∑i∈Saiai⊤+λId)−1).f(S):=\operatorname{tr}\left(\left(\sum_{i\in S}\bm a_i\bm a_i^{\top}+\lambda\bm I_d\right)^{-1}\right).

Hendrych's NP-hardness conjecture. The Bayesian AOD problem is NP-hard. This conjecture is resolved in the source: the paper proves NP-hardness for its regularized A-optimal design problem and notes that this problem is a special case of Bayesian AOD.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.