We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near Neighbor Search algorithm with the asymptotically optimal running time exponent. Unlike earlier algorithms with this property (e.g., Spherical LSH (Andoni-Indyk-Nguyen-Razenshteyn 2014) (Andoni-Razenshteyn 2015)), our algorithm is also practical, improving upon the well-studied hyperplane LSH (Charikar 2002) in practice. We also introduce a multiprobe version of this algorithm and conduct an experimental evaluation on real and synthetic data sets.We complement the above positive results with a fine-grained lower bound for the quality of any LSH family for angular distance. Our lower bound implies that the above LSH family exhibits a trade-off between evaluation time and quality that is close to optimal for a natural class of LSH functions.

High dimensional regression benefits from sparsity promoting regularizations. Screening rules leverage the known sparsity of the solution by ignoring some variables in the optimization, hence speeding up solvers. When the procedure is proven not to discard features wrongly the rules are said to be safe. In this paper we derive new safe rules for generalized linear models regularized with L1 and L1/L2 norms. The rules are based on duality gap computations and spherical safe regions whose diameters converge to zero. This allows to discard safely more variables, in particular for low regularization parameters. The GAP Safe rule can cope with any iterative solver and we illustrate its performance on coordinate descent for multi-task Lasso, binary and multinomial logistic regression, demonstrating significant speed ups on all tested datasets with respect to previous safe rules.

Despite the recent achievements in machine learning, we are still very far from achieving real artificial intelligence. In this paper, we discuss the limitations of standard deep learning approaches and show that some of these limitations can be overcome by learning how to grow the complexity of a model in a structured way. Specifically, we study the simplest sequence prediction problems that are beyond the scope of what is learnable with standard recurrent networks, algorithmically generated sequences which can only be learned by models which have the capacity to count and to memorize sequences. We show that some basic algorithms can be learned from sequential data using a recurrent network associated with a trainable memory.

This paper develops a general approach, rooted in statistical learning theory, to learning an approximately revenue-maximizing auction from data. We introduce t-level auctions to interpolate between simple auctions, such as welfare maximization with reserve prices, and optimal auctions, thereby balancing the competing demands of expressivity and simplicity. We prove that such auctions have small representation error, in the sense that for every product distribution F over bidders’ valuations, there exists a t-level auction with small t and expected revenue close to optimal. We show that the set of t-level auctions has modest pseudo-dimension (for polynomial t) and therefore leads to small learning error. One consequence of our results is that, in arbitrary single-parameter settings, one can learn a mechanism with expected revenue arbitrarily close to optimal from a polynomial number of samples.

Humans demonstrate remarkable abilities to predict physical events in dynamic scenes, and to infer the physical properties of objects from static images. We propose a generative model for solving these problems of physical scene understanding from real-world videos and images. At the core of our generative model is a 3D physics engine, operating on an object-based representation of physical properties, including mass, position, 3D shape, and friction. We can infer these latent properties using relatively brief runs of MCMC, which drive simulations in the physics engine to fit key features of visual observations. We further explore directly mapping visual inputs to physical properties, inverting a part of the generative process using deep learning. We name our model Galileo, and evaluate it on a video dataset with simple yet physically rich scenarios. Results show that Galileo is able to infer the physical properties of objects and predict the outcome of a variety of physical events, with an accuracy comparable to human subjects. Our study points towards an account of human vision with generative physical knowledge at its core, and various recognition models as helpers leading to efficient inference.

Lunch with a Fellow, and the Volunteer high standard, and of special interest AAAI-16 Registration is now available Program, in addition to the Student to the AAAI community.

The Automated Negotiating Agents Competition is an international event that, since 2010, has contributed to the evaluation and development of new techniques and benchmarks for improving the state-of-the-art in automated multi-issue negotiation. A key objective of the competition has been to analyze and search the design space of negotiating agents for agents that are able to operate effectively across a variety of domains. The competition is a valuable tool for studying important aspects of negotiation including profiles and domains, opponent learning, strategies, bilateral and multilateral protocols. Two of the challenges that remain are: How to develop argumentation-based negotiation agents that next to bids, can inform and argue to obtain an acceptable agreement for both parties, and how to create agents that can negotiate in a human fashion.

Recent advances in cognitive computing componentry combined with other factors are leading to commercially viable cognitive systems. From chips to smart phones to public and private clouds, industrial strength “cognition as a service” is beginning to appear at all scales in business and society. Furthermore, in the age of zettabytes on the way to yottabytes, the designers, engineers, and managers of future smart systems will depend on cognition as a service. Cognition as a service can help unlock the mysteries of big data and ultimately boost the creativity and productivity of professionals and their teams, the productive output of industries and organizations, as well as the GDP (gross domestic product) of regions and nations. In this and the next decade, cognition as a service will allow us to re-image work practices, augmenting and scaling expertise to transform professions, industries, and regions.

This article is aimed at helping AI researchers and practitioners imagine roles intelligent technologies might play in the many different and varied ecosystems in which people learn. My observations are based on learning sciences research of the past several decades, the possibilities of new technologies of the past few years, and my experience as program officer for the National Science Foundation’s Cyberlearning and Future Learning Technologies program. My thesis is that new technologies have potential to transform possibilities for fostering learning in both formal and informal learning environments by making it possible and manageable for learners to engage in the kinds of project work that professionals engage in and learn important content, skills, practices, habits, and dispositions from those experiences. The expertise of AI researchers and practitioners is critical to that vision, but it will require teaming up with others — for example, technology imagineers, educators, and learning scientists.

Active problem solving has been shown to be one of the most effective ways to acquire complex skills. Whether one is learning a programming language by implementing a computer program, or learning calculus by solving problems, context sensitive feedback and guidance are crucial to keeping problem solving efforts fruitful and efficient. This article reviews AI-based algorithms that can diagnose student difficulties during active problem solving and serve as the basis for providing context-sensitive and individualized guidance. The article also describes the crucial role sensor based estimates of cognitive resources such as working memory capacity and attention can play in enhancing the diagnostic capabilities of intelligent instructional systems.