Goto

Collaborating Authors

 Media


How Hospitality-Specific AI is Changing How We Do Business – 4Hoteliers

#artificialintelligence

Artificial Intelligence (AI) seems to be a buzzword in today's information age and AI is all around us; it's.


Is AI Image Generation Art?. If you're debating whether AI image…

#artificialintelligence

If you're debating whether AI image generation is art or not, this blog post is for you. Learn about the different ways you can generate your own AI art. For centuries, art has been seen as a product of the human imagination, a way for us to express our creativity and view of the world around us. But what happens when artificial intelligence (AI) is used to generate images? Some argue that generated images cannot be classified as art because they lack the creativity and human emotion that traditional artwork has.


A Track Sung By an AI Voice Has Eclipsed 100 Million Streams - EDM.com - The Latest Electronic Dance Music News, Reviews & Artists

#artificialintelligence

While artists work hard to produce new music for fans and increase their streaming numbers, an A.I. has effortlessly recorded a song that eclipsed 100 million streams. According to a report by Music Business Worldwide, Chinese streaming giant Tencent Music Entertainment (TME) has recorded and released over 1,000 new songs that feature AI-generated vocals mimicking the human voice. One track in particular, titled "Today," has become the first song with an AI voice to surpass the nine-digit milestone. That led to just under $350,000 in streaming revenue, per MBW. The songs use TME's "patented voice synthesis technology," Lingyin Engine, which is said to be able to replicate the voices of real-life singers to produce original songs throughout any genre and language.


Towards Robustness of Text-to-SQL Models Against Natural and Realistic Adversarial Table Perturbation

arXiv.org Artificial Intelligence

The robustness of Text-to-SQL parsers against adversarial perturbations plays a crucial role in delivering highly reliable applications. Previous studies along this line primarily focused on perturbations in the natural language question side, neglecting the variability of tables. Motivated by this, we propose the Adversarial Table Perturbation (ATP) as a new attacking paradigm to measure the robustness of Text-to-SQL models. Following this proposition, we curate ADVETA, the first robustness evaluation benchmark featuring natural and realistic ATPs. All tested state-of-the-art models experience dramatic performance drops on ADVETA, revealing models' vulnerability in real-world practices. To defend against ATP, we build a systematic adversarial training example generation framework tailored for better contextualization of tabular data. Experiments show that our approach not only brings the best robustness improvement against table-side perturbations but also substantially empowers models against NL-side perturbations. We release our benchmark and code at: https://github.com/microsoft/ContextualSP.


Unsigned Play by Milan Kundera? An Authorship Attribution Study

arXiv.org Artificial Intelligence

