sergeyk
1. Import your own PRs 2. We find the original spec or infer the spec 3. Agents you select (eg claude code opus 5, codex gpt 6 astra high, pi kimi k3, etc) implement the spec (starting from the parent commit of the PR, with the git history is pruned so they can’t look up the implementation) 4. Three judge LLMs grade agent solution given spec, PR implementation, and a rubric 5. You see the scores
Currently, from launching an agent to that agent being able to run tests in our Rails docker-compose environment (and to the live app preview running), is about 30 seconds. If that agent finishes their work and goes to sleep, and then hours later you come back to send a message, it'll wake up in about the same time.
(And, of course, you can launch many agents at once -- they're all going to be ready at roughly the same time.)
I think this is almost exactly what we've built with https://superconductor.dev
- set up a project with one or more repos
- set up your environment any way you want, including using docker containers
- run any number of Claude Code, Codex, Gemini, Amp, or OpenCode agents on a prompt, or "ticket" (we can add Cursor CLI also)
- each ticket implementation has a fully running "app preview", which you can use just like you use your locally running setup. your running web app is even shown in a pane right next to chat and diff
- chat with the agent inside of a ticket implementation, and when you're happy, submit to github
(agents can even take screenshots)
happy to onboard you if that sounds interesting, just ping me at [email protected]
Lecture Videos from LLM Bootcamp
The Art of Production: Rrose (Techno, Player Piano)
Data Management for Full Stack Deep Learning
Try NotePlan (https://noteplan.co)
Infrastructure Landscape for Full Stack Deep Learning [video]
Videos from Full Stack Deep Learning Program [March 2019]
Troubleshooting Deep Neural Networks: A Field Guide to Fixing Your Model
Troubleshooting Deep Neural Networks: a decision tree for debugging your model
Where have all the workers gone? – New Yorker
1) Instead of using the full color pixel image, use an "edge image" with some simple additional normalizations. If color is important, do this per color channel.
2) Create a dataset with as many cropped examples of the target object as you can find (mechanical turk is useful for annotating large datasets); every other crop of every image is a negative example.
3) Train a classifier (SVM if you want it to work, neural network if you're so inclined) using this dataset.
4) Apply the classifier to all subwindows of a new image to generate hypotheses of the target object location. This can be sped up in various ways, but this is the basic idea.
5) Post-process the hypotheses using context (can be as simple as simply finding the most confident hypotheses within a neighborhood).
If you're interested in object detection, an excellent recent summary of the recent decade of research is due to Kristen Grauman and Bastian Leibe: http://www.morganclaypool.com/doi/abs/10.2200/S00332ED1V01Y2... (do some googling if you don't have access to this particular PDF).
A cool paper from a few months ago that should be mentioned when commenting on a post called "Where's Waldo?" is http://www.cs.washington.edu/homes/rahul/data/WheresWaldo.ht...
Along with the lecture slides from different professors linked to on that page, it should be a sufficient start.