This page includes forthcoming AAAI sponsored conferences, conferences presented by AAAI Affiliates, and conferences held in cooperation with AAAI. AI Magazine also maintains a calendar listing that includes nonaffiliated conferences at www.aaai.org/Magazine/calendar.php. The Tenth International AAAI Conference 15th International Conference on 18th International Conference on on Web and Social Media Principles of Knowledge Representation Enterprise Information Systems ICWSM-16 will be held May 17-20, and Reasoning (KR 2016) KR ICEIS 2016 will be held April 27-30, 2016 in Cologne, Germany. IEA/AIE-2016 will be York, New York USA. to Washington DC USA. AAAI-17 will be held in January-February in New Orleans, Louisiana USA.

We review the First International Competition on Computational Models of Argumentation (ICMMA’15). The competition evaluated submitted solvers performance on four different computational tasks related to solving abstract argumentation frameworks. Each task evaluated solvers in ways that pushed the edge of existing performance by introducing new challenges. Despite being the first competition in this area, the high number of competitors entered, and differences in results, suggest that the competition will help shape the landscape of ongoing developments in argumentation theory solvers.

The dinner speech at the Fischerhuette was given by Jörg Siekmann (University of Saarbrücken). The poster session, consisting of 18 posters and demos, was jointly organized as a get-together with the Berlin Semantic Web Meetup. At the session, wine, beer, and finger food were provided in the greenhouses of the Computer Science Department at The Thirty-First AAAI Conference on Artificial Intelligence the Freie Universität Berlin. The organizers also used (AAAI-17) and the Twenty-Ninth Conference on Innovative this unique opportunity to hold a joint public Applications of Artificial Intelligence (IAAI-17), will be RuleML and RR business meeting as well as an invited held in New Orleans, Louisiana, USA, during the mid-January dinner with all chairs, and invited keynote speakers to mid-February timeframe. AAAI-17 August 1, a boat sightseeing tour from lake Wannsee will arrive in New Orleans just prior to Mardi Gras and festivities to the Reichstag on Sunday, August 2, the CADE exhibitions will already be underway.

This article proposes a new grand challenge for AI reasearch: to develop AI system to make major scientific discoveries in biomedical sciences that worth Nobel Prize. There are a series of human cognitive limitations that prevents us from making accerlated scientific discoveries, particularity in biomedical sciences. As a result, scientific discoveries are left behind at the level of cottage industry. AI systems can transform scientific discoveries into highly efficient practice, thereby enable us to expand our knowledge in unprecedented way. Such system may out-compute all possible hypotheses and may redefine the nature of scientific intuition, hence scientific discovery process.

Inverse Reinforcement Learning (IRL) describes the problem of learning an unknown reward function of a Markov Decision Process (MDP) from observed behavior of an agent. Since the agent's behavior originates in its policy and MDP policies depend on both the stochastic system dynamics as well as the reward function, the solution of the inverse problem is significantly influenced by both. Current IRL approaches assume that if the transition model is unknown, additional samples from the system's dynamics are accessible, or the observed behavior provides enough samples of the system's dynamics to solve the inverse problem accurately. These assumptions are often not satisfied. To overcome this, we present a gradient-based IRL approach that simultaneously estimates the system's dynamics. By solving the combined optimization problem, our approach takes into account the bias of the demonstrations, which stems from the generating policy. The evaluation on a synthetic MDP and a transfer learning task shows improvements regarding the sample efficiency as well as the accuracy of the estimated reward functions and transition models.

A BSTRACT Existing approaches to combine both additive and multiplicative neural units either use a fixed assignment of operations or require discrete optimization to determine what function a neuron should perform. However, this leads to an extensive increase in the computational complexity of the training procedure. We present a novel, parameterizable transfer function based on the mathematical concept of non-integer functional iteration that allows the operation each neuron performs to be smoothly and, most importantly, differentiablely adjusted between addition and multiplication. This allows the decision between addition and multiplication to be integrated into the standard backpropagation training procedure. The value of such a product unit is given byy i σ ( j x W ij j).

In order to push the performance on realistic computer vision tasks, the number of classes in modern benchmark datasets has significantly increased in recent years. This increase in the number of classes comes along with increased ambiguity between the class labels, raising the question if top-1 error is the right performance measure. In this paper, we provide an extensive comparison and evaluation of established multiclass methods comparing their top-k performance both from a practical as well as from a theoretical perspective. Moreover, we introduce novel top-k loss functions as modifications of the softmax and the multiclass SVM losses and provide efficient optimization schemes for them. In the experiments, we compare on various datasets all of the proposed and established methods for top-k error optimization. An interesting insight of this paper is that the softmax loss yields competitive top-k performance for all k simultaneously. For a specific top-k error, our new top-k losses lead typically to further improvements while being faster to train than the softmax.

Noname manuscript No. (will be inserted by the editor) Abstract Hierarchical models are versatile tools for joint modeling of data sets arising from different, but related, sources. Fully Bayesian inference may, however, become computationally prohibitive if the sourcespecific data models are complex, or if the number of sources is very large. To facilitate computation, we propose an approach, where inference is first made independently for the parameters of each data set, whereupon the obtained posterior samples are used as observed data in a substitute hierarchical model, based on a scaled likelihood function. Compared to direct inference in a full hierarchical model, the approach has the advantage of being able to speed up convergenceby breaking down the initial large inference problem into smaller individual subproblems with better convergence properties. Moreover it enables parallel processing of the possibly complex inferences of the source-specific parameters, which may otherwise create a computational bottleneck if processed jointly as part of a hierarchical model.

In this blog post, we will use Hivemall, the open source Machine Learning-on-SQL library available in the Treasure Data environment, to introduce the basics of machine learning. We will use an E-Commerce dataset from Kaggle, the data science competition platform. The first challenge is predicting the retail sales for the Rossman stores (the full details at Kaggle). We will use an ensemble learning technique known as Random Forest regression. Rossman is a pharmacy chain with over 3,000 stores in seven countries within Europe.

Sensitive details held by police and prosecutors in England are being lost because evidence is still being shared on computer discs, watchdogs say. Police and prosecution watchdogs looked at criminal justice computer systems and found the testimonies of underage and vulnerable victims and witnesses had been kept on portable discs. In one case a DVD interview of a 12-year-old sex offence victim was lost. The CPS said it and the police were reviewing their handling of such data. The joint report from HM Crown Prosecution Service Inspectorate and HM Inspectorate of Constabulary said there was a "widespread issue" involving the Crown Prosecution Service (CPS) "misplacing discs containing sensitive evidence and information".