PSA: Eugine_Nier evading ban?

Both accounts' SSC comments come from the same IP.

Eh, I don't mind someone using a different account, as long as they don't repeat the behavior that got them banned originally.

[-]Dahlen11y120

Well, I'm not advocating for the new account to get banned either; it's just that as far as I'm aware most places have rules against evading bans, and LW doesn't seem to have a clear-cut policy on such situations. I just thought the community should be aware, and then it's up to mods to discuss the matter and take action if they so choose.

[-]Alejandro111y170

You are the fourth or fifth person who has reached the same suspicion, as far I as know, independently. Which of course is moderate additional Bayesian evidence for its truth (at the very least, it means you are seeing a objective pattern even if it turns out to be coincidental, instead of being paranoid or deluded)

[-]Ander11y120

I propose a new version of the Turing test: An AI is as smart as a human when it can figure out which new poster on a message board is actually the same person as an old poster who got banned. :)

[-]IlyaShpitser11y220

This is an old problem, see e.g.:

https://www.cs.berkeley.edu/~russell/papers/ifsa01-identity.pdf

for special cases. Both google and facebook are very interested in versions of this problem.

[-]V_V11y130

I don't think this is actually a difficult problem. Some simple machine learning on word frequencies, bigram frequencies, etc. will be probably enough to solve it.

[-]Kawoomba11y250

Friend of mine did it via computational complexity: using gzip (as an approximation for KC) for attributing classical latin literature to their respective authors by checking which strings add the least additional complexity (due to shared writing styles, word choice, etc.) when compressed together and then clustering. Worked like a charm.

ETA: These were large bodies of text, however. Probably not gonna work for a bundle of comments, except for me, due to my overuse of "obviously", obviously.

[-]Kaj_Sotala11y100

I thought this was pretty impressive:

We study techniques for identifying an anonymous author via linguistic stylometry, i.e., comparing the writing style against a corpus of texts of known authorship. We experimentally demonstrate the effectiveness of our techniques with as many as 100,000 candidate authors.

[...]

In experiments where we match a sample of just 3 blog posts against the rest of the posts from that blog (mixed in with 100,000 other blogs), the nearest-neighbor/RLSC combination is able to identify the correct blog in about 20% of cases; in about 35% of cases, the correct blog is one of the top 20 guesses. Via confidence estimation, we can increase precision from 20% to over 80% with a recall of 50%, which means that we identify 50% of the blogs overall compared to what we would have if we always made a guess.
The efficacy of the attack varies based on the number of labeled and anonymous posts available. Even with just a single post in the anonymous sample, we can identify the correct author about 7.5% of the time (without any confidence estimation). When the number of available posts in the sample increases to 10, we are able to achieve a 25% accuracy. Authors with

... (read more)

3Kawoomba11y

Difference was one of scale. Much easier when just taking three dozen? pieces of classical latin literature, some of which were different parts of the same opus magnum, then see them cluster to their respective authors and to the other parts of the same piece. More of a "put the pieces into the box" as opposed to a 100,000 pieces puzzle. In the latter case, you just know most of the puzzle pieces will either show the blue sky, or the blue sea, both a similar shade of blue.

4gattsuru11y

Commenting to 'save' this comment. That's a really clever way to handle that.

0[anonymous]11y

KC = Kolmogorov Complexity?

0Kawoomba11y

Yeap, the paper linked in my other comment explains how it works.

0[anonymous]11y

gzip is a "crude upper bound" on KC, and afaik there is no known bound on the error. EDIT: I'm pretty sure the following result isn't even true: If KC(x) < KC(y), then gzip(x) < gzip(y). Or even quantitatively weaker variants of the same.

0Kawoomba11y

There can't be, since KC isn't computable (could be mistaken on that in itself precluding a (edit:) lower error bound). It's still kinda nice and works on a similar principle (and also, somewhat, in practice). Let's plug the Hutter prize while we're at it, for the 5 people reading this. Also, just saw a cool paper which kinda describes the same principle, here.

4gwern11y

