Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
lqr
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
lqr
4y ago
What is so bad about VST?
32.
▲
by
lqr
4y ago
In CS right now, people with a very strong PhD can go straight to the tenure track. I took a postdoc because my PhD is solid but I jumped around topics a lot, so it's not quite coherent enough. My postdoc is also at a more prestigious
33.
▲
by
lqr
4y ago
Looked it up, it seems more targeted to page layout applications. Is it really that much better for something like a drawing in a math textbook?
34.
▲
by
lqr
4y ago
If the author is here: There is a mistake in this article. In Section II, the text discusses a wagon capacity of 19, but the code and printed output are for a wagon capacity of 1000.
35.
▲
by
lqr
4y ago
I take notes on the lowest-tier Strathmore 9x12" spiral-bound sketchbooks. I strongly prefer totally blank paper for math and diagrams. The paper is plenty high-quality, you can tear out pages without ruining the appearance, and they a
36.
▲
by
lqr
4y ago
Matlab toolboxes: Lots of algorithms. Good documentation. Converting LPs/QPs into standard forms is kind of a fun puzzle but very error-prone. Manual gradient/Jacobian for general nonconvex/nonlinear problems can be painful.
37.
▲
by
lqr
4y ago
In another life I would love to be a BCI researcher.
38.
▲
by
lqr
4y ago
The poster is an advertisement for the paper. Same goes for oral sessions. Almost all talks include the phrase "for details, see our paper". Posters are a nice middle ground between an abstract and a full paper. Spending 5 minutes
39.
▲
by
lqr
5y ago
The Perceptron is also interesting because its classic mistake bound analysis is one of the earliest instances of modern learning theory. The mistake bound states that if the data is linearly separable (i.e. a perfect linear classifier exi
40.
▲
by
lqr
5y ago
It does seem like it should be simple to avoid those. I can imagine it might be complicated if the model treats turns as instantaneous and only considers edges in the road graph as taking time. I would love a road navigation tool that gives
41.
▲
by
lqr
5y ago
If by "unprotected" you mean "no green arrow", in what part of the LA area is it feasible to avoid unprotected lefts? They are all over the place in my neighborhood. If by "unprotected" you mean a left from a s
42.
▲
by
lqr
5y ago
The LP solver might find a solution with fractional toys. If we add the constraint that x must be an integer vector, then it becomes an integer linear program. Solving integer linear programs is NP-complete.
43.
▲
by
lqr
5y ago
My main workflow improvement over the course of my PhD has been making my papers reproducible. This means: I clone a github repo, then I execute a single command to re-run all computations, re-generate all figures and tables, and compile th
44.
▲
by
lqr
5y ago
Geometrically-growing arrays (std::vector) and hash tables also have amortized O(1) insertion complexity. They are some of the most widely-used data structures of all. I agree that amortized guarantees can be a problem in certain applicatio
45.
▲
by
lqr
5y ago
One example with model-based RL is "World Models" by Ha and Schmidhuber. They pre-train an autoencoder to reduce image observations to vectors, then pre-train a RNN to predict future reduced vectors, then use a parameter-space glo
46.
▲
by
lqr
5y ago
Graphics-wise, the assumptions are quite different. Game scenes are a large collection of low-detail objects that are constantly moving and not all visible at once. CAD scenes are a small collection of high-detail objects that don't mo