hunch_net hunch_net-2005 hunch_net-2005-88 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: COLT had an impromptu session which seemed as interesting or more interesting than any other single technical session (despite being only an hour long). There are several roles that an impromptu session can play including: Announcing new work since the paper deadline. Letting this happen now rather than later helps aid the process of research. Discussing a paper that was rejected. Reviewers err sometimes and an impromptu session provides a means to remedy that. Entertainment. We all like to have a bit of fun. For design, the following seem important: Impromptu speakers should not have much time. At COLT, it was 8 minutes, but I have seen even 5 work well. The entire impromptu session should not last too long because the format is dense and promotes restlessness. A half hour or hour can work well. Impromptu talks are a mechanism to let a little bit of chaos into the schedule. They will be chaotic in content, presentation, and usefulness. The fundamental adv
sentIndex sentText sentNum sentScore
1 COLT had an impromptu session which seemed as interesting or more interesting than any other single technical session (despite being only an hour long). [sent-1, score-2.039]
2 There are several roles that an impromptu session can play including: Announcing new work since the paper deadline. [sent-2, score-1.344]
3 Letting this happen now rather than later helps aid the process of research. [sent-3, score-0.263]
4 Reviewers err sometimes and an impromptu session provides a means to remedy that. [sent-5, score-1.411]
5 For design, the following seem important: Impromptu speakers should not have much time. [sent-8, score-0.076]
6 At COLT, it was 8 minutes, but I have seen even 5 work well. [sent-9, score-0.122]
7 The entire impromptu session should not last too long because the format is dense and promotes restlessness. [sent-10, score-1.467]
8 Impromptu talks are a mechanism to let a little bit of chaos into the schedule. [sent-12, score-0.492]
9 The fundamental advantage of this chaos is that it provides a means for covering material that the planned program did not (or could not). [sent-14, score-0.718]
10 One caveat is that it is unclear how well this mechanism can scale to large conferences. [sent-17, score-0.301]
wordName wordTfidf (topN-words)
[('impromptu', 0.637), ('session', 0.396), ('hour', 0.287), ('chaos', 0.212), ('dense', 0.115), ('announcing', 0.106), ('planned', 0.106), ('roles', 0.106), ('remedy', 0.1), ('promotes', 0.1), ('provides', 0.099), ('mechanism', 0.097), ('letting', 0.096), ('err', 0.096), ('colt', 0.095), ('minutes', 0.092), ('caveat', 0.086), ('material', 0.086), ('means', 0.083), ('long', 0.081), ('half', 0.079), ('discussing', 0.077), ('play', 0.077), ('speakers', 0.076), ('aid', 0.074), ('covering', 0.074), ('work', 0.073), ('technical', 0.07), ('despite', 0.07), ('bit', 0.069), ('entire', 0.069), ('seemed', 0.069), ('format', 0.069), ('later', 0.068), ('interesting', 0.067), ('unclear', 0.066), ('content', 0.065), ('presentation', 0.063), ('helps', 0.062), ('considering', 0.062), ('talks', 0.061), ('happen', 0.059), ('advantage', 0.058), ('paper', 0.055), ('short', 0.055), ('reviewers', 0.053), ('let', 0.053), ('scale', 0.052), ('single', 0.05), ('seen', 0.049)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 88 hunch net-2005-07-01-The Role of Impromptu Talks
Introduction: COLT had an impromptu session which seemed as interesting or more interesting than any other single technical session (despite being only an hour long). There are several roles that an impromptu session can play including: Announcing new work since the paper deadline. Letting this happen now rather than later helps aid the process of research. Discussing a paper that was rejected. Reviewers err sometimes and an impromptu session provides a means to remedy that. Entertainment. We all like to have a bit of fun. For design, the following seem important: Impromptu speakers should not have much time. At COLT, it was 8 minutes, but I have seen even 5 work well. The entire impromptu session should not last too long because the format is dense and promotes restlessness. A half hour or hour can work well. Impromptu talks are a mechanism to let a little bit of chaos into the schedule. They will be chaotic in content, presentation, and usefulness. The fundamental adv
2 0.16473193 437 hunch net-2011-07-10-ICML 2011 and the future
Introduction: Unfortunately, I ended up sick for much of this ICML. I did manage to catch one interesting paper: Richard Socher , Cliff Lin , Andrew Y. Ng , and Christopher D. Manning Parsing Natural Scenes and Natural Language with Recursive Neural Networks . I invited Richard to share his list of interesting papers, so hopefully we’ll hear from him soon. In the meantime, Paul and Hal have posted some lists. the future Joelle and I are program chairs for ICML 2012 in Edinburgh , which I previously enjoyed visiting in 2005 . This is a huge responsibility, that we hope to accomplish well. A part of this (perhaps the most fun part), is imagining how we can make ICML better. A key and critical constraint is choosing things that can be accomplished. So far we have: Colocation . The first thing we looked into was potential colocations. We quickly discovered that many other conferences precomitted their location. For the future, getting a colocation with ACL or SIGI
3 0.150489 439 hunch net-2011-08-01-Interesting papers at COLT 2011
Introduction: Since John did not attend COLT this year, I have been volunteered to report back on the hot stuff at this year’s meeting. The conference seemed to have pretty high quality stuff this year, and I found plenty of interesting papers on all the three days. I’m gonna pick some of my favorites going through the program in a chronological order. The first session on matrices seemed interesting for two reasons. First, the papers were quite nice. But more interestingly, this is a topic that has had a lot of presence in Statistics and Compressed sensing literature recently. So it was good to see high-dimensional matrices finally make their entry at COLT. The paper of Ohad and Shai on Collaborative Filtering with the Trace Norm: Learning, Bounding, and Transducing provides non-trivial guarantees on trace norm regularization in an agnostic setup, while Rina and Nati show how Rademacher averages can be used to get sharper results for matrix completion problems in their paper Concentr
4 0.11649922 141 hunch net-2005-12-17-Workshops as Franchise Conferences
Introduction: Founding a successful new conference is extraordinarily difficult. As a conference founder, you must manage to attract a significant number of good papers—enough to entice the participants into participating next year and to (generally) to grow the conference. For someone choosing to participate in a new conference, there is a very significant decision to make: do you send a paper to some new conference with no guarantee that the conference will work out? Or do you send it to another (possibly less related) conference that you are sure will work? The conference founding problem is a joint agreement problem with a very significant barrier. Workshops are a way around this problem, and workshops attached to conferences are a particularly effective means for this. A workshop at a conference is sure to have people available to speak and attend and is sure to have a large audience available. Presenting work at a workshop is not generally exclusive: it can also be presented at a confe
5 0.10806571 481 hunch net-2013-04-15-NEML II
Introduction: Adam Kalai points out the New England Machine Learning Day May 1 at MSR New England. There is a poster session with abstracts due April 19. I understand last year’s NEML went well and it’s great to meet your neighbors at regional workshops like this.
6 0.10255929 453 hunch net-2012-01-28-Why COLT?
7 0.098050848 75 hunch net-2005-05-28-Running A Machine Learning Summer School
8 0.081720009 458 hunch net-2012-03-06-COLT-ICML Open Questions and ICML Instructions
9 0.080930188 474 hunch net-2012-10-18-7th Annual Machine Learning Symposium
10 0.070730895 80 hunch net-2005-06-10-Workshops are not Conferences
11 0.070401981 307 hunch net-2008-07-04-More Presentation Preparation
12 0.069300428 116 hunch net-2005-09-30-Research in conferences
13 0.069104388 89 hunch net-2005-07-04-The Health of COLT
14 0.067582905 91 hunch net-2005-07-10-Thinking the Unthought
15 0.063046403 304 hunch net-2008-06-27-Reviewing Horror Stories
16 0.062999599 454 hunch net-2012-01-30-ICML Posters and Scope
17 0.061890543 452 hunch net-2012-01-04-Why ICML? and the summer conferences
18 0.061230313 203 hunch net-2006-08-18-Report of MLSS 2006 Taipei
19 0.057362705 86 hunch net-2005-06-28-The cross validation problem: cash reward
20 0.057276674 484 hunch net-2013-06-16-Representative Reviewing
topicId topicWeight
[(0, 0.121), (1, -0.082), (2, 0.021), (3, 0.004), (4, -0.002), (5, 0.044), (6, 0.008), (7, 0.004), (8, -0.042), (9, -0.026), (10, 0.035), (11, 0.011), (12, -0.023), (13, 0.024), (14, 0.076), (15, -0.064), (16, 0.109), (17, 0.06), (18, -0.0), (19, 0.047), (20, -0.013), (21, 0.003), (22, 0.066), (23, 0.031), (24, 0.038), (25, 0.074), (26, 0.003), (27, 0.074), (28, 0.008), (29, -0.024), (30, -0.046), (31, -0.023), (32, -0.024), (33, -0.0), (34, 0.027), (35, -0.006), (36, -0.039), (37, -0.018), (38, 0.009), (39, -0.003), (40, 0.064), (41, 0.036), (42, -0.003), (43, -0.055), (44, 0.026), (45, 0.038), (46, -0.025), (47, -0.019), (48, 0.006), (49, 0.061)]
simIndex simValue blogId blogTitle
same-blog 1 0.96605402 88 hunch net-2005-07-01-The Role of Impromptu Talks
Introduction: COLT had an impromptu session which seemed as interesting or more interesting than any other single technical session (despite being only an hour long). There are several roles that an impromptu session can play including: Announcing new work since the paper deadline. Letting this happen now rather than later helps aid the process of research. Discussing a paper that was rejected. Reviewers err sometimes and an impromptu session provides a means to remedy that. Entertainment. We all like to have a bit of fun. For design, the following seem important: Impromptu speakers should not have much time. At COLT, it was 8 minutes, but I have seen even 5 work well. The entire impromptu session should not last too long because the format is dense and promotes restlessness. A half hour or hour can work well. Impromptu talks are a mechanism to let a little bit of chaos into the schedule. They will be chaotic in content, presentation, and usefulness. The fundamental adv
2 0.63994366 453 hunch net-2012-01-28-Why COLT?
Introduction: By Shie and Nati Following John’s advertisement for submitting to ICML, we thought it appropriate to highlight the advantages of COLT, and the reasons it is often the best place for theory papers. We would like to emphasize that we both respect ICML, and are active in ICML, both as authors and as area chairs, and certainly are not arguing that ICML is a bad place for your papers. For many papers, ICML is the best venue. But for many theory papers, COLT is a better and more appropriate place. Why should you submit to COLT? By-and-large, theory papers go to COLT. This is the tradition of the field and most theory papers are sent to COLT. This is the place to present your ground-breaking theorems and new models that will shape the theory of machine learning. COLT is more focused then ICML with a single track session. Unlike ICML, the norm in COLT is for people to sit through most sessions, and hear most of the talks presented. There is also often a lively discussion followi
3 0.62580025 394 hunch net-2010-04-24-COLT Treasurer is now Phil Long
Introduction: For about 5 years, I’ve been the treasurer of the Association for Computational Learning, otherwise known as COLT, taking over from John Case before me. A transfer of duties to Phil Long is now about complete. This probably matters to almost no one, but I wanted to describe things a bit for those interested. The immediate impetus for this decision was unhappiness over reviewing decisions at COLT 2009 , one as an author and several as a member of the program committee. I seem to have disagreements fairly often about what is important work, partly because I’m focused on learning theory with practical implications, partly because I define learning theory more broadly than is typical amongst COLT members, and partly because COLT suffers a bit from insider-clique issues. The degree to which these issues come up varies substantially each year so last year is not predictive of this one. And, it’s important to understand that COLT remains healthy with these issues not nearly so bad
4 0.58604056 324 hunch net-2008-11-09-A Healthy COLT
Introduction: A while ago , we discussed the health of COLT . COLT 2008 substantially addressed my concerns. The papers were diverse and several were interesting. Attendance was up, which is particularly notable in Europe. In my opinion, the colocation with UAI and ICML was the best colocation since 1998. And, perhaps best of all, registration ended up being free for all students due to various grants from the Academy of Finland , Google , IBM , and Yahoo . A basic question is: what went right? There seem to be several answers. Cost-wise, COLT had sufficient grants to alleviate the high cost of the Euro and location at a university substantially reduces the cost compared to a hotel. Organization-wise, the Finns were great with hordes of volunteers helping set everything up. Having too many volunteers is a good failure mode. Organization-wise, it was clear that all 3 program chairs were cooperating in designing the program. Facilities-wise, proximity in time and space made
5 0.57212883 437 hunch net-2011-07-10-ICML 2011 and the future
Introduction: Unfortunately, I ended up sick for much of this ICML. I did manage to catch one interesting paper: Richard Socher , Cliff Lin , Andrew Y. Ng , and Christopher D. Manning Parsing Natural Scenes and Natural Language with Recursive Neural Networks . I invited Richard to share his list of interesting papers, so hopefully we’ll hear from him soon. In the meantime, Paul and Hal have posted some lists. the future Joelle and I are program chairs for ICML 2012 in Edinburgh , which I previously enjoyed visiting in 2005 . This is a huge responsibility, that we hope to accomplish well. A part of this (perhaps the most fun part), is imagining how we can make ICML better. A key and critical constraint is choosing things that can be accomplished. So far we have: Colocation . The first thing we looked into was potential colocations. We quickly discovered that many other conferences precomitted their location. For the future, getting a colocation with ACL or SIGI
6 0.5552516 89 hunch net-2005-07-04-The Health of COLT
7 0.5446654 86 hunch net-2005-06-28-The cross validation problem: cash reward
8 0.52232832 221 hunch net-2006-12-04-Structural Problems in NIPS Decision Making
9 0.52095932 318 hunch net-2008-09-26-The SODA Program Committee
10 0.50996888 429 hunch net-2011-04-06-COLT open questions
11 0.49524364 307 hunch net-2008-07-04-More Presentation Preparation
12 0.48652074 141 hunch net-2005-12-17-Workshops as Franchise Conferences
13 0.48070925 47 hunch net-2005-03-28-Open Problems for Colt
14 0.47731712 458 hunch net-2012-03-06-COLT-ICML Open Questions and ICML Instructions
15 0.47678325 439 hunch net-2011-08-01-Interesting papers at COLT 2011
16 0.47289193 249 hunch net-2007-06-21-Presentation Preparation
17 0.46882436 80 hunch net-2005-06-10-Workshops are not Conferences
18 0.46677187 147 hunch net-2006-01-08-Debugging Your Brain
19 0.46499678 203 hunch net-2006-08-18-Report of MLSS 2006 Taipei
20 0.4596163 322 hunch net-2008-10-20-New York’s ML Day
topicId topicWeight
[(4, 0.411), (10, 0.024), (27, 0.125), (53, 0.037), (55, 0.146), (94, 0.067), (95, 0.044), (96, 0.013)]
simIndex simValue blogId blogTitle
1 0.91560245 108 hunch net-2005-09-06-A link
Introduction: I read through some of the essays of Michael Nielsen today, and recommend them. Principles of Effective Research and Extreme Thinking are both relevant to several discussions here.
2 0.90113097 86 hunch net-2005-06-28-The cross validation problem: cash reward
Introduction: I just presented the cross validation problem at COLT . The problem now has a cash prize (up to $500) associated with it—see the presentation for details. The write-up for colt .
same-blog 3 0.89179933 88 hunch net-2005-07-01-The Role of Impromptu Talks
Introduction: COLT had an impromptu session which seemed as interesting or more interesting than any other single technical session (despite being only an hour long). There are several roles that an impromptu session can play including: Announcing new work since the paper deadline. Letting this happen now rather than later helps aid the process of research. Discussing a paper that was rejected. Reviewers err sometimes and an impromptu session provides a means to remedy that. Entertainment. We all like to have a bit of fun. For design, the following seem important: Impromptu speakers should not have much time. At COLT, it was 8 minutes, but I have seen even 5 work well. The entire impromptu session should not last too long because the format is dense and promotes restlessness. A half hour or hour can work well. Impromptu talks are a mechanism to let a little bit of chaos into the schedule. They will be chaotic in content, presentation, and usefulness. The fundamental adv
4 0.82648796 29 hunch net-2005-02-25-Solution: Reinforcement Learning with Classification
Introduction: I realized that the tools needed to solve the problem just posted were just created. I tried to sketch out the solution here (also in .lyx and .tex ). It is still quite sketchy (and probably only the few people who understand reductions well can follow). One of the reasons why I started this weblog was to experiment with “research in the open”, and this is an opportunity to do so. Over the next few days, I’ll be filling in details and trying to get things to make sense. If you have additions or ideas, please propose them.
5 0.79301375 10 hunch net-2005-02-02-Kolmogorov Complexity and Googling
Introduction: Machine learning makes the New Scientist . From the article: COMPUTERS can learn the meaning of words simply by plugging into Google. The finding could bring forward the day that true artificial intelligence is developed‌. But Paul Vitanyi and Rudi Cilibrasi of the National Institute for Mathematics and Computer Science in Amsterdam, the Netherlands, realised that a Google search can be used to measure how closely two words relate to each other. For instance, imagine a computer needs to understand what a hat is. You can read the paper at KC Google . Hat tip: Kolmogorov Mailing List Any thoughts on the paper?
6 0.66456711 75 hunch net-2005-05-28-Running A Machine Learning Summer School
7 0.62942803 129 hunch net-2005-11-07-Prediction Competitions
8 0.4512862 141 hunch net-2005-12-17-Workshops as Franchise Conferences
9 0.45081124 204 hunch net-2006-08-28-Learning Theory standards for NIPS 2006
10 0.44732842 40 hunch net-2005-03-13-Avoiding Bad Reviewing
11 0.44554216 458 hunch net-2012-03-06-COLT-ICML Open Questions and ICML Instructions
12 0.4442929 452 hunch net-2012-01-04-Why ICML? and the summer conferences
13 0.44365147 453 hunch net-2012-01-28-Why COLT?
14 0.44242138 395 hunch net-2010-04-26-Compassionate Reviewing
15 0.44165757 51 hunch net-2005-04-01-The Producer-Consumer Model of Research
16 0.43805385 454 hunch net-2012-01-30-ICML Posters and Scope
17 0.43603364 270 hunch net-2007-11-02-The Machine Learning Award goes to …
18 0.43499914 116 hunch net-2005-09-30-Research in conferences
19 0.43432862 437 hunch net-2011-07-10-ICML 2011 and the future
20 0.42664668 464 hunch net-2012-05-03-Microsoft Research, New York City