Hurricane Ian made its way across Florida in late September 2022, causing tens of billions in estimated insurance losses due to wind and flood damage. Now, half a year later after the disaster, homeowners are still picking up the pieces and rebuilding with the payouts that have been slowly coming out from insurance policies. However, many have had the unexpected shock to learn that flooding was not a part of their homeowners insurance. Here we explain natural disasters, AI and insurance risk assessment. This event and many like it are stark reminders to both individuals and businesses that checking in with their insurance company to review insurance policies is something that needs to happen regularly, not because something may have gone unnoticed, but because things change.

CNBC reports that Google is reorganizing the management hierarchy within its virtual assistant division--Assistant--to concentrate on Bard. Last week, Google introduced Bard, its ChatGPT competitor, to the public as an experimental project. Previous reports indicate Google has been reallocating team members from various departments to concentrate on Bard as part of a "code red" effort. CNBC's report suggests that the effort is still ongoing. Google hasn't responded to requests for comment on CNBC's report.

Nearly a year after he first floated the idea of making Twitter's recommendation algorithm public, the company has posted the source code for its recommendation algorithm on GitHub. In a Twitter Space discussing the move, Elon Musk said he hoped users would be able to find potential "issues" in the code and help make it better. "Our initial release of the so-called algorithm is going to be quite embarrassing and people are gonna find a lot of mistakes but we're going to fix them very quickly," Musk said. Notably, the code released Friday only deals with how tweets are shown in Twitter's "For You" feed. The company didn't release the underlying code for its search algorithm or how content is displayed on other parts of Twitter, though Musk said the company would "for sure" open-source the search algorithm as well.

Machine learning (ML) and Artificial Intelligence (AI) have been receiving a lot of public interest in recent years, with both terms being practically common in the IT language. Despite their similarities, there are some important differences between ML and AI that are frequently neglected. Thus we will cover the key differences between ML and AI in this blog so that you can understand how these two technologies vary and how they may be utilized together. Machine Learning (ML) is a subfield of Artificial Intelligence (AI) that automates data analysis and prediction using algorithms and statistical models. It allows systems to recognize patterns and correlations in vast amounts of data and can be applied to a range of applications like image recognition, natural language processing, and others.

Robots have become ubiquitous tools in various industries and households, highlighting the importance of human-robot interaction (HRI). This has increased the need for easy and accessible communication between humans and robots. Recent research has focused on the intersection of virtual assistant technology, such as Amazon's Alexa, with robots and its effect on HRI. This paper presents the Virtual Assistant, Human, and Robots in the loop (VAHR) system, which utilizes bidirectional communication to control multiple robots through Alexa. VAHR's performance was evaluated through a human-subjects experiment, comparing objective and subjective metrics of traditional keyboard and mouse interfaces to VAHR. The results showed that VAHR required 41% less Robot Attention Demand and ensured 91% more Fan-out time compared to the standard method. Additionally, VAHR led to a 62.5% improvement in multi-tasking, highlighting the potential for efficient human-robot interaction in physically- and mentally-demanding scenarios. However, subjective metrics revealed a need for human operators to build confidence and trust with this new method of operation.

The sharing-economy-based business model has recently seen success in the transportation and accommodation sectors with companies like Uber and Airbnb. There is growing interest in applying this model to energy systems, with modalities like peer-to-peer (P2P) Energy Trading, Electric Vehicles (EV)-based Vehicle-to-Grid (V2G), Vehicle-to-Home (V2H), Vehicle-to-Vehicle (V2V), and Battery Swapping Technology (BST). In this work, we exploit the increasing diffusion of EVs to realize a crowdsourcing platform called e-Uber that jointly enables ride-sharing and energy-sharing through V2G and BST. e-Uber exploits spatial crowdsourcing, reinforcement learning, and reverse auction theory. Specifically, the platform uses reinforcement learning to understand the drivers' preferences towards different ride-sharing and energy-sharing tasks. Based on these preferences, a personalized list is recommended to each driver through CMAB-based Algorithm for task Recommendation System (CARS). Drivers bid on their preferred tasks in their list in a reverse auction fashion. Then e-Uber solves the task assignment optimization problem that minimizes cost and guarantees V2G energy requirement. We prove that this problem is NP-hard and introduce a bipartite matching-inspired heuristic, Bipartite Matching-based Winner selection (BMW), that has polynomial time complexity. Results from experiments using real data from NYC taxi trips and energy consumption show that e-Uber performs close to the optimum and finds better solutions compared to a state-of-the-art approach

