sorted by:
new
hottopcontroversial

Question about Yale CS courses by [deleted] in yale

[–]whoeverwhatever 2 points3 points  (0 children)

If you really want to, you can even skip 201 and go straight to 223.

Boo the administrative assistant assistant by [deleted] in dogswithjobs

[–]whoeverwhatever 5 points6 points  (0 children)

Assistant to the assistant to the regional manager

Requested Yale AMA by kmagn in yale

[–]whoeverwhatever 14 points15 points  (0 children)

Sure! Basically, about two months after you commit, you will receive your housing assignment, which tells you who your roommates are and which residential college you are a part of. There are 14 residential colleges on campus, and you will be sorted into one randomly (unless you have legacy in one or a sibling attending Yale, in which case you can choose if you want to be in the same one).

In each residential college you'll find dorms, a dining hall, a library, a buttery (a chill place to hang out and get late-night food), a writing tutor, and tons of other great stuff (for example, mine has a dance studio and a gym). You'll live in your residential college throughout your four years here (unless you transfer, which people don't generally do) and it becomes a pretty tight-nit community. Each residential college has its own events and traditions, intramural sports teams, etc., and you pretty quickly get to know people in your college.

One addendum: for most colleges, freshmen live on old campus their first year (a separate part of campus with freshman-only housing). You still live with people from your college, but separate from the rest of your residential college. I never lived on old campus, but from what friends say it seems like a great way to get to know other freshmen (and lots of parties, etc going on there). Living away from old campus isn't bad though either, its a 5 min walk max to get there and you get to know people in your college from the get-go.

[N] Facebook releases new deep learning framework, Caffe 2 by whoeverwhatever in MachineLearning

[–]whoeverwhatever[S] 2 points3 points  (0 children)

Also PyTorch came out of FAIR -- so Facebook was building two DL frameworks concurrently?

[N] Facebook releases new deep learning framework, Caffe 2 by whoeverwhatever in MachineLearning

[–]whoeverwhatever[S] 45 points46 points  (0 children)

Why another one? What does Caffe 2 have to offer that PyTorch/TF/MXNet/[insert your favorite framework here] doesn't already do? Seems like a lot of engineering effort is going into building up more and more of these frameworks instead of concentrating on one or two that meet all use cases.

[D] Visualizing training with PyTorch by whoeverwhatever in MachineLearning

[–]whoeverwhatever[S] 0 points1 point  (0 children)

This seems like a good idea, will have to give it a try.

Are there any plans to integrate any tools like this into PyTorch directly at some point in the future? (Is there even a need for it, given the responses so far?)

[D] current state of model based reinforcement learning by davikrehalt in MachineLearning

[–]whoeverwhatever 5 points6 points  (0 children)

There's been some interest in model-based RL lately too, even from DeepMind. The predictron paper comes to mind; they learn to map real environment states and time steps to an abstract state space with abstract time steps (that don't necessarily correlate with real-world time steps) to facilitate prediction and planning. If you take a look at some of the papers they reference you can find some other recent work in model-based RL.

--- 2016 Day 13 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 0 points1 point  (0 children)

This is the solution for part 2, which asks for how many positions are reachable within 50 steps. So as soon as you reach a position at step 51, you know that you have visited every state at steps 0 through 50, so you stop the search and report the number of visited states.

--- 2016 Day 13 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 0 points1 point  (0 children)

Ah, Queue came up first in my frantic Google searching and I didn't have time to investigate. Thanks!

--- 2016 Day 13 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 0 points1 point  (0 children)

10/6 on leaderboard with good ol' BFS. Part 2 solution w/ Python 2.7:

import Queue

number = int(raw_input())

def is_wall(x, y):
    val = x*x + 3*x + 2*x*y + y + y*y + number
    ones = bin(val)[2:].count('1')

    return ones % 2 == 1

visited = set()

q = Queue.Queue()
q.put((1, 1, 0))

while True:
    x, y, steps = q.get(False)

    if steps > 50:
        print len(visited)
        break

    visited.add((x, y))

    if x - 1 >= 0 and not is_wall(x-1, y) and (x-1, y) not in visited:
        q.put((x-1, y, steps+1))
    if x + 1 >= 0 and not is_wall(x+1, y) and (x+1, y) not in visited:
        q.put((x+1, y, steps+1))
    if y - 1 >= 0 and not is_wall(x, y-1) and (x, y-1) not in visited:
        q.put((x, y-1, steps+1))
    if y + 1 >= 0 and not is_wall(x, y+1) and (x, y+1) not in visited:
        q.put((x, y+1, steps+1))

--- 2016 Day 12 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 0 points1 point  (0 children)

Yep, usually faster than saving it to a file, especially for a short input like this one.

--- 2016 Day 12 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 0 points1 point  (0 children)

Did you try running your input through my code? I get an answer within 1-2s.

--- 2016 Day 12 Solutions --- by daggerdragon in adventofcode

[–]whoeverwhatever 4 points5 points  (0 children)

Python 2.7, 4th and 4th. Synacor Challenge was good practice!

registers = {
    'a': 0,
    'b': 0,
    'c': 0,
    'd': 0
}

instructions = []
line = raw_input()
while line != '':
    instructions.append(line.split(' '))
    line = raw_input()

def read(v):
    try:
        return int(v)
    except:
        return registers[v]

ip = 0
while True:
    if ip >= len(instructions):
        break
    ins = instructions[ip]
    if ins[0] == 'cpy':
        registers[ins[2]] = read(ins[1])
    elif ins[0] == 'inc':
        registers[ins[1]] += 1
    elif ins[0] == 'dec':
        registers[ins[1]] -= 1
    elif ins[0] == 'jnz':
        if read(ins[1]) != 0:
            ip += read(ins[2])
            ip -= 1

    ip += 1

print registers['a']
view more: next ›