Education
Deep learning nlp python github
This course is not part of my deep learning series, so it doesn't contain any hard math - just straight up coding in Python. This course is not part of my deep learning series, so there are no mathematical prerequisites - just straight up coding in Python. You'll start by preparing your environment for NLP and then quickly learn about language structure and how we can break sentences down to extract information and uncover the underlying meaning.
PDE-Inspired Algorithms for Semi-Supervised Learning on Point Clouds
Crook, Oliver M., Hurst, Tim, Schönlieb, Carola-Bibiane, Thorpe, Matthew, Zygalakis, Konstantinos C.
Given a data set and a subset of labels the problem of semi-supervised learning on point clouds is to extend the labels to the entire data set. In this paper we extend the labels by minimising the constrained discrete $p$-Dirichlet energy. Under suitable conditions the discrete problem can be connected, in the large data limit, with the minimiser of a weighted continuum $p$-Dirichlet energy with the same constraints. We take advantage of this connection by designing numerical schemes that first estimate the density of the data and then apply PDE methods, such as pseudo-spectral methods, to solve the corresponding Euler-Lagrange equation. We prove that our scheme is consistent in the large data limit for two methods of density estimation: kernel density estimation and spline kernel density estimation.
sZoom: A Framework for Automatic Zoom into High Resolution Surveillance Videos
Saini, Mukesh, Guthier, Benjamin, Kuang, Hao, Mahapatra, Dwarikanath, Saddik, Abdulmotaleb El
Current cameras are capable of recording high resolution video. While viewing on a mobile device, a user can manually zoom into this high resolution video to get more detailed view of objects and activities. However, manual zooming is not suitable for surveillance and monitoring. It is tiring to continuously keep zooming into various regions of the video. Also, while viewing one region, the operator may miss activities in other regions. In this paper, we propose sZoom, a framework to automatically zoom into a high resolution surveillance video. The proposed framework selectively zooms into the sensitive regions of the video to present details of the scene, while still preserving the overall context required for situation assessment. A multi-variate Gaussian penalty is introduced to ensure full coverage of the scene. The method achieves near real-time performance through a number of timing optimizations. An extensive user study shows that, while watching a full HD video on a mobile device, the system enhances the security operator's efficiency in understanding the details of the scene by 99% on the average compared to a scaled version of the original high resolution video. The produced video achieved 46% higher ratings for usefulness in a surveillance task.
Necessary and Sufficient Conditions for Adaptive, Mirror, and Standard Gradient Methods
We study the impact of the constraint set and gradient geometry on the convergence of online and stochastic methods for convex optimization, providing a characterization of the geometries for which stochastic gradient and adaptive gradient methods are (minimax) optimal. In particular, we show that when the constraint set is quadratically convex, diagonally pre-conditioned stochastic gradient methods are minimax optimal. We further provide a converse that shows that when the constraints are not quadratically convex---for example, any $\ell_p$-ball for $p < 2$---the methods are far from optimal. Based on this, we can provide concrete recommendations for when one should use adaptive, mirror or stochastic gradient methods.
Decentralized Markov Chain Gradient Descent
Sun, Tao, Chen, Tianyi, Sun, Yuejiao, Liao, Qing, Li, Dongsheng
Decentralized stochastic gradient method emerges as a promising solution for solving large-scale machine learning problems. This paper studies the decentralized Markov chain gradient descent (DMGD) algorithm - a variant of the decentralized stochastic gradient methods where the random samples are taken along the trajectory of a Markov chain. This setting is well-motivated when obtaining independent samples is costly or impossible, which excludes the use of the traditional stochastic gradient algorithms. Specifically, we consider the first- and zeroth-order versions of decentralized Markov chain gradient descent over a connected network, where each node only communicates with its neighbors about intermediate results. The nonergodic convergence and the ergodic convergence rate of the proposed algorithms have been rigorously established, and their critical dependences on the network topology and the mixing time of Markov chain have been highlighted. The numerical tests further validate the sample efficiency of our algorithm.
Acceptable Planning: Influencing Individual Behavior to Reduce Transportation Energy Expenditure of a City
Mohan, Shiwali, Rakha, Hesham, Klenk, Matthew
Palo Alto Research Center, Mail Stop: 3333 Coyote Hill Road, Palo Alto, CA 94034 USA Abstract Our research aims at developing intelligent systems to reduce the transportation-related energy expenditure of a large city by influencing individual behavior. We introduce Copter - an intelligent travel assistant that evaluates multi-modal travel alternatives to find a plan that is acceptable to a person given their context and preferences. We propose a formulation for acceptable planning that brings together ideas from AI, machine learning, and economics. This formulation has been incorporated in Copter that produces acceptable plans in real-time. We adopt a novel empirical evaluation framework that combines human decision data with a high fidelity multi-modal transportation simulation to demonstrate a 4% energy reduction and 20% delay reduction in a realistic deployment scenario in Los Angeles, California, USA. 1. Introduction Transportation is one of the largest consumers of energy in the ...
Automatic Short Answer Grading via Multiway Attention Networks
Liu, Tiaoqiao, Ding, Wenbiao, Wang, Zhiwei, Tang, Jiliang, Huang, Gale Yan, Liu, Zitao
Automatic short answer grading (ASAG), which autonomously score student answers according to reference answers, provides a cost-effective and consistent approach to teaching professionals and can reduce their monotonous and tedious grading workloads. However, ASAG is a very challenging task due to two reasons: (1) student answers are made up of free text which requires a deep semantic understanding; and (2) the questions are usually open-ended and across many domains in K-12 scenarios. In this paper, we propose a generalized end-to-end ASAG learning framework which aims to (1) autonomously extract linguistic information from both student and reference answers; and (2) accurately model the semantic relations between free-text student and reference answers in open-ended domain. The proposed ASAG model is evaluated on a large real-world K-12 dataset and can outperform the state-of-the-art baselines in terms of various evaluation metrics. 1 Introduction Assessing the knowledge acquired by students is one of the most important aspects of the learning process as it provides feedback to help students correct their misunderstanding of knowledge and improves their overall learning performance. Traditionally, the assessing paradigm is often conducted by instructors or teachers. However, this access paradigm is not suitable in many cases especially when teaching resources are not readily available.
Say What I Want: Towards the Dark Side of Neural Dialogue Models
Liu, Haochen, Derr, Tyler, Liu, Zitao, Tang, Jiliang
Neural dialogue models have been widely adopted in various chatbot applications because of their good performance in simulating and generalizing human conversations. However, there exists a dark side of these models -- due to the vulnerability of neural networks, a neural dialogue model can be manipulated by users to say what they want, which brings in concerns about the security of practical chatbot services. In this work, we investigate whether we can craft inputs that lead a well-trained black-box neural dialogue model to generate targeted outputs. We formulate this as a reinforcement learning (RL) problem and train a Reverse Dialogue Generator which efficiently finds such inputs for targeted outputs. Experiments conducted on a representative neural dialogue model show that our proposed model is able to discover such desired inputs in a considerable portion of cases. Overall, our work reveals this weakness of neural dialogue models and may prompt further researches of developing corresponding solutions to avoid it.
5 Hottest Artificial Intelligence Jobs Right Now Robots.net
It's not surprising that in this day and age, artificial intelligence jobs are some of the most sought-after positions on the market. The chance to work with exciting technology that's becoming increasingly important, collaborate with top-level engineers and be an employee on the most avant-garde companies around makes a career in artificial intelligence an excellent choice for an ambitious young graduate. Not to mention the fact that tech companies are paying big money for the right kind of candidate. The AI sector currently offers all kinds of exciting opportunities. Let's take a look at some of the hottest AI jobs out there.
Skill India, IBM join hands for nationwide Train-the-Trainer programme in AI
The Directorate General of Training (DGT), under the skill development and entrepreneurship ministry, has signed an agreement with IT major IBM to carry out a nationwide Train-the-Trainer programme in basic artificial intelligence, an official statement said on Wednesday. As part of the programme, ITI trainers will be trained on basic artificial intelligence (AI) skills towards using the technology in their day-to-day training activities, the ministry said in a statement. This programme, it said, aims at enabling the trainers with basic approach, workflow and application of artificial intelligence that they can apply in their training modules. "IBM aims at training 10,000 faculty members from ITIs across the country and the programme will be executed over a period of one year with 14 trainers across 7 locations with over 200 workshops," it added. Mahendra Nath Pandey, Minister for Skill Development and Entrepreneurship said, many more training programmes will be initiated for the trainers.