Are you willing to learn about Deep Learning for Cyber Security? Join the webinar to learn more! In this webinar, Steven Hutt, Consultant in Deep Learning and Financial Risk, will provide an overview of network anomaly detection. This webinar will be of interest to Data Scientists, Software Engineers and Entrepreneurs in the areas of Connected Cars, Internet of Things/Industrial Internet, Medical Devices, Financial Technology (blockchain) and predictive apps/APIs of all sorts. Steven Hutt is a consultant in Deep Learning and Financial Risk, currently working in Cyber Security and Algorithmic Trading.

If there is anything that chip giant Intel has learned over the past two decades as it has gradually climbed to dominance in processing in the datacenter, it is ironically that one size most definitely does not fit all. As the tight co-design of hardware and software continues in all parts of the IT industry, we can expect fine-grained customization for very precise – and lucrative – workloads, like data analytics and machine learning, just to name two of the hottest areas today. Software will run most efficiently on hardware that is tuned for it, although we are used to thinking of that process in a mirror image, where programmers tweak their code to take advantage of the forward-looking features a chip maker conceives of four or five years before they are etched into its transistors and delivered as a product. The competition is fierce these days, and Intel has to move fast if it is to keep its compute hegemony in the datacenter. That is why at the Intel Developer Forum in San Francisco the company put a new path on the Knights family of many-core processors that will see the company deliver a version of this chip specifically tuned for machine learning workloads.

Qualitative reasoning formalisms are an active research topic in artificial intelligence. In this survey we present a model-theoretic perspective on qualitative constraint reasoning and explain some of the basic concepts and results in an accessible way. In particular, we discuss the significance of omega-categoricity for qualitative reasoning, of primitive positive interpretations for complexity analysis, and of Datalog as a unifying language for describing local consistency algorithms.

Gamalon Inc, emerged from stealth mode this week, announced two machine learning products, based on an in-house technology known as Bayesian Program Synthesis (BPS). The company claims BPS can perform machine learning tasks 100 times faster than conventional deep learning techniques, while providing more accurate results. "We call our way of doing this Bayesian program learning," said Gamalon founder and CEO, Ben Vigoda at a recent TED talk. He believes using Bayesian probabilistic modeling is a much more efficient way, that is, a much less computationally intensive way, to infuse intelligence into machines. Unlike deep learning, which often needs millions of data examples to train a neural network, a Bayesian model can be built with much fewer examples.

This week in the Substance ÉTS science review, we highlight articles on two topics that are top concerns for many people: Artificial Intelligence and the environment. Each quarter, The Economist publishes a fairly detailed review of a particular aspect of technology. In the first quarter of 2017, The Economist published seven articles describing the progress and limitations of language technology with, in addition, a glimpse of the future in this field. Researchers at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL), in the US, are trying to figure out how MIT students solve a planning problem. They found that the strategies used by the majority of students could be described using a language called "linear temporal logic".

We introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label algorithm, have been adapted to our choice modeling problem setting. We also develop two new algorithms based on the cluster-and-label algorithm. The new algorithms use the Bayesian Information Criterion to evaluate a clustering setting to automatically adjust the number of clusters. Two computational studies including a hotel booking case and a large-scale airline itinerary shopping case are presented to evaluate the prediction accuracy and computational effort of the proposed algorithms. Algorithmic recommendations are rendered under various scenarios.

With the proliferation of AI (Artificial Intelligence) scientific, engineering and technical innovation and its impact on other cutting edge technology fields such as IoT (Internet of Things) and robotics, it may be time for your organization to formulate a job description and start recruiting for a CAIO (Chief Artificial Intelligence Officer). Failure to immediately start this staffing process can harm your business! The Commerce Department reported Friday that U.S. GDP (Gross Domestic Product) ended the 4th quarter of 2016 on a lackluster, inflation and seasonally adjusted annual rate, of only 1.9%. Because GDP is the broadest measure of the goods and services produced by America, this is yet another indication of America's slowest economic expansion since World War II. As a result, this latest data underscores the obstacles facing President Trump as he pushes for economic growth after he has repeatedly stating a goal of 4% expansion in his one year!

With the rise of the Internet and social media, social mobilization - large-scale mobilization manpower for scientific, social, and political activities through crowdsourcing - has become a widespread practice. Despite the success, social mobilization is not without its limitations. Local trapping of diffusion and the dependence on highly connected individuals to mobilize people in distance locations affect the effectiveness of social mobilization. Furthermore, as empirical studies on people's responses to various social mobilization approaches are lacking, it is a significant challenge for artificial intelligence (AI) researchers to design effective and efficient decision support mechanisms to help manage this emerging phenomenon. In my thesis, I conduct large-scale empirical studies to help the AI research community establish baseline personal variabilities in different people's response patterns to social mobilization approaches. Based on the collected dataset, I will further propose computational algorithmic crowdsourcing mechanisms which leverage the empirical evidence to improve the effectiveness and efficiency of social mobilization, towards achieving superlinear productivity. Throughout this process, I will also incorporate human factors into the computational models to benefit social mobilization efforts.

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields.The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. This game is commonly used for analyzing a wide range of applications such as the U.S presidential election, innovative technology competitions, advertisements, etc. There have been persistent efforts for finding the optimal strategies for the Colonel Blotto game. After almost a century Ahmadinejad, Dehghani, Hajiaghayi, Lucier, Mahini, and Seddighin provided a poly-time algorithm for finding the optimal strategies. They first model the problem by a Linear Program (LP) with exponential number of constraints and use Ellipsoid method to solve it. However, despite the theoretical importance of their algorithm, it ishighly impractical. In general, even Simplex method (despite its exponential running-time) performs better than Ellipsoid method in practice. In this paper, we provide the first polynomial-size LP formulation of the optimal strategies for the Colonel Blotto game. We use linear extension techniques. Roughly speaking, we project the strategy space polytope to a higher dimensional space, which results in a lower number of facets for the polytope.We use this polynomial-size LP to provide a novel, simpler and significantly faster algorithm for finding the optimal strategies for the Colonel Blotto game. We further show this representation is asymptotically tight in terms of the number of constraints. We also extend our approach to multi-dimensional Colonel Blotto games, and implement our algorithm to observe interesting properties of Colonel Blotto; for example, we observe the behavior of players in the discrete model is very similar to the previously studied continuous model.

LP MLN is a recently introduced formalism that extends answer set programs by adopting the log-linear weight scheme of Markov Logic. This paper investigates the relationships between LPMLN and two other extensions of answer set programs: weak constraints to express a quantitative preference among answer sets, and P-log to incorporate probabilistic uncertainty. We present a translation of LP MLN into programs with weak constraints and a translation of P-log into LPMLN, which complement the existing translations in the opposite directions. The first translation allows us to compute the most probable stable models (i.e., MAP estimates) of LP MLN programs using standard ASP solvers. This result can be extended to other formalisms, such as Markov Logic, ProbLog, and Pearl's Causal Models, that are shown to be translatable into LP MLN . The second translation tells us how probabilistic nonmonotonicity (the ability of the reasoner to change his probabilistic model as a result of new information) of P-log can be represented in LP MLN , which yields a way to compute P-log using standard ASP solvers and MLN solvers.