KC may not be uncomputable in general, but I'm pretty sure that doesn't preclude all possible proofs or constructions*, and it seems odd to say that there is no upper bounds when we have what sure look like such things. * I have just invented a Scheme-like programming language in which all tokens except numbers are 2 alphanumeric characters long; what is the Kolmogorov complexity of the bitstring '1'? 'Who knows, KC is uncomputable -' Bzzt! The answer is that the KC is exactly 1, since the shortest program which emits the bitstring '1' is a program consisting of the constant '1' which evaluates to '1', which as you can see, is indeed of length 1, and all other programs emitting the bitstring '1' are longer by definition. Or if you don't like that example, consider taking your favorite language and enumerating all possible programs in length order; consider the outputs of the programs you've just enumerated when evaluated up to the highest available Busy Beaver in steps (to avoid nontermination issues), and the respective lengths of outputs - have you not found the KC for those outputs? If you run gzip over the outputs to get estimated KCs, are those not upper bounds on the actual KCs you proved?

5V_V11y

Computing upper bounds on on Kolmogorov Complexity is not very difficult: gzip and all the other compression algorithms do it. The difficulty is computing non-trivial lower bounds: For all programming languages (with a self-terminating encoding), there is a trivial lower bound that doesn't depend on the string. This bound is at least one token. But there is also a language-dependent constant L_max which is the maximum KC complexity and lower bound on KC complexity that you can compute for any string: L_max is the length of the shortest program for which the halting property is uncomputable ( * ) (which makes L_max is uncomputable as well). This implies that you can compute the KC complexity only for a finite number of strings. ( * And doesn't provably emit any token)

3Anatoly_Vorobey11y

There is no such thing as "the shortest program for which the halting property is uncomputable". That property is computable trivially for every possible program. What's uncomputable is always the halting problem for an infinity of programs using one common algorithm. It is also easy to make up artificial languages in which Kolmogorov complexity is computable for an infinite subset of all possible strings. You were probably thinking of something else: that there exists a constant L, which depends on the language and a proof system T, such that it's not possible to prove in T that any string has Kolmogorov complexity larger than L. That is true. In particular, this means that there's a limit to lower bounds we can establish, although we don't know what that limit is.

6V_V11y

The halting property is semi-decidable: if a program halts, then you can always trivially prove that it halts, you just need run it. If a program does not halt, then sometimes you can prove that it doesn't halt, and sometimes you can't prove anything. For any programming language, there exist a length such that you can compute the halting property for all programs shorter than that. At length L_max, there will be program Bad_0, which: * Does not halt. * Can't be proven not to halt. * Doesn't emit any output symbol. * It can't be proven that there exist any string of output symbols that it doesn't emit. You can never prove that any string S has Kolmogorov complexity K if K > L_max, as it would imply that you proved that Bad_0 doesn't halt, or at least doesn't emit any symbol which is not a prefix of S. Since there are only finitely many strings with complexity up to L_max, we can only compute Kolmogorov complexity, for finitely many strings. If the language is Turing-complete I don't think this is possible. If you think that an arbitrary string S has complexity K, how can you prove that there exist no program shorter than K that computes S?

0Anatoly_Vorobey11y

[retracted]

0Kawoomba11y

Yea, only talking about the general case. Even the Halting Problem is usually computable in daily life, just by running the program (ETA: and seeing it terminate). Watch the program run See it die before your eyes Halting Problem? Solved!

0[anonymous]11y

Exactly. So why bother saying gzip is an approximation of KC? (I assume: because KC is a well-known theoretical object with good properties, and one shouldn't let the fact that none of these properties carry over to gzip ruin one's chance of getting published cheaply.)

0lmm11y

Because gzip is being used to measure complexity. That's literally the reason they used gzip and not, I don't know, rot13. It's an explanation of the causal role that gzip is playing in the whole process.

2[anonymous]11y

No. "gzip is being used to measure complexity" is an explanation of the causal role that gzip is playing in this study. "gzip is an approximation of KC" is either 1) flatly not true, see edit to grandparent or 2) not relevant to the study at all.

0Kawoomba11y

And while we're at it, why do we even care about Turing Machines, it's not like we could ever build one anyways. ;-) goes back to tending his potato garden

[-]Bugmaster11y110

I downvoted this post not because I hate you, or because I love Eugine_Nier (o), but because I'd like to see fewer post like this one in the future. And I think that expressing my sentiment is what the "Downvote" button is for.

