Mumbai: ICICI Bank, India's largest private sector bank, today announced the deployment of'Software Robotics' in over 200 business processes across various functions of the bank. The bank is the first in the country and among few, globally, to deploy'Software Robotics' that emulates human actions to automate and perform repetitive, high volume and time consuming business tasks cutting across multiple applications. At ICICI Bank, software robots have reduced the response time to customers by up to 60% and increased accuracy to 100% thereby sharply improving the bank's productivity and efficiency. It has also enabled the bank's employees to focus more on value-added and customer-related functions. The software robots now perform over 10 lakh banking transactions every working day.

Nasa has announced that it has found evidence of flowing water on Mars. Scientists have long speculated that Recurring Slope Lineae -- or dark patches -- on Mars were made up of briny water but the new findings prove that those patches are caused by liquid water, which it has established by finding hydrated salts. Several hundred camped outside the London store in Covent Garden. The 6s will have new features like a vastly improved camera and a pressure-sensitive "3D Touch" display

We met up with Jeh Daruvala, CEO of Yactraq, a machine learning company with cutting edge technology that delivers business intelligence using audible or video input. In layman terms, their patent pending technology can be used to accurately search through tens of millions of hours of call center recordings TV shows, movies etc. in a fast and cost effective manner in order to provide actionable insights and intelligence. Here is what he had to say about one of the most coveted spaces in technology. Q: Can you please tell us about your company and the specific challenge that you are addressing? Yactraq empowers SMB & Enterprise clients with machine learning driven insights extracted from any audible media.

The rise of artificial intelligence and automation in journalism has been front and center in the news lately, from Narrative Science co-founder Kris Hammond's prediction that "a machine will win a Pulitzer one day" to Facebook's decision to automate its Trending Topics feed. Algorithms seem certain to play a growing role in the production and curation of news, but it remains unclear what exactly this trend will mean for journalism -- or for the human journalists who currently produce it. Celebrants argue that algorithms will simply take over journalism's most menial tasks, freeing up human journalists to tackle more advanced work. Bloomberg editor-in-chief John Micklethwait, for example, called automation "crucial to the future of journalism," and New York magazine writer Kevin Roose described the introduction of automated reporting as "the best thing to happen to journalists in a long time." However, skeptics fear that robots may end up replacing journalists instead of helping them.

Artificial Intelligence is already operating in a range of limited but interesting ways across the healthcare sector. The use of processing computers that can sift and sort data hundreds if not thousands of times quicker than humans is growing, with research suggesting that we spent around 2 billion in venture backed capital on it in 2015. But where is its use likely to impact healthcare in the next decade or so, with reports predicting spending on AI in healthcare will reach as much as 20 Billion in 10 years time? Before we look at applications in healthcare in particular, we should remember that AI is an umbrella term for three related technologies; machine learning, extended human cognition and robotics. AI is quite a broad field and in this regard the impact on healthcare as one large industry is likely to be significant, especially in being able to be major new platform/systems leveraging by SAAS systems and databases intelligently talking to each other.

A big challenge in environmental monitoring is the spatiotemporal variation of the phenomena to be observed. To enable persistent sensing and estimation in such a setting, it is beneficial to have a time-varying underlying environmental model. Here we present a planning and learning method that enables an autonomous marine vehicle to perform persistent ocean monitoring tasks by learning and refining an environmental model. To alleviate the computational bottleneck caused by large-scale data accumulated, we propose a framework that iterates between a planning component aimed at collecting the most information-rich data, and a sparse Gaussian Process learning component where the environmental model and hyperparameters are learned online by taking advantage of only a subset of data that provides the greatest contribution. Our simulations with ground-truth ocean data shows that the proposed method is both accurate and efficient.

Recently, several models based on deep neural networks have achieved great success in terms of both reconstruction accuracy and computational performance for single image super-resolution. In these methods, the low resolution (LR) input image is upscaled to the high resolution (HR) space using a single filter, commonly bicubic interpolation, before reconstruction. This means that the super-resolution (SR) operation is performed in HR space. We demonstrate that this is sub-optimal and adds computational complexity. In this paper, we present the first convolutional neural network (CNN) capable of real-time SR of 1080p videos on a single K2 GPU. To achieve this, we propose a novel CNN architecture where the feature maps are extracted in the LR space. In addition, we introduce an efficient sub-pixel convolution layer which learns an array of upscaling filters to upscale the final LR feature maps into the HR output. By doing so, we effectively replace the handcrafted bicubic filter in the SR pipeline with more complex upscaling filters specifically trained for each feature map, whilst also reducing the computational complexity of the overall SR operation. We evaluate the proposed approach using images and videos from publicly available datasets and show that it performs significantly better (+0.15dB on Images and +0.39dB on Videos) and is an order of magnitude faster than previous CNN-based methods.

We consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given item beats a randomly chosen item, and ranking refers to partitioning the items into sets of pre-specified sizes according to their scores. This notion of ranking includes as special cases the identification of the top-k items and the total ordering of the items. We first analyze a sequential ranking algorithm that counts the number of comparisons won, and uses these counts to decide whether to stop, or to compare another pair of items, chosen based on confidence intervals specified by the data collected up to that point. We prove that this algorithm succeeds in recovering the ranking using a number of comparisons that is optimal up to logarithmic factors. This guarantee does not require any structural properties of the underlying pairwise probability matrix, unlike a significant body of past work on pairwise ranking based on parametric models such as the Thurstone or Bradley-Terry-Luce models. It has been a long-standing open question as to whether or not imposing these parametric assumptions allows for improved ranking algorithms. For stochastic comparison models, in which the pairwise probabilities are bounded away from zero, our second contribution is to resolve this issue by proving a lower bound for parametric models. This shows, perhaps surprisingly, that these popular parametric modeling choices offer at most logarithmic gains for stochastic comparisons.

The multivariate normal density is a monotonic function of the distance to the mean, and its ellipsoidal shape is due to the underlying Euclidean metric. We suggest to replace this metric with a locally adaptive, smoothly changing (Riemannian) metric that favors regions of high local density. The resulting locally adaptive normal distribution (LAND) is a generalization of the normal distribution to the "manifold" setting, where data is assumed to lie near a potentially low-dimensional manifold embedded in $\mathbb{R}^D$. The LAND is parametric, depending only on a mean and a covariance, and is the maximum entropy distribution under the given metric. The underlying metric is, however, non-parametric. We develop a maximum likelihood algorithm to infer the distribution parameters that relies on a combination of gradient descent and Monte Carlo integration. We further extend the LAND to mixture models, and provide the corresponding EM algorithm. We demonstrate the efficiency of the LAND to fit non-trivial probability distributions over both synthetic data, and EEG measurements of human sleep.

Mixture models and topic models generate each observation from a single cluster, but standard variational posteriors for each observation assign positive probability to all possible clusters. This requires dense storage and runtime costs that scale with the total number of clusters, even though typically only a few clusters have significant posterior mass for any data point. We propose a constrained family of sparse variational distributions that allow at most $L$ non-zero entries, where the tunable threshold $L$ trades off speed for accuracy. Previous sparse approximations have used hard assignments ($L=1$), but we find that moderate values of $L>1$ provide superior performance. Our approach easily integrates with stochastic or incremental optimization algorithms to scale to millions of examples. Experiments training mixture models of image patches and topic models for news articles show that our approach produces better-quality models in far less time than baseline methods.