HackerTrans
TopNewTrendsCommentsPastAskShowJobs

lschneider

no profile record

Submissions

Hackable PyTorch RL Library with Distributional Algorithms (D4PG, DSAC, DPPO)

github.com
2 points·by lschneider·2 ay önce·0 comments

Show HN: Deckades – Was Star Wars released before or after the first Email?

deckades.app
3 points·by lschneider·2 ay önce·1 comments

Show HN: Open-source AI image/deepfake detection that actually works

nonescape.com
3 points·by lschneider·11 ay önce·0 comments

Show HN: Generate docs for any GitHub repo (+ RAG chat)

givemedocs.com
1 points·by lschneider·geçen yıl·0 comments

Minimal auto-differentiation engine in Rust

github.com
70 points·by lschneider·geçen yıl·7 comments

Hardware basics: Harvard arch. processor and simulator in pure C

github.com
2 points·by lschneider·geçen yıl·0 comments

Show HN: Open-source sound effects and react library to spice up your website

reactsounds.com
21 points·by lschneider·geçen yıl·10 comments

Show HN: Sayso – We Fixed AI Phone Calls

saysoapp.com
4 points·by lschneider·geçen yıl·0 comments

Basic tools to develop deep learning applications in the cloud

blog.gpudeploy.com
1 points·by lschneider·2 yıl önce·0 comments

Show HN: Airbnb for GPUs

gpudeploy.com
2 points·by lschneider·2 yıl önce·0 comments

comments

lschneider
·2 ay önce·discuss
A bit more on the card data problem, since that took the majority of my time.

Each card needs, besides the title and year, a difficulty score, a popularity score, and a fun fact. Difficulty is just a measure how "obscure" the card is, most of the difficulty of a deck comes from how many cards + how close the years of the cards are. Popularity is used to create decks that are actually fun because no one enjoys just having super nieche titles they've never heard of.

Creating 2000+ cards was by hands was not possible so I used Claude to do it. After the initial card generation process, I created some skills to do quality assurance runs on the cards. Dividing cards into chunks that are manageable for Claude was the biggest difficulty here. Also, assigning difficulty/popularity scores was quite hard because Claude gave all of them 4-8 scores (out of 10). I solved this by coming up with specific rules for when to assign which score. For fun facts and year fact checking, I made Claude look up everyting manually on the internet.

Lastly, I had Claude create a scrappy QA dashboard with card stats and edit forms. I spent a lot of time playing the decks and manually adjusting things that caught my eye. This is still an ongoing process because when creating shareable decks for my friends, I still find that a lot of good cards are missing.

All in all it took me probably 10-15 hours to create all of the cards. This probably only saved me ~30-50% of the time it would take to create them manually. But now I have a repeatable process that's less error prone and will (hopefully) speed up creating more cards in the future.
lschneider
·geçen yıl·discuss
That's a great point, it would be better to keep the gradients separate from the Scalars.

However, I think PyTorch does it the same way (?), at least they say something like this in their docs.

"This function accumulates gradients in the leaves - you might need to zero .grad attributes or set them to None before calling it." - https://docs.pytorch.org/docs/stable/generated/torch.autogra...

The rust burn crate does it better, they store the backprop'd gradients in a separate container and return it: https://github.com/tracel-ai/burn/blob/af381ee18566fc27f5c98...
lschneider
·2 yıl önce·discuss
Github Copilot is the most useful tool I've found in a long time and having that in Jupyter Notebooks is just awesome. I've been missing that for quite some time. Great work guys!