rphln · HackerTrans

rphln

no profile record

Submissions

Symmetry454

en.wikipedia.org

1 pointsby rphlnvor 3 Jahren0 comments

Meaningful

slatestarcodex.com

1 pointsby rphlnvor 3 Jahren0 comments

comments

vor 7 Monatendiscuss

Flamegraphs are a really lovely tool for visualizing trees. Slightly related anecdote:

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.

letztes Jahrdiscuss

The app asks you to move the camera or change your expression throughout the verification.

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.

letztes Jahrdiscuss

Can't speak about this one in particular, but the face scans for banking that I know of also includes liveness checks to avoid AI impersonation (and presumably dead bodies).

letztes Jahrdiscuss

Mixing them should be relatively common when denoting intervals, as in "(a, b]" or "[a, b)", so that'd be one cause for being unbalanced. But even so, the math on their usage still doesn't add up.

letztes Jahrdiscuss

This apparently fits the bill: https://patricksurry.github.io/posts/flowsnake/. Amit's post led me to search about recursive coordinates for hexes again and I came across it in a StackExchange comment.

vor 2 Jahrendiscuss

> with the S and Q in Portuguese

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.

vor 2 Jahrendiscuss

There's already `ls --hyperlink` for clickable results, but that depends on your terminal supporting the URL escape sequence.

vor 2 Jahrendiscuss

Would've been perfect had you said jndex.

vor 2 Jahrendiscuss

Bummer, I had no idea about that. But I guess that, at least for turn-based games, it wouldn't be super annoying if you manage to split the logic (F#) from the UI glue (C#), right?

(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.)

vor 2 Jahrendiscuss

I think it'd be interesting to compare against F#, especially since Godot already has first-class support for .NET. When the bindings get fully fleshed out, what will OCaml bring to the table to warrant the extra hoops for the user that has no prior preferences for either languages?

vor 2 Jahrendiscuss

Previous discussion: https://news.ycombinator.com/item?id=13857116

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.

vor 2 Jahrendiscuss

Often I wish that:

    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.

vor 2 Jahrendiscuss

There's also the Alabaster variants [1], which includes a dark theme.

I really like Alabaster BG, but sadly VS Code lacks support to implement it.

[1]: https://github.com/tonsky/sublime-scheme-alabaster

vor 2 Jahrendiscuss

Somehow the paper they mention completely flew under my radar when I was researching MCTS. Surely it's gonna be a lot of fun to give this modification a spin on my next opportunity.

vor 2 Jahrendiscuss

Building and (most importantly) programming one of those was a pipe dream back when I used to browse Let's Make Robots a bunch of years ago.

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.

vor 2 Jahrendiscuss

My favorite resource on Thompson Sampling is <https://everyday-data-science.tigyog.app/a-b-testing>.

After learning about it, I went on to replace the UCT formula in MCTS with it and the results were... not much better, actually. But it made me understand both a little better.

vor 3 Jahrendiscuss

Ultimately, what kinds of incentives does having no respecs leads to?

I don't think I've ever really cared about immersion. I like experimenting with stuff. In a long game, having no option to undo whatever I cook up means I'd either a) have to suffer for the rest of the playthrough, b) avoid the janky stuff, or c) end up looking for build spoilers. None of which are particularly fun. Bonus points if the game doesn't really have a lot of replay value in the first place.

(That being said, the only games that I played and truly felt miserable in this regard were MMOs.)

If the game wants to be punishing, give it hard bosses that force me to learn how to play better regardless of my build.

(Though, as mentioned downthread, if it's a short game, no problems. The game is probably designed to be played multiple times anyway.)

vor 3 Jahrendiscuss

How about U+202F NARROW NO-BREAK SPACE?

1 000 (Narrow nbsp)

1 000 (Regular nbsp)

(Assuming HN even allows it.)

vor 3 Jahrendiscuss

That is actually a problem under research; there are a few papers on it and luckily they use the obvious name — TSP with drones or TSP-D.

I gave that problem a very shallow go for a Metaheuristics assignment, and while I didn't really mess with the domain specific heuristics for it, it did seem pretty fun indeed.

vor 4 Jahrendiscuss

I recently had the same problem with Conda's and Pandoc's initializations in Bash.

At first I did the same as the author and just dumped the output from `pandoc --bash-completion` et al. into a file, but then I'd have to deal with cache invalidation on every machine that I use. Doing it manually isn't that bad, but remembering to update the file in a bunch of machines is a bit too much ugly for me.

After a surprisingly short Google session, I ended up settling with lazy initialization [1]. Unlike the post I found, I did it all manually, though. Now I just have this tucked at the end of my `.bashrc`:

    function conda {
        unset -f conda

        # shellcheck disable=SC1090
        source <(conda shell.bash hook)
        conda "${@}"
    }

    function _pandoc {
        unset -f _pandoc

        # shellcheck disable=SC1090
        source <(pandoc --bash-completion)
        _pandoc "${@}"
    }

    complete -F _pandoc pandoc

[1]: https://dev.to/zanehannanau/bash-lazy-completion-evaluation-...