Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
andersource
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
91.
▲
by
andersource
4y ago
My advice: 1. Find a therapist. If the first one or two or six don't work, keep looking. 2. Find something you like to do offline - reading, music (listening or playing), dancing, volunteering, whatever. If the first thing or two or si
92.
▲
False Vacuum Decay
(en.wikipedia.org)
1 points
by
andersource
4y ago
|
0 comments
93.
▲
Researchers thought this was a bug (Borwein integrals) [video]
(youtube.com)
2 points
by
andersource
4y ago
|
0 comments
94.
▲
by
andersource
4y ago
No, I mean (non-)differentiable, although differentiable non-continuous is also not useful. If you scanned every pixel for every polygon and discretely determined whether it was inside or outside that would be as you describe, but that'
95.
▲
by
andersource
4y ago
Most rendering pipelines, as they involve discrete operations. For example in mesh rendering, the step of polygon rasterization is typically non-differentiable, because every pixel is either inside some polygon or isn't.
96.
▲
by
andersource
4y ago
Parent is correct that the definition you gave is indeed broadly the correct definition, i.e. there's no principle difference between calculus "differentiable" and differentiable as in differentiable rendering, except maybe t
97.
▲
by
andersource
4y ago
SEEKING WORK | ML & DS | Remote Have a nonstandard optimization problem? Could use an interactive visualization to explore complex data? I'd love to hear about it! daniel@andersource.dev https://andersource.dev
98.
▲
Fuzzy Metaballs: Approximate differentiable rendering with algebraic surfaces
(leonidk.github.io)
137 points
by
andersource
4y ago
|
13 comments
99.
▲
by
andersource
4y ago
The interview: https://m.youtube.com/watch?v=e6Y2uQn_wvc
100.
▲
Listening demos of acoustic simulations of cochlear implants
(ecs.utdallas.edu)
2 points
by
andersource
4y ago
|
0 comments
101.
▲
by
andersource
4y ago
Look at past Kaggle competitions with similar characteristics to your problem; many (most?) competitions have threads in the discussion by top ranked participants detailing their approach.
102.
▲
by
andersource
4y ago
Maybe I'm misunderstanding your comment, but it sounds (to me) like you're putting the onus on the maintainers, as if it's their obligation to contribute to OS and their inability to not be upset stands in the way of performi
103.
▲
by
andersource
4y ago
Very cool! From the related blog post[0]: * All the animation is done using color palette cycling (which is very impressive!) * The scenes were originally made by Mark J Ferrari and ported by the author as a demo for color cycling in HTML5
104.
▲
by
andersource
4y ago
Congrats, that sounds awesome (not cynically)! But I think there's a big difference between owning your own business (where you make all the big decisions, you dictate the business values, and are directly responsible for the value you
105.
▲
by
andersource
4y ago
I was in a similar position, ended up transitioning to machine learning. Very happy with it, but I also echo the sentimemt expressed in other comments that work is work and ultimately fulfillment is better sought outside of the workplace. I
106.
▲
by
andersource
4y ago
Very tangentially, the "Snakeoil Salesman" reminded me of a candidate I once interviewed. For an hour and a half they showed a dozen codebases cloned off github, explaining basically what the README.md explained without actually s
107.
▲
by
andersource
4y ago
Yes, with topics that don't seem related to what I usually watch. Also noticed this quite recently.
108.
▲
Halloween Problem
(en.wikipedia.org)
2 points
by
andersource
4y ago
|
0 comments
109.
▲
by
andersource
4y ago
When I'm procrastinating hard on something, my best solution so far is to divide it to lots of tiny action items (~10 minutes each) and commit to doing at least one item every day. Sometimes that's enough to get me in the mood and
110.
▲
Stepping Stones
(azspcs.com)
1 points
by
andersource
4y ago
|
0 comments
111.
▲
by
andersource
4y ago
Not a rare algorithm, but used Dijkstra along with [0] to create a timelapse video from a sequence of videos. The Dijkstra was used to choose paths of most similar frames across videos to morph between. [0] https://learnopencv.co
112.
▲
The dangerous playgrounds of 1900s through vintage photographs
(rarehistoricalphotos.com)
191 points
by
andersource
4y ago
|
173 comments
113.
▲
Dollar Auction
(en.wikipedia.org)
1 points
by
andersource
4y ago
|
0 comments
114.
▲
Britain pulls the plug on its UFO hotline (2009)
(nbcnews.com)
2 points
by
andersource
4y ago
|
0 comments
115.
▲
by
andersource
4y ago
From TFA it appears this is not practical yet, maybe in the future: > For now, it’s primarily a theoretical advance, since the speed improvements kick in only for networks that are far larger than the ones we encounter in the real world,
116.
▲
Interactive data exploration utilities with dimensionality reduction and D3.js
(andersource.dev)
3 points
by
andersource
4y ago
|
0 comments
117.
▲
Interactive data exploration utilities with dimensionality reduction and D3.js
(andersource.dev)
1 points
by
andersource
4y ago
|
0 comments
118.
▲
by
andersource
4y ago
That's cool, I didn't know that, thanks!
119.
▲
by
andersource
4y ago
Thanks for your reply! I've only seen (and used) this for linear / convex models and constraints, so that's actually linear / convex programming (highly recommend the cvxpy library [0]). I was curious if you've inte
120.
▲
by
andersource
4y ago
Makes sense, and designing proper constraints is an art on its own. Out of curiosity, did you apply the constraint as a term in the loss or did you use constrained optimization?
More ›