In this paper, we propose a new low-rank matrix factorization model dubbed bounded simplex-structured matrix factorization (BSSMF). Given an input matrix $X$ and a factorization rank $r$, BSSMF looks for a matrix $W$ with $r$ columns and a matrix $H$ with $r$ rows such that $X \approx WH$ where the entries in each column of $W$ are bounded, that is, they belong to given intervals, and the columns of $H$ belong to the probability simplex, that is, $H$ is column stochastic. BSSMF generalizes nonnegative matrix factorization (NMF), and simplex-structured matrix factorization (SSMF). BSSMF is particularly well suited when the entries of the input matrix $X$ belong to a given interval; for example when the rows of $X$ represent images, or $X$ is a rating matrix such as in the Netflix and MovieLens datasets where the entries of $X$ belong to the interval $[1,5]$. The simplex-structured matrix $H$ not only leads to an easily understandable decomposition providing a soft clustering of the columns of $X$, but implies that the entries of each column of $WH$ belong to the same intervals as the columns of $W$. In this paper, we first propose a fast algorithm for BSSMF, even in the presence of missing data in $X$. Then we provide identifiability conditions for BSSMF, that is, we provide conditions under which BSSMF admits a unique decomposition, up to trivial ambiguities. Finally, we illustrate the effectiveness of BSSMF on two applications: extraction of features in a set of images, and the matrix completion problem for recommender systems.

Workers are being bombarded with data from a variety of sources. If the point is to make people more productive, as the volume increases, the more difficult it is to find the information you need to do your job. AI thrives in large data environments and can help cut through the noise, move across applications and find the nuggets that matter most. That's the idea behind Jigso, an early-stage startup that's building an AI assistant to act as an observability layer, not unlike security or performance monitoring, but instead of looking at logs, it's looking at the apps employees are using to find the information they need. Today the startup announced a $7.5 million seed investment.

Google is reshuffling the reporting structure of its virtual assistant unit -- called Assistant -- to focus more on Bard, the company's new artificial intelligence chat technology. In a memo to employees on Wednesday, titled "Changes to Assistant and Bard teams," Sissie Hsiao, vice president and lead of Google Assistant's business unit, announced changes to the organization that show the unit heavily prioritizing Bard. Jianchang "JC" Mao, who reported directly to Hsiao, will be leaving the company for personal reasons, according to the memo, which was viewed by CNBC. Mao held the position of vice president of engineering for Google Assistant and "helped shape the Assistant we have today," Hsiao wrote. Taking Mao's place will be 16-year Google veteran Peeyush Ranjan, who most recently held the title of vice president in Google's commerce organization, overseeing payments.

Promotions are becoming more important and prevalent in e-commerce to attract customers and boost sales, leading to frequent changes of occasions, which drives users to behave differently. In such situations, most existing Click-Through Rate (CTR) models can't generalize well to online serving due to distribution uncertainty of the upcoming occasion. In this paper, we propose a novel CTR model named MOEF for recommendations under frequent changes of occasions. Firstly, we design a time series that consists of occasion signals generated from the online business scenario. Since occasion signals are more discriminative in the frequency domain, we apply Fourier Transformation to sliding time windows upon the time series, obtaining a sequence of frequency spectrum which is then processed by Occasion Evolution Layer (OEL). In this way, a high-order occasion representation can be learned to handle the online distribution uncertainty. Moreover, we adopt multiple experts to learn feature representations from multiple aspects, which are guided by the occasion representation via an attention mechanism. Accordingly, a mixture of feature representations is obtained adaptively for different occasions to predict the final CTR. Experimental results on real-world datasets validate the superiority of MOEF and online A/B tests also show MOEF outperforms representative CTR models significantly.