A group of academics and technology experts have embarked on a study to find out how life will be in 2030 with the huge developments in Artificial Intelligence. Although these advances in technology will create some new challenges, however it looks like that there will be a lot more of benefits to gain from. The report entitled "Artificial Intelligence and Life in 2030" forms part of The Stanford University's One Hundred Year Study on Artificial Intelligence. It is the first part from a series which will be published at regular intervals. In this study, experts focused on studying eight particular sectors which are most likely to be affected by Artificial Intelligence by the year 2030.

A Japanese startup is entering the equity research business in a bid to challenge the dominance of securities firms by using computers to crunch vast troves of information and predict companies' earnings. Nowcast Inc., a financial-technology venture formed last year out of the University of Tokyo, will begin providing automated earnings estimates of consumer goods makers as soon as October by analyzing millions of transactions at retail stores, Chief Executive Officer Ryota Hayashi said. The move comes as pressure from Japan's financial regulator prompts brokerages to move away from a long-standing practice of gleaning information from companies about their performance before earnings figures are released. Hayashi sees this as an opportunity for Nowcast to find other ways to estimate companies' results and sell the research to active investors such as hedge funds. "This doesn't mean analysts won't be needed anymore," Hayashi said in an interview.

Data scientists are no longer needed to mine data for business value, and organisations should instead look to machine learning platforms.

Although there has been a rapid and greatly publicized growth of data analytics and machine learning methodologies across many applications, and in virtually every industry, these developments seem to have almost completely been missed in the semiconductor integrated circuit (IC) space. With the 14nm process technology node currently in production, and both 10 and 7nm nodes at different stages of development, the IC'ecosystem' is being restructured and consolidated across its four traditional components (i.e., fabless design companies, electronic design automation and intellectual property suppliers, process and metrology tools suppliers, and silicon foundries). There are, however, intrinsic technology factors (e.g., the continual deceleration of geometric scaling and the delayed introduction of key patterning technologies) that are primary sources of disruption to this restructuring. There are also critical hidden gaps and bottlenecks in the design-to-manufacturing data information pipeline. The deployment of carefully selected data analytics techniques (with/without machine learning algorithms) therefore represents a strategic opportunity to enable a 2 year/node ('more-Moore') cycle at 10nm and below in the semiconductor industry.

BEIJING, CHINA - GPU Technology Conference China -- NVIDIA (NASDAQ: NVDA) today unveiled a palm-sized, energy-efficient artificial intelligence (AI) computer that automakers can use to power automated and autonomous vehicles for driving and mapping. The new single-processor configuration of the NVIDIA DRIVE PX 2 AI computing platform for AutoCruise functions -- which include highway automated driving and HD mapping -- consumes just 10 watts of power and enables vehicles to use deep neural networks to process data from multiple cameras and sensors. It will be deployed by China's Baidu as the in-vehicle car computer for its self-driving cloud-to-car system. DRIVE PX 2 enables automakers and their tier 1 suppliers to accelerate production of automated and autonomous vehicles. A car using the small form-factor DRIVE PX 2 for AutoCruise can understand in real time what is happening around it, precisely locate itself on an HD map and plan a safe path forward.

It is often said that, given an infinite amount of time, monkeys hitting random keys on a typewriter will eventually type the works of Shakespeare. While it may seem far fetched, an unusual experiment has achieved the fabled task. To illustrate how paralysed people can type using a device called a'brain-computer interface', scientists used monkeys to show how it can be done. Two rhesus macaque monkeys (stock picture left) had electrodes implanted in part of the brain that controls hand movement. As a result, they were able to type a passage from William Shakespeare's Hamlet The technology uses a multi-electrode array implanted in the brain to directly read signals from a region that directs hand and arm movements used to move a computer mouse.

A world-first study has identified how cannabis can damage brain circuits to cause significant long-term damage. As our brains develop, we form neural circuits which hold our short-term memory. This process pushes out unnecessary projections, leaving only correct systematic connections in the circuit. These circuits allow us to retrieve recent information such as where you left your keys or what someone just said. They also act as a foundation for long-term memory.

In this form of iterated learning, agents teach each other in sequence: X teaches Y, who then teaches Z, who then teaches... [1-10]. By a classic result of Griffiths and Kalish [3], Quenya will vanish after a finite number of iterations, at which point the agents, assumed to be rational, will be "teaching" each other plain English. In other words, after a while, learners will be taught nothing they don't already know: iterated learning is not self-sustaining. Such findings are hard to validate empirically but variants of it are within the reach of experimental psychology. As early as 1932, in fact, the English psychologist Frederic Bartlett used iterated learning to expose hidden biases among humans. He presented a picture of an owl to a person for given period of time and then asked her to draw it from memory. Her picture was then shown to the next learner for the same amount of time, who then proceeded to draw it back from memory. After 20 iterations of this process, to Bartlett's surprise, what was being drawn was no longer an owl but, quite clearly, a This work was supported in part by NSF grant CCF-1420112.

We formulate and analyze a graphical model selection method for inferring the conditional independence graph of a high-dimensional nonstationary Gaussian random process (time series) from a finite-length observation. The observed process samples are assumed uncorrelated over time and having a time-varying marginal distribution. The selection method is based on testing conditional variances obtained for small subsets of process components. This allows to cope with the high-dimensional regime, where the sample size can be (drastically) smaller than the process dimension. We characterize the required sample size such that the proposed selection method is successful with high probability.

We introduce a new recursive aggregation procedure called Bernstein Online Aggregation (BOA). The exponential weights include an accuracy term and a second order term that is a proxy of the quadratic variation as in Hazan and Kale (2010). This second term stabilizes the procedure that is optimal in different senses. We first obtain optimal regret bounds in the deterministic context. Then, an adaptive version is the first exponential weights algorithm that exhibits a second order bound with excess losses that appears first in Gaillard et al. (2014). The second order bounds in the deterministic context are extended to a general stochastic context using the cumulative predictive risk. Such conversion provides the main result of the paper, an inequality of a novel type comparing the procedure with any deterministic aggregation procedure for an integrated criteria. Then we obtain an observable estimate of the excess of risk of the BOA procedure. To assert the optimality, we consider finally the iid case for strongly convex and Lipschitz continuous losses and we prove that the optimal rate of aggregation of Tsybakov (2003) is achieved. The batch version of the BOA procedure is then the first adaptive explicit algorithm that satisfies an optimal oracle inequality with high probability.