A self-taught artificial intelligence (AI) system called DeepCube has mastered solving the Rubik's Cube puzzle in just 44 hours without human intervention. The system's inventors have detailed their design in a paper titled'Solving the Rubik's Cube Without Human Knowledge'. "A generally intelligent agent must be able to teach itself how to solve problems in complex domains with minimal human supervision," write the paper's authors. "Indeed, if we're ever going to achieve a general, human-like machine intelligence, we'll have to develop systems that can learn and then apply those learnings to real-world applications." While many AI systems have been taught to play games, mastering the complexity of a Rubik's Cube posed a unique set of challenges.

We present a principled way of extending a classical AI planning formalism with systems of state constraints, which relate - sometimes determine - the values of variables in each state traversed by the plan. This extension occupies an attractive middle ground between expressivity and complexity. It enables modelling a new range of problems, as well as formulating more efficient models of classical planning problems. An example of the former is planning-based control of networked physical systems - power networks, for example - in which a local, discrete control action can have global effects on continuous quantities, such as altering flows across the entire network. At the same time, our extension remains decidable as long as the satisfiability of sets of state constraints is decidable, including in the presence of numeric state variables, and we demonstrate that effective techniques for cost-optimal planning known in the classical setting - in particular, relaxation-based admissible heuristics - can be adapted to the extended formalism. In this paper, we apply our approach to constraints in the form of linear or non-linear equations over numeric state variables, but the approach is independent of the type of state constraints, as long as there exists a procedure that decides their consistency. The planner and the constraint solver interact through a well-defined, narrow interface, in which the solver requires no specialisation to the planning context.

Suppose you could merely imagine a computation, and a digital prostheses, an extension of your biological brain, would turn it into code that instantly realizes what you had in mind. Imagine looking at an image, dataset or set of equations and wanting to analyze and explore its meaning as an artistic whim or part of a scientific investigation. I don't mean you would use an existing software suite to produce a standard visualization, but rather you would make use of an extensive repository of existing code to assemble a new program analogous to how a composer draws upon a repertoire of musical motifs, themes and styles to construct new works, and tantamount to having a talented musical amanuensis who, in addition to copying your scores, takes liberties with your prior work, making small alterations here and there and occasionally adding new works of its own invention, novel but consistent with your taste and sensibilities. Perhaps the interaction would be wordless and you would express your objective by simply focusing your attention and guiding your imagination, the prostheses operating directly on patterns of activation arising in your primary sensory, proprioceptive and associative cortex that have become part of an extensive vocabulary that you now share with your personal digital amanuensis. Or perhaps it would involve a conversation conducted in subvocal, unarticulated speech in which you specify what it is you want to compute and your assistant asks questions to clarify your intention and the two of you share examples of input and output to ground your internal conversation in concrete terms. More than thirty years ago, Charles Rich and Richard Waters published an MIT AI Lab technical report [68] entitled The Programmer's Apprentice: A Research Overview. Whether they intended it or not, it would have been easy in those days for someone to misremember the title and inadvertently refer to it as "The Sorcerer's Apprentice" since computer programmers at the time were often characterized as wizards and most children were familiar with the Walt Disney movie Fantasia, featuring music written by Paul Dukas inspired by Goethe's poem of the same name

Specialty drugs account for just 2% of all medicines prescribed, yet they are on pace to comprise 50% of the drug spend in the next few years – ballooning to $400B in the US alone by 2020. Traditional approaches to drug utilization and cost management are simply not working. And biopharmaceutical pipelines are filled with new, high-priced, specialty drugs that continue to pressure health care budgets around the world. There is currently estimated to be up to $20billion in annual, solvable Specialty Rx inefficiencies in the US alone. By identifying which drugs are most effective for which patients (precision analytics for precision medicine) can a Decision support system (DSS) help solve the growing problem with Specialty Drug Use and Cost out of Control? This trend is unsustainable to the healthcare system.

Can machines design? Can they come up with creative solutions to problems and build tools and artifacts across a wide range of domains? Recent advances in the field of computational creativity and formal Artificial General Intelligence (AGI) provide frameworks for machines with the general ability to design. In this paper we propose to integrate a formal computational creativity framework into the G\"odel machine framework. We call the resulting framework design G\"odel machine. Such a machine could solve a variety of design problems by generating novel concepts. In addition, it could change the way these concepts are generated by modifying itself. The design G\"odel machine is able to improve its initial design program, once it has proven that a modification would increase its return on the utility function. Finally, we sketch out a specific version of the design G\"odel machine which specifically addresses the design of complex software and hardware systems. Future work aims at the development of a more formal version of the design G\"odel machine and a proof of concept implementation.

Our next interaction in the series of interviews for analytics hiring scenario in India is with Professor U Dinesh Kumar, Chairperson, Analytics Lab at IIM-B, and faculty in the Decision Sciences and Information Systems (DSIS) area at IIM Bangalore. IIM Bangalore has been a pioneer in providing analytics courses to freshers as well as working professionals to gain a strong foothold in areas like analytics, artificial intelligence, machine learning and data science, among others. Dinesh Kumar: The trend is obviously increasing with many recruiting senior management positions in analytics. Having said that, it is still behind western countries. For example, In 2016 MIT Sloan management review reported that 54 percent of Fortune 1000 companies had Chief Data Office, but the corresponding number in India is much lower.

Two algorithms, collectively called Deep Cube, typically can solve the 3-D combination puzzle within 30 moves, which is less than or equal to systems that use human knowledge, according to the research paper. Less than 5.8% of the world's population can solve the Rubik's Cube, according to the Rubik's website.

Indian Institute of Science's Machine Learning Special Interest Group: Touted as one of the best research groups in India, especially the one with a beautiful campus, IISc's MLSIG features several talented students and faculty members engaged in cutting-edge research on a variety of aspects of ML and related fields. These works range from theoretical foundations to new algorithms as well as other exciting applications. IISc MLSIG has a great roster of events that covers topics such as deep learning with GPUs, data mining (models, algorithms and applications), text analysis, knowledge representation and reasoning with DNN. MLSIG is also doing cutting-edge research that is published in top journals and conferences. Some of the research topics are ML in text mining, ML in computer vision, graphical models, clustering, support vector machines and kernel-based learning methods.

Pathfinding is a very popular area in computer game development. While two-dimensional (2D) pathfinding is widely applied in most of the popular game engines, little implementation of real three-dimensional (3D) pathfinding can be found. This research presents a dynamic search space optimization algorithm which can be applied to tessellate 3D search space unevenly, significantly reducing the total number of resulting nodes. The algorithm can be used with popular pathfinding algorithms in 3D game engines. Furthermore, a simplified standalone 3D pathfinding algorithm is proposed in this paper. The proposed algorithm relies on ray-casting or line vision to generate a feasible path during runtime without requiring division of the search space into a 3D grid. Both of the proposed algorithms are simulated on Unreal Engine to show innerworkings and resultant path comparison with A*. The advantages and shortcomings of the proposed algorithms are also discussed along with future directions.

Incredibly, the system learned to dominate the classic 3D puzzle in just 44 hours and without any human intervention. "A generally intelligent agent must be able to teach itself how to solve problems in complex domains with minimal human supervision," write the authors of the new paper, published online at the arXiv preprint server. Indeed, if we're ever going to achieve a general, human-like machine intelligence, we'll have to develop systems that can learn and then apply those learnings to real-world applications. Recent breakthroughs in machine learning have produced systems that, without any prior knowledge, have learned to master games like chess and Go. But these approaches haven't translated very well to the Rubik's Cube.