Hacker Newsnew | past | comments | ask | show | jobs | submit | more denfromufa's commentslogin

@jph00 where do I find lstm/gru/seq2seq layers for time-series sequence predictions (not text)? Also interested in autoencoder implementations. The fast.ai docs search does not really work for this. What do you think about other notable APIs built on top of pytorch such as Pyro and AllenNLP?


AGPL would be a restriction if you need to deploy this model on top of PlaidML in production. It is still very useful during the training time after which the neural network can be offloaded into production framework such as tensorflow.


Heh, I think the part of the point of PlaidML is to avoid the speed/efficiency limitations of TensorFlow in deployment/production.



The results are income do not reflect the location, which is really important in US.


is there open-source implementation on github?


There are two reachable from here: https://arxiv.org/abs/1611.09482


Main features added to IPython:

- Show function signature in the terminal while completing.

- Assignments can trigger the display mechanism.

- IPdb can be called recursively.

- Support for system-wide configuration.

- Built-in support for Progress Bar.

More details here:

http://ipython.readthedocs.io/en/stable/whatsnew/version6.ht...

Main features added to Jupyter Notebooks:

- Internationalization.

- Shutdown server from command-line.

More details here:

https://medium.com/jupyter-blog/jupyter-notebook-5-1-0-ddc8b...


Will this work with CFFI?


Strange that no one has mentioned xonsh here:

http://xon.sh


Or Ammonite, for the strongly-typed crowd.

http://ammonite.io/


wow, this is insightful generalization


I have a jupyter notebook about a similar game "Penguins on Ice", solved with rotation of numpy arrays:

https://nbviewer.jupyter.org/gist/denfromufa/9a5e1fdeaf611dc...


Wow, hacker news is incredible sometimes :) , I was/am just looking over your notebook a week ago. Vacation is starting in a couple days and i was gonna try and solve if infinite play is possible in Tetris with just perfect clears. People have been at the problem for a few years now, and your notebook is pretty cool :D http://harddrop.com/forums/index.php?showtopic=7792&hl=perfe...


I was really surprised how efficient numpy arrays were at finding all combinations of the pieces. The backtracking is not using recursion, but instead a stack. This makes it more verbose to code and read, but easier to understand. I would like to make this notebook more interactive with ipywidgets and Unicode characters, so stay tuned ;)


Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: