Abstract

To optimize expensive black-box functions over networks, one of the most dominant frameworks is distributed Bayesian optimization (DBO), where local information can be exchanged among agents. However, DBO suffers from low evaluation efficiency due to limited data in the initial stage and the high cost of evaluations among multiple objectives. To tackle these obstacles, we propose a prior-informed multi-task collaborative Bayesian optimization (PMCBO) algorithm over networks. Concretely, PMCBO integrates expert prior knowledge about the location of optimum into the distributed multi-task Bayesian optimization framework to reduce the cost of evaluations. Meanwhile, PMCBO combines multi-task Bayesian optimization with a collaborative mechanism to improve the evaluation efficiency. Furthermore, we rigorously prove that the cumulative regret bound of PMCBO can achieve sub-linearly with high probability, where the acquisition functions employ expected improvement (EI) and upper-confidence bound (UCB) based on a Gaussian process surrogate. Finally, we implement various experiments to evaluate the effectiveness of PMCBO. The experimental results demonstrate that PMCBO can achieve state-of-the-art performance and benefit all clients based on diverse benchmarks and prior characteristics.
Keywords:
black-box functions; <
MSC:
62F15

To mitigate this issue, various surrogate models have been proposed, including Random Forest (RF) [17], Gaussian process (GP) [18], Bayesian Neural Networks (BNNs) [19,20], Tree-structured Parzen Estimator (TPE) [8], and Mondrian trees [21]. These surrogate models focus on constructing useful prior distributions for objective functions and computing posterior beliefs based on observations. Soon afterward, the surrogate model is combined with an acquisition function to guide the selection of the next query for the unknown objective function. In general, the one-step lookahead approach is used in acquisition functions, where the direct effect of the evaluation on an immediate measure of solution quality is considered. For example, Probability of Improvement (PI) [22], EI [23], Knowledge Gradient (KG) [24], UCB [25], Entropy Search (ES) [26], Predictive Entropy Search (PES) [27], and Maxvalue Entropy Search (MES) [28] are used to myopically maximize the immediate improvement in solution quality. In addition, Wu et al. [29] proposed the non-myopic method to improve sampling accuracy. However, the above-mentioned methods in BO suffer from low evaluation efficiency due to limited data in the initial stage.

To address this question, we propose PMCBO, a prior-informed multi-task collaborative Bayesian optimization method. In the design of PMCBO, the following key challenges need to be addressed: (1) how to mitigate the issue of expensive function evaluations in the distributed Bayesian framework; (2) how to facilitate collaborative optimization among clients while maximizing the protection of private information for each client; and (3) how to better integrate expert prior knowledge. To this end, we utilize an expert prior that is represented as a probability distribution on the location of the optimum over the objective function to mitigate the issue of expensive evaluation costs. Moreover, we introduce the consensus mechanism to information exchange among clients to facilitate collaborative optimization. In addition, we consider the prior decay technique to avoid erroneous acquisition due to incorrect prior and the temporally dynamic information-sharing approach to gain consolidated insights within the DBO framework without divulging client-specific information due to privacy or security apprehensions. Therefore, PMCBO can cooperatively construct a meaningful model over the objective function separately. Concretely, the comparisons between existing methods and PMCBO are summarized in Table 1. Our main contributions are threefold:

Education Information Services

The rdf:ID attribute can be used on a property element to reify the triple that it generates (See section 7.3 Reification Rules for the full details). The identifier for the triple should be constructed as a RDF URI reference made from the relative URI reference # concatenated with the rdf:ID attribute value, resolved against the in-scope base URI. So for example if rdf:ID="triple", that would be equivalent to the RDF URI reference formed from relative URI reference #triple against the base URI. Each (rdf:ID attribute value, base URI) pair has to be unique in an RDF/XML document, see constraint-id.


Return to School Today.
>>Proceed by responding to the subsequent questions.
Complete out the Education Grant Evaluation to Find Out If You Qualified for Up to $7,395* in Funds.
Kindly respond to some of these questions to identify suitable program matches.
1. What's your gender?
2. Are you a citizen of the United States?
3. Do you make less than $80,000 a year?
4. Were you born on or before 1977?
You must be 18 or older and have a high school diploma or GED to qualify
Processing answers...
Grant Programs currently provide up to $7,395* per year to those who qualify.
Returning to school is both thrilling and difficult. Considering your desired level of study and professional aspirations, we can assist you in selecting the ideal organization. You can match with colleges and institutions in a matter of minutes.
Our website provides helpful information. Presented information and data are subject to change. Grants or funding may be temporarily paused.By proceeding, you acknowledge it is your responsibility to verify. Inclusion on this website does not imply or represent a direct relationship with the company, or brand. Information, though believed correct at the time of publication, may not be correct, and no warranty is provided. Contact the clinical company to verify any information before relying on it. This funding may be available for those who qualify. The displayed options may include sponsored or recommended results, not necessarily based on your preferences.California Consumer Protection Act (CCPA). If you are a California resident, you have the right to direct us to not sell your personal information to third parties by Contacting us with a "California Resident Opt-Out Request" with the message along with your email address simply label "California Resident Opt-Out Request". More information about what we collect and how we share your personal information is available in our privacy policy.

More information about what we collect and how we share your personal information is available in our Privacy Policy.

*https://studentaid.ed.gov/types/grants-scholarships/pell