Learning Management
Generative AI for learning: Investigating the potential of synthetic learning videos
Leiker, Daniel, Gyllen, Ashley Ricker, Eldesouky, Ismail, Cukurova, Mutlu
Recent advances in generative artificial intelligence (AI) have captured worldwide attention. Tools such as Dalle-2 and ChatGPT suggest that tasks previously thought to be beyond the capabilities of AI may now augment the productivity of creative media in various new ways, including through the generation of synthetic video. This research paper explores the utility of using AI-generated synthetic video to create viable educational content for online educational settings. To date, there is limited research investigating the real-world educational value of AI-generated synthetic media. To address this gap, we examined the impact of using AI-generated synthetic video in an online learning platform on both learners content acquisition and learning experience. We took a mixed-method approach, randomly assigning adult learners (n=83) into one of two micro-learning conditions, collecting pre- and post-learning assessments, and surveying participants on their learning experience. The control condition included a traditionally produced instructor video, while the experimental condition included a synthetic video with a realistic AI-generated character. The results show that learners in both conditions demonstrated significant improvement from pre- to post-learning (p<.001), with no significant differences in gains between the two conditions (p=.80). In addition, no differences were observed in how learners perceived the traditional and synthetic videos. These findings suggest that AI-generated synthetic learning videos have the potential to be a viable substitute for videos produced via traditional methods in online educational settings, making high quality educational content more accessible across the globe.
Exploration of Unranked Items in Safe Online Learning to Re-Rank
Shiino, Hiroaki, Ariu, Kaito, Abe, Kenshi, Riku, Togashi
Bandit algorithms for online learning to rank (OLTR) problems often aim to maximize long-term revenue by utilizing user feedback. From a practical point of view, however, such algorithms have a high risk of hurting user experience due to their aggressive exploration. Thus, there has been a rising demand for safe exploration in recent years. One approach to safe exploration is to gradually enhance the quality of an original ranking that is already guaranteed acceptable quality. In this paper, we propose a safe OLTR algorithm that efficiently exchanges one of the items in the current ranking with an item outside the ranking (i.e., an unranked item) to perform exploration. We select an unranked item optimistically to explore based on Kullback-Leibler upper confidence bounds (KL-UCB) and safely re-rank the items including the selected one. Through experiments, we demonstrate that the proposed algorithm improves long-term regret from baselines without any safety violation.
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
Zhao, Peng, Zhang, Yu-Jie, Zhang, Lijun, Zhou, Zhi-Hua
We investigate online convex optimization in non-stationary environments and choose the dynamic regret as the performance measure, defined as the difference between cumulative loss incurred by the online algorithm and that of any feasible comparator sequence. Let $T$ be the time horizon and $P_T$ be the path length that essentially reflects the non-stationarity of environments, the state-of-the-art dynamic regret is $\mathcal{O}(\sqrt{T(1+P_T)})$. Although this bound is proved to be minimax optimal for convex functions, in this paper, we demonstrate that it is possible to further enhance the guarantee for some easy problem instances, particularly when online functions are smooth. Specifically, we introduce novel online algorithms that can exploit smoothness and replace the dependence on $T$ in dynamic regret with problem-dependent quantities: the variation in gradients of loss functions, the cumulative loss of the comparator sequence, and the minimum of these two terms. These quantities are at most $\mathcal{O}(T)$ while could be much smaller in benign environments. Therefore, our results are adaptive to the intrinsic difficulty of the problem, since the bounds are tighter than existing results for easy problems and meanwhile guarantee the same rate in the worst case. Notably, our proposed algorithms can achieve favorable dynamic regret with only one gradient per iteration, sharing the same gradient query complexity as the static regret minimization methods. To accomplish this, we introduce the framework of collaborative online ensemble. The proposed framework employs a two-layer online ensemble to handle non-stationarity, and uses optimistic online learning and further introduces crucial correction terms to facilitate effective collaboration within the meta-base two layers, thereby attaining adaptivity. We believe that the framework can be useful for broader problems.
NSLF-OL: Online Learning of Neural Surface Light Fields alongside Real-time Incremental 3D Reconstruction
Immersive novel view generation is an important technology in the field of graphics and has recently also received attention for operator-based human-robot interaction. However, the involved training is time-consuming, and thus the current test scope is majorly on object capturing. This limits the usage of related models in the robotics community for 3D reconstruction since robots (1) usually only capture a very small range of view directions to surfaces that cause arbitrary predictions on unseen, novel direction, (2) requires real-time algorithms, and (3) work with growing scenes, e.g., in robotic exploration. The paper proposes a novel Neural Surface Light Fields model that copes with the small range of view directions while producing a good result in unseen directions. Exploiting recent encoding techniques, the training of our model is highly efficient. In addition, we design Multiple Asynchronous Neural Agents (MANA), a universal framework to learn each small region in parallel for large-scale growing scenes. Our model learns online the Neural Surface Light Fields (NSLF) aside from real-time 3D reconstruction with a sequential data stream as the shared input. In addition to online training, our model also provides real-time rendering after completing the data stream for visualization. We implement experiments using well-known RGBD indoor datasets, showing the high flexibility to embed our model into real-time 3D reconstruction and demonstrating high-fidelity view synthesis for these scenes. The code is available on github.
Edge Impulse: An MLOps Platform for Tiny Machine Learning
Hymel, Shawn, Banbury, Colby, Situnayake, Daniel, Elium, Alex, Ward, Carl, Kelcey, Mat, Baaijens, Mathijs, Majchrzycki, Mateusz, Plunkett, Jenny, Tischler, David, Grande, Alessandro, Moreau, Louis, Maslov, Dmitry, Beavis, Artie, Jongboom, Jan, Reddi, Vijay Janapa
Edge Impulse is a cloud-based machine learning operations (MLOps) platform for developing embedded and edge ML (TinyML) systems that can be deployed to a wide range of hardware targets. Current TinyML workflows are plagued by fragmented software stacks and heterogeneous deployment hardware, making ML model optimizations difficult and unportable. We present Edge Impulse, a practical MLOps platform for developing TinyML systems at scale. Edge Impulse addresses these challenges and streamlines the TinyML design cycle by supporting various software and hardware optimizations to create an extensible and portable software stack for a multitude of embedded systems. As of Oct. 2022, Edge Impulse hosts 118,185 projects from 50,953 developers.
Optimality of Robust Online Learning
Guo, Zheng-Chu, Christmann, Andreas, Shi, Lei
In this paper, we study an online learning algorithm with a robust loss function $\mathcal{L}_{\sigma}$ for regression over a reproducing kernel Hilbert space (RKHS). The loss function $\mathcal{L}_{\sigma}$ involving a scaling parameter $\sigma>0$ can cover a wide range of commonly used robust losses. The proposed algorithm is then a robust alternative for online least squares regression aiming to estimate the conditional mean function. For properly chosen $\sigma$ and step size, we show that the last iterate of this online algorithm can achieve optimal capacity independent convergence in the mean square distance. Moreover, if additional information on the underlying function space is known, we also establish optimal capacity dependent rates for strong convergence in RKHS. To the best of our knowledge, both of the two results are new to the existing literature of online learning.
Investment Management with Python and Machine Learning
Founded in 1906, EDHEC is now one of Europe's top 15 business schools . Based in Lille, Nice, Paris, London and Singapore, and counting over 90 nationalities on its campuses, EDHEC is a fully international school directly connected to the business world. With over 40,000 graduates in 120 countries, it trains committed managers capable of dealing with the challenges of a fast-evolving world. Harnessing its core values of excellence, innovation and entrepreneurial spirit, EDHEC has developed a strategic model founded on research of true practical use to society, businesses and students, and which is particularly evident in the work of EDHEC-Risk Institute and Scientific Beta. The School functions as a genuine laboratory of ideas and plays a pioneering role in the field of digital education via EDHEC Online, the first fully online degree-level training platform.
AI Applications in People Management
In this course, you will learn about Artificial Intelligence and Machine Learning as it applies to HR Management. You will explore concepts related to the role of data in machine learning, AI application, limitations of using data in HR decisions, and how bias can be mitigated using blockchain technology. Machine learning powers are becoming faster and more streamlined, and you will gain firsthand knowledge of how to use current and emerging technology to manage the entire employee lifecycle. Through study and analysis, you will learn how to sift through tremendous volumes of data to identify patterns and make predictions that will be in the best interest of your business. By the end of this course, you'll be able to identify how you can incorporate AI to streamline all HR functions and how to work with data to take advantage of the power of machine learning.
Fundamentals of Machine Learning for Supply Chain
This course will teach you how to leverage the power of Python to understand complicated supply chain datasets. Even if you are not familiar with supply chain fundamentals, the rich data sets that we will use as a canvas will help orient you with several Pythonic tools and best practices for exploratory data analysis (EDA). As such, though all datasets are geared towards supply chain minded professionals, the lessons are easily generalizable to other use cases.
Coursera offers classes so workers aren't blindsided by AI taking their jobs
Join top executives in San Francisco on July 11-12, to hear how leaders are integrating and optimizing AI investments for success. Coursera is offering more classes and degrees so that global labor market won't be blindsided by the rise of generative AI and remote work. As businesses adopt generative AI to improve customer offerings and productivity, it will also create an unprecedented demand for reskilling – with up to 49% of workers having half or more of their tasks exposed to large language models. "Today, we're excited to announce several new content offerings, ChatGPT-powered platform innovations, and expanded immersive learning experiences to better serve our learners and educators worldwide," said Jeff Maggioncalda, CEO of Coursera, in a blog post. To meet the growing demand for AI skills in the workforce, Coursera is increasing its selection of AI-related courses, including a ChatGPT Teach-Out (University of Michigan) and AI for Good Specialization (DeepLearning.AI).