configuration


How 5G Will Serve AI and Vice Versa

#artificialintelligence

Though it's still several years away from widespread deployment, 5G is a key component in the evolution of cloud-computing ecosystems toward more distributed environments. Between now and 2025, the networking industry will invest about $1 trillion worldwide on 5G, supporting rapid global adoption of mobile, edge, and embedded devices in practically every sphere of our lives. It will be a proving ground for next-generation artificial intelligence (AI), offering an environment within which data-driven algorithms will guide every cloud-centric process, device, and experience. Just as significant, AI will be a key component in ensuring that 5G networks are optimized from end to end, 24 7. AI will live at every edge in the hybrid clouds, multiclouds, and mesh networks of the future. Already, we see prominent AI platform vendors--such as NVIDIA--making significant investments in 5G-based services for mobility, Internet of Things (IoT) and other edge environments.


Configuration Estimates Improve Pedestrian Finding

Neural Information Processing Systems

Fair discriminative pedestrian finders are now available. In fact, these pedestrian finders make most errors on pedestrians in configurations that are uncommon in the training data, for example, mounting a bicycle. However, the human configuration can itself be estimated discriminatively using structure learning. We demonstrate a pedestrian finder which first finds the most likely human pose in the window using a discriminative procedure trained with structure learning on a small dataset. We then present features (local histogram of oriented gradient and local PCA of gradient) based on that configuration to an SVM classifier.


Image Parsing with Stochastic Scene Grammar

Neural Information Processing Systems

In contrast to previous scene labeling work that applied discriminative classifiers to pixels (or super-pixels), we use a generative Stochastic Scene Grammar (SSG). This grammar represents the compositional structures of visual entities from scene categories, 3D foreground/background, 2D faces, to 1D lines. The grammar includes three types of production rules and two types of contextual relations. Production rules: (i) AND rules represent the decomposition of an entity into sub-parts; (ii) OR rules represent the switching among sub-types of an entity; (iii) SET rules rep- resent an ensemble of visual entities. Contextual relations: (i) Cooperative " " relations represent positive links between binding entities, such as hinged faces of a object or aligned boxes; (ii) Competitive "-" relations represents negative links between competing entities, such as mutually exclusive boxes. We design an efficient MCMC inference algorithm, namely Hierarchical cluster sampling, to search in the large solution space of scene configurations. The algorithm has two stages: (i) Clustering: It forms all possible higher-level structures (clusters) from lower-level entities by production rules and contextual relations.


Goal-conditioned Imitation Learning

Neural Information Processing Systems

Designing rewards for Reinforcement Learning (RL) is challenging because it needs to convey the desired task, be efficient to optimize, and be easy to compute. The latter is particularly problematic when applying RL to robotics, where detecting whether the desired configuration is reached might require considerable supervision and instrumentation. Furthermore, we are often interested in being able to reach a wide range of configurations, hence setting up a different reward every time might be unpractical. Methods like Hindsight Experience Replay (HER) have recently shown promise to learn policies able to reach many goals, without the need of a reward. Unfortunately, without tricks like resetting to points along the trajectory, HER might require many samples to discover how to reach certain areas of the state-space.


We'll Do It Live: Updating Machine Learning Models on Flask/uWSGI with No Downtime

#artificialintelligence

Flask is one of the most popular REST API frameworks used for hosting machine learning (ML) models. The choice is heavily influenced by a data science team's expertise in Python and the reusability of training assets built in Python. At WW, Flask is used extensively by the data science team to serve predictions from various ML models. However, there are a few considerations that need to be made before a Flask application is production-ready. If Flask code isn't modified to run asynchronously, it only can run one request per process at a time.


Bringing Media Analytics into View - IT Peer Network

#artificialintelligence

Video content will become richer and more data-intensive as it evolves from HD to 4K to 360 and even 8K. Companies are moving these visual workloads to the cloud and edge in order to keep up with capacity, growth and service demands. With the emergence of edge computing and cloudified, 5G networks, organizations have an opportunity to deliver insights through artificial intelligence (AI) that complement new user experiences and are adaptable to the complexities of delivering video content to a global audience. Companies need a visual cloud and media analytics platform that is flexible enough to support changing business models and deployment options, software that enables rapid innovation, and hardware that can scale to provide a range of performance, all while being able to lower total cost of ownership and grow profitability. Intel launched the Intel Select Solutions for Visual Cloud to give companies an easier path towards successful content creation and delivery starting with the Intel Select Solution for Simulation and Visualization and Intel Select Solution for Visual Cloud Delivery Network.


Weakly-supervised Discovery of Visual Pattern Configurations

Neural Information Processing Systems

The prominence of weakly labeled data gives rise to a growing demand for object detection methods that can cope with minimal supervision. We propose an approach that automatically identifies discriminative configurations of visual patterns that are characteristic of a given object class. We formulate the problem as a constrained submodular optimization problem and demonstrate the benefits of the discovered configurations in remedying mislocalizations and finding informative positive and negative training examples. Papers published at the Neural Information Processing Systems Conference.


One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizers

Neural Information Processing Systems

The success of lottery ticket initializations (Frankle and Carbin, 2019) suggests that small, sparsified networks can be trained so long as the network is initialized appropriately. Unfortunately, finding these "winning ticket'' initializations is computationally expensive. One potential solution is to reuse the same winning tickets across a variety of datasets and optimizers. However, the generality of winning ticket initializations remains unclear. Here, we attempt to answer this question by generating winning tickets for one training configuration (optimizer and dataset) and evaluating their performance on another configuration.


Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs

Neural Information Processing Systems

Robotic motion-planning problems, such as a UAV flying fast in a partially-known environment or a robot arm moving around cluttered objects, require finding collision-free paths quickly. Typically, this is solved by constructing a graph, where vertices represent robot configurations and edges represent potentially valid movements of the robot between theses configurations. The main computational bottlenecks are expensive edge evaluations to check for collisions. State of the art planning methods do not reason about the optimal sequence of edges to evaluate in order to find a collision free path quickly. In this paper, we do so by drawing a novel equivalence between motion planning and the Bayesian active learning paradigm of decision region determination (DRD).


Offline Contextual Bayesian Optimization

Neural Information Processing Systems

In black-box optimization, an agent repeatedly chooses a configuration to test, so as to find an optimal configuration. In many practical problems of interest, one would like to optimize several systems, or tasks'', simultaneously; however, in most of these scenarios the current task is determined by nature. In this work, we explore the offline'' case in which one is able to bypass nature and choose the next task to evaluate (e.g. via a simulator). Because some tasks may be easier to optimize and others may be more critical, it is crucial to leverage algorithms that not only consider which configurations to try next, but also which tasks to make evaluations for. In this work, we describe a theoretically grounded Bayesian optimization method to tackle this problem.