guiand
Joined 6 years ago
Karma
281
Submissions
27
Member since
Jun 13
Recent submissions
Comment · 1 month ago
Love this!
I played with doing something similar, where my features were based on Edgic charts I found online[1]. This ends up implicitly factoring in people’s _perceptions_ of the players/editing, which can be useful. Ultimately it was just a bit of a toy still, somewhat better than random.
Like other people mention, Survivor is edited with a lot of intention, I think if you really want to predict winners you need to somehow capture cues from the editors.
I wonder if you could derive per-player 1st and 2nd person sentiment from transcripts of the episodes. Could be interesting to factor that in.
[1]: Example - https://www.reddit.com/r/Edgic/s/2v0nA93odi
Comment · 10 months ago
Long horizon events like this on Polymarket stabilize around a % odds corresponding to time value of money. You can get 4% buying risk free CDs for that horizon.
Comment · 10 months ago
For security, the feature requires setting a special option with the recovery mode command line:
rdma_ctl enable
Comment · 11 months ago
Split brain experiments show that a person rationalizes and accommodates their own behavior even when "they" didn't choose to perform an action[1]. I wonder if ML-based implants which extrapolate behavior from CNS signals may actually drive behavior that a person wouldn't intrinsically choose, yet the person accommodates that behavior as coming from their own free will.
[1]: "The interpreter" https://en.wikipedia.org/wiki/Left-brain_interpreter
Comment · 11 months ago
Noteworthy: this is powered by a new ultra-low-latency userspace TB5 driver offering an ibverbs/RDMA interface over thunderbolt 5[1]. Non-inference HPC workloads could see a massive benefit as well.
[1]: See MLX integration PR at https://github.com/ml-explore/mlx/pull/2808
Comment · 1 year ago
> true positives and false negatives
That would be a simple cache in most instances.
Comment · 1 year ago
This looks fantastic! I also rely a lot on CTRL-`-` for navigating to past locations.
Comment · 1 year ago
Hi HN,
I figured one of the really useful applications of LLMs would be in processing transcripts of city government public meetings.
First I was doing it for myself, but I figured others might be interested to read these summaries as well. I use a few prompts to semi-automatically create reports of the most discussed topics for various board/commission meetings.
Ad free, done in my spare time. Just figured people might be interested.
Comment · 3 years ago
This could be useful for e.g. bazel, where I’ve regularly seen deleting the bazel caches take on the order of 10 minutes because of absurdly large and repeated directory trees (caused by things like runfile trees containing the python interpreter).
Comment · 4 years ago
It’s somewhat true in the sense that banks need to keep some fraction of their deposits in cash as reserves (the “reserve ratio”). So if they lend money it needs to be backed to that extent by their deposits.
Comment · 4 years ago
Hash tables are (usually) faster to do all sorts of operations than tree based maps, as most operations become a simple function to calculate a tree’s hash followed by a table lookup. Of course, they’re unordered, so if you need to iterate in order, or find all keys < a certain value, or things like that, tree maps can be better for your algorithm.
Also, TreeMap uses a red-black tree to implement the map, which is a basic type of binary tree. Depending on the data you’d like to store, other kinds of tree-based maps can have better performance characteristics. A map based on a Splay Tree[1] speeds up repeated accesses, so it could perform well if you had keys that were cheap to compute an ordering but expensive to compute a hash, and your access pattern has good temporal locality.
All opinions here are my own, not my employer’s.
You can find other projects of mine at https://guiand.xyz.