Of course, I have no idea what I am talking about. I am a first-year undergraduate, I have never been to any other conference, and when a fellow student from Germany asked me “What, then, are you doing here?”, I didn’t really mind. The AAAI conference is one of the most popular international AI conferences, certainly the most popular one in North America. This year it took place in Vancouver, Canada. What follows is a list of the tutorials, talks and technical sessions I attended, each with a one-line summary of what I learned.

Tutorials I attended

• General Game Playing is the task to write programs that learn to play arbitrary games solely by being given the rules of a game. Allow games with an infinite number of states and this is as close as you can get to working on AGI without being considered weird by the traditional AI community.
• Autonomous Bidding Agents: If you want people to bid their true values in an auction, use a sealed-bid second-price auction (similar to eBay’s system). The Trading Agent Competition is a useful testbed if you like game theory and view AI as a tool for automated trading and scheduling.
• Constraint-Based Local Search in Comet: If you want to solve constraint satisfaction problems (e.g. a Sudoku), don’t want to spend much time programming and like nice visualizations, use Comet.
• Practical Statisticial Relational AI: We may finally be able to unify logical inference, inductive logic programming, probabilistic inference, and statistical learning using Markov logic networks. Alchemy is supposed to fulfill Prolog’s promises (and it looks like it could).

Talks I heard

• Agents, Bodies, Constraints, Dynamics and Evolution: Robot soccer is a great challenge. We can’t completely avoid ethical choices (but please, don’t think ahead too far, let’s start with Asimov). Robot architectures need to provide an easy way to model constraints on the agent’s actions.
• Graph Identification and Alignment: Nice algorithms for entity resolution, link prediction, and collective classification exist that make it possible to extract useful information from noisy input data, e.g. social relations from a bunch of e-mails.
• AI in a Moore’s Law World: The Stories of Farecast and KnowItAll: The story of Farecast: You can make lots of money using data mining. The story of KnowItAll: It would be awesome if web search engines understood web pages and answered questions instead of just doing keyword searches, but we’re really not there yet and we need much more computing power for more sophisticated approaches.
• Representing and Reasoning about Preferences: You can force people to vote truthfully instead of opportunistically by making manipulation a NP-hard problem.
• Big “A”, Small “I”: Smart Ends from Simple Means: If you are designing a game, don’t compute things the player never gets to see, think about whether sophisticated planning really is better than just-the-next-step computation and remember that Matt Brown likes to do things in a very non-rocket-science kind of way.

Technical sessions

• Deriving a Large-Scale Taxonomy from Wikipedia: Wikipedia’s categories make for a useful network of concepts and, with a little effort, are just as good as the current largest taxonomies, WordNet and ResearchCyc.
• A New Algorithm for Generating Equilibria in Massive Zero-Sum Games: The range of skill in a game, i.e. how many different skill levels exist, is a reasonable measure of the complexity of a game. There is an iterative algorithm for computing approximate equilibrium strategies by fixing the opponent’s set of strategies but I don’t remember how it works.
• Reasoning Patterns of Agents: We can think of five basic reasoning patterns agents use in games — direct effect, influence for no reason, manipulation, signaling and revealing/denying — and these can be used to talk about actions in a more fine-grained way than just saying that an agent maximizes expected utility.
• On the prospects of building a Working Model of the Visual Cortex: More computing power is good and Jeff Hawkins approach may not be totally off, but we don’t want to mention his name.
• Modeling Crowd Behavior using Social Comparison Theory: People act similar to those who are like themselves but not too much like themselves. Simulate this and what you get is fairly convincing crowd behavior.
• Retaliate: Learning Winning Policies in First-Person Shooter Games: Really simple reinforcement learning produces good team strategies for Unreal Tournament’s domination mode.
• Analyzing Reading Behavior by Blog Mining: People who write comments on your blog tend to be regular readers. People who visit your blog are likely to visit similar blogs, too. If you don’t believe this, remember that we can still mention preferential attachment in our paper and thus have a few formulae that make the obvious much more convincing.

(Not quite) random remarks

• Man vs. Machine Poker Tournament: Poker players are lots of fun. This is the last year the human players won, but it is still not clear whether the bot that wins next year will be a boring equilibrium player or a learning bot that exploits its opponent’s weaknesses.
• The outside view of “traditional” AI research is right. I got the impression that most people are happy working on smallish problems. Let’s improve an existing optimization algorithm here and think about a new heuristic there, but don’t even mention general intelligence. That’s science fiction.
• And wrong. Whatever you do, be it natural language processing or robotics, the signs are there that quick hacks won’t get you anywhere near intelligent behavior, that the combination of faster hardware and new neuroscience provides an upper bound for the advent of silicon intelligence and that there are ethical and societal issues that need to be taken care of.
• Times change. On the way back from the conference, an uncle of mine who lives in Vancouver told me about his youth. Most of the time progress feels slow and boring. When you just return from a place where 200 people think about how to make the international network of computers reply to questions in an intelligent way and someone tells you about how he started out as a kind of millwright 50 years ago, that’s not the case.