Goto

Collaborating Authors

 Instructional Material


Midjourney Mastery: Create Visually Stunning AI Art - Views Coupon

#artificialintelligence

This course takes you step-by-step through the process of becoming a professional AI artist. By the end of the programme you'll have a mastery Are you a creative looking to explore the possibilities of making art with artificial intelligence? If so, then this course is for you! With Midjourney, you'll learn how to create impressive AI art in minutes. You'll learn how to use Midjourney to create art, we'll go through all of tools available so you can master this revolutionary new medium.


Online Deep Learning from Doubly-Streaming Data

arXiv.org Artificial Intelligence

This paper investigates a new online learning problem with doubly-streaming data, where the data streams are described by feature spaces that constantly evolve, with new features emerging and old features fading away. The challenges of this problem are two folds: 1) Data samples ceaselessly flowing in may carry shifted patterns over time, requiring learners to update hence adapt on-the-fly. 2) Newly emerging features are described by very few samples, resulting in weak learners that tend to make error predictions. A plausible idea to overcome the challenges is to establish relationship between the pre-and-post evolving feature spaces, so that an online learner can leverage the knowledge learned from the old features to better the learning performance on the new features. Unfortunately, this idea does not scale up to high-dimensional media streams with complex feature interplay, which suffers an tradeoff between onlineness (biasing shallow learners) and expressiveness(requiring deep learners). Motivated by this, we propose a novel OLD^3S paradigm, where a shared latent subspace is discovered to summarize information from the old and new feature spaces, building intermediate feature mapping relationship. A key trait of OLD^3S is to treat the model capacity as a learnable semantics, yields optimal model depth and parameters jointly, in accordance with the complexity and non-linearity of the input data streams in an online fashion. Both theoretical analyses and empirical studies substantiate the viability and effectiveness of our proposal.


Pre-training for Information Retrieval: Are Hyperlinks Fully Explored?

arXiv.org Artificial Intelligence

Recent years have witnessed great progress on applying pre-trained language models, e.g., BERT, to information retrieval (IR) tasks. Hyperlinks, which are commonly used in Web pages, have been leveraged for designing pre-training objectives. For example, anchor texts of the hyperlinks have been used for simulating queries, thus constructing tremendous query-document pairs for pre-training. However, as a bridge across two web pages, the potential of hyperlinks has not been fully explored. In this work, we focus on modeling the relationship between two documents that are connected by hyperlinks and designing a new pre-training objective for ad-hoc retrieval. Specifically, we categorize the relationships between documents into four groups: no link, unidirectional link, symmetric link, and the most relevant symmetric link. By comparing two documents sampled from adjacent groups, the model can gradually improve its capability of capturing matching signals. We propose a progressive hyperlink predication ({PHP}) framework to explore the utilization of hyperlinks in pre-training. Experimental results on two large-scale ad-hoc retrieval datasets and six question-answering datasets demonstrate its superiority over existing pre-training methods.


Reward Design For An Online Reinforcement Learning Algorithm Supporting Oral Self-Care

arXiv.org Artificial Intelligence

Dental disease is one of the most common chronic diseases despite being largely preventable. However, professional advice on optimal oral hygiene practices is often forgotten or abandoned by patients. Therefore patients may benefit from timely and personalized encouragement to engage in oral self-care behaviors. In this paper, we develop an online reinforcement learning (RL) algorithm for use in optimizing the delivery of mobile-based prompts to encourage oral hygiene behaviors. One of the main challenges in developing such an algorithm is ensuring that the algorithm considers the impact of the current action on the effectiveness of future actions (i.e., delayed effects), especially when the algorithm has been made simple in order to run stably and autonomously in a constrained, real-world setting (i.e., highly noisy, sparse data). We address this challenge by designing a quality reward which maximizes the desired health outcome (i.e., high-quality brushing) while minimizing user burden. We also highlight a procedure for optimizing the hyperparameters of the reward by building a simulation environment test bed and evaluating candidates using the test bed. The RL algorithm discussed in this paper will be deployed in Oralytics, an oral self-care app that provides behavioral strategies to boost patient engagement in oral hygiene practices.


Data and AI Fundamentals

#artificialintelligence

Organizations are increasingly adopting AI as a way to enable data-driven decision making, and as a great source of automated predictions that will potentially generate interesting savings or new sources of revenue. Even our personal devices such as smartphones or voice assistants are already leveraging AI technologies. However, the level of AI maturity within the companies varies a lot, as well as the needs for AI-savvy professionals. Reality is that not everyone needs to be an AI expert or a data scientist. Companies need other kinds of profiles for which at least AI knowledge is required, such as product managers or top executives managing innovation initiatives. This course is designed to give you an introduction to the amazing world of Artificial Intelligence.


iiot machinelearning_2022-09-09_04-17-49.xlsx

#artificialintelligence

The graph represents a network of 1,369 Twitter users whose tweets in the requested range contained "iiot machinelearning", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Friday, 09 September 2022 at 11:21 UTC. The requested start date was Friday, 09 September 2022 at 00:01 UTC and the maximum number of tweets (going backward in time) was 7,500. The tweets in the network were tweeted over the 2-day, 10-hour, 8-minute period from Tuesday, 06 September 2022 at 13:51 UTC to Thursday, 08 September 2022 at 23:59 UTC. Additional tweets that were mentioned in this data set were also collected from prior time periods.


#iiot_2022-02-01_14-46-33.xlsx

#artificialintelligence

The graph represents a network of 1,430 Twitter users whose tweets in the requested range contained "#iiot", or who were replied to or mentioned in those tweets. The network was obtained from the NodeXL Graph Server on Tuesday, 01 February 2022 at 22:57 UTC. The requested start date was Tuesday, 01 February 2022 at 01:01 UTC and the maximum number of tweets (going backward in time) was 7,500. The tweets in the network were tweeted over the 3-day, 6-hour, 55-minute period from Friday, 28 January 2022 at 18:04 UTC to Tuesday, 01 February 2022 at 01:00 UTC. Additional tweets that were mentioned in this data set were also collected from prior time periods.


An Optimal Transport Formulation of Bayes' Law for Nonlinear Filtering Algorithms

arXiv.org Machine Learning

This paper presents a variational representation of the Bayes' law using optimal transportation theory. The variational representation is in terms of the optimal transportation between the joint distribution of the (state, observation) and their independent coupling. By imposing certain structure on the transport map, the solution to the variational problem is used to construct a Brenier-type map that transports the prior distribution to the posterior distribution for any value of the observation signal. The new formulation is used to derive the optimal transport form of the Ensemble Kalman filter (EnKF) for the discrete-time filtering problem and propose a novel extension of EnKF to the non-Gaussian setting utilizing input convex neural networks. Finally, the proposed methodology is used to derive the optimal transport form of the feedback particle filler (FPF) in the continuous-time limit, which constitutes its first variational construction without explicitly using the nonlinear filtering equation or Bayes' law.


Save the date: Join AWS at NVIDIA GTC, September 19โ€“22

#artificialintelligence

Register free for NVIDIA GTC to learn from experts on how AI and the evolution of the 3D internet are profoundly impacting industries--and society as a whole. We have prepared several AWS sessions to give you guidance on how to use AWS services powered by NVIDIA technology to meet your goals. Amazon Elastic Compute Cloud (Amazon EC2) instances powered by NVIDIA GPUs deliver the scalable performance needed for fast machine learning (ML) training, cost-effective ML inference, flexible remote virtual workstations, and powerful HPC computations. AWS is a Global Diamond Sponsor of the conference. Scaling Deep Learning Training on Amazon EC2 using PyTorch (Presented by Amazon Web Services) [A41454] As deep learning models grow in size and complexity, they need to be trained using distributed architectures.


Bridging between LegalRuleML and TPTP for Automated Normative Reasoning (extended version)

arXiv.org Artificial Intelligence

LegalRuleML is a comprehensive XML-based representation framework for modeling and exchanging normative rules. The TPTP input and output formats, on the other hand, are general-purpose standards for the interaction with automated reasoning systems. In this paper we provide a bridge between the two communities by (i) defining a logic-pluralistic normative reasoning language based on the TPTP format, (ii) providing a translation scheme between relevant fragments of LegalRuleML and this language, and (iii) proposing a flexible architecture for automated normative reasoning based on this translation. We exemplarily instantiate and demonstrate the approach with three different normative logics.