Asia
Qualcomm Ventures is dedicating $100M to AI investments
Qualcomm Ventures, the corporate venture capital arm of the chipmaker, has plans to invest up to $100 million in artificial intelligence. Specifically, Qualcomm says it will provide capital to startups building on-device AI, which is AI that runs on the end device, like a smartphone or vehicle, rather than in the cloud. The fund's leader, Qualcomm investment director Albert Wang (pictured), says on-device AI is the future. "Today's AI processing is very computationally intensive," Wang told TechCrunch. "When you're talking to Alexa, nothing is processed on your device, it gets taken to the cloud and gets scrunched there. There are a few problems with that -- performance deteriorates, it consumes a lot of bandwidth and there are privacy issues. Imagine you have an Alexa that is more private and user-friendly, you ask the questions and can get the answers instantly. It doesn't take the round trip all the way to the cloud."
China's first web-only bank hopes A.I. and robots can improve customer service
China's first web-only bank hopes artificial intelligence can improve customer service through the use of virtual robots powered by technologies such as facial recognition, speech recognition and natural language processing. AI is "there only to improve human services," Yang Qiang, an AI consultant at Tencent's WeBank, told CNBC's Arjun Kharpal at the East Tech West conference in the Nansha district of Guangzhou, China. "Automated service is not an enemy to human services," he said. "They should work side by side." In addition, advances in technology create possibilities for greater efficiencies in traditional bank roles such as processing loan applications, risk analysis and offering personalized service, he said.
Data-driven Conceptual Spaces: Creating Semantic Representations For Linguistic Descriptions Of Numerical Data
Banaee, Hadi, Schaffernicht, Erik, Loutfi, Amy
There is an increasing need to derive semantics from real-world observations to facilitate natural information sharing between machine and human. Conceptual spaces theory is a possible approach and has been proposed as mid-level representation between symbolic and sub-symbolic representations, whereby concepts are represented in a geometrical space that is characterised by a number of quality dimensions. Currently, much of the work has demonstrated how conceptual spaces are created in a knowledge-driven manner, relying on prior knowledge to form concepts and identify quality dimensions. This paper presents a method to create semantic representations using data-driven conceptual spaces which are then used to derive linguistic descriptions of numerical data. Our contribution is a principled approach to automatically construct a conceptual space from a set of known observations wherein the quality dimensions and domains are not known a priori. This novelty of the approach is the ability to select and group semantic features to discriminate between concepts in a data-driven manner while preserving the semantic interpretation that is needed to infer linguistic descriptions for interaction with humans. Two data sets representing leaf images and time series signals are used to evaluate the method. An empirical evaluation for each case study assesses how well linguistic descriptions generated from the conceptual spaces identify unknown observations. Furthermore, comparisons are made with descriptions derived on alternative approaches for generating semantic models.
Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
Bate, Andrew, Motik, Boris, Cuenca Grau, Bernardo, Tena Cucala, David, Simančík, František, Horrocks, Ian
Classification of description logic (DL) ontologies is a key computational problem in modern data management applications, so considerable effort has been devoted to the development and optimisation of practical reasoning calculi. Consequence-based calculi combine ideas from hypertableau and resolution in a way that has proved very effective in practice. However, existing consequence-based calculi can handle either Horn DLs (which do not support disjunction) or DLs without number restrictions. In this paper, we overcome this important limitation and present the first consequence-based calculus for deciding concept subsumption in the DL ALCHIQ+. Our calculus runs in exponential time assuming unary coding of numbers, and on ELH ontologies it runs in polynomial time. The extension to disjunctions and number restrictions is technically involved: we capture the relevant consequences using first-order clauses, and our inference rules adapt paramodulation techniques from first-order theorem proving. By using a well-known preprocessing step, the calculus can also decide concept subsumptions in SRIQ---a rich DL that covers all features of OWL 2 DL apart from nominals and datatypes. We have implemented our calculus in a new reasoner called Sequoia. We present the architecture of our reasoner and discuss several novel and important implementation techniques such as clause indexing and redundancy elimination. Finally, we present the results of an extensive performance evaluation, which revealed Sequoia to be competitive with existing reasoners. Thus, the calculus and the techniques we present in this paper provide an important addition to the repertoire of practical implementation techniques for description logic reasoning.
Deep Signal Recovery with One-Bit Quantization
Khobahi, Shahin, Naimipour, Naveed, Soltanalian, Mojtaba, Eldar, Yonina C.
Machine learning, and more specifically deep learning, have shown remarkable performance in sensing, communications, and inference. In this paper, we consider the application of the deep unfolding technique in the problem of signal reconstruction from its one-bit noisy measurements. Namely, we propose a model-based machine learning method and unfold the iterations of an inference optimization algorithm into the layers of a deep neural network for one-bit signal recovery. The resulting network, which we refer to as DeepRec, can efficiently handle the recovery of high-dimensional signals from acquired one-bit noisy measurements. The proposed method results in an improvement in accuracy and computational efficiency with respect to the original framework as shown through numerical analysis.
Leveraging Deep Stein's Unbiased Risk Estimator for Unsupervised X-ray Denoising
Shamshad, Fahad, Awais, Muhammad, Asim, Muhammad, Lodhi, Zain ul Aabidin, Umair, Muhammad, Ahmed, Ali
Among the plethora of techniques devised to curb the prevalence of noise in medical images, deep learning based approaches have shown the most promise. However, one critical limitation of these deep learning based denoisers is the requirement of high-quality noiseless ground truth images that are difficult to obtain in many medical imaging applications such as X-rays. To circumvent this issue, we leverage recently proposed approach of [7] that incorporates Stein's Unbiased Risk Estimator (SURE) to train a deep convolutional neural network without requiring denoised ground truth X-ray data. Our experimental results demonstrate the effectiveness of SURE based approach for denoising X-ray images.
Global optimization of expensive black-box models based on asynchronous hybrid-criterion with interval reduction
Gong, Chunlin, Li, Xu, Su, Hua, Guo, Jinlei, Gu, Liangxian
In this paper, a new sequential surrogate-based optimization (SSBO) algorithm is developed, which aims to improve the global search ability and local search efficiency for the global optimization of expensive black-box models. The proposed method involves three basic sub-criteria to infill new samples asynchronously to balance the global exploration and local exploitation. First, to capture the promising possible global optimal region, searching for the global optimum with genetic algorithm (GA) based on the current surrogate models of the objective and constraint functions. Second, to infill samples in the region with sparse samples to improve the global accuracy of the surrogate models, a grid searching with Latin hypercube sampling (LHS) with the current surrogate model is adopted to explore the sample space. Third, to accelerate the local searching efficiency, searching for a local optimum with sequential quadratic programming (SQP) based on the local surrogate models in the reduced interval, which involves some samples near the current optimum. When the new sample is too close to the existing ones, the new sample should be abandoned, due to the poor additional information. According to the three sub-criteria, the new samples are placed in the regions which have not been fully explored and includes the possible global optimum point. When a possible global optimum point is found, the local searching sub-criterion captures the local optimum around it rapidly. Numerical and engineering examples are used to verify the efficiency of the proposed method. The statistical results show that the proposed method has good global searching ability and efficiency.
Adversarial Examples as an Input-Fault Tolerance Problem
Galloway, Angus, Golubeva, Anna, Taylor, Graham W.
We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., $\epsilon$-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse input faults.
MOBIUS: Model-Oblivious Binarized Neural Networks
Kitai, Hiromasa, Cruz, Jason Paul, Yanai, Naoto, Nishida, Naohisa, Oba, Tatsumi, Unagami, Yuji, Teruya, Tadanori, Attrapadung, Nuttapong, Matsuda, Takahiro, Hanaoka, Goichiro
A privacy-preserving framework in which a computational resource provider receives encrypted data from a client and returns prediction results without decrypting the data, i.e., oblivious neural network or encrypted prediction, has been studied in machine learning that provides prediction services. In this work, we present MOBIUS (Model-Oblivious BInary neUral networkS), a new system that combines Binarized Neural Networks (BNNs) and secure computation based on secret sharing as tools for scalable and fast privacy-preserving machine learning. BNNs improve computational performance by binarizing values in training to $-1$ and $+1$, while secure computation based on secret sharing provides fast and various computations under encrypted forms via modulo operations with a short bit length. However, combining these tools is not trivial because their operations have different algebraic structures and the use of BNNs downgrades prediction accuracy in general. MOBIUS uses improved procedures of BNNs and secure computation that have compatible algebraic structures without downgrading prediction accuracy. We created an implementation of MOBIUS in C++ using the ABY library (NDSS 2015). We then conducted experiments using the MNIST dataset, and the results show that MOBIUS can return a prediction within 0.76 seconds, which is six times faster than SecureML (IEEE S\&P 2017). MOBIUS allows a client to request for encrypted prediction and allows a trainer to obliviously publish an encrypted model to a cloud provided by a computational resource provider, i.e., without revealing the original model itself to the provider.
Sega Dreamcast at 20: the futuristic games console that came too soon
The Dreamcast looked like nothing else out there. A lighter box than the uniform black or grey, four joypad ports, a bizarre controller with a memory card that had its own screen and worked as a separate miniature games console. The name – a portmanteau of Dream and Broadcast – was strangely ethereal for a games console (Sega had apparently gone through 5,000 possibile monikers to get here). When a prototype was shown to the press in the summer of 1998, there was no Sega logo. This was a new dawn.