More specifically, I don't think that public shaming and witch hunts belong on Less Wrong, even when the person being hunted is actually a witch (oo). I think that the toxic culture such tactics create is likely to be more harmful than individual unruly posters, in the long term.

(o) I don't even remember who he is, though the name does sound familiar.
(oo) Metaphorically speaking.

[-]Unknowns11y90

I am fairly sure that Azathoth123 downvotes comments that he disagrees with just because he disagrees with them, even when he is responding, which seems a bit rude if you are going to engage someone.

[-]Shmi11y230

That's indeed rude, but not unusual. It's the mass downvoting that was the real issue.

[-]JoshuaZ11y100

It is something Eugine did. I think Unkown's point is that it is additional evidence that this is Eugine.

2Shmi11y

Right, that makes sense.

[-]Peter Wildeford11y50

I also think it was wrong / overly risky to write this up publicly, unless you've contacted moderators personally first and found them unresponsive.

[-]Viliam_Bur11y140

unless you've contacted moderators personally first and found them unresponsive

I admit that this pretty much happened, only instead of "unresponsive" it was "responded, but then did nothing". :(

See also this.

3Peter Wildeford11y

Fair enough. Sorry then.

[-]Dahlen11y140

Alright, but

1) Overly risky for whom? I personally don't feel I have exposed myself to any risk other than vindictive downvoting, and if that happens (it hasn't yet) I trust that the resulting karma issues won't affect my participation much.

2) As far as I know LW doesn't have a well set-up report & moderation system. I even searched for the official rules of conduct and only found a page on what people should not talk about (not on how they should behave generally, or the policy for bans and banned members). I don't remember seeing a list of all the mods on LW or which of them is currently online. Even Viliam Bur said here that it might take even mods a long time to get to the bottom of such an issue.

3) Some people who have an interest in knowing this (e.g. people who have been the targets of mass downvoting) might have been duped otherwise, and I view this as an intrinsically bad thing.

0Peter Wildeford11y

For being wrong. - That's true, and fair.

3Dahlen11y

That's not a person. Again, who is being put at risk?

[-]Peter Wildeford11y140

The counterfactual u/Azathoth123 in the worlds where u/Azathoth123 and Eugine_Nier are different people.
The entire LW community, should this turn into a witchhunt (which it didn't).

[-]satt11y50

Thanks for saving me the effort of writing a full-length "J'accuse!".

[-]Dorikka11y40

I would retract and contact the moderator regarding your suspicion. See http://lesswrong.com/lw/kza/meta_new_lw_moderator_viliam_bur/

9pragmatist11y

I already contacted Viliam_Bur with this suspicion a few months ago, and I doubt I'm the first. I'm assuming Viliam either doesn't feel he has sufficient evidence to act, doesn't feel that any action is warranted, or is too busy to follow up on this at the moment. Yvain's comment below is a new piece of (fairly conclusive) evidence. Maybe that will impact the situation if Viliam felt he had insufficient evidence previously, so it might be worth drawing his attention to this thread.

[-]Viliam_Bur11y560

One of the problems with moderation is that cooperation with LW admins is very slow. As in: extremely slow. Which means: even more slow than you imagine after reading this. Certainly much slower than I imagined when volunteering for this role.

Using my own moderator powers, all I have is a "Ban user" button which can ban a user. (And a corresponding "Unban user" button.) That is the whole moderator user interface as far as I know. If I am wrong, please educate me.

So, my options as this moment are: (a) ban Azathoth123 because I feel sufficiently convinced that he is a reincarnation of Eugine Nier, or (b) send an e-mail asking for more evidence, and wait literally forever, or (c) ignore the whole thing. From the outside, options "b" and "c" seem indistinguishable, and... well, how much happy would you be if I started using the option "a" as a general strategy?

What would really help me at this moment:

Someone with knowledge of Python and SQL, willing to cooperate with me for a few weeks (an hour or two every week). The task would be: reading and analyzing a few already written scripts to understand how exactly the data are stored in data... (read more)

7Eliezer Yudkowsky11y

I tried a negative karma award so he couldn't downvote and was told "Karma awards must be greater than zero." I don't know where a "Ban user" button is.

5Viliam_Bur11y

As a moderator, when you look at someone else's comment, there should be an additional option between "Permalink" and "Get notifications" buttons. (Parent, Reply, Permalink, Ban, Notifications.) If you click it, it will change to "Unban".

[-]Eliezer Yudkowsky11y170

Found the correct control. For mods, the link is:

And Azathoth123 is out. It's not very good, but it's the best I can do - I encourage everyone to help Viliam make the software support better.

5Eliezer Yudkowsky11y

That only bans the comment, not the user!

3Kaj_Sotala11y

http://lesswrong.com/r/lesswrong/about/banned/ http://lesswrong.com/r/discussion/about/banned/ (These links only work for logged-in moderators.)

5pragmatist11y

Fair enough. Just wanted to let you know that although my comment might have sounded judgmental it genuinely wasn't intended that way. From my perspective, all three reasons for inaction I listed are perfectly legitimate and not deserving of criticism. I'm still not sure whether any concrete action is necessary, although at this point I am virtually certain that it is a Eugine sock puppet.

[-]Viliam_Bur11y100

I should have asked for help sooner. I should have updated sooner that the help will be necessary.

At this moment, I already have a few volunteers, and... uhm, I guess I will publicly ask for help again if the situation is not solved until 1.1.2015.

0Dahlen11y

Alright, I was looking for a way to report posts or contact moderators and couldn't find any, thanks for the link. But why retract?

2Dorikka11y

No problem. I would have retracted because of the significant downside if you happened to be wrong. Though it's still possible, I'm not really worried about it anymore given Yvain's comment.

0[anonymous]11y

PSA: Dahlen may be wanted in Argentina for absconding with 43 llamas. I have nothing against Dahlen, but you should guard your ungulates! EDIT Retracted for publizing unconfirmed rumors

0[anonymous]11y

P̶S̶A̶:̶ ̶D̶a̶h̶l̶e̶n̶ ̶m̶a̶y̶ ̶b̶e̶ ̶w̶a̶n̶t̶e̶d̶ ̶i̶n̶ ̶A̶r̶g̶e̶n̶t̶i̶n̶a̶ ̶f̶o̶r̶ ̶a̶b̶s̶c̶o̶n̶d̶i̶n̶g̶ ̶w̶i̶t̶h̶ ̶4̶3̶ ̶l̶l̶a̶m̶a̶s̶.̶ ̶ ̶I̶ ̶h̶a̶v̶e̶ ̶n̶o̶t̶h̶i̶n̶g̶ ̶a̶g̶a̶i̶n̶s̶t̶ ̶h̶i̶m̶,̶ ̶b̶u̶t̶ ̶d̶o̶n̶'̶t̶ ̶t̶r̶u̶s̶t̶ ̶h̶i̶m̶ ̶w̶i̶t̶h̶ ̶y̶o̶u̶r̶ ̶u̶n̶g̶u̶l̶a̶t̶e̶s̶!̶ E̶D̶I̶T̶:̶ (̶c̶o̶m̶m̶e̶n̶t̶ ̶r̶e̶t̶r̶a̶c̶t̶e̶d̶ ̶f̶o̶r̶ ̶p̶o̶s̶s̶i̶b̶l̶y̶ ̶s̶t̶a̶r̶t̶i̶n̶g̶ ̶b̶a̶s̶e̶l̶e̶s̶s̶ ̶r̶u̶m̶o̶r̶s̶)̶

4Dahlen11y

Heh. Wouldn't know about Argentina, but newspapers in SimNation are all over it. In all seriousness though, my claim is a) supported by arguments; b) somewhat relevant to the community; c) not an accusation tantamount to calumny (having a sock is neither illegal nor morally outrageous). The cases aren't even remotely comparable. Also, there are at least a few people who might be interested in knowing this, if true, and few people who would be interested in covering up the whole business. If not true, then at the very most the "two" of them might "find a valuable conversation partner" in "each other". (Scare-quoted because I highly doubt that is the case.)

[+]Kawoomba11y-80

LESSWRONG
LW

LESSWRONG
LW

27

PSA: Eugine_Nier evading ban?

27

27