In this paper, we investigate a new form of automated curriculum learning based on adaptive selection of accuracy requirements, called accuracy-based curriculum learning. Using a reinforcement learning agent based on the Deep Deterministic Policy Gradient algorithm and addressing the Reacher environment, we first show that an agent trained with various accuracy requirements sampled randomly learns more efficiently than when asked to be very accurate at all times. Then we show that adaptive selection of accuracy requirements, based on a local measure of competence progress, automatically generates a curriculum where difficulty progressively increases, resulting in a better learning efficiency than sampling randomly.

While the worst-case complexity of exp-concave stochastic optimization is fairly understood ([22, 28, 18, 15]), a promising avenue is to investigate these complexities under distributional assumptions. One common possibility is the common fast eigendecay assumption ([12, 5, 25, 1]). Namely, in many machine learning problems, the eigenvalues associated with the empirical covariance matrix exhibit a fast decay, where the tail of the eigenvalues are significantly smaller than the desired precision. Naturally, this phenomenon suggests a sketch-and-solve approach, where a sufficiently accurate solution is obtained by projecting the data onto a low-dimensional space and solving the smaller problem. Indeed, many algorithmic ideas in this spirit have been suggested in the recent years ([3, 25]). A more sophisticated approach, which we name sketch-to-precondition, ([2, 8]) is to enhance the performance of first-order optimization methods via preconditioning, where the preconditioner is based on a coarse low-rank approximation to the data matrix. The main message of our paper is as follows: 1 The sample complexity of exp-concave stochastic optimization scales optimally with the effective dimension, rendering the sketch-and-solve approach useless in this context. On the other hand, the sketch-to-precondition approach is effective and can be accelerated via model selection.

The Space Invaders arcade video game, celebrating its 40th anniversary, is a classic piece of software credited as one of the earliest digital shooting games. As a game designer and teacher of games, I know how meaning is carried from designer to the mechanics of play. As a game studies researcher, I also know how games reveal myth, meaning and culture. An analysis of Pac-Man, for instance, shows how that game embodies many values of its day – including consumerism, drug use and gender politics. The message in Space Invaders is as basic as the graphics: when faced with conflict, players have no option except to blast it away.

Manifold learning offers nonlinear dimensionality reduction of high-dimensional datasets. In this paper, we bring geometry processing to bear on manifold learning by introducing a new approach based on metric connection for generating a quasi-isometric, low-dimensional mapping from a sparse and irregular sampling of an arbitrary manifold embedded in a high-dimensional space. Geodesic distances of discrete paths on the input pointset are evaluated through "parallel transport unfolding" (PTU) to offer robustness to poor sampling and arbitrary topology. Our new geometric procedure exhibits the same strong resilience to noise as one of the staples of manifold learning, the Isomap algorithm, as it also exploits all pairwise geodesic distances to compute a low-dimensional embedding. While Isomap is limited to geodesically-convex sampled domains, parallel transport unfolding does not suffer from this crippling limitation, resulting in an improved robustness to irregularity and voids in the sampling. Moreover, it involves only simple linear algebra, significantly improves the accuracy of all pairwise geodesic distance approximations, and has the same computational complexity as Isomap. Finally, we show that our connection-based distance estimation can be used for faster variants of Isomap such as L-Isomap.

We propose a novel online algorithm for training deep feedforward neural networks that employs alternating minimization (block-coordinate descent) between the weights and activation variables. It extends off-line alternating minimization approaches to online, continual learning, and improves over stochastic gradient descent (SGD) with backpropagation in several ways: it avoids the vanishing gradient issue, it allows for non-differentiable nonlinearities, and it permits parallel weight updates across the layers. Unlike SGD, our approach employs co-activation memory inspired by the online sparse coding algorithm of [Mairal et al, 2009]. Furthermore, local iterative optimization with explicit activation updates is a potentially more biologically plausible learning mechanism than backpropagation. We provide theoretical convergence analysis and promising empirical results on several datasets.

To be informative, an evaluation must measure how well systems generalize to realistic unseen data. We identify limitations of and propose improvements to current evaluations of text-to-SQL systems. First, we compare human-generated and automatically generated questions, characterizing properties of queries necessary for real-world applications. To facilitate evaluation on multiple datasets, we release standardized and improved versions of seven existing datasets and one new text-to-SQL dataset. Second, we show that the current division of data into training and test sets measures robustness to variations in the way questions are asked, but only partially tests how well systems generalize to new queries; therefore, we propose a complementary dataset split for evaluation of future work. Finally, we demonstrate how the common practice of anonymizing variables during evaluation removes an important challenge of the task. Our observations highlight key difficulties, and our methodology enables effective measurement of future development.

Training large neural networks requires distributing learning across multiple workers, where the cost of communicating gradients can be a significant bottleneck. signSGD alleviates this problem by transmitting just the sign of each minibatch stochastic gradient. We prove that it can get the best of both worlds: compressed gradients and SGD-level convergence rate. The relative $\ell_1/\ell_2$ geometry of gradients, noise and curvature informs whether signSGD or SGD is theoretically better suited to a particular problem. On the practical side we find that the momentum counterpart of signSGD is able to match the accuracy and convergence speed of Adam on deep Imagenet models. We extend our theory to the distributed setting, where the parameter server uses majority vote to aggregate gradient signs from each worker enabling 1-bit compression of worker-server communication in both directions. Using a theorem by Gauss we prove that majority vote can achieve the same reduction in variance as full precision distributed SGD. Thus, there is great promise for sign-based optimisation schemes to achieve fast communication and fast convergence. Code to reproduce experiments is to be found at https://github.com/jxbz/signSGD.

This article was written by Monica Rogati. Monica is an independent data science executive and advisor. She built key data products and teams at Jawbone and LinkedIn; she now helps companies make the most out of their data. Do a project you care about. Make it good and share it. A quick search yields a plethora of possible resources that could help -- MOOCs, blogs, Quora answers to this exact question, books, Master's programs, bootcamps, self-directed curricula, articles, forums and podcasts.

We are excited to announce Samsung NEXT Q Fund, an early-stage venture fund focused on AI startups. In ML, researchers want to maximize "Q," which is the quality of an action in noisy, partially observable environments. We are interested in startups tackling AI Grand Challenges. Problem spaces we are looking into include learning in simulation, scene understanding, intuitive physics, program learning programs, automl, robot control, human computer interaction, and meta learning, just to name a few. We prefer novel techniques over solutions that "import ai."

Now, some scientists are starting to explore if artificial intelligence (AI) could help find answers.