-
Notifications
You must be signed in to change notification settings - Fork 0
/
gomors_sync_strategies.py
562 lines (477 loc) · 22.9 KB
/
gomors_sync_strategies.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
"""
.. module:: gomors_sync_strategies
:synopsis: Parallel synchronous MO optimization strategy - GOMORS
.. moduleauthor (for the original Python 2.7 version and pySOT 0.1.36):: David Bindel <bindel@cornell.edu>,
David Eriksson <dme65@cornell.edu>,
Taimoor Akhtar <erita@nus.edu.sg>
..imported to Python 3.7 version and pySOT 0.2.0 by authors: Vijey Subramani Raja Gopalan <vijeysubramani@gmail.com>
Yannis Werner <y.werner@tu-braunschweig.de>
Tim van Hout <tim.j.vanhout@gmail.com>
"""
import numpy as np
import math
import logging
from pySOT.experimental_design import SymmetricLatinHypercube, LatinHypercube
from poap.strategy import BaseStrategy, RetryStrategy
from pySOT.surrogate import *
from pySOT.utils import *
#from pySOT.rs_wrappers import *
import time
import random
from gomors_adaptive_sampling import EvolutionaryAlgorithm
from copy import deepcopy
from mo_utils import *
from archiving_strategies import MemoryRecord, NonDominatedArchive, EpsilonArchive
from matplotlib import pyplot as plt
# Get module-level logger
logger = logging.getLogger(__name__)
POSITIVE_INFINITY = float("inf")
class MoSyncStrategyNoConstraints(BaseStrategy):
"""Parallel Multi-Objective synchronous optimization strategy without non-bound constraints. (GOMORS)
This class implements the GOMORS Framework
described by Akhtar and Shoemaker (2016). After the initial experimental
design (which is embarrassingly parallel), the optimization
proceeds in phases. During each phase, we allow nsamples
simultaneous function evaluations. We insist that these
evaluations run to completion -- if one fails for whatever reason,
we will resubmit it. Samples are drawn randomly from a multi-rule
selection strategy that includes i) Global Evolutionary / Candidate
search with three selection rules a) Hypervolume, b) Max-min Decision
Space Distance and c) Max-min Objective Space Distance, and,
ii) Neighborhood Evolutionary / Candidate Search with hv selection.
:param worker_id: Start ID in a multi-start setting
:type worker_id: int
:param data: Problem parameter data structure
:type data: Object
:param response_surface: Surrogate model object
:type response_surface: Object
:param maxeval: Stopping criterion. If positive, this is an
evaluation budget. If negative, this is a time
budget in seconds.
:type maxeval: int
:param nsamples: Number of simultaneous fevals allowed
:type nsamples: int
:param exp_design: Experimental design
:type exp_design: Object
:param sampling_method: Sampling method for finding
points to evaluate
:type sampling_method: Object
:param extra: Points to be added to the experimental design
:type extra: numpy.array
:param extra_vals: Values of the points in extra (if known). Use nan for values that are not known.
:type extra_vals: numpy.array
"""
def __init__(self, worker_id, data, response_surface, maxeval, nsamples,
exp_design=None, sampling_method=None, archiving_method=None, extra=None, extra_vals=None, store_sim=False):
# Check stopping criterion
self.start_time = time.time()
if maxeval < 0: # Time budget
self.maxeval = np.inf
self.time_budget = np.abs(maxeval)
else:
self.maxeval = maxeval
self.time_budget = np.inf
# Import problem information
self.worker_id = worker_id
self.data = data
self.fhat = []
if response_surface is None:
for i in range(self.data.nobj):
self.fhat.append(RBFInterpolant(dim=data.dim, kernel=CubicKernel(), tail=LinearTail(dim=data.dim))) #, maxp=maxeval)) #MOPLS ONLY
else:
for i in range(self.data.nobj):
response_surface.reset() # Just to be sure!
self.fhat.append(deepcopy(response_surface)) #MOPLS ONLY
self.ncenters = nsamples
self.nsamples = 1
self.numinit = None
self.extra = extra
self.extra_vals = extra_vals
self.store_sim = store_sim
#self.integer = []
# Default to generate sampling points using Symmetric Latin Hypercube
self.design = exp_design
if self.design is None:
if self.data.dim > 50:
self.design = LatinHypercube(data.dim, data.dim+1)
else:
self.design = SymmetricLatinHypercube(data.dim, 2*(data.dim+1))
self.xrange = np.asarray(data.ub - data.lb)
# algorithm parameters
self.sigma_min = 0.005
self.sigma_max = 0.2
self.sigma_init = 0.2
self.failtol = max(5, data.dim)
self.failcount = 0
self.contol = 5
self.numeval = 0
self.status = 0
self.sigma = 0
self.resubmitter = RetryStrategy()
self.xbest = None
self.fbest = None
self.fbest_old = None
self.improvement_prev = 1
# population of centers and long-term archive
self.nd_archives = []
self.new_pop = []
self.sim_res = []
if archiving_method is None:
self.memory_archive = NonDominatedArchive(200)
else:
self.memory_archive = archiving_method
self.evals = []
self.maxfit = min(200,20*self.data.dim)
self.d_thresh = 1.0
# Set up search procedures and initialize
self.sampling = sampling_method
if self.sampling is None:
self.sampling = EvolutionaryAlgorithm(data)
self.check_input()
# Start with first experimental design
self.sample_initial()
def check_input(self):
"""Checks that the inputs are correct"""
self.check_common()
if hasattr(self.data, "eval_ineq_constraints"):
raise ValueError("Optimization problem has constraints,\n"
"SyncStrategyNoConstraints can't handle constraints")
if hasattr(self.data, "eval_eq_constraints"):
raise ValueError("Optimization problem has constraints,\n"
"SyncStrategyNoConstraints can't handle constraints")
def check_common(self):
"""Checks that the inputs are correct"""
# Check evaluation budget
if self.extra is None:
if self.maxeval < self.design.num_pts:
raise ValueError("Experimental design is larger than the evaluation budget")
else:
# Check the number of unknown extra points
if self.extra_vals is None: # All extra point are unknown
nextra = self.extra.shape[0]
else: # We know the values at some extra points so count how many we don't know
nextra = np.sum(np.isinf(self.extra_vals[0])) + np.sum(np.isnan(self.extra_vals[0]))
if self.maxeval < self.design.npts + nextra:
raise ValueError("Experimental design + extra points "
"exceeds the evaluation budget")
# Check dimensionality
if self.design.dim != self.data.dim:
raise ValueError("Experimental design and optimization "
"problem have different dimensions")
if self.extra is not None:
if self.data.dim != self.extra.shape[1]:
raise ValueError("Extra point and optimization problem "
"have different dimensions")
if self.extra_vals is not None:
if self.extra.shape[0] != len(self.extra_vals):
raise ValueError("Extra point values has the wrong length")
# Check that the optimization problem makes sense
check_opt_prob(self.data)
def proj_fun(self, x):
"""Projects a set of points onto the feasible region
:param x: Points, of size npts x dim
:type x: numpy.array
:return: Projected points
:rtype: numpy.array
"""
x = np.atleast_2d(x)
return round_vars(x, self.data.int_var, self.data.lb, self.data.ub)
def log_completion(self, record):
"""Record a completed evaluation to the log.
:param record: Record of the function evaluation
:type record: Object
"""
xstr = np.array_str(record.params[0], max_line_width=np.inf,
precision=5, suppress_small=True)
if self.store_sim is True:
fstr = np.array_str(record.value[0], max_line_width=np.inf,
precision=5, suppress_small=True)
else:fstr = np.array_str(record.value, max_line_width=np.inf,
precision=5, suppress_small=True)
if record.feasible:
logger.info("{} {} @ {}".format("True", fstr, xstr))
else:
logger.info("{} {} @ {}".format("False", fstr, xstr))
def sample_initial(self):
"""Generate and queue an initial experimental design."""
for fhat in self.fhat:
fhat.reset() #MOPLS Only
self.sigma = self.sigma_init
self.failcount = 0
self.xbest = None
self.fbest_old = None
self.fbest = None
for fhat in self.fhat:
fhat.reset() #MOPLS Only
start_sample = self.design.generate_points()
assert start_sample.shape[1] == self.data.dim, \
"Dimension mismatch between problem and experimental design"
start_sample = from_unit_box(start_sample, self.data.lb, self.data.ub)
if self.extra is not None:
# We know the values if this is a restart, so add the points to the surrogate
if self.numeval > 0:
for i in range(len(self.extra_vals)):
xx = self.proj_fun(np.copy(self.extra[i, :]))
for j in range(self.data.nobj):
self.fhat[j].add_points(np.ravel(xx), self.extra_vals[i, j])
else: # Check if we know the values of the points
if self.extra_vals is None:
self.extra_vals = np.nan * np.ones((self.extra.shape[0], self.data.nobj))
for i in range(len(self.extra_vals)):
xx = self.proj_fun(np.copy(self.extra[i, :]))
if np.isnan(self.extra_vals[i, 0]) or np.isinf(self.extra_vals[i, 0]): # We don't know this value
proposal = self.propose_eval(np.ravel(xx))
proposal.extra_point_id = i # Decorate the proposal
self.resubmitter.rput(proposal)
else: # We know this value
for j in range(self.data.nobj):
self.fhat[j].add_points(np.ravel(xx), self.extra_vals[i, j])
# 2 - Generate a Memory Record of the New Evaluation
srec = MemoryRecord(np.copy(np.ravel(xx)), self.extra_vals[i, :], self.sigma_init)
self.new_pop.append(srec)
self.evals.append(srec)
# Evaluate the experimental design
for j in range(min(start_sample.shape[0], self.maxeval - self.numeval)):
start_sample[j, :] = self.proj_fun(start_sample[j, :]) # Project onto feasible region
proposal = self.propose_eval(np.copy(start_sample[j, :]))
self.resubmitter.rput(proposal)
if self.extra is not None:
sample_init = np.vstack((start_sample, self.extra))
else:
sample_init = start_sample
sample_prev = np.copy(sample_init)
if self.numeval == 0:
logger.info("=== Start ===")
elif self.status < self.contol:
logger.info("=== Connected Start ===")
print('Connected Restart # ' + str(self.status+1) + ' initiated')
# Step 1 - Update connected restart count
self.status += 1
# Step 2 - Obtain xvals and fvals of ND points
front = self.memory_archive.contents
fvals = [rec.fx for rec in front]
fvals = np.asarray(fvals)
xvals = [rec.x for rec in front]
xvals = np.asarray(xvals)
# Step 3 - Add ND points to the surrogate
npts, nobj = fvals.shape
for i in range(npts):
for j in range(nobj):
#Surrogate.add_points(xvals[i,:], fvals[i, j])
# self.fhat[j].add_point(xvals[i, :], fvals[i, j])
# Surrogate.add_points(xvals[i, :], fvals[i, j])
self.fhat[j].add_points(xvals[i, :], fvals[i, j])
# Step 4 - Add points to the set of previously evaluated points for sampling strategy
all_xvals = [rec.x for rec in self.evals]
sample_prev = np.vstack((sample_prev, all_xvals))
else:
# Step 4 - Store the Front in a separate archive
front = self.memory_archive.contents
self.nd_archives.append(front)
self.status = 0
if len(self.nd_archives) == 2:
logger.info("=== Global Connected Restart ===")
print('GLOBAL Restart Initiated')
prev_front = self.nd_archives[0]
for rec in prev_front:
self.memory_archive.add(rec)
# Step 2 - Obtain xvals and fvals of ND points
front = self.memory_archive.contents
fvals = [rec.fx for rec in front]
fvals = np.asarray(fvals)
xvals = [rec.x for rec in front]
xvals = np.asarray(xvals)
# Step 3 - Add ND points to the surrogate
npts, nobj = fvals.shape
for i in range(npts):
for j in range(nobj):
self.fhat[j].add_points(xvals[i, :], fvals[i, j])
# Step 4 - Add points to the set of previously evaluated points for sampling strategy
all_xvals = [rec.x for rec in self.evals]
sample_prev = np.vstack((sample_prev, all_xvals))
self.nd_archives = []
self.failtol = self.failtol*2
else:
logger.info("=== Independent Restart ===")
print('INDEPENDENT Restart Initiated')
self.memory_archive.reset() #GOMORS only
self.new_pop = [] #GOMORS Only
all_xvals = [rec.x for rec in self.evals]
sample_prev = np.vstack((sample_prev, all_xvals))
self.sampling.init(sample_init, self.fhat, self.maxeval - self.numeval, sample_prev)
if self.numinit is None:
self.numinit = start_sample.shape[0]
print('Initialization completed successfully')
def update_archives(self):
"""Update the Tabu list, Tabu Tenure, memory archive and non-dominated front.
"""
# Step 3 - Add newly Evaluated Points to Memory Archive and update ND_Archives list
nimprovements = 0
for rec in self.new_pop:
self.memory_archive.add(rec)
nimprovements += self.memory_archive.improvement
self.new_pop = []
self.memory_archive.compute_fitness()
# Step 3b - Adjust failure_count if needed
if nimprovements == 0:
print('No Improvement Registered')
if self.improvement_prev == 0:
self.failcount += 1
print('No Improvement - Failure count is: ' + str(self.failcount))
self.improvement_prev = 0
else:
print("Number of Improvements: " + str(nimprovements))
self.improvement_prev = 1
def sample_adapt(self):
"""Generate and queue samples from the search strategy"""
# # Step 1 - Add Newly Evaluated Points to Memory Archive
self.update_archives()
front = self.memory_archive.contents
fvals = [rec.fx for rec in front]
fvals = np.asarray(fvals)
xvals = [rec.x for rec in front]
xvals = np.asarray(xvals)
fitness = [rec.fitness for rec in front]
if fitness[0] == POSITIVE_INFINITY:
idx = random.randint(0,len(fitness)-1)
else:
fitness = np.asarray(fitness)
idx = np.argmax(fitness)
self.xbest = xvals[idx,:]
self.fbest = fvals[idx,:]
#self.interactive_plotting(fvals)
print('NUMBER OF EVALUATIONS COMPLETED: ' + str(self.numeval))
start = time.clock()
new_points, new_fhvals, fhvals_nd = self.sampling.make_points(npts=1, xbest=self.xbest, xfront=xvals, front=fvals,
proj_fun=self.proj_fun)
#print(new_points)
end = time.clock()
totalTime = end - start
print('CANDIDATE SELECTION TIME: ' + str(totalTime))
#self.interactive_plotting(fvals, new_fhvals, fhvals_nd)
self.save_plot(self.numeval)
nsamples=4
for i in range(nsamples):
proposal = self.propose_eval(np.copy(np.ravel(new_points[i,:])))
self.resubmitter.rput(proposal)
def start_batch(self):
"""Generate and queue a new batch of points"""
if self.failcount > self.failtol:
self.sample_initial()
else:
self.sample_adapt()
def propose_action(self):
"""Propose an action
"""
if self.numeval >= self.maxeval:
# Save results to Array and Terminate
X = np.zeros((self.maxeval, self.data.dim + self.data.nobj))
all_xvals = [rec.x for rec in self.evals]
all_xvals = np.asarray(all_xvals)
X[:,0:self.data.dim] = all_xvals[0:self.maxeval,:]
all_fvals = [rec.fx for rec in self.evals]
all_fvals = np.asarray(all_fvals)
X[:,self.data.dim:self.data.dim + self.data.nobj] = all_fvals[0:self.maxeval,:]
np.savetxt('final.txt', X)
return self.propose_terminate()
elif self.resubmitter.num_eval_outstanding == 0:
# UPDATE MEMORY ARCHIVE
self.start_batch()
return self.resubmitter.get()
def on_complete(self, record):
"""Handle completed function evaluation.
When a function evaluation is completed we need to ask the constraint
handler if the function value should be modified which is the case for
say a penalty method. We also need to print the information to the
logfile, update the best value found so far and notify the GUI that
an evaluation has completed.
:param record: Evaluation record
"""
self.numeval += 1
record.worker_id = self.worker_id
record.worker_numeval = self.numeval
record.feasible = True
self.log_completion(record)
if self.store_sim is True:
obj_val = np.copy(record.value[0])
self.sim_res.append(np.copy(record.value[1]))
np.savetxt('final_simulations.txt', np.asarray(self.sim_res))
else:
obj_val = np.copy(record.value)
# 1 - Update Response Surface Model
i = 0
for fhat in self.fhat:
l = np.copy(record.params[0])
fhat.add_points(l,obj_val[i])
#Surrogate.add_points(fhat, l, obj_val[i])
i +=1
# 2 - Generate a Memory Record of the New Evaluation
srec = MemoryRecord(np.copy(record.params[0]),obj_val,self.sigma_init)
self.new_pop.append(srec)
self.evals.append(srec)
def interactive_plotting(self, fvals, sel_fhvals, new_fhvals_nd):
""""If interactive plotting is on,
"""
maxgen = (self.maxeval - self.numinit)/(self.nsamples*self.ncenters)
curgen = (self.numeval - self.numinit)/(self.nsamples*self.ncenters) + 1
plt.show()
#plt.plot(self.data.pf[:,0], self.data.pf[:,1], 'g')
all_fvals = [rec.fx for rec in self.evals]
all_fvals = np.asarray(all_fvals)
plt.plot(all_fvals[:,0], all_fvals[:,1], 'k+')
plt.plot(fvals[:,0], fvals[:,1], 'b*')
plt.plot(self.fbest[0], self.fbest[1], 'y>')
plt.plot(new_fhvals_nd[:,0], new_fhvals_nd[:,1], 'ro')
plt.plot(sel_fhvals[:,0], sel_fhvals[:,1], 'cd')
plt.draw()
if curgen < maxgen:
plt.pause(0.001)
else:
plt.show()
def save_plot(self, i):
""""If interactive plotting is on,
"""
#plt.figure(i)
title = 'Number of Evals Completed: ' + str(i)
front = self.memory_archive.contents
fvals = [rec.fx for rec in front]
fvals = np.asarray(fvals)
maxgen = (self.maxeval - self.numinit)/(self.nsamples*self.ncenters)
curgen = (self.numeval - self.numinit)/(self.nsamples*self.ncenters) + 1
# if self.data.pf is not None:
# plt.plot(self.data.pf[:,0], self.data.pf[:,1], 'g')
all_fvals = [rec.fx for rec in self.evals]
all_fvals = np.asarray(all_fvals)
plt.plot(all_fvals[:,0], all_fvals[:,1], 'k+')
if fvals.ndim > 1:
plt.plot(fvals[:,0], fvals[:,1], 'b*')
plt.title(title)
plt.draw()
plt.savefig('Final')
plt.clf()
all_xvals = [rec.x for rec in self.evals]
all_xvals = np.asarray(all_xvals)
npts = all_xvals.shape[0]
X = np.zeros((npts, self.data.dim + self.data.nobj))
X[:, 0:self.data.dim] = all_xvals
X[:, self.data.dim:self.data.dim + self.data.nobj] = all_fvals
np.savetxt('final.txt', X)
if self.data.pf is not None:
plt.plot(self.data.pf[:,0], self.data.pf[:,1], 'g')
if fvals.ndim > 1:
plt.plot(fvals[:,0], fvals[:,1], 'b*')
plt.title(title)
plt.draw()
plt.savefig('Final_front')
plt.clf()
# --------------------------------- #tvh
""""write final-(Pareto)-front to textfile
"""
front_xvals = [rec.x for rec in front]
front_xvals = np.array(front_xvals)
npts = front_xvals.shape[0]
front_shape = np.zeros((npts, self.data.dim + self.data.nobj))
front_shape[:, 0:self.data.dim] = front_xvals
front_shape[:, self.data.dim:self.data.dim + self.data.nobj] = fvals
np.savetxt('Final_front.txt', front_shape)
# ---------------------------------