|
| 1 | +### Example config for mixed likelihood constraints |
| 2 | + |
| 3 | +[common] |
| 4 | +parnames = [par1, par2] |
| 5 | +strategy_names = [init_strat, opt_strat] |
| 6 | +stimuli_per_trial = 1 |
| 7 | +outcome_types = [binary] |
| 8 | + |
| 9 | +[par1] |
| 10 | +par_type = continuous |
| 11 | +lower_bound = 0 |
| 12 | +upper_bound = 500 |
| 13 | + |
| 14 | +[par2] |
| 15 | +par_type = continuous |
| 16 | +lower_bound = 0 |
| 17 | +upper_bound = 2 |
| 18 | + |
| 19 | +[init_strat] |
| 20 | +min_asks = 1 |
| 21 | +generator = SobolGenerator |
| 22 | + |
| 23 | +[opt_strat] |
| 24 | +min_asks = 1 |
| 25 | +model = GPClassificationModel |
| 26 | +generator = OptimizeAcqfGenerator |
| 27 | + |
| 28 | +[GPClassificationModel] # These types of constraints are only available for GPClassification |
| 29 | +constraint_locations = [[100, 0.4], [200, 1.0], [300, 1.5]] # Individual locations can be defined |
| 30 | +constraint_values = [1, 0.7, 0.3] # For each location, a specific value is needed, defined in the probability space |
| 31 | +constraint_strengths = [1e-3, 2e-3, 3e-3] # The strength of the constraints (the smaller the stronger), this is optional, without it, a heuristic is used |
| 32 | +constraint_factory = constraint_factory # Constraint factory can be defined to constraint a subspace |
| 33 | + |
| 34 | +[constraint_factory] # Constraint factory is used to define constraints over a space |
| 35 | +constraint_lower = [[0, 0], [0, 0]] # The subspace is defined by coordinates |
| 36 | +constraint_upper = [[0, 2], [500, 0]] # Multiple subspaces can be defined |
| 37 | +constraint_values = [0.5, 0.5] # Each subspace needs a value |
| 38 | +constraint_strengths = [1e-2, 1e-2] # Each subspace can have an optional strength |
| 39 | +points_per_dim = 2 # The space is constructed via a grid of points, the more points the tighter the grid |
| 40 | + |
| 41 | +[OptimizeAcqfGenerator] |
| 42 | +acqf = qLogNoisyExpectedImprovement |
0 commit comments