hunch_net hunch_net-2011 hunch_net-2011-446 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Various people want to use hunch.net to announce things. I’ve generally resisted this because I feared hunch becoming a pure announcement zone while I am much more interested contentful posts and discussion personally. Nevertheless there is clearly some value and announcements are easy, so I’m planning to summarize announcements on Mondays. D. Sculley points out an interesting Semisupervised feature learning competition, with a deadline of October 17. Lihong Li points out the webscope user interaction dataset which is the first high quality exploration dataset I’m aware of that is publicly available. Seth Rogers points out CrossValidated which looks similar in conception to metaoptimize , but directly using the stackoverflow interface and with a bit more of a statistics twist.
sentIndex sentText sentNum sentScore
1 I’ve generally resisted this because I feared hunch becoming a pure announcement zone while I am much more interested contentful posts and discussion personally. [sent-3, score-1.235]
2 Nevertheless there is clearly some value and announcements are easy, so I’m planning to summarize announcements on Mondays. [sent-4, score-1.215]
3 Sculley points out an interesting Semisupervised feature learning competition, with a deadline of October 17. [sent-6, score-0.494]
4 Lihong Li points out the webscope user interaction dataset which is the first high quality exploration dataset I’m aware of that is publicly available. [sent-7, score-1.532]
5 Seth Rogers points out CrossValidated which looks similar in conception to metaoptimize , but directly using the stackoverflow interface and with a bit more of a statistics twist. [sent-8, score-1.272]
wordName wordTfidf (topN-words)
[('announcements', 0.374), ('points', 0.246), ('dataset', 0.205), ('rogers', 0.202), ('announcement', 0.202), ('zone', 0.202), ('feared', 0.202), ('metaoptimize', 0.202), ('conception', 0.187), ('announce', 0.177), ('sculley', 0.177), ('summarize', 0.168), ('semisupervised', 0.162), ('lihong', 0.162), ('publicly', 0.147), ('li', 0.147), ('user', 0.143), ('pure', 0.143), ('interaction', 0.139), ('october', 0.139), ('posts', 0.133), ('interface', 0.131), ('becoming', 0.126), ('looks', 0.121), ('competition', 0.119), ('planning', 0.119), ('exploration', 0.118), ('aware', 0.109), ('statistics', 0.108), ('clearly', 0.108), ('deadline', 0.103), ('quality', 0.091), ('directly', 0.09), ('feature', 0.086), ('nevertheless', 0.085), ('discussion', 0.08), ('high', 0.08), ('generally', 0.076), ('similar', 0.076), ('various', 0.074), ('value', 0.072), ('interested', 0.071), ('ve', 0.061), ('bit', 0.061), ('easy', 0.06), ('interesting', 0.059), ('want', 0.059), ('using', 0.05), ('first', 0.049), ('use', 0.043)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 446 hunch net-2011-10-03-Monday announcements
Introduction: Various people want to use hunch.net to announce things. I’ve generally resisted this because I feared hunch becoming a pure announcement zone while I am much more interested contentful posts and discussion personally. Nevertheless there is clearly some value and announcements are easy, so I’m planning to summarize announcements on Mondays. D. Sculley points out an interesting Semisupervised feature learning competition, with a deadline of October 17. Lihong Li points out the webscope user interaction dataset which is the first high quality exploration dataset I’m aware of that is publicly available. Seth Rogers points out CrossValidated which looks similar in conception to metaoptimize , but directly using the stackoverflow interface and with a bit more of a statistics twist.
2 0.15813285 433 hunch net-2011-04-23-ICML workshops due
Introduction: Lihong points out that ICML workshop submissions are due April 29.
3 0.10183156 393 hunch net-2010-04-14-MLcomp: a website for objectively comparing ML algorithms
Introduction: Much of the success and popularity of machine learning has been driven by its practical impact. Of course, the evaluation of empirical work is an integral part of the field. But are the existing mechanisms for evaluating algorithms and comparing results good enough? We ( Percy and Jake ) believe there are currently a number of shortcomings: Incomplete Disclosure: You read a paper that proposes Algorithm A which is shown to outperform SVMs on two datasets. Great. But what about on other datasets? How sensitive is this result? What about compute time – does the algorithm take two seconds on a laptop or two weeks on a 100-node cluster? Lack of Standardization: Algorithm A beats Algorithm B on one version of a dataset. Algorithm B beats Algorithm A on another version yet uses slightly different preprocessing. Though doing a head-on comparison would be ideal, it would be tedious since the programs probably use different dataset formats and have a large array of options
4 0.093163081 25 hunch net-2005-02-20-At One Month
Introduction: This is near the one month point, so it seems appropriate to consider meta-issues for the moment. The number of posts is a bit over 20. The number of people speaking up in discussions is about 10. The number of people viewing the site is somewhat more than 100. I am (naturally) dissatisfied with many things. Many of the potential uses haven’t been realized. This is partly a matter of opportunity (no conferences in the last month), partly a matter of will (no open problems because it’s hard to give them up), and partly a matter of tradition. In academia, there is a strong tradition of trying to get everything perfectly right before presentation. This is somewhat contradictory to the nature of making many posts, and it’s definitely contradictory to the idea of doing “public research”. If that sort of idea is to pay off, it must be significantly more succesful than previous methods. In an effort to continue experimenting, I’m going to use the next week as “open problems we
5 0.092993706 402 hunch net-2010-07-02-MetaOptimize
Introduction: Joseph Turian creates MetaOptimize for discussion of NLP and ML on big datasets. This includes a blog , but perhaps more importantly a question and answer section . I’m hopeful it will take off.
6 0.091675811 423 hunch net-2011-02-02-User preferences for search engines
7 0.090164095 293 hunch net-2008-03-23-Interactive Machine Learning
8 0.083214119 326 hunch net-2008-11-11-COLT CFP
9 0.082059875 418 hunch net-2010-12-02-Traffic Prediction Problem
10 0.0789854 268 hunch net-2007-10-19-Second Annual Reinforcement Learning Competition
11 0.075532392 276 hunch net-2007-12-10-Learning Track of International Planning Competition
12 0.074941501 454 hunch net-2012-01-30-ICML Posters and Scope
13 0.07476078 151 hunch net-2006-01-25-1 year
14 0.07342039 475 hunch net-2012-10-26-ML Symposium and Strata-Hadoop World
15 0.068465352 20 hunch net-2005-02-15-ESPgame and image labeling
16 0.067754716 225 hunch net-2007-01-02-Retrospective
17 0.063739508 459 hunch net-2012-03-13-The Submodularity workshop and Lucca Professorship
18 0.063297912 281 hunch net-2007-12-21-Vowpal Wabbit Code Release
19 0.062967435 19 hunch net-2005-02-14-Clever Methods of Overfitting
20 0.062615968 472 hunch net-2012-08-27-NYAS ML 2012 and ICML 2013
topicId topicWeight
[(0, 0.111), (1, -0.043), (2, -0.061), (3, -0.024), (4, 0.016), (5, 0.016), (6, -0.047), (7, -0.072), (8, -0.027), (9, -0.088), (10, -0.028), (11, 0.046), (12, -0.058), (13, -0.001), (14, -0.096), (15, 0.004), (16, -0.044), (17, -0.056), (18, -0.033), (19, 0.043), (20, -0.001), (21, -0.02), (22, -0.016), (23, -0.02), (24, -0.017), (25, 0.065), (26, 0.112), (27, -0.029), (28, -0.187), (29, -0.041), (30, 0.042), (31, -0.044), (32, 0.035), (33, -0.058), (34, 0.004), (35, -0.03), (36, -0.041), (37, 0.038), (38, 0.012), (39, -0.013), (40, -0.092), (41, 0.097), (42, 0.068), (43, 0.016), (44, 0.072), (45, -0.007), (46, 0.006), (47, 0.074), (48, -0.048), (49, 0.05)]
simIndex simValue blogId blogTitle
same-blog 1 0.98603159 446 hunch net-2011-10-03-Monday announcements
Introduction: Various people want to use hunch.net to announce things. I’ve generally resisted this because I feared hunch becoming a pure announcement zone while I am much more interested contentful posts and discussion personally. Nevertheless there is clearly some value and announcements are easy, so I’m planning to summarize announcements on Mondays. D. Sculley points out an interesting Semisupervised feature learning competition, with a deadline of October 17. Lihong Li points out the webscope user interaction dataset which is the first high quality exploration dataset I’m aware of that is publicly available. Seth Rogers points out CrossValidated which looks similar in conception to metaoptimize , but directly using the stackoverflow interface and with a bit more of a statistics twist.
2 0.57209718 433 hunch net-2011-04-23-ICML workshops due
Introduction: Lihong points out that ICML workshop submissions are due April 29.
3 0.55659133 427 hunch net-2011-03-20-KDD Cup 2011
Introduction: Yehuda points out KDD-Cup 2011 which Markus and Gideon helped setup. This is a prediction and recommendation contest for music. In addition to being a fun chance to show your expertise, there are cash prizes of $5K/$2K/$1K.
4 0.54514694 459 hunch net-2012-03-13-The Submodularity workshop and Lucca Professorship
Introduction: Nina points out the Submodularity Workshop March 19-20 next week at Georgia Tech . Many people want to make Submodularity the new Convexity in machine learning, and it certainly seems worth exploring. Sara Olson also points out a tenured faculty position at IMT Lucca with a deadline of May 15th . Lucca happens to be the ancestral home of 1/4 of my heritage
5 0.51440251 399 hunch net-2010-05-20-Google Predict
Introduction: Slashdot points out Google Predict . I’m not privy to the details, but this has the potential to be extremely useful, as in many applications simply having an easy mechanism to apply existing learning algorithms can be extremely helpful. This differs goalwise from MLcomp —instead of public comparisons for research purposes, it’s about private utilization of good existing algorithms. It also differs infrastructurally, since a system designed to do this is much less awkward than using Amazon’s cloud computing. The latter implies that datasets several order of magnitude larger can be handled up to limits imposed by network and storage.
6 0.51418895 418 hunch net-2010-12-02-Traffic Prediction Problem
7 0.49098089 326 hunch net-2008-11-11-COLT CFP
8 0.48245624 155 hunch net-2006-02-07-Pittsburgh Mind Reading Competition
9 0.4794983 409 hunch net-2010-09-13-AIStats
10 0.46480134 190 hunch net-2006-07-06-Branch Prediction Competition
11 0.43493637 421 hunch net-2011-01-03-Herman Goldstine 2011
12 0.43300703 342 hunch net-2009-02-16-KDNuggets
13 0.42834663 124 hunch net-2005-10-19-Workshop: Atomic Learning
14 0.42796481 102 hunch net-2005-08-11-Why Manifold-Based Dimension Reduction Techniques?
15 0.39792889 248 hunch net-2007-06-19-How is Compressed Sensing going to change Machine Learning ?
16 0.39317968 423 hunch net-2011-02-02-User preferences for search engines
17 0.3796826 393 hunch net-2010-04-14-MLcomp: a website for objectively comparing ML algorithms
18 0.3779445 312 hunch net-2008-08-04-Electoralmarkets.com
19 0.36838767 443 hunch net-2011-09-03-Fall Machine Learning Events
20 0.35338134 200 hunch net-2006-08-03-AOL’s data drop
topicId topicWeight
[(27, 0.111), (55, 0.757)]
simIndex simValue blogId blogTitle
1 0.99732417 472 hunch net-2012-08-27-NYAS ML 2012 and ICML 2013
Introduction: The New York Machine Learning Symposium is October 19 with a 2 page abstract deadline due September 13 via email with subject “Machine Learning Poster Submission” sent to physicalscience@nyas.org. Everyone is welcome to submit. Last year’s attendance was 246 and I expect more this year. The primary experiment for ICML 2013 is multiple paper submission deadlines with rolling review cycles. The key dates are October 1, December 15, and February 15. This is an attempt to shift ICML further towards a journal style review process and reduce peak load. The “not for proceedings” experiment from this year’s ICML is not continuing. Edit: Fixed second ICML deadline.
2 0.9898718 271 hunch net-2007-11-05-CMU wins DARPA Urban Challenge
Introduction: The results have been posted , with CMU first , Stanford second , and Virginia Tech Third . Considering that this was an open event (at least for people in the US), this was a very strong showing for research at universities (instead of defense contractors, for example). Some details should become public at the NIPS workshops . Slashdot has a post with many comments.
same-blog 3 0.98971343 446 hunch net-2011-10-03-Monday announcements
Introduction: Various people want to use hunch.net to announce things. I’ve generally resisted this because I feared hunch becoming a pure announcement zone while I am much more interested contentful posts and discussion personally. Nevertheless there is clearly some value and announcements are easy, so I’m planning to summarize announcements on Mondays. D. Sculley points out an interesting Semisupervised feature learning competition, with a deadline of October 17. Lihong Li points out the webscope user interaction dataset which is the first high quality exploration dataset I’m aware of that is publicly available. Seth Rogers points out CrossValidated which looks similar in conception to metaoptimize , but directly using the stackoverflow interface and with a bit more of a statistics twist.
4 0.98946208 326 hunch net-2008-11-11-COLT CFP
Introduction: Adam Klivans , points out the COLT call for papers . The important points are: Due Feb 13. Montreal, June 18-21. This year, there is author feedback.
5 0.98946208 465 hunch net-2012-05-12-ICML accepted papers and early registration
Introduction: The accepted papers are up in full detail. We are still struggling with the precise program itself, but that’s coming along. Also note the May 13 deadline for early registration and room booking.
6 0.98171407 302 hunch net-2008-05-25-Inappropriate Mathematics for Machine Learning
7 0.98035336 20 hunch net-2005-02-15-ESPgame and image labeling
8 0.97624063 448 hunch net-2011-10-24-2011 ML symposium and the bears
9 0.94493586 90 hunch net-2005-07-07-The Limits of Learning Theory
10 0.92668962 331 hunch net-2008-12-12-Summer Conferences
11 0.89109462 387 hunch net-2010-01-19-Deadline Season, 2010
12 0.89036071 270 hunch net-2007-11-02-The Machine Learning Award goes to …
13 0.86826086 395 hunch net-2010-04-26-Compassionate Reviewing
14 0.85544324 453 hunch net-2012-01-28-Why COLT?
15 0.82697874 65 hunch net-2005-05-02-Reviewing techniques for conferences
16 0.81481284 356 hunch net-2009-05-24-2009 ICML discussion site
17 0.80881596 457 hunch net-2012-02-29-Key Scientific Challenges and the Franklin Symposium
18 0.79864162 216 hunch net-2006-11-02-2006 NIPS workshops
19 0.78222811 46 hunch net-2005-03-24-The Role of Workshops
20 0.77445704 422 hunch net-2011-01-16-2011 Summer Conference Deadline Season