rphln
Joined 6 years ago
Joined 6 years ago
I'm not familiar with how it works on the implementation side. A ML conference that I attended had a presenter working on this area and beating AI impersonation was their #1 priority (along with other trivial approaches).
For what it's worth, this might also be just a security theater from the banks, though.
Guilty as charged. Pronouncing letters and numbers in English requires an active mental effort for me, so that happens if I'm not paying attention. I guess it's because they don't really register as another language, even with context. My inner monologue also does letters and numbers in Portuguese, which doesn't help either.
(I never got around to that point though, I usually start making games as libraries and then get nerd sniped into reading about game theory for the AI before I make them playable for humans.)
Love it, thanks for posting.
Reading through, this method sounds a lot like Thompson sampling, and surely enough, the previous thread came up after a quick search for comparisons.
Sadly, no immediate empirical results came up, but having another tool in the belt is good on its own.
enum Auth { Guest, User(u32), Bot(u32) }
was just syntactic sugar for struct Auth::Guest;
struct Auth::User(u32);
struct Auth::Bot(u32);
type Auth = Auth::Guest | Auth::User | Auth::Bot;
where `|` denotes an anonymous union. Using enums feel very clunky when you start needing to work with subsets of them.I really like Alabaster BG, but sadly VS Code lacks support to implement it.
Sadly nowadays I just can't get into these projects that'd need me to spend money and would just sit on a drawer until the ends of the time after completed.
A while ago I was experimenting with interactive exploration of (huge) Monte Carlo Tree Search trees. Inspired by file system visualization tools, my first attempts were also tree maps and sunburst graphs, but I ran into the same problems as in the article.
I tried flamegraphs next with the following setup:
- The number of visits in each node maps to the width and order of each bar (i.e., the most visited node was first and was the largest)
- The expected value maps to the color of each bar.
And then it was a perfect fit: it's easy to see what's going on in each branch at the first levels, and the deeper levels can be explored through drilling down.