Africa
Bayesian Low Rank Tensor Ring Model for Image Completion
Long, Zhen, Zhu, Ce, Liu, Jiani, Liu, Yipeng
Low rank tensor ring model is powerful for image completion which recovers missing entries in data acquisition and transformation. The recently proposed tensor ring (TR) based completion algorithms generally solve the low rank optimization problem by alternating least squares method with predefined ranks, which may easily lead to overfitting when the unknown ranks are set too large and only a few measurements are available. In this paper, we present a Bayesian low rank tensor ring model for image completion by automatically learning the low rank structure of data. A multiplicative interaction model is developed for the low-rank tensor ring decomposition, where core factors are enforced to be sparse by assuming their entries obey Student-T distribution. Compared with most of the existing methods, the proposed one is free of parameter-tuning, and the TR ranks can be obtained by Bayesian inference. Numerical Experiments, including synthetic data, color images with different sizes and YaleFace dataset B with respect to one pose, show that the proposed approach outperforms state-of-the-art ones, especially in terms of recovery accuracy.
K-Nearest Neighbour and Support Vector Machine Hybrid Classification
In this paper, a novel K-Nearest Neighbour and Support Vector Machine hybrid classification technique has been proposed that is simple and robust. It is based on the concept of discriminative nearest neighbourhood classification. The technique consists of using K-Nearest Neighbour Classification for test samples satisfying a proximity condition. The patterns which do not pass the proximity condition are separated. This is followed by sifting the training set for a fixed number of patterns for every class which are closest to each separated test pattern respectively, based on the Euclidean distance metric. Subsequently, for every separated test sample, a Support Vector Machine is trained on the sifted training set patterns associated with it, and classification for the test sample is done. The proposed technique has been compared to the state of art in this research area. Three datasets viz. the United States Postal Service (USPS) Handwritten Digit Dataset, MNIST Dataset, and an Arabic numeral dataset, the Modified Arabic Digits Database, MADB, have been used to evaluate the performance of the algorithm. The algorithm generally outperforms the other algorithms with which it has been compared.
Roweisposes, Including Eigenposes, Supervised Eigenposes, and Fisherposes, for 3D Action Recognition
Ghojogh, Benyamin, Karray, Fakhri, Crowley, Mark
Human action recognition is one of the important fields of computer vision and machine learning. Although various methods have been proposed for 3D action recognition, some of which are basic and some use deep learning, the need of basic methods based on generalized eigenvalue problem is sensed for action recognition. This need is especially sensed because of having similar basic methods in the field of face recognition such as eigenfaces and Fisherfaces. In this paper, we propose Roweisposes which uses Roweis discriminant analysis for generalized subspace learning. This method includes Fisherposes, eigenposes, supervised eigenposes, and double supervised eigenposes as its special cases. Roweisposes is a family of infinite number of action recongition methods which learn a discriminative subspace for embedding the body poses. Experiments on the TST, UTKinect, and UCFKinect datasets verify the effectiveness of the proposed method for action recognition.
Reducibility and Statistical-Computational Gaps from Secret Leakage
Brennan, Matthew, Bresler, Guy
Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted classes of algorithms, progress towards a more traditional reduction-based approach to computational complexity in statistical inference has been limited. Existing reductions have largely been limited to inference problems with similar structure -- primarily mapping among problems representable as a sparse submatrix signal plus a noise matrix, which are similar to the common hardness assumption of planted clique. The insight in this work is that a slight generalization of the planted clique conjecture -- secret leakage planted clique -- gives rise to a variety of new average-case reduction techniques, yielding a web of reductions among problems with very different structure. Using variants of the planted clique conjecture for specific forms of secret leakage planted clique, we deduce tight statistical-computational tradeoffs for a diverse range of problems including robust sparse mean estimation, mixtures of sparse linear regressions, robust sparse linear regression, tensor PCA, variants of dense $k$-block stochastic block models, negatively correlated sparse PCA, semirandom planted dense subgraph, detection in hidden partition models and a universality principle for learning sparse mixtures. In particular, a $k$-partite hypergraph variant of the planted clique conjecture is sufficient to establish all of our computational lower bounds. Our techniques also reveal novel connections to combinatorial designs and to random matrix theory. This work gives the first evidence that an expanded set of hardness assumptions, such as for secret leakage planted clique, may be a key first step towards a more complete theory of reductions among statistical problems.
How Ethical Is Your AI?
Wendy Gonzalez, interim CEO of Samasource, poses with Agents in Nairobi, Kenya. Samasource employees ... [ ] young Kenyans and Ugandans to work in the AI supply chain, upskilling them up for a career in technology. Conscious consumers demand fair-trade when it comes to products like coffee, and when it's quality coffee, they are even willing to pay more for it. When it comes to our technology products though, many consumers don't even know that "fair-trade" is possible. Behind many acts of AI "magic," there is a human in the loop.
AI in Enterprise Accounting Market Key Driver – 3w Market News Reports
The AI in Enterprise Accounting Market has witnessed continuous growth in the past few years and is projected to grow even further during the forecast period (2020-2025). The assessment provides a 360 view and insights, outlining the key outcomes of the industry. These insights help the business decision-makers to formulate better business plans and make informed decisions for improved profitability. In addition, the study helps venture or private players in understanding the companies more precisely to make better-informed decisions. The AI in Enterprise Accounting Market study covers current status, % share, future patterns, development rate, SWOT examination, sales channels, to anticipate growth scenarios for years 2020-2025.
Three AI-based solutions innovate building energy efficiency - asmag.com
The evolution of technology is taking artificial intelligence (AI) to the fore in nearly every industry. As AI gradually becomes mature, it is being applied in the energy management sector. A number of Internet of Things (IoT) companies are using AI to help businesses reduce energy consumption and expenses. U.S.-based BuildingIQ is one of these companies that aim to improve energy efficiency in large, complex building structures. BuildingIQ's Predictive Energy Optimization (PEO) service uses cloud-based software to calculate heating, ventilation and air conditioning (HVAC) related utility expenses.
A Face Depixelation Tool Is Sparking a Debate Over AI Bias
But it wasn't long after an independent programmer posted it to Twitter last week that other researchers started to notice a glaring flaw. When prompted with Barack Obama's blurry likeness, it returned a white man's face with little resemblance to the former president. An image of @BarackObama getting upsampled into a white guy is floating around because it illustrates racial bias in #MachineLearning. Just in case you think it isn't real, it is, I got the code working locally. Here is me, and here is @AOC.
Tools For Building Machine Learning Models On Android
Ever since Android first came into existence in 2008, it has become the world's biggest mobile platform in terms of popularity and number of users. Over the years, Android developers have built advances in machine learning, features like on-device speech recognition, real-time video interactiveness, and real-time enhancements when taking a photo/selfie. In addition, image recognition with machine learning can enable users to point their smartphone camera at text and have it live-translated into 88 different languages with the help of Google Translate. Android users can even point your camera at a beautiful flower, use Google Lens to identify what type of flower that is, and then set a reminder to order a bouquet for someone. Google Lens is able to use computer vision models to expand and speed up web search and mobile experience.
Robots Are Solving Banks' Very Expensive Research Problem
As lawmakers in Brasilia debated a controversial pension overhaul for months, a robot more than 5,000 miles away in London kept a close eye on all 513 of them. The algorithm, designed by technology startup Arkera Inc., tracked their comments in Brazilian newspapers and government web pages each day to predict the likelihood the bill would pass. Weeks before the legislation cleared its biggest obstacle in July, the machine's data crunching allowed Arkera analysts to predict the result almost to the letter, giving hedge fund clients in New York and London the insight to buy the Brazilian real near eight-month lows in May. It's since rallied more than 8%. This is the kind of edge that a new generation of researchers are betting will upend the research marketplace.