Early on in the evolution of artificial intelligence, researchers realized the power and possibility of machines that are able to understand the meaning and nuances of human speech. Conversation and human language is a particularly challenging area for computers, since words and communication is not precise. Human language is filled with nuance, context, cultural and societal depth, and imprecision that can lead to a wide range of interpretations. If computers can understand what we mean when we talk, and then communicate back to us in a way we can understand, then clearly we've accomplished a goal of artificial intelligence. This particular application of AI is so profound that it makes up one of the fundamental seven patterns of AI: the conversation and human interaction pattern.

What if AI can help brands take their brand voice to the next level? Artificial intelligence is top of mind for many in the marketing and communications world. Many Marcom departments already use AI to analyze consumer behavior and try to predict future needs. Many brands use algorithms to recommend personalized content, show personalized ads, as well as power customer service chatbots. But what if AI can help brands take their brand voice to the next level? Brands usually spend thousands, if not millions of dollars, fine-tuning their brand voice, which describes a company's personality.

In a world of rapid change, artificial intelligence (AI) currently fuels most of this growth so it is no surprise that the next wave of great startups is based in AI solutions. With events like Covid-19, there is increased focus on solutions that tap into the extraordinary capabilities from AI. Something else unique is also happening. Generation Z (Gen Z) and the young millennial entrepreneurs are leading the way. Where are these innovators starting? One area where they are tapping into is a field everyone has had high hopes over the past few decades: robotics.

Machine learning projects took home the most funding in 2019, receiving more funding than all other artificial intelligence systems combined. Between both machine learning apps and platforms, over 42 billion dollars went to the development of those automating systems. All other projects that use artificial intelligence, including advancing smart robots, virtual assistants, and natural language processing, got about 38 billion by comparison. While funders are getting behind more machine learning ideas, some of the biggest players in the space are putting resources behind not just advancing these systems technologically but also ethically. Other industry behemoths, like IBM, have pushed for more transparency and software add-ons that could monitor algorithms to see how biases are built into them.

Implicit feedback data is extensively explored in recommendation as it is easy to collect and generally applicable. However, predicting users' preference on implicit feedback data is a challenging task since we can only observe positive (voted) samples and unvoted samples. It is difficult to distinguish between the negative samples and unlabeled positive samples from the unvoted ones. Existing works, such as Bayesian Personalized Ranking (BPR), sample unvoted items as negative samples uniformly, therefore suffer from a critical noisy-label issue. To address this gap, we design an adaptive sampler based on noisy-label robust learning for implicit feedback data. To formulate the issue, we first introduce Bayesian Point-wise Optimization (BPO) to learn a model, e.g., Matrix Factorization (MF), by maximum likelihood estimation. We predict users' preferences with the model and learn it by maximizing likelihood of observed data labels, i.e., a user prefers her positive samples and has no interests in her unvoted samples. However, in reality, a user may have interests in some of her unvoted samples, which are indeed positive samples mislabeled as negative ones. We then consider the risk of these noisy labels, and propose a Noisy-label Robust BPO (NBPO). NBPO also maximizes the observation likelihood while connects users' preference and observed labels by the likelihood of label flipping based on the Bayes' theorem. In NBPO, a user prefers her true positive samples and shows no interests in her true negative samples, hence the optimization quality is dramatically improved. Extensive experiments on two public real-world datasets show the significant improvement of our proposed optimization methods.

Data sparsity is an inherent challenge in the recommender systems, where most of the data is collected from the implicit feedbacks of users. This causes two difficulties in designing effective algorithms: first, the majority of users only have a few interactions with the system and there is no enough data for learning; second, there are no negative samples in the implicit feedbacks and it is a common practice to perform negative sampling to generate negative samples. However, this leads to a consequence that many potential positive samples are mislabeled as negative ones and data sparsity would exacerbate the mislabeling problem. To solve these difficulties, we regard the problem of recommendation on sparse implicit feedbacks as a semi-supervised learning task, and explore domain adaption to solve it. We transfer the knowledge learned from dense data to sparse data and we focus on the most challenging case -- there is no user or item overlap. In this extreme case, aligning embeddings of two datasets directly is rather sub-optimal since the two latent spaces encode very different information. As such, we adopt domain-invariant textual features as the anchor points to align the latent spaces. To align the embeddings, we extract the textual features for each user and item and feed them into a domain classifier with the embeddings of users and items. The embeddings are trained to puzzle the classifier and textual features are fixed as anchor points. By domain adaptation, the distribution pattern in the source domain is transferred to the target domain. As the target part can be supervised by domain adaptation, we abandon negative sampling in target dataset to avoid label noise. We adopt three pairs of real-world datasets to validate the effectiveness of our transfer strategy. Results show that our models outperform existing models significantly.

Three gay black people speak to the BBC about encountering racism in the world of online dating - from feeling fetishised to the impact of colourism.

Timed Practice Exam is coming soon! New reference architecture section with hands-on lab that demonstrates how to build a data lake solution using AWS Services and the best practices: 2020 AWS S3 Data Lake Architecture. This topic covers essential services and how they work together for a cohesive solution. AWS Artificial Intelligence material is now live! Within a few minutes, you will learn about algorithms for sophisticated facial recognition systems, sentiment analysis, conversational interfaces with speech and text and much more.

There has been growing attention on fairness considerations recently, especially in the context of intelligent decision making systems. Explainable recommendation systems, in particular, may suffer from both explanation bias and performance disparity. In this paper, we analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups. We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users, and that their recommendations may be biased by the training records of more active users, due to the nature of collaborative filtering, which leads to an unfair treatment by the system. We propose a fairness constrained approach via heuristic re-ranking to mitigate this unfairness problem in the context of explainable recommendation over knowledge graphs. We experiment on several real-world datasets with state-of-the-art knowledge graph-based explainable recommendation algorithms. The promising results show that our algorithm is not only able to provide high-quality explainable recommendations, but also reduces the recommendation unfairness in several respects.

Retrieving relevant targets from an extremely large target set under computational limits is a common challenge for information retrieval and recommendation systems. Tree models, which formulate targets as leaves of a tree with trainable node-wise scorers, have attracted a lot of interests in tackling this challenge due to their logarithmic computational complexity in both training and testing. Tree-based deep models (TDMs) and probabilistic label trees (PLTs) are two representative kinds of them. Though achieving many practical successes, existing tree models suffer from the training-testing discrepancy, where the retrieval performance deterioration caused by beam search in testing is not considered in training. This leads to an intrinsic gap between the most relevant targets and those retrieved by beam search with even the optimally trained node-wise scorers. We take a first step towards understanding and analyzing this problem theoretically, and develop the concept of Bayes optimality under beam search and calibration under beam search as general analyzing tools for this purpose. Moreover, to eliminate the discrepancy, we propose a novel algorithm for learning optimal tree models under beam search. Experiments on both synthetic and real data verify the rationality of our theoretical analysis and demonstrate the superiority of our algorithm compared to state-of-the-art methods.