In addition to being a widely recognised novelist, Milan Kundera has also authored three pieces for theatre: The Owners of the Keys (Majitel\'e kl\'i\v{c}\r{u}, 1961), The Blunder (Pt\'akovina, 1967), and Jacques and his Master (Jakub a jeho p\'an, 1971). In recent years, however, the hypothesis has been raised that Kundera is the true author of a fourth play: Juro J\'ano\v{s}\'ik, first performed in a 1974 production under the name of Karel Steigerwald, who was Kundera's student at the time. In this study, we make use of supervised machine learning to settle the question of authorship attribution in the case of Juro J\'ano\v{s}\'ik, with results strongly supporting the hypothesis of Kundera's authorship.


Knowledge Unlearning for Mitigating Privacy Risks in Language Models

arXiv.org Artificial Intelligence

Pretrained Language Models (LMs) memorize a vast amount of knowledge during initial pretraining, including information that may violate the privacy of personal lives and identities. Previous work addressing privacy issues for language models has mostly focused on data preprocessing and differential privacy methods, both requiring re-training the underlying LM. We propose knowledge unlearning as an alternative method to reduce privacy risks for LMs post hoc. We show that simply performing gradient ascent on target token sequences is effective at forgetting them with little to no degradation of general language modeling performances for larger LMs; it sometimes even substantially improves the underlying LM with just a few iterations. We also find that sequential unlearning is better than trying to unlearn all the data at once and that unlearning is highly dependent on which kind of data (domain) is forgotten. By showing comparisons with a previous data preprocessing method and a decoding method known to mitigate privacy risks for LMs, we show that unlearning can give a stronger empirical privacy guarantee in scenarios where the data vulnerable to extraction attacks are known a priori while being much more efficient and robust. We release the code and dataset needed to replicate our results at https://github.com/joeljang/knowledge-unlearning.


Almost Cost-Free Communication in Federated Best Arm Identification

arXiv.org Artificial Intelligence

We study the problem of best arm identification in a federated learning multi-armed bandit setup with a central server and multiple clients. Each client is associated with a multi-armed bandit in which each arm yields {\em i.i.d.}\ rewards following a Gaussian distribution with an unknown mean and known variance. The set of arms is assumed to be the same at all the clients. We define two notions of best arm -- local and global. The local best arm at a client is the arm with the largest mean among the arms local to the client, whereas the global best arm is the arm with the largest average mean across all the clients. We assume that each client can only observe the rewards from its local arms and thereby estimate its local best arm. The clients communicate with a central server on uplinks that entail a cost of $C\ge0$ units per usage per uplink. The global best arm is estimated at the server. The goal is to identify the local best arms and the global best arm with minimal total cost, defined as the sum of the total number of arm selections at all the clients and the total communication cost, subject to an upper bound on the error probability. We propose a novel algorithm {\sc FedElim} that is based on successive elimination and communicates only in exponential time steps and obtain a high probability instance-dependent upper bound on its total cost. The key takeaway from our paper is that for any $C\geq 0$ and error probabilities sufficiently small, the total number of arm selections (resp.\ the total cost) under {\sc FedElim} is at most~$2$ (resp.~$3$) times the maximum total number of arm selections under its variant that communicates in every time step. Additionally, we show that the latter is optimal in expectation up to a constant factor, thereby demonstrating that communication is almost cost-free in {\sc FedElim}. We numerically validate the efficacy of {\sc FedElim}.


MuseMorphose: Full-Song and Fine-Grained Piano Music Style Transfer with One Transformer VAE

arXiv.org Artificial Intelligence

Transformers and variational autoencoders (VAE) have been extensively employed for symbolic (e.g., MIDI) domain music generation. While the former boast an impressive capability in modeling long sequences, the latter allow users to willingly exert control over different parts (e.g., bars) of the music to be generated. In this paper, we are interested in bringing the two together to construct a single model that exhibits both strengths. The task is split into two steps. First, we equip Transformer decoders with the ability to accept segment-level, time-varying conditions during sequence generation. Subsequently, we combine the developed and tested in-attention decoder with a Transformer encoder, and train the resulting MuseMorphose model with the VAE objective to achieve style transfer of long pop piano pieces, in which users can specify musical attributes including rhythmic intensity and polyphony (i.e., harmonic fullness) they desire, down to the bar level. Experiments show that MuseMorphose outperforms recurrent neural network (RNN) based baselines on numerous widely-used metrics for style transfer tasks.


How to get Alexa to speak more like you

FOX News

Kurt "CyberGuy" Knutsson shows you how to customize your Alexa settings to get her to sound more like you. Take a moment to learn the newest ways to get Alexa to speak the way you want. It will dramatically improve how you are currently using Alexa forever. CLICK TO GET KURT'S CYBERGUY NEWSLETTER WITH QUICK TIPS, TECH REVIEWS, SECURITY ALERTS AND EASY HOW-TO'S TO MAKE YOU SMARTER You can change Alexa's volume directly on most devices or by using your voice, but did you know you can change Alexa's speed at which the device talks to you? Say "Alexa, speak faster" or "Alexa, speak slower" either once, or a few times to get the device speaking at the rate you'd like. If you end up wanting Alexa to go back to the original speed, just say "Alexa, speak at your default rate" and the settings will reset.


Top Innovative Artificial Intelligence (AI) Powered Startups Based in Austria – MarkTechPost

#artificialintelligence

Here are some of the cool artificial intelligence startups/businesses that are innovating the Artificial Intelligence market in various ways, …