Menu

Blog

Archive for the ‘information science’ category: Page 195

Oct 29, 2020

DeepMind Introduces Algorithms for Causal Reasoning in Probability Trees

Posted by in categories: information science, robotics/AI

Are you a cutting-edge AI researcher looking for models with clean semantics that can represent the context-specific causal dependencies necessary for causal induction? If so, maybe you should take a look at good old-fashioned probability trees.

Probability trees may have been around for decades, but they have received little attention from the AI and ML community. Until now. “Probability trees are one of the simplest models of causal generative processes,” explains the new DeepMind paper Algorithms for Causal Reasoning in Probability Trees, which the authors say is the first to propose concrete algorithms for causal reasoning in discrete probability trees.

Humans naturally learn to reason in large part through inducing causal relationships from our observations, and we do this remarkably well, cognitive scientists say. Even when the data we perceive is sparse and limited, humans can quickly learn causal structures such as interactions between physical objects, observations of the co-occurrence frequencies between causes and effects, etc.

Oct 27, 2020

The Deck Is Not Rigged: Poker and the Limits of AI

Posted by in categories: business, cybercrime/malcode, government, health, information science, mathematics, military, robotics/AI

Tuomas Sandholm, a computer scientist at Carnegie Mellon University, is not a poker player—or much of a poker fan, in fact—but he is fascinated by the game for much the same reason as the great game theorist John von Neumann before him. Von Neumann, who died in 1957, viewed poker as the perfect model for human decision making, for finding the balance between skill and chance that accompanies our every choice. He saw poker as the ultimate strategic challenge, combining as it does not just the mathematical elements of a game like chess but the uniquely human, psychological angles that are more difficult to model precisely—a view shared years later by Sandholm in his research with artificial intelligence.

“Poker is the main benchmark and challenge program for games of imperfect information,” Sandholm told me on a warm spring afternoon in 2018, when we met in his offices in Pittsburgh. The game, it turns out, has become the gold standard for developing artificial intelligence.

Tall and thin, with wire-frame glasses and neat brow hair framing a friendly face, Sandholm is behind the creation of three computer programs designed to test their mettle against human poker players: Claudico, Libratus, and most recently, Pluribus. (When we met, Libratus was still a toddler and Pluribus didn’t yet exist.) The goal isn’t to solve poker, as such, but to create algorithms whose decision making prowess in poker’s world of imperfect information and stochastic situations—situations that are randomly determined and unable to be predicted—can then be applied to other stochastic realms, like the military, business, government, cybersecurity, even health care.

Oct 26, 2020

MIT tests autonomous ‘Roboat’ that can carry two passengers

Posted by in categories: information science, robotics/AI

MIT looked at the original Roboat as “quarter-scale” option, with the Roboat II being half-scale; they’re slowly working up to the point of a full-scale option that can carry four to six passengers. That bigger version is already under construction in Amsterdam, but there’s no word on when it’ll be ready for testing. In the meantime, Roboat II seems like it can pretty effectively navigate Amsterdam — MIT says that it autonomously navigated the city’s canals for three hours collecting data and returned to where it left with an error margin of less than seven inches.

Going forward, the MIT team expects to keep improving the Roboat’s algorithms to make it better able to deal with the challenges a boat might find, like disturbances from currents and waves. They’re also working to make it more capable of identifying and “understanding” objects it comes across so it can better deal with the environment it’s in. Everything the half-scale Roboat II learns will naturally be applied to the full-scale version that’s being worked on now. There’s no word on when we might see that bigger Roboat out in the waters, though.

Oct 24, 2020

IBM releases Watson supercomputer yottabyte storage into the market

Posted by in categories: information science, supercomputing

Circa 2014 o,.o.


IBM has started to flex its muscles with the Watson super computer after launching its software defined storage options for the big data era.

Oct 23, 2020

Artificial general intelligence: Are we close, and does it even make sense to try?

Posted by in categories: information science, robotics/AI

Moving from one-algorithm to one-brain is one of the biggest open challenges in AI. A one-brain AI would still not be a true intelligence, only a better general-purpose AI—Legg’s multi-tool. But whether they’re shooting for AGI or not, researchers agree that today’s systems need to be made more general-purpose, and for those who do have AGI as the goal, a general-purpose AI is a necessary first step.

Oct 22, 2020

A machine-learning algorithm that can infer the direction of the thermodynamic arrow of time

Posted by in categories: information science, robotics/AI

The second law of thermodynamics delineates an asymmetry in how physical systems evolve over time, known as the arrow of time. In macroscopic systems, this asymmetry has a clear direction (e.g., one can easily notice if a video showing a system’s evolution over time is being played normally or backward).

In the microscopic world, however, this direction is not always apparent. In fact, fluctuations in microscopic systems can lead to clear violations of the , causing the arrow of to become blurry and less defined. As a result, when watching a video of a microscopic process, it can be difficult, if not impossible, to determine whether it is being played normally or backwards.

Researchers at University of Maryland developed a that can infer the direction of the thermodynamic arrow of time in both macroscopic and microscopic processes. This algorithm, presented in a paper published in Nature Physics, could ultimately help to uncover new physical principles related to thermodynamics.

Oct 22, 2020

New MIT algorithm automatically deciphers lost languages

Posted by in categories: information science, robotics/AI

An MIT CSAIL AI system that can automatically decipher extinct languages offers hope of preserving a wealth of historical heritage.

Oct 22, 2020

Can We Trust AI Doctors? Google Health and Academics Battle It Out

Posted by in categories: biotech/medical, health, information science, robotics/AI

So now, there are AI doctors.


Machine learning is taking medical diagnosis by storm. From eye disease, breast and other cancers, to more amorphous neurological disorders, AI is routinely matching physician performance, if not beating them outright.

Yet how much can we take those results at face value? When it comes to life and death decisions, when can we put our full trust in enigmatic algorithms—“black boxes” that even their creators cannot fully explain or understand? The problem gets more complex as medical AI crosses multiple disciplines and developers, including both academic and industry powerhouses such as Google, Amazon, or Apple, with disparate incentives.

Continue reading “Can We Trust AI Doctors? Google Health and Academics Battle It Out” »

Oct 21, 2020

Robot trained in a game-like simulation performs better in real life

Posted by in categories: entertainment, information science, robotics/AI

A robot controlled by a neural network algorithm that was trained in a video game-like simulation is better able to navigate difficult terrain in real life.

Oct 19, 2020

Computer Scientists Break the ‘Traveling Salesperson’ Record

Posted by in categories: computing, information science

Now Karlin, Klein and Oveis Gharan have proved that an algorithm devised a decade ago beats Christofides’ 50 percent factor, though they were only able to subtract 0.2 billionth of a trillionth of a trillionth of a percent. Yet this minuscule improvement breaks through both a theoretical logjam and a psychological one. Researchers hope that it will open the floodgates to further improvements.

“This is a result I have wanted all my career,” said David Williamson of Cornell University, who has been studying the traveling salesperson problem since the 1980s.

The traveling salesperson problem is one of a handful of foundational problems that theoretical computer scientists turn to again and again to test the limits of efficient computation. The new result “is the first step towards showing that the frontiers of efficient computation are in fact better than what we thought,” Williamson said.