tag:blogger.com,1999:blog-8890204.post5859717801232139438..comments2024-05-04T06:30:02.754-04:00Comments on My Biased Coin: In Need of a Few Bad PapersMichael Mitzenmacherhttp://www.blogger.com/profile/06738274256402616703noreply@blogger.comBlogger15125tag:blogger.com,1999:blog-8890204.post-52027635529521588102010-09-28T07:59:37.765-04:002010-09-28T07:59:37.765-04:00To put this another way: I love as much as anyone ...To put this another way: I love as much as anyone the challenge of developing better approximation algorithms for important problems. For instance, I'd love to get a factor-2 approximation to k-median. But the BBG algorithms already have the property that if data is such that all factor-2 approximations are close to the desired answer, then BBG will also get a solution close to the desired answer. So, to claim my new factor-2 approximation is better, I need to be able to say "it doesn't just produce any old 2-approximation, it produces a good/natural/special one" for some compelling notion of "good/natural/special". And if we can articulate what we mean by that, we can then ask if we can develop a souped-up version of BBG that needs only the assumption that the "good/natural/special" approximations to k-median are close to the desired answer.ali0482http://www.nrzee.comnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-36879850062992185312010-09-09T08:31:52.633-04:002010-09-09T08:31:52.633-04:00While BBG is a fine paper (if one whose eventual i...While BBG is a fine paper (if one whose eventual impact seems uncertain to me), clustering in general is a *great* source of bad papers. Drawing randomly from hits on "clustering" in the ACM Digital Library or Google Scholar, will bring up many a stinker in good conferences and journals. You can decide whether it's a success or failure of that randomized algorithm if an old clustering paper of mine comes up. :-) <br /><br />The common failing is the lack of connection between the criterion being optimized (always chosen for computational convenience) and the properties of any concrete task. There are thousands of clustering algorithms, and precious little insight into what problems which are good for.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-44603191981983143802010-08-24T20:35:52.108-04:002010-08-24T20:35:52.108-04:00This paper strikes me as a potentially "bad&q...This paper strikes me as a potentially "bad" paper, for reasons which I will outline below. The basic gist of it is that a major conclusion which the authors hold out as significant or surprising appears, upon closer inspection, to be directly built into the authors' definitions, and the definitions seem a little sketchy.<br /><br />http://www.chidalgo.com/Papers/HidalgoRodriguezPhysicaA2008.pdf<br /><br />The authors study the persistence of ties in a network of cellular phone calls.<br /><br />They define the "persistence" of a tie thusly: First, the the cellular phone records are split into ten contiguous time periods (called "panels") of equal length. Persistence is then quantified as the fraction of the panels in which a tie appears. <br /><br />This means that persistence is a numeric quantity with a value of 0 if the the tie never appears and 1 if it appears in all 10 panels. Note a natural consequence of this: A tie gets a persistence value of 0.5 under each of the following conditions: 1) It appears in each of the first 5 panels and then disappears, 2) It appears in the 5th panel and persists forever, or 3) It appears in every other panel. Intuitively, these do not seem like equivalent notions of persistence.<br /><br />They use basically five features in their model of tie persistence:<br /><br />1) Degree<br />2) Clustering Coefficient<br />3) Node Reciprocity<br />4) Link Reciprocity<br />5) Neighborhood overlap (sort-of Jaccard coefficient).<br /><br />The first three they consider as node attributes (rather than edge attributes) such that node reciprocity is defined as the fraction of all ego's ties that are reciprocated. They do this in order to study the average persistence of a node's ties as a function of these three characteristics. They find that:<br /><br />1) Average persistence decreases with degree.<br />2) Average persistence increases with clustering coefficient.<br />3) Average persistence increases with reciprocity.<br /><br />Their definition of link reciprocity is unclear. The only definition they give is "was there ever a panel in which the caller and callee reciprocally called each other?" I'm assuming the quantity they call "reciprocity" is the fraction of the panels in which the tie was reciprocal.<br /><br />If this is true, then it seems to me that their main conclusion "reciprocity is the strongest predictor of persistence" is built into the definitions rather than being a brilliant sociological deduction.<br /><br />Remember that persistence is defined as the fraction of panels in which A calls B. If reciprocity is defined as the fraction of panels in which A calls B and B calls A, then persistence increases whenever reciprocity increases merely by definition. Of course it is possible for persistence to increase without reciprocity increasing, and that is the reason that the correlation is not perfect, but the methodology seems flawed.<br /><br />It's also possible that my interpretation of their definition of link reciprocity is incorrect, but it probably should have been more clear.<br /><br />I'm not sure if this is what you mean by "bad." I would be interested in hearing defenses. Any thoughts?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-65540477229646770832010-08-24T14:41:43.584-04:002010-08-24T14:41:43.584-04:00Can you give an example of what you are looking fo...Can you give an example of what you are looking for here? (Maybe the old example, even if it is no longer appropriate, would serve as good illustration.) There are plenty of bad published papers out there, even in top conferences (and certainly as you go to weaker conferences). But I don't see how they would be very interesting to read in class. I think you also risk being insulting to people: I certainly wouldn't want to find my worst paper being highlighted as such in your class, regardless of what you (or I) though about it.<br /><br />Maybe you are just looking for controversial papers?Jonathan Katzhttps://www.blogger.com/profile/07362776979218585818noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-29501739482516873332010-08-22T15:02:15.084-04:002010-08-22T15:02:15.084-04:00(To be clear, my comment is based on Anons referri...(To be clear, my comment is based on Anons referring to the BBG paper.)Michael Mitzenmacherhttps://www.blogger.com/profile/02161161032642563814noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-32851548150276442942010-08-22T15:01:22.415-04:002010-08-22T15:01:22.415-04:00I suppose I should have imagined some some nut wit...I suppose I should have imagined some some nut with an agenda would use this post to spout some vitriol, but to make clear, I'm disappointed by the anonymous comments, and I thank Avrim for taking time to respond.<br /><br />Of course, there wasn't anything particularly useful to respond to -- just a statement of "I think this is a bad paper" with some wishy-washy comments with no specifics, no clear points, no actual references to any text. And then a generalization to the "other papers of Balcan". <br /><br />Just to give my opinion on the opinion, if I saw a review like this when on a PC, my opinion of the reviewer would be downgraded for the rest of the meeting. If I received a review like this, I'd assume the reviewer was either personally biased against me or just an unsuitable individual for reviewing.<br /><br />It's OK to have a poor opinion of a paper (or, I suppose, a researcher). Indeed, the point of my post was that it should be useful for students to see "bad examples", and learn from them (as they learn from good papers). But particularly if you're going to call a paper bad, you should have the argument ready to back it up.<br /><br />On the plus side, perhaps these comments will encourage MORE people to read the BBG paper, which should, I think, be good for the authors.Michael Mitzenmacherhttps://www.blogger.com/profile/02161161032642563814noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-55180044219778916032010-08-22T11:02:11.917-04:002010-08-22T11:02:11.917-04:00I really hope you will read this Clustering paper ...I really hope you will read this Clustering paper in in your class; and then post impressions on your blog.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-77114202256436266312010-08-21T23:16:44.708-04:002010-08-21T23:16:44.708-04:00"The same goes for the other papers of Balcan..."The same goes for the other papers of Balcan about Learning and Clustering via Similarity Functions.<br /><br />They all try to make a conceptual point, but the conceptual point turns out, each time, to be highly flawed: the theorems are correct, but often nearly-vacuous, and in any case don't mean what you'd have thought they mean."<br /><br />Can you describe a theorem that troubles you?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-43224210180061808312010-08-19T16:19:53.541-04:002010-08-19T16:19:53.541-04:00"Finding Patterns with Variable Length Gaps o..."Finding Patterns with Variable Length Gaps or Don’t Cares"<br /><br />M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed and William F. Smyth<br /><br />http://www.springerlink.com/content/t214n0657456g116/<br /><br />This paper works on an idea which is actually fine, but does not really give the reasons. Also, the use of "by clever programming" is never a good sign.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-39221068990659649622010-08-18T15:28:15.242-04:002010-08-18T15:28:15.242-04:00Seeing as I was mentioned here, I'd like to sa...Seeing as I was mentioned here, I'd like to say that BBG and the papers on clustering and learning via similarity functions, are some of my favorites of my own papers. Let me focus here on BBG in particular and explain why I like it so much.<br /><br />First, there are many problems that when you formulate them as an optimization problem, they have the property that the objective function you are using to measure solution quality is not the same as the quantity you really care about. For instance, say you are clustering images of people by who is in them. You might algorithmically map the images into points in R^n and then aim to find a clustering that (approximately) minimizes k-means score on these points. But really you care about whether you clustered the people correctly. Of course, what's happening is your algorithm can't measure what you really care about so instead you optimize something you can measure. Fine - it's not a crazy thing to do. But the effect is this may make the problem seem harder than it really is. In particular, notice that in order for this to work, you *already* need to have used a method for representing your data (e.g, a way of placing images into in R^n) such that the optimal and near-optimal solutions to the objective you are measuring (k-means score) have good quality according to what you really care about. Otherwise, why be excited about getting a near-optimal score? The key point of BBG is that this property (solutions that are near-optimal according to the objective you can measure are also near-optimal according to the one you care about but can't) implies structure you can use algorithmically. Furthermore, this is true *even if* it's NP-hard in general to find near-optimal solutions. E.g., say we believe that it would be enough to get a 1.1 approximation to k-means in order to get close to the clustering we want. You might think this is not useful since k-means is NP-hard to approximate to such a factor. But what BBG shows is you can still use the implied structure to get close according to the objective you care about, even if it's NP-hard in general to approximate the objective you can measure.<br /><br />To put this another way: I love as much as anyone the challenge of developing better approximation algorithms for important problems. For instance, I'd love to get a factor-2 approximation to k-median. But the BBG algorithms already have the property that if data is such that all factor-2 approximations are close to the desired answer, then BBG will also get a solution close to the desired answer. So, to claim my new factor-2 approximation is better, I need to be able to say "it doesn't just produce any old 2-approximation, it produces a good/natural/special one" for some compelling notion of "good/natural/special". And if we can articulate what we mean by that, we can then ask if we can develop a souped-up version of BBG that needs only the assumption that the "good/natural/special" approximations to k-median are close to the desired answer.<br /><br />Personally, I think this is great. It says that for problems where we are trying to use solutions to objective A in order to solve problem B, then perhaps hardness results for A can be bypassed by using the assumption we are making *anyway* of the link between quality according to A and quality according to B in our given instances. For me, as someone who has worked in approximation algorithms for a long time, this was really cool.Avrim Blumhttp://www.cs.cmu.edu/~avrim/noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-75161574873198766852010-08-17T21:09:50.243-04:002010-08-17T21:09:50.243-04:00Why don't you use Deolalikar's P \neq NP p...Why don't you use Deolalikar's P \neq NP paper in your class as an example of a "bad" paper? :-)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-57523194916650596332010-08-16T03:20:23.228-04:002010-08-16T03:20:23.228-04:00They all try to make a conceptual point, but the c...<i>They all try to make a conceptual point, but the conceptual point turns out, each time, to be highly flawed: the theorems are correct, but often nearly-vacuous, and in any case don't mean what you'd have thought they mean.</i><br /><br />And this differs from virtually every theory paper how, exactly?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-85787023644503456812010-08-15T23:19:30.510-04:002010-08-15T23:19:30.510-04:00This is a new anonymous.
I still think the BBG pa...This is a new anonymous.<br /><br />I still think the BBG paper is a bad paper.<br /><br />The same goes for the other papers of Balcan about Learning and Clustering via Similarity Functions.<br /><br />They all try to make a conceptual point, but the conceptual point turns out, each time, to be highly flawed: the theorems are correct, but often nearly-vacuous, and in any case don't mean what you'd have thought they mean.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-71239709918517855212010-08-13T17:19:57.216-04:002010-08-13T17:19:57.216-04:00This comment has been removed by the author.Lev Reyzinhttps://www.blogger.com/profile/09629175455869565423noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-15824001297172352812010-08-13T16:43:35.051-04:002010-08-13T16:43:35.051-04:00Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Ap...Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Approximate clustering without the approximation. SODA 2009: 1068-1077Anonymousnoreply@blogger.com