File size: 22,775 Bytes
3bdb76c |
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 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 |
from dreamcoder.type import *
from dreamcoder.task import Task
from dreamcoder.utilities import eprint, hashable
from random import randint, random, seed
from itertools import product
# Excluded routines either impossible or astronomically improbable
# I'm cutting these off at ~20 nats in learned grammars.
EXCLUDES = {
"dedup",
"intersperse-k",
"pow-base-k",
"prime",
"replace-all-k-with-n",
"replace-index-k-with-n",
"uniq",
}
# These are tasks that are easy (solved from base DSL) and also uninteresting
# We exclude these from the test set
EASYLISTTASKS = {
"add-k with k=2",
"bool-identify-geq-k with k=2",
"bool-identify-geq-k with k=3",
"bool-identify-is-mod-k with k=1",
"bool-identify-is-prime",
"bool-identify-k with k=0",
"bool-identify-k with k=1",
"bool-identify-k with k=2",
"caesar-cipher-k-modulo-n with k=3 and n=2",
"drop-k with k=1",
"drop-k with k=2",
"drop-k with k=4",
"index-head",
"index-k with k=2",
"index-k with k=4",
"is-mod-k with k=1",
"is-odds",
"is-squares",
"pow-k with k=2",
"pow-k with k=3",
"prepend-index-k with k=3",
"prepend-index-k with k=5",
"prepend-k with k=1",
"prepend-k with k=2",
"prepend-k with k=3",
"remove-index-k with k=1",
"replace-all-with-index-k with k=2",
"replace-all-with-index-k with k=3",
"slice-k-n with k=1 and n=2",
"slice-k-n with k=2 and n=1",
"slice-k-n with k=3 and n=1",
}
def make_list_task(name, examples, **params):
input_type = guess_type([i for (i,), _ in examples])
output_type = guess_type([o for _, o in examples])
# We can internally handle lists of bools.
# We explicitly create these by modifying existing routines.
if name.startswith("identify"):
boolexamples = [((i,), list(map(bool, o))) for (i,), o in examples]
yield from make_list_task("bool-" + name, boolexamples, **params)
# for now, we'll stick with the boolean-only tasks and not have a copy
# for integers.
return
program_type = arrow(input_type, output_type)
cache = all(hashable(x) for x in examples)
if params:
eq_params = ["{}={}".format(k, v) for k, v in params.items()]
if len(eq_params) == 1:
ext = eq_params[0]
elif len(eq_params) == 2:
ext = "{} and {}".format(*eq_params)
else:
ext = ", ".join(eq_params[:-1])
ext = "{}, and {}".format(ext, eq_params[-1])
name += " with " + ext
yield Task(name, program_type, examples, cache=cache)
def make_list_tasks(n_examples=4):
import listroutines as lr
for routine in lr.find(count=100): # all routines
if routine.id in EXCLUDES:
continue
if routine.is_parametric():
keys = list(routine.example_params()[0].keys())
for params in map(lambda values: dict(zip(keys, values)),
product(range(6), repeat=len(keys))):
try:
if routine.id == "rotate-k":
# rotate-k is hard if list is smaller than k
k = params["k"]
if k < 1:
continue
inps = []
for _ in range(n_examples):
r = randint(abs(k) + 1, 17)
inp = routine.gen(len=r, **params)[0]
inps.append(inp)
else:
inps = routine.gen(count=n_examples, **params)
examples = [((inp,), routine.eval(inp, **params))
for inp in inps]
yield from make_list_task(routine.id, examples, **params)
except lr.APIError: # invalid params
continue
else:
inps = routine.examples()
if len(inps) > n_examples:
inps = inps[:n_examples]
elif len(inps) < n_examples:
inps += routine.gen(count=(n_examples - len(inps)))
examples = [((inp,), routine.eval(inp)) for inp in inps]
yield from make_list_task(routine.id, examples)
def make_list_bootstrap_tasks():
seed(42)
def suffixes(l):
if l == []:
return []
else:
return [l[1:]] + suffixes(l[1:])
def flip(): return random() > 0.5
def randomSuffix():
return [randint(0, 9) for _ in range(randint(1, 4))]
def randomList(minimum=0, minimumLength=4, maximumLength=6):
return [randint(minimum, 9) for _ in range(randint(minimumLength, maximumLength))]
def randomListOfLists():
return [randomSuffix() for _ in range(randint(2, 4))]
def randomListOfLists_bool(l=None):
if l is None:
l = randint(4, 7)
return [randomBooleanList() for _ in range(l)]
def randomBooleanList():
return [flip() for _ in range(randint(4, 7))]
# Reliably learned in under a minute; always triggers learning of length
# primitive
lengthBootstrap = [
# Task("length bool", arrow(tlist(tbool), tint),
# [((l,), len(l))
# for _ in range(10)
# for l in [[flip() for _ in range(randint(0, 10))]]]),
Task("length int", arrow(tlist(tint), tint),
[((l,), len(l))
for _ in range(10)
for l in [randomList()]]),
Task("map length", arrow(tlist(tlist(tint)), tlist(tint)),
[((xss,), [len(xs) for xs in xss])
for _ in range(10)
for xss in [randomListOfLists()] ])
]
# Encourages learning of unfolding
unfoldBootstrap = [
Task("countdown", arrow(tint, tlist(tint)),
[((n,), list(range(n + 1, 1, -1)))
for n in range(10)]),
Task("weird count", arrow(tint, tlist(tint)),
[((n,), list(range(-n,0,-1)))
for n in range(-10,0) ]),
Task("take every other", arrow(tlist(tint),tlist(tint)),
[((l,), [x for j,x in enumerate(l) if j%2 == 0])
for _ in range(9)
for l in [ [randint(0, 9) for _ in range(randint(1,4)*2)] ] ] + [(([],),[])]),
# Task("stutter every other", arrow(tlist(tint),tlist(tint)),
# [((l,), [l[int(j/2)] for j in range(len(l)) ])
# for _ in range(10)
# for l in [ [randint(0, 9) for _ in range(randint(1,4)*2)] ] ]),
# Task("take until 3 reached", arrow(tlist(tint),tlist(tint)),
# [((p + [3] + s,),p)
# for _ in range(10)
# for p in [ [z for z in randomList()[:5] if z != 3 ]]
# for s in [randomList()] ]),
Task("drop last element", arrow(tlist(tint),tlist(tint)),
[((l,), l[:-1])
for _ in range(10)
for l in [ [randint(0, 9) for _ in range(randint(2,5))] ] ]),
# Task("suffixes", arrow(tlist(tint), tlist(tlist(tint))),
# [((l,), suffixes(l))
# for _ in range(10)
# for l in [randomList()]]),
Task("range", arrow(tint, tlist(tint)),
[((n,), list(range(n)))
for n in range(10)]),
Task("range inclusive", arrow(tint, tlist(tint)),
[((n,), list(range(n + 1)))
for n in range(10)]),
# Task("range inclusive+1", arrow(tint, tlist(tint)),
# [((n,), list(range(n + 2)))
# for n in range(10)]),
# Task("range exclusive", arrow(tint, tlist(tint)),
# [((n,), list(range(n - 1)))
# for n in range(2, 11)]),
# Task("range length", arrow(tlist(tint),tlist(tint)),
# [((l,),list(range(len(l))))
# for _ in range(10)
# for l in [randomList()] ])
]
# Encourages learning how to treat a list as an array
arrayBootstrap = [
Task("index int", arrow(tint, tlist(tint), tint),
[((n, l), l[n])
for n in range(10)
for l in [[randint(0, 9) for _ in range(randint(n + 1, n + 5))]]]),
# Task("last n", arrow(tint, tlist(tint), tlist(tint)),
# [((n, l), l[-n:])
# for n in range(10)
# for l in [[randint(0, 9) for _ in range(randint(n + 1, n + 5))]]]),
Task("1-index int", arrow(tint, tlist(tint), tint),
[((n, l), l[n - 1])
for n in range(1,11)
for l in [[randint(0, 9) for _ in range(randint(n + 1, n + 4))]]])
# Task("index bool", arrow(tint, tlist(tbool), tbool),
# [((n, l), l[n])
# for n in range(10)
# for l in [[flip() for _ in range(randint(n + 1, n + 5))]]])
]
# Teaches how to slice lists, not sure if we really need this though
sliceBootstrap = [
Task("take bool", arrow(tint, tlist(tbool), tlist(tbool)),
[((n, l), l[:n])
for n in range(10)
for l in [[flip() for _ in range(randint(n, n + 5))]]]),
Task("drop bool", arrow(tint, tlist(tbool), tlist(tbool)),
[((n, l), l[n:])
for n in range(10)
for l in [[flip() for _ in range(randint(n, n + 5))]]]),
Task("take int", arrow(tint, tlist(tint), tlist(tint)),
[((n, l), l[:n])
for n in range(10)
for l in [[randint(0, 9) for _ in range(randint(n, n + 5))]]]),
Task("drop int", arrow(tint, tlist(tint), tlist(tint)),
[((n, l), l[n:])
for n in range(10)
for l in [[randint(0, 9) for _ in range(randint(n, n + 5))]]]),
]
# learning to fold
foldBootstrap = [
Task("stutter", arrow(tlist(tint),tlist(tint)),
[((l,), [z for x in l for z in [x,x] ])
for _ in range(10)
for l in [randomList()] ]),
Task("sum", arrow(tlist(tint), tint),
[((l,), sum(l))
for _ in range(10)
for l in [randomList()]]),
# Task("difference", arrow(tlist(tint), tint),
# [((l,), reduce(lambda x, y: y - x, reversed(l), 1))
# for _ in range(10)
# for l in [randomList()[:4]]]),
# Task("append bool", arrow(tlist(tbool), tlist(tbool), tlist(tbool)),
# [((x, y), x + y)
# for _ in range(10)
# for [x, y] in [[randomBooleanList(), randomBooleanList()]]]),
Task("append constant 0", arrow(tlist(tint),tlist(tint)),
[((l,),l + [0])
for _ in range(10)
for l in [randomList()] ]),
]
# learning to map
mapBootstrap = [
Task("map double", arrow(tlist(tint), tlist(tint)),
[((l,), list(map(lambda n: n * 2, l)))
for _ in range(10)
for l in [randomList()]]),
Task("map increment", arrow(tlist(tint),tlist(tint)),
[((l,),list(map(lambda n: n+1, l)))
for _ in range(10)
for l in [randomList()] ]),
Task("map negation", arrow(tlist(tint),tlist(tint)),
[((l,),list(map(lambda n: 0-n, l)))
for _ in range(10)
for l in [randomList()] ]),
# Task("map car", arrow(tlist(tlist(tint)), tlist(tint)),
# [((l,), [n[0] for n in l])
# for _ in4 range(10)
# for l in [randomListOfLists()]]),
# Task("map cdr", arrow(tlist(tlist(tbool)),tlist(tlist(tbool))),
# [((l,),map(lambda n: n[1:],l))
# for _ in range(10)
# for l in [randomListOfLists_bool()]]),
# Task("map empty?", arrow(tlist(tlist(tint)), tlist(tboolean)),
# [((l,), [n == [] for n in l])
# for _ in range(10)
# for l in [[[] if flip() else randomList() for _ in range(randint(1, 5))]]]),
# Task("map eq 0?", arrow(tlist(tint),tlist(tboolean)),
# [((l,),map(lambda n: 0 == n,l))
# for _ in range(10)
# for l in [[ randint(0,3) for _ in range(randint(4,7)) ]] ])
]
difficultMaps = [
Task("map quadruple", arrow(tlist(tint), tlist(tint)),
[((l,), list(map(lambda n: n * 4, l)))
for _ in range(10)
for l in [randomList()]]),
Task("map add 3", arrow(tlist(tint),tlist(tint)),
[((l,),list(map(lambda n: n+3, l)))
for _ in range(10)
for l in [randomList()] ]),
]
# Learning to zip lists together
zipBootstrap = [
Task("zip plus", arrow(tlist(tint),tlist(tint),tlist(tint)),
[((l1,l2),list(map(lambda x,y: x+y,l1,l2)))
for _ in range(10)
for l1 in [randomList(minimumLength=2, maximumLength=4)]
for l2 in [[ randint(0,9) for _ in range(len(l1)) ]]]),
Task("zip minus", arrow(tlist(tint),tlist(tint),tlist(tint)),
[((l1,l2),list(map(lambda x,y: x-y,l1,l2)))
for _ in range(10)
for l1 in [randomList(minimumLength=2, maximumLength=4)]
for l2 in [[ randint(0,9) for _ in range(len(l1)) ]]]),
# Task("zip eq?", arrow(tlist(tint), tlist(tint), tlist(tbool)),
# [((l1, l2), list(map(lambda x, y: x == y, l1, l2)))
# for _ in range(10)
# for l1 in [[randint(0, 3) for _ in range(randint(4, 7))]]
# for l2 in [[randint(0, 3) for _ in range(len(l1))]]]),
# Task("zip cons", arrow(tlist(tbool), tlist(tlist(tbool)), tlist(tlist(tbool))),
# [((l1, l2), list(map(lambda x, y: [x] + y, l1, l2)))
# for _ in range(10)
# for l1 in [randomBooleanList()]
# for l2 in [randomListOfLists_bool(l=len(l1))]]),
# Task("zip cons", arrow(tlist(tint),tlist(tlist(tint)),tlist(tlist(tint))),
# [((l1,l2),list(map(lambda x,y: [x]+y,l1,l2)))
# for _ in range(10)
# for l1 in [randomList()]
# for l2 in [[ randomList() for _ in range(len(l1)) ]]]),
]
# Learning to filter
filterBootstrap = [
# Task("remove empty lists",
# arrow(tlist(tlist(tbool)), tlist(tlist(tbool))),
# [((ls,), [l for l in ls if len(l) > 0])
# for _ in range(10)
# for ls in [[[flip() for _ in range(randint(0, 3))]
# for _ in range(4)]]])
# Task("remove non 0s",
# arrow(tlist(tint), tlist(tint)),
# [((xs,), filter(lambda x: x == 0, xs))
# for _ in range(10)
# for xs in [[ randint(0,3) for _ in range(5) ]] ]),
Task("remove 0s",
arrow(tlist(tint), tlist(tint)),
[((xs,), [x for x in xs if x != 0])
for _ in range(10)
for xs in [[randint(0, 3) for _ in range(5)]]]),
Task("remove non-positives",
arrow(tlist(tint), tlist(tint)),
[((xs,), [x for x in xs if not (x > 1)])
for _ in range(10)
for xs in [[randint(0, 3) for _ in range(5)]]]),
]
return lengthBootstrap + filterBootstrap + \
unfoldBootstrap + arrayBootstrap + foldBootstrap + mapBootstrap + zipBootstrap
def bonusListProblems():
# Taken from https://www.ijcai.org/Proceedings/75/Papers/037.pdf
# These problems might be a lot easier if we do not use numbers
def randomList(lb=None, ub=None):
if lb is None:
lb = 2
if ub is None:
ub = 5
return [randint(0, 5) for _ in range(randint(lb, ub))]
bonus = [
Task(
"pair reverse", arrow(tlist(tint), tlist(tint)),
[((x,), [x[j + (1 if j % 2 == 0 else -1)]
for j in range(len(x))])
for _ in range(5)
for x in [randomList(10, 10)]]
),
Task(
"duplicate each element", arrow(tlist(tint), tlist(tint)),
[((x,), [a for z in x for a in [z] * 2])
for _ in range(5)
for x in [randomList(4, 6)]]
),
Task(
"reverse duplicate each element", arrow(tlist(tint), tlist(tint)),
[((x,), [a for z in reversed(x) for a in [z] * 2])]
),
]
return bonus
def sortBootstrap():
# These tasks have as their goal the learning of (1) filter, and
# (2) sort, which uses filter.
def flip(): return random() > 0.5
def randomList(lb=None, ub=None):
if lb is None:
lb = 2
if ub is None:
ub = 5
return [randint(0, 10) for _ in range(randint(lb, ub))]
def randomBooleanList():
return [flip() for _ in range(randint(4, 7))]
def removeDuplicates(l):
if len(l) == 0: return l
return [l[0]] + removeDuplicates([ z for z in l if z != l[0] ])
filterBootstrap = [
# Task("remove empty lists",
# arrow(tlist(tlist(tbool)), tlist(tlist(tbool))),
# [((ls,), [l for l in ls if len(l) > 0])
# for _ in range(10)
# for ls in [[[flip() for _ in range(randint(0, 3))]
# for _ in range(4)]]]),
# Task("remove non 0s",
# arrow(tlist(tint), tlist(tint)),
# [((xs,), filter(lambda x: x == 0, xs))
# for _ in range(10)
# for xs in [[ randint(0,3) for _ in range(5) ]] ]),
Task("remove 0s",
arrow(tlist(tint), tlist(tint)),
[((xs,), [x for x in xs if x != 0])
for _ in range(10)
for xs in [[randint(0, 3) for _ in range(5)]]]),
# Task("remove primes",
# arrow(tlist(tint), tlist(tint)),
# [((xs,), [x for x in xs if not (x in {2,3,5,7,11,13,17,19,23})])
# for _ in range(10)
# for xs in [[randint(0, 20) for _ in range(7)]]]),
Task("remove squares",
arrow(tlist(tint), tlist(tint)),
[((xs,), [x for x in xs if not (int(x**0.5)**2 == x)])
for _ in range(10)
for xs in [[randint(0, 20) for _ in range(7)]]]),
Task("remove > 1",
arrow(tlist(tint), tlist(tint)),
[((xs,), [x for x in xs if not (x > 1)])
for _ in range(10)
for xs in [[randint(0, 5) for _ in range(7)]]]),
]
# Needed for selection sort
minimumBootstrap = [
Task("min2", arrow(tint,tint,tint),
[((x,y),min(x,y))
for x in range(4)
for y in range(4) ]),
Task("minimum of list", arrow(tlist(tint),tint),
[((l,),min(l))
for _ in range(15)
for l in [randomList()] ])
]
appendBootstrap = [
Task("append bool", arrow(tlist(tbool), tlist(tbool), tlist(tbool)),
[((x, y), x + y)
for _ in range(10)
for [x, y] in [[randomBooleanList(), randomBooleanList()]]]),
Task("append int", arrow(tlist(tint), tlist(tint), tlist(tint)),
[((x, y), x + y)
for _ in range(10)
for [x, y] in [[randomList(), randomList()]]])
]
insertionBootstrap = [
Task("filter greater than or equal", arrow(tint,tlist(tint),tlist(tint)),
[((x,l), [y for y in l if y >= x ])
for _ in range(15)
for x in [randint(0,5)]
for l in [randomList()] ]),
Task("filter less than", arrow(tint,tlist(tint),tlist(tint)),
[((x,l), [y for y in l if y < x ])
for _ in range(15)
for x in [randint(0,5)]
for l in [randomList()] ]),
Task("insert into sorted list (I)", arrow(tint,tlist(tint),tlist(tint)),
[((x,l), [y for y in l if y < x ] + [x] + [y for y in l if y >= x ])
for _ in range(15)
for x in [randint(0,5)]
for _l in [randomList()]
for l in [sorted(_l)] ]),
Task("insert into sorted list (II)", arrow(tint,tlist(tint),tlist(tint)),
[((x,l), [y for y in l if y < x ] + [x] + [y for y in l if y >= x ])
for _ in range(15)
for x in [randint(0,5)]
for l in [randomList()] ])
]
sortTask = [
Task("sort-and-deduplicate", arrow(tlist(tint),tlist(tint)),
[((l,),list(sorted(l)))
for _ in range(15)
for l in [removeDuplicates(randomList())]
])]
slowSort = [
Task("+1 maximum list", arrow(tlist(tint), tint),
[((l,),max(l) + 1)
for _ in range(15)
for l in [randomList()] ]),
Task("range +1 maximum list", arrow(tlist(tint), tlist(tint)),
[((l,),list(range(max(l) + 1)))
for _ in range(15)
for l in [randomList()] ]),
]
tasks = sortTask + slowSort
for t in tasks: t.mustTrain = True
return tasks
def exportTasks():
import sys
import pickle as pickle
n_examples = 15
if len(sys.argv) > 1:
n_examples = int(sys.argv[1])
eprint("Downloading and generating dataset")
tasks = sorted(make_list_tasks(n_examples), key=lambda t: t.name)
eprint("Got {} list tasks".format(len(tasks)))
with open("data/list_tasks.pkl", "w") as f:
pickle.dump(tasks, f)
eprint("Wrote list tasks to data/list_tasks.pkl")
if __name__ == "__main__":
import json
def retrieveJSONTasks(filename, features=False):
"""
For JSON of the form:
{"name": str,
"type": {"input" : bool|int|list-of-bool|list-of-int,
"output": bool|int|list-of-bool|list-of-int},
"examples": [{"i": data, "o": data}]}
"""
with open(filename, "r") as f:
loaded = json.load(f)
TP = {
"bool": tbool,
"int": tint,
"list-of-bool": tlist(tbool),
"list-of-int": tlist(tint),
}
return [Task(
item["name"],
arrow(TP[item["type"]["input"]], TP[item["type"]["output"]]),
[((ex["i"],), ex["o"]) for ex in item["examples"]],
features=(None if not features else list_features(
[((ex["i"],), ex["o"]) for ex in item["examples"]])),
cache=False,
) for item in loaded]
for t in retrieveJSONTasks("data/list_tasks.json") + sortBootstrap() + make_list_bootstrap_tasks():
print(t.describe())
print()
# exportTasks()
|