You are viewing a single comment's thread from:

RE: A talk with ChatGPT about Steem... or: A lot of text! / Ein Gespräch mit ChatGPT über Steem... oder: Eine Menge Text!

in Suggestions Club • 25 days ago

Yes, but here too, suitable candidates for comparison need to be found first. Even if we assume, for example, that a 7-day window is sufficient for a contest, that’s still quite a lot of posts that would need to be compared.

True. It might be technically feasible if, for example, the bot looks at 6 day old posts each day and compares against 7-days worth of posts until it finds 10 to vote for. It could even cut the pool size down to a day or two. But, that would probably still require a lot of horsepower. Even if it's technically feasible, it's likely not economically feasible.

Coincidentally, a few minutes before I read this I was talking to an LLM about "surprise" and "perplexity" in language. Basically (if I understand correctly), perplexity is the degree to which tokens in a text are different from the most likely tokens. How surprising the text is.

I wonder if it's possible to consider the posts as a simple stream of text and maintain the current state of token likelihood within some window, and then calculate a perplexity value against the current expected values for each post that is published. I'm out of my depth here, but it almost seems doable - maybe also cost-prohibitive, though.

Sort:  

This vote is yours and deserved! Let's read, comment and connect.
❤️🍀

Boomin Three vote by wakeupkitty.jpg