Search

Systems that are based on recursive Bayesian updates for classification limit the cost of evidence collection through certain stopping/termination criteria and accordingly enforce decision making. Conventionally, two termination criteria based on pre-defined thresholds over (i) the maximum of the state posterior distribution; and (ii) the state posterior uncertainty are commonly used. In this paper, we propose a geometric interpretation over the state posterior progression and accordingly we provide a point-by-point analysis over the disadvantages of using such conventional termination criteria. For example, through the proposed geometric interpretation we show that confidence thresholds defined over maximum of the state posteriors suffer from stiffness that results in unnecessary evidence collection whereas uncertainty based thresholding methods are fragile to number of categories and terminate prematurely if some state candidates are already discovered to be unfavorable. Moreover, both types of termination methods neglect the evolution of posterior updates. We then propose a new stopping/termination criterion with a geometrical insight to overcome the limitations of these conventional methods and provide a comparison in terms of decision accuracy and speed. We validate our claims using simulations and using real experimental data obtained through a brain computer interfaced typing system. [ABSTRACT FROM AUTHOR]

Emotion recognition is a critical component of affective computing. Training accurate machine learning models for emotion recognition typically requires a large amount of labeled data. Due to the subtleness and complexity of emotions, multiple evaluators are usually needed for each affective sample to obtain its ground-truth label, which is expensive. To save the labeling cost, this paper proposes an inconsistency-based active learning approach for cross-task transfer between emotion classification and estimation. Affective norms are utilized as prior knowledge to connect the label spaces of categorical and dimensional emotions. Then, the prediction inconsistency on the two tasks for the unlabeled samples is used to guide sample selection in active learning for the target task. Experiments on within-corpus and cross-corpus transfers demonstrated that cross-task inconsistency could be a very valuable metric in active learning. To our knowledge, this is the first work that utilizes prior knowledge on affective norms and data in a different task to facilitate active learning for a new task, even the two tasks are from different datasets. [ABSTRACT FROM AUTHOR]

The success of supervised models for emotion recognition on images heavily depends on the availability of images properly annotated. Although millions of images are presently available, only a few are annotated with reliable emotional information. Current emotion recognition solutions either use large amounts of weakly-labeled web images, which often contain noise that is unrelated to the emotions of the image, or transfer learning, which usually results in performance losses. Thus, it would be desirable to know which images would be useful to be annotated to avoid an extensive annotation effort. In this paper, we propose a novel approach based on active learning to choose which images are more relevant to be annotated. Our approach dynamically combines multiple active learning strategies and learns the best ones (without prior knowledge of the best ones). Experiments using nine benchmark datasets revealed that: (i) active learning allows to reduce the annotation effort, while reaching or surpassing the performance of a supervised baseline with as little as 3% to 18% of the baseline's training set, in classification tasks; (ii) our online combination of multiple strategies converges to the performance of the best individual strategies, while avoiding the experimentation overhead needed to identify them. [ABSTRACT FROM AUTHOR]

Multi-Task Learning (MTL) is a learning paradigm in machine learning and its aim is to leverage useful information contained in multiple related tasks to help improve the generalization performance of all the tasks. In this paper, we give a survey for MTL from the perspective of algorithmic modeling, applications and theoretical analyses. For algorithmic modeling, we give a definition of MTL and then classify different MTL algorithms into five categories, including feature learning approach, low-rank approach, task clustering approach, task relation learning approach and decomposition approach as well as discussing the characteristics of each approach. In order to improve the performance of learning tasks further, MTL can be combined with other learning paradigms including semi-supervised learning, active learning, unsupervised learning, reinforcement learning, multi-view learning and graphical models. When the number of tasks is large or the data dimensionality is high, we review online, parallel and distributed MTL models as well as dimensionality reduction and feature hashing to reveal their computational and storage advantages. Many real-world applications use MTL to boost their performance and we review representative works in this paper. Finally, we present theoretical analyses and discuss several future directions for MTL. [ABSTRACT FROM AUTHOR]

This paper proposes a deep learning approach to the adaptive and sequential beamforming design problem for the initial access phase in a mmWave environment with a single-path channel. For a single-user scenario where the problem is equivalent to designing the sequence of sensing beamformers to learn the angle of arrival (AoA) of the dominant path, we propose a novel deep neural network (DNN) that designs the adaptive sensing vectors sequentially based on the available information so far at the base station (BS). By recognizing that the AoA posterior distribution is a sufficient statistic for solving the initial access problem, we use the posterior distribution as the input to the proposed DNN for designing the adaptive sensing strategy. However, computing the posterior distribution can be computationally challenging when the channel fading coefficient is unknown. To address this issue, this paper proposes to use an estimate of the fading coefficient to compute an approximation of the posterior distribution. Further, this paper shows that the proposed DNN can deal with practical beamforming constraints such as the constant modulus constraint. Numerical results demonstrate that compared to the existing adaptive and non-adaptive beamforming schemes, the proposed DNN-based adaptive sensing strategy achieves a significantly better AoA acquisition performance. [ABSTRACT FROM AUTHOR]

This paper proposes a deep learning approach to a class of active sensing problems in wireless communications in which an agent sequentially interacts with an environment over a predetermined number of time frames to gather information in order to perform a sensing or actuation task for maximizing some utility function. In such an active learning setting, the agent needs to design an adaptive sensing strategy sequentially based on the observations made so far. To tackle such a challenging problem in which the dimension of historical observations increases over time, we propose to use a long short-term memory (LSTM) network to exploit the temporal correlations in the sequence of observations and to map each observation to a fixed-size state information vector. We then use a deep neural network (DNN) to map the LSTM state at each time frame to the design of the next measurement step. Finally, we employ another DNN to map the final LSTM state to the desired solution. We investigate the performance of the proposed framework for adaptive channel sensing problems in wireless communications. In particular, we consider the adaptive beamforming problem for mmWave beam alignment and the adaptive reconfigurable intelligent surface sensing problem for reflection alignment. Numerical results demonstrate that the proposed deep active sensing strategy outperforms the existing adaptive or nonadaptive sensing schemes. [ABSTRACT FROM AUTHOR]

With the increasing ubiquity of computing, more engineering programs now require their students to take one or more computing courses. At institutions where significant numbers of engineering students take computer courses, computing instructors and educators often assume roles that have them teaching their computing courses for non-majors as service courses, dealing with students with diverse backgrounds and varied motivations. Although teaching computing courses to non-majors is not new, the increasing importance of computing in future undergraduate engineering curricula poses new challenges. In this Special Issue, four of the papers offer insight into, and give evidence of, teaching computing to engineering students; the fifth paper investigates computational modeling abilities in conceptual understanding of electric circuits. [ABSTRACT FROM AUTHOR]

Network alignment aims at inferring a set of anchor links matching the shared entities between different information networks, which has become a prerequisite step for effective fusion of multiple information networks. In this paper, we will study the network alignment problem to fuse online social networks specifically. Social network alignment is extremely challenging to address due to several reasons, i.e., lack of training data, network heterogeneity and one-to-one constraint. Existing network alignment works usually require a large number of training instances, but such a demand can hardly be met in applications, as manual anchor link labeling is extremely expensive. Significantly different from other homogeneous network alignment works, information in online social networks is usually of heterogeneous categories, the incorporation of which in model building is not an easy task. Furthermore, the one-to-one cardinality constraint on anchor links renders their inference process intertwistingly correlated. To resolve these three challenges, a novel network alignment model, namely ActiveIter (Active Iterative Alignment), is introduced in this paper. The model ActiveIter defines a set of inter-network meta diagrams for anchor link feature extraction, adopts active learning for effective label query and uses greedy link selection for anchor link cardinality filtering. Extensive experiments were performed on a real-world aligned networks dataset, and the experimental results have demonstrated the effectiveness of ActiveIter compared with other state-of-the-art baseline methods. [ABSTRACT FROM AUTHOR]

Lithography simulation is one of the key steps in physical verification, enabled by the substantial optical and resist models. A resist model bridges the aerial image simulation to printed patterns. While the effectiveness of learning-based solutions for resist modeling has been demonstrated, they are considerably data-demanding. Meanwhile, a set of manufactured data for a specific lithography configuration is only valid for the training of one single model, indicating low data efficiency. Due to the complexity of the manufacturing process, obtaining enough data for acceptable accuracy becomes very expensive in terms of both time and cost, especially during the evolution of technology generations when the design space is intensively explored. In this paper, we propose a new resist modeling framework for contact layers, utilizing existing data from old technology nodes and active selection of data in a target technology node, to reduce the amount of data required from the target lithography configuration. Our framework based on transfer learning and active learning techniques is effective within a competitive range of accuracy, i.e., $3 \times -10 \times $ reduction on the amount of training data with comparable accuracy to the state-of-the-art learning approach. [ABSTRACT FROM AUTHOR]

This paper presents an active learning strategy for robotic systems that takes into account task information, enables fast learning, and allows control to be readily synthesized by taking advantage of the Koopman operator representation. We first motivate the use of representing nonlinear systems as linear Koopman operator systems by illustrating the improved model-based control performance with an actuated Van der Pol system. Information-theoretic methods are then applied to the Koopman operator formulation of dynamical systems where we derive a controller for active learning of robot dynamics. The active learning controller is shown to increase the rate of information about the Koopman operator. In addition, our active learning controller can readily incorporate policies built on the Koopman dynamics, enabling the benefits of fast active learning and improved control. Results using a quadcopter illustrate single-execution active learning and stabilization capabilities during free fall. The results for active learning are extended for automating Koopman observables and we implement our method on real robotic systems. [ABSTRACT FROM AUTHOR]

Recently, vehicle type recognition in surveillance images with deep learning has received significant attention in various applications of intelligent transportation systems. However, annotating large-scale images from many surveillance images is tedious and time-consuming, which impedes its application in the real world. This paper aims to resolve this problem by reducing manual labeling in surveillance images, and then maximizing the effect of the few tagged data. Thus, a deep active learning method with a new query strategy is proposed in this paper for vehicle type recognition in surveillance images. First, the proposed method constructs a memory space using a large-scale fully labeled auxiliary dataset collected from the Internet. Subsequently, two metrics, the similarity measurement in memory space and the entropy, are used to simultaneously emphasize the diversity and uncertainty in the query strategy. Moreover, an additional label-consistent term apart from the hyper-parameters is used to adaptively adjust the combination of the two principles in active learning. The proposed method was evaluated on the Comprehensive Cars dataset. The experimental results demonstrated that the proposed method could effectively reduce the annotation cost by up to 40% in surveillance vehicle type recognition compared with the random selection method. [ABSTRACT FROM AUTHOR]

Contribution: This paper provides evidence for the benefits of pair programming early in the curriculum on student performance later in the curriculum. It also confirms the short term benefits of partnerships at scale. Background: Engineers often work in teams, both in industry and in academia. Previous work has shown that partnered programming yields higher student performance during the course in which students partner. Research Questions: This paper investigates the long term effects of early curriculum pair programming on student performance in a following course. Specifically, do student partnerships impact long-term student performance in a later course? Are previously observed effects of partner programming robust to a larger sample size? Methodology: This quantitative analysis examines 2468 students in an introductory computer science sequence at a large, public research institution. The data set comprises two academic years and includes partnership participation, project and exam scores, withdraw rates, time between courses, GPA, and gender. Findings: A positive relationship is observed between partnering in an introductory course, and higher project scores in a future course, where all students worked alone ( $N = 1003$ ). Students with the lowest GPAs experienced the greatest benefits. Additionally, results with a large population of students confirm the observations of previous research, showing that partnerships are associated with an overall positive grade impact during the course in which the partnership takes place ( $N = 2468$ ). [ABSTRACT FROM AUTHOR]

Modern methods for counting people in crowded scenes rely on deep networks to estimate people densities in individual images. As such, only very few take advantage of temporal consistency in video sequences, and those that do only impose weak smoothness constraints across consecutive frames. In this paper, we advocate estimating people flows across image locations between consecutive images and inferring the people densities from these flows instead of directly regressing them. This enables us to impose much stronger constraints encoding the conservation of the number of people. As a result, it significantly boosts performance without requiring a more complex architecture. Furthermore, it allows us to exploit the correlation between people flow and optical flow to further improve the results. We also show that leveraging people conservation constraints in both a spatial and temporal manner makes it possible to train a deep crowd counting model in an active learning setting with much fewer annotations. This significantly reduces the annotation cost while still leading to similar performance to the full supervision case. [ABSTRACT FROM AUTHOR]

Emotion recognition is an important part of affective computing. Human emotions can be described categorically or dimensionally. Accurate machine learning models for emotion classification and estimation usually depend on a large amount of annotated data. However, label acquisition in emotion recognition is costly: obtaining the ground-truth labels of an emotional sample usually requires multiple annotators’ assessments, which is expensive and time-consuming. To reduce the labeling effort in multi-task emotions recognition, the paper proposes an inconsistency measure that can indicate the difference between the labels estimated from the feature space and the label distribution of labeled dataset. Using the inconsistency as an indicator of sample informativeness, we further propose an inconsistency-based multi-task cooperative learning framework that integrates multi-task active learning and self-training semi-supervised learning. Experiments in two multi-task emotion recognition scenarios, multi-dimensional emotion estimation and simultaneous emotion classification and estimation, were conducted under this framework. The results demonstrated that the proposed multi-task active learning framework outperformed several single-task and multi-task active learning approaches. [ABSTRACT FROM AUTHOR]

Reinforcement learning (RL) has demonstrated its ability to solve high dimensional tasks by leveraging non-linear function approximators. However, these successes are mostly achieved by ’black-box’ policies in simulated domains. When deploying RL to the real world, several concerns regarding the use of a ’black-box’ policy might be raised. In order to make the learned policies more transparent, we propose in this paper a policy iteration scheme that retains a complex function approximator for its internal value predictions but constrains the policy to have a concise, hierarchical, and human-readable structure, based on a mixture of interpretable experts. Each expert selects a primitive action according to a distance to a prototypical state. A key design decision to keep such experts interpretable is to select the prototypical states from trajectory data. The main technical contribution of the paper is to address the challenges introduced by this non-differentiable prototypical state selection procedure. Experimentally, we show that our proposed algorithm can learn compelling policies on continuous action deep RL benchmarks, matching the performance of neural network based policies, but returning policies that are more amenable to human inspection than neural network or linear-in-feature policies. [ABSTRACT FROM AUTHOR]

Active learning is an effective approach for tasks with limited labeled data. It samples a small set of data to annotate actively and is widely applied in various AI tasks. It uses an iterative process, during which we utilize the current trained model to evaluate all unlabeled samples and annotate the best samples based on a specific query strategy to update the underlying model iteratively. Most existing active learning approaches rely on only the evaluation results generated by the current model and ignore the results from previous iterations. In this paper, we propose using more historical evaluation results which can provide additional information to help better select samples. First, we apply two kinds of heuristic features of the historical evaluation results, the weighted sum of historical results and the fluctuation of the historical evaluation sequence, to improve the effectiveness of active learning sampling. Next, to further and more globally use the information contained in the historical results, we design a novel query strategy that learns how to select samples based on the historical sequences automatically. Our proposed idea is general and can be combined with both basic and state-of-the-art query strategies to achieve improvements. We test our approaches on two common NLP tasks including text classification and named entity recognition. Experimental results show that our methods significantly promote existing methods. [ABSTRACT FROM AUTHOR]

Computer vision-based vehicle detection techniques are widely used in real-world applications. However, most of these techniques aim to detect only single-view vehicles, and their performances are easily affected by partial occlusion. Therefore, this paper proposes a novel multi-view vehicle detection system that uses a part model to address the partial occlusion problem and the high variance between all types of vehicles. There are three features in this paper; firstly, different from Deformable Part Model, the construction of part models in this paper is visual and can be replaced at any time. Secondly, this paper proposes some new part models for detection of vehicles according to the appearance analysis of a large number of modern vehicles by the active learning algorithm. Finally, this paper proposes the method that contains color transformation along with the Bayesian rule to filter out the background to accelerate the detection time and increase accuracy. The proposed method outperforms other methods on given dataset. [ABSTRACT FROM AUTHOR]

Due to the lack of the labeled data and the complex structures of various data, it is very hard to learn the uncertainty and representativeness accurately in active learning. In this paper, we propose a multiple kernel active learning framework that incorporates a group regularizer of distribution information into the estimation of uncertainty. The proposed method takes the advantage of multiple kernel learning to learn the kernel space in which the complex structures can be well captured by kernel weights. Meanwhile, we have developed an efficient optimization algorithm to solve the proposed method. Experimental results on twelve UCI benchmark data sets and eight subsets of ImageNet show that the proposed method outperforms several state-of-the-art active learning methods. Moreover, we also have applied the proposed method to multiple feature scenario on Caltech101, and the promising results are also obtained compared with single feature scenario. [ABSTRACT FROM AUTHOR]

As for fuel cell hybrid electric vehicle equipped with battery (BAT) and ultracapacitor (UC), its dynamic topology structure is complex and different characteristics of three power sources induce challenges in energy management for fuel economy, power sources lifespan, and dynamic performance of the vehicle. In this paper, an energy management strategy (EMS) based on a hierarchical power splitting structure and deep reinforcement learning (DRL) is proposed. In the higher layer strategy of the proposed EMS, the UC is employed to supply peak power and recover braking energy through the adaptive filter based on fuzzy control. Then, the integrated DRL and equivalent consumption minimization strategy framework is proposed to optimize the power allocation of fuel cell (FC) and BAT in the lower layer, to ensure the highly efficient operation of FC and reduce hydrogen consumption. And the action trimming based on heuristic technique is proposed to further restrain the adverse effect of sudden peak power on FC lifespan. The simulation results show the proposed EMS can make the output of FC smoother, improve its working efficiency to alleviate the stress of BAT, and increase by 14.8% compared with the Q-learning strategy in fuel economy under WLTP driving cycle. Meanwhile, the obtained results under UDDSHDV show fuel economy of the proposed EMS can reach dynamic programming (DP) benchmark level of 89.7 $\%$. [ABSTRACT FROM AUTHOR]

In recommender systems, cold-start issues are situations where no previous events, e.g., ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g., item attributes) and initial user ratings are valuable for seizing users’ preferences on a new item. However, previous methods for the item cold-start problem either (1) incorporate content information into collaborative filtering to perform hybrid recommendation, or (2) actively select users to rate the new item without considering content information and then do collaborative filtering. In this paper, we propose a novel recommendation scheme for the item cold-start problem by leveraging both active learning and items’ attribute information. Specifically, we design useful user selection criteria based on items’ attributes and users’ rating history, and combine the criteria in an optimization framework for selecting users. By exploiting the feedback ratings, users’ previous ratings and items’ attributes, we then generate accurate rating predictions for the other unselected users. Experimental results on two real-world datasets show the superiority of our proposed method over traditional methods. [ABSTRACT FROM AUTHOR]

Hyperspectral imaging is a widely used technique in remote sensing in which an imaging spectrometer collects hundreds of images (at different wavelength channels) for the same area on the surface of the earth. In the last two decades, several methods (unsupervised, supervised, and semisupervised) have been proposed to deal with the hyperspectral image classification problem. Supervised techniques have been generally more popular, despite the fact that it is difficult to collect labeled samples in real scenarios. In particular, deep neural networks, such as convolutional neural networks (CNNs), have recently shown a great potential to yield high performance in the hyperspectral image classification. However, these techniques require sufficient labeled samples in order to perform properly and generalize well. Obtaining labeled data is expensive and time consuming, and the high dimensionality of hyperspectral data makes it difficult to design classifiers based on limited samples (for instance, CNNs overfit quickly with small training sets). Active learning (AL) can deal with this problem by training the model with a small set of labeled samples that is reinforced by the acquisition of new unlabeled samples. In this paper, we develop a new AL-guided classification model that exploits both the spectral information and the spatial-contextual information in the hyperspectral data. The proposed model makes use of recently developed Bayesian CNNs. Our newly developed technique provides robust classification results when compared with other state-of-the-art techniques for hyperspectral image classification. [ABSTRACT FROM AUTHOR]

Using mobile Light Detection and Ranging point clouds to accomplish road scene labeling tasks shows promise for a variety of applications. Most existing methods for semantic labeling of point clouds require a huge number of fully supervised point cloud scenes, where each point needs to be manually annotated with a specific category. Manually annotating each point in point cloud scenes is labor intensive and hinders practical usage of those methods. To alleviate such a huge burden of manual annotation, in this paper, we introduce an active learning method that avoids annotating the whole point cloud scenes by iteratively annotating a small portion of unlabeled supervoxels and creating a minimal manually annotated training set. In order to avoid the biased sampling existing in traditional active learning methods, a neighbor-consistency prior is exploited to select the potentially misclassified samples into the training set to improve the accuracy of the statistical model. Furthermore, lots of methods only consider short-range contextual information to conduct semantic labeling tasks, but ignore the long-range contexts among local variables. In this paper, we use a higher order Markov random field model to take into account more contexts for refining the labeling results, despite of lacking fully supervised scenes. Evaluations on three data sets show that our proposed framework achieves a high accuracy in labeling point clouds although only a small portion of labels is provided. Moreover, comparative experiments demonstrate that our proposed framework is superior to traditional sampling methods and exhibits comparable performance to those fully supervised models. [ABSTRACT FROM AUTHOR]

Contribution: This paper reports a curriculum development in hybrid problem-based learning (h-PBL), addresses the design, implementation, effectiveness, and assessment issues of h-PBL, and explains the mixed results observed regarding the impact of problem-based learning (PBL) on student grades from a hybrid perspective. Background: The effect of PBL on student learning is difficult to analyze. Empirical research on h-PBL has been scant in the engineering education field. Intended Outcomes: The hybrid approach described in this paper can be used to guide other course designs. Future research directions are also provided in order to better capture the positive effects of PBL on student learning. Application Design: A 3-D imaging project was developed and implemented using h-PBL. A non-parametric hypothesis test was conducted to compare four-year student performance data collected after the implementation of h-PBL with four-year student performance data collected under traditional lecturing; both sets of students were taught by the same instructor. Findings: Student project grades improved after h-PBL, whereas student cumulative course grades did not show significant improvement. The study suggests that higher ratios and weights of PBL, better timing in introducing PBL, and more integrated course components in the hybrid approach may further improve student performance. [ABSTRACT FROM AUTHOR]

With the increasing penetration of renewable energy, frequency response and its security are of significant concerns for reliable power system operations. Frequency-constrained unit commitment (FCUC) is proposed to address this challenge. Despite existing efforts in modeling frequency characteristics in unit commitment (UC), current strategies can only handle oversimplified low-order frequency response models and do not consider wide-range operating conditions. This paper presents a generic data-driven framework for FCUC under high renewable penetration. Deep neural networks (DNNs) are trained to predict the frequency response using real data or high-fidelity simulation data. Next, the DNN is reformulated as a set of mixed-integer linear constraints to be incorporated into the ordinary UC formulation. In the data generation phase, all possible power injections are considered, and a region-of-interest active sampling is proposed to include power injection samples with frequency nadirs closer to the UFLC threshold, which enhances the accuracy of frequency constraints in FCUC. The proposed FCUC is investigated on the IEEE 39-bus system. Then, a full-order dynamic model simulation using PSS/E verifies the effectiveness of FCUC in frequency-secure generator commitments. [ABSTRACT FROM AUTHOR]

Conventional frequentist learning, as assumed by existing federated learning protocols, is limited in its ability to quantify uncertainty, incorporate prior knowledge, guide active learning, and enable continual learning. Bayesian learning provides a principled approach to address all these limitations, at the cost of an increase in computational complexity. This paper studies distributed Bayesian learning in a wireless data center setting encompassing a central server and multiple distributed workers. Prior work on wireless distributed learning has focused exclusively on frequentist learning, and has introduced the idea of leveraging uncoded transmission to enable “over-the-air” computing. Unlike frequentist learning, Bayesian learning aims at evaluating approximations or samples from a global posterior distribution in the model parameter space. This work investigates for the first time the design of distributed one-shot, or “embarrassingly parallel”, Bayesian learning protocols in wireless data centers via consensus Monte Carlo (CMC). Uncoded transmission is introduced not only as a way to implement “over-the-air” computing, but also as a mechanism to deploy channel-driven MC sampling: Rather than treating channel noise as a nuisance to be mitigated, channel-driven sampling utilizes channel noise as an integral part of the MC sampling process. A simple wireless CMC scheme is first proposed that is asymptotically optimal under Gaussian local posteriors. Then, for arbitrary local posteriors, a variational optimization strategy is introduced. Simulation results demonstrate that, if properly accounted for, channel noise can indeed contribute to MC sampling and does not necessarily decrease the accuracy level. [ABSTRACT FROM AUTHOR]

Acquisition of labeled training samples for affective computing is usually costly and time-consuming, as affects are intrinsically subjective, subtle and uncertain, and hence multiple human assessors are needed to evaluate each affective sample. Particularly, for affect estimation in the 3D space of valence, arousal and dominance, each assessor has to perform the evaluations in three dimensions, which makes the labeling problem even more challenging. Many sophisticated machine learning approaches have been proposed to reduce the data labeling requirement in various other domains, but so far few have considered affective computing. This paper proposes two multi-task active learning for regression approaches, which select the most beneficial samples to label, by considering the three affect primitives simultaneously. Experimental results on the VAM corpus demonstrated that our optimal sample selection approaches can result in better estimation performance than random selection and several traditional single-task active learning approaches. Thus, they can help alleviate the data labeling problem in affective computing, i.e., better estimation performance can be obtained from fewer labeling queries. [ABSTRACT FROM AUTHOR]

Some education specialists are challenging the use of traditional strategies in classrooms and are calling for the use of contemporary teaching and learning techniques. In response to these calls, many field experiments that compare different teaching and learning strategies have been conducted. However, to date, little is known on the outcomes of these strategies specific to the context of engineers and engineering education. The debate on traditional versus contemporary strategies continues, with many traditionalists holding firm to the view that contemporary techniques diminish the academic quality and integrity of teaching and learning. This paper adds to the current debate by assessing the outcome of interactive lectures, a contemporary teaching strategy, in the context of engineering education. Specifically, this paper examines the effect of interactive lectures on student academic achievement and the learning environment. This paper supported the quantitative survey responses with self-reported student reflections. The findings contradict the traditionalist view of teaching and learning; student performance was not significantly different when interactive learning strategies were employed. However, students held a more positive view toward the learning environment and felt that interactive learning enhanced their overall learning experiences and spurred interest in the subject area. This paper concluded that interactive lecturing can be an effective approach in teaching business management in engineering education. [ABSTRACT FROM PUBLISHER]

Quality of Transmission (QoT) estimation, where the received signal quality is predicted before deployment, plays a significant role in efficient resource utilization, such as determining the optimal transmission configuration. Traditionally, it is implemented with analytical models, and often accompanied by large link margins to account for the low estimation accuracy. Machine learning (ML) based methods have been recently demonstrated as an alternative solution with high accuracy. However, they require a large number of training data, which is often expensive to obtain in the context of QoT estimation. In this paper, we use active learning (AL) to achieve data efficient QoT estimation. A learner actively selects the training data to be labeled by applying the strategy of uncertainty sampling which favors data with high model uncertainty. A data selection algorithm compatible with the widely studied artificial neural network (ANN)-based QoT estimator is proposed and experimentally demonstrated in a fiber-wireless integrated testbed. Monte Carlo dropout (MC dropout) is utilized to calculate model uncertainty. To achieve a mean squared error (MSE) of 0.055, the number of training data can be reduced by more than 25% compared with the conventional passive ML. The algorithm is also investigated under different sampling settings and the impact of hyperparameters is discussed. [ABSTRACT FROM AUTHOR]

Contribution: A semester-long project, geared towards a multidisciplinary group of undergraduate engineering students, to design and simulate a large-scale microelectromechanical systems (MEMS) 2-D optical scanner is presented. Background: MEMS component design and fabrication typically requires a cleanroom and costly high-vacuum equipment; these are not available at many small educational institutions. Conventionally, institutions without cleanroom access teach MEMS courses using lectures and videos, but this fails to engage and motivate students because of the absence of hands-on fabrication and design experience. Application Design: The mechatronics project has students use simple accessible tools, including 3-D printing, servomotors, a microcontroller, and mechanical simulation software to design and optimize a large-scale model of a MEMS optical scanner that simulates the 2-D motion of the actual device. Intended Outcomes: This project involves a hands-on approach designed to improve the participating students’ understanding of MEMS devices; its design and process constraints closely resemble aspects of the MEMS industry. Application Design: In addition to a detailed description of the various components of the project, this paper describes methods to assess student progress, and gives reflections on the project’s implementation. The effectiveness of the project is evaluated through assessment data obtained from a total of 65 students over three semesters. Findings: After introducing the project to the course, instructors saw a great increase in interest, and an improvement in performance. Students showed a significant improvement in their understanding of mask design and fabrication process description, as demonstrated by their final exam grades. [ABSTRACT FROM AUTHOR]

Weakly supervised temporal action localization aims at learning the instance-level action pattern from the video-level labels, where a significant challenge is action-context confusion. To overcome this challenge, one recent work builds an action-click supervision framework. It requires similar annotation costs but can steadily improve the localization performance when compared to the conventional weakly supervised methods. In this paper, by revealing that the performance bottleneck of the existing approaches mainly comes from the background errors, we find that a stronger action localizer can be trained with labels on the background video frames rather than those on the action frames. To this end, we convert the action-click supervision to the background-click supervision and develop a novel method, called BackTAL. Specifically, BackTAL implements two-fold modeling on the background video frames, i.e., the position modeling and the feature modeling. In position modeling, we not only conduct supervised learning on the annotated video frames but also design a score separation module to enlarge the score differences between the potential action frames and backgrounds. In feature modeling, we propose an affinity module to measure frame-specific similarities among neighboring frames and dynamically attend to informative neighbors when calculating temporal convolution. Extensive experiments on three benchmarks are conducted, which demonstrate the high performance of the established BackTAL and the rationality of the proposed background-click supervision. [ABSTRACT FROM AUTHOR]

Pathology analysis is crucial to precise cancer diagnoses and the succeeding treatment plan as well. To detect abnormality in histopathology images with prevailing patch-based convolutional neural networks (CNNs), contextual information often serves as a powerful cue. However, as whole-slide images (WSIs) are characterized by intense morphological heterogeneity and extensive tissue scale, a straightforward visual span to a larger context may not well capture the information closely associated with the focal patch. In this paper, we propose a novel pixel-offset based patch-location method to identify high-representative tissues, with a CNN backbone. Pathology Deformable Conditional Random Field (PDCRF) is proposed to learn the offsets and weights of neighboring contexts in a spatial-adaptive manner, to search for high-representative patches. A CNN structure with the localized patches as training input is then capable of consistently reaching superior classification outcomes for histology images. Overall, the proposed method has achieved state-of-the-art performance, in terms of the test classification accuracy improvement to the baseline by 1.15-2.60%, 0.78-1.78%, and 1.47-2.18% on TCGA public datasets of TCGA-STAD, TCGA-COAD, and TCGA-READ respectively. It also achieves 88.95% test accuracy and 0.920 test AUC on Camelyon 16. To show the effectiveness of the proposed framework on downstream tasks, we take a further step by incorporating an active learning model, which noticeably reduces the number of manual annotations by PDCRF to reach a parallel patch-based histology classifier. [ABSTRACT FROM AUTHOR]

Most existing discriminative tracking algorithms use a sampling-and-labeling strategy to collect examples and treat the training example collection as a task that is independent of classifier learning. However, the examples collected directly by sampling are neither necessarily informative nor intended to be useful for classifier learning. Updating the classifier with these examples might introduce ambiguity to the tracker. In this paper, we present a novel online discriminative tracking framework that explicitly couples the objectives of example collection and classifier learning. Our method uses Laplacian regularized least squares (LapRLS) to learn a robust classifier that can sufficiently exploit unlabeled data and preserve the local geometrical structure of the feature space. To ensure the high classification confidence of the classifier, we propose an active example selection approach to automatically select the most informative examples for LapRLS. Part of the selected examples that satisfy strict constraints are labeled to enhance the adaptivity of our tracker, which actually provides robust supervisory information to guide semisupervised learning. With active example selection, we are able to avoid the ambiguity introduced by an independent example collection strategy and to alleviate the drift problem caused by misaligned examples. Comparison with the state-of-the-art trackers on the comprehensive benchmark demonstrates that our tracking algorithm is more effective and accurate. [ABSTRACT FROM AUTHOR]

This paper proposes an active learning algorithm and models which can gradually learn individual’s preference through pairwise comparisons. The active learning scheme aims at finding individual’s most preferred choice (e.g. an airline itinerary) with minimized number of pairwise comparisons. The pairwise comparisons are encoded into probabilistic models based on assumptions of choice models and deep Gaussian processes. More specifically, this paper develops two novel probabilistic models assuming correlated Gumbel noises and latent utility functions. One is based on shallow Gaussian priors and the other assumes deep Gaussian priors. In the active learning algorithm, the next-to-compare decision is determined by an original acquisition function. The proposed algorithm and models have been benchmarked using functions with multiple local optima and one public airline itinerary dataset. In both experiments, nests are designed to capture correlated Gumbel noises. The experiments indicate the effectiveness of our active learning algorithm and models. The deep Gaussian models are proven to find the best choice with a lower number of pairwise comparisons than the shallow one. In both experiments, deep Gaussian models outperform the shallow model. The shallow model is recommended when the choice set is large and less computational time is required (e.g. in one experiment, deep Gaussian models require approximately 60%-70% more time on average). [ABSTRACT FROM AUTHOR]

Classification is an important technique for remote sensing data interpretation. In order to enhance the performance of a supervised classifier and ensure the lowest possible cost of the training samples used in the process, active learning (AL) can be used to optimize the training sample set. At the same time, integrating spatial information can help to enhance the separability between similar classes, which can in turn reduce the need for training samples in AL. To effectively integrate spatial information into the AL framework, this paper proposes a new active relearning (ARL) model for remote sensing image classification. In particular, our model is used to relearn the spatial features on the classification map, which contributes significantly to enhancing the performance of the classifier. We integrate the relearning model into the AL framework, with the aim to accelerate the convergence of AL and further reduce the labeling cost. Under the newly developed ARL framework, we propose two spatial–spectral uncertainty criteria to optimize the procedure for selecting new training samples. Furthermore, an adaptive multiwindow ARL model is also introduced in this paper. Our experiments with two hyperspectral images and two very high resolution images indicate that the ARL model exhibits faster convergence speed with fewer samples than traditional AL methods. Our results also suggest that the proposed spatial–spectral uncertainty criteria and the multiwindow version can further improve the performance when implementing ARL. [ABSTRACT FROM AUTHOR]

This paper studies electrical engineering learners’ preferences for learning methods with various degrees of activity. Less active learning methods such as homework and peer reviews are investigated, as well as a newly introduced very active (constructive) learning method called “slectures,” and some others. The results suggest that graduate students’ perception of the usefulness of the activity increases with its level of activity. For undergraduate students, an increased perception of the usefulness of the activity was observed for lightly active but structured learning methods. Group-based analysis focusing on two types of learners, defined as “instructor-dependent” and “instructor-independent” according to their perception of the usefulness of the classroom lectures, was also performed. The results suggest that instructor-independent learners may benefit more from active learning methods than instructor-dependent learners. For example, instructor-independent undergraduate learners were found to perceive the homework assignment as being more useful than the lectures. Such a preference was not seen in the average group data. In fact, no learning method was found to be perceived as more useful than the lectures, on average. Thus this paper illustrates the pertinence of group-based data analysis. [ABSTRACT FROM AUTHOR]

Accurate acquisition of air quality is important for improving human well-being. However, directly monitoring air quality at all locations is costly. The challenge is how we can select a small number of locations to monitor the air quality such that the estimation error of air quality at other locations can be minimized. In this paper, a general location selection strategy is proposed based on active learning, which involves iterations of a selector and an estimator. We implement four instances of this general strategy to embody it: KAL (Active Learning based on Kriging), TAL (Active Learning based on Regression Tree), KMAL (Active Learning based on Kriging and MPGR) and TMAL (Active Learning based on Regression Tree and MPGR). The estimator of KAL or TAL can estimate the air quality at remaining locations from air quality samples at monitoring locations, leveraging spatial or cross-domain correlation of air quality. The selecting indicators of their selectors are designed to measure the uncertainty of unlabeled samples according to their estimators. KMAL and TMAL are upgrades of the former two, respectively, by introducing MPGR (Manifold Preserving Graph Reduction) to also take the representativeness of unlabeled samples into account. The experimental results show that the proposed strategy can achieve a low estimation error with few monitoring locations. Particularly, given the same budget (i.e., the number of monitoring locations), the estimation error is reduced from about 20 percent of baselines to 15 percent by KAL and to 5 percent by KMAL; and TAML likewise. [ABSTRACT FROM AUTHOR]

Error disagreement-based active learning (AL) selects the data that maximally update the error of a classification hypothesis. However, poor human supervision (e.g., few labels, improper classifier parameters) may weaken or clutter this update; moreover, the computational cost of performing a greedy search to estimate the errors using a deep neural network is intolerable. In this paper, a novel disagreement coefficient based on distribution, not error, provides a tighter bound on label complexity, which further guarantees its generalization in hyperbolic space. The focal points derived from the squared Lorentzian distance, present more effective hyperbolic representations on aspherical distribution from geometry, replacing the typical euclidean, kernelized, and Poincaré centroids. Experiments on different deep AL tasks show that, the focal representation adopted in a tree-likeliness splitting, significantly performs better than typical baselines of centroid representations and error disagreement, and state-of-the-art neural network architectures-based AL, dramatically accelerating the learning process. [ABSTRACT FROM AUTHOR]

In this paper, we propose an ambiguousness-aware state evolution (AASE) method which represents the uncertainty of the input sequence and evolves the subsequent skeletons to generate a reasonable full-length sequence for action prediction. Unlike most existing methods that enforce partial sequences with the labels of full-length videos and ignore the semantic information of the subsequent action, we develop an evolution method by predicting the instructional actions and generating the reasonable candidate subsequent actions, so that the ambiguity of the full sequence’s label supervising for the partial actions can be effectively alleviated. Our method generates the rational subsequent actions under the instructional action class to complement the partially observed action sequence. We design two criteria for a rational generation: 1) the instruction of subsequent action keeps the semantic consistency with the observed sequence; 2) the generation sequence is satisfied with the distribution of the sequence of real data. Moreover, we design an uncertainty module to decide the instructional action class for the generation network. AASE predicts instructional actions with uncertainty learning and evolves different instructional actions by generating the subsequent skeletons, which find the most probable action to represent the partially observed action by learning the way of perceiving the tendency of the ongoing action. We conduct experiments on seven widely used action datasets: NTU-60, NTU-120, UCF101, UT-Interaction, BIT, PKU-MMD and HMDB51, and our experimental results clearly demonstrate that our method achieves very competitive performance with state-of-the-art. [ABSTRACT FROM AUTHOR]

Deep Neural Networks (DNNs) often rely on vast datasets for training. Given the large size of such datasets, it is conceivable that they contain specific samples that either do not contribute or negatively impact the DNN’s optimization. Modifying the training distribution to exclude such samples could provide an effective solution to improve performance and reduce training time. This paper proposes to scale up ensemble Active Learning (AL) methods to perform acquisition at a large scale (10k to 500k samples at a time). We do this with ensembles of hundreds of models, obtained at a minimal computational cost by reusing intermediate training checkpoints. This allows us to automatically and efficiently perform a training data subset search for large labeled datasets. We observe that our approach obtains favorable subsets of training data, which can be used to train more accurate DNNs than training with the entire dataset. We perform an extensive experimental study of this phenomenon on three image classification benchmarks (CIFAR-10, CIFAR-100, and ImageNet), as well as an internal object detection benchmark for prototyping perception models for autonomous driving. Unlike existing studies, our experiments on object detection are at the scale required for production-ready autonomous driving systems. We provide insights on the impact of different initialization schemes, acquisition functions, and ensemble configurations at this scale. Our results provide strong empirical evidence that optimizing the training data distribution can significantly benefit large-scale vision tasks. [ABSTRACT FROM AUTHOR]

In the Master’s of Telecommunication Engineering program at the University of Deusto, Spain, courses in communication circuit design, electronic instrumentation, advanced systems for signal processing and radiocommunication systems allow students to acquire concepts crucial to the fields of electronics and communication. During the educational project presented in this paper, students build a continuous-wave frequency-modulation (CWFM) Doppler radar system from components as simple as ordinary cocoa cans and common electronics components placed on a breadboard without any soldering. One of the goals of the project is to stimulate students' interest in building an entire, completely functional communication system that integrates the knowledge acquired in the various courses and whose functioning they can check in real scenarios. This paper describes this learning project and the ways in which it helps students understand and connect all the concepts that underlie a fully operative communications system, thus meeting the competencies and learning outcomes of the courses involved in the project. [ABSTRACT FROM PUBLISHER]

Active learning algorithms attempt to overcome the labeling bottleneck by asking queries from large collection of unlabeled examples. Existing batch mode active learning algorithms suffer from three limitations: (1) The methods that are based on similarity function or optimizing certain diversity measurement, in which may lead to suboptimal performance and produce the selected set with redundant examples. (2) The models with assumption on data are hard in finding images that are both informative and representative. (3) The problem of noise labels has been an obstacle for algorithms. In this paper, we propose a novel active learning method that makes embeddings of labeled examples to those of unlabeled ones and back via deep neural networks. The active scheme makes correct association cycles that end up at the same class from that the association was started, which considers both the informativeness and representativeness of examples, as well as being robust to the noise labels. We apply our active learning method to semi-supervised classification and clustering. The submodular function is designed to reduce the redundancy of the selected examples. Specifically, we incorporate our batch mode active scheme into the classification approaches, in which the generalization ability is improved. For semi-supervised clustering, we try to use our active scheme for constraints to make fast convergence and perform better than unsupervised clustering. Finally, we apply our active learning method to data filtering. To validate the effectiveness of the proposed algorithms, extensive experiments are conducted on diversity benchmark datasets for different tasks, i.e., classification, clustering, and data filtering, and the experimental results demonstrate consistent and substantial improvements over the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Contribution: Portable learning instrumentation has become common in university classrooms and laboratories, but few publications assess the effects of these technologies on student retention. This paper addresses this under-researched connection between the use of portable learning technologies, incorporated into an Introduction to Computer Engineering course, and student retention. Background: The desire for active learning experiences has promoted the use of portable, hands-on technologies in classrooms and laboratories. However, published results from such efforts do not often assess the impact of such tools on student retention. In Fall 2015, the Kansas State University Department of Electrical and Computer Engineering overhauled an introductory computer engineering course, incorporating portable learning tools with the aims to increase student retention, where a secondary focus related to helping students understand the limitations of portable hardware platforms. Intended Outcomes: The goal was to improve student confidence and the retention of first- and second-year students who took the course. Application Design: Laboratory exercises used portable technologies and focused on hardware limitations. Summative surveys helped to quantify the impact of the new course structure on student confidence. The retention of first- and second-year students who took the course was also investigated. Findings: Survey results indicated that the course transformation positively affected student confidence (measured directly and indirectly). Retention of second-year students who took the course improved to a two-year average of 51%, from a 40% average for the three prior years. [ABSTRACT FROM AUTHOR]

In spite of maturity to the modern electronic design automation (EDA) tools, optimized designs at architectural stage may become suboptimal after going through physical design flow. Adder design has been such a long studied fundamental problem in very large-scale integration industry yet designers cannot achieve optimal solutions by running EDA tools on the set of available prefix adder architectures. In this paper, we enhance a state-of-the-art prefix adder synthesis algorithm to obtain a much wider solution space in architectural domain. On top of that, a machine learning-based design space exploration methodology is applied to predict the Pareto frontier of the adders in physical domain, which is infeasible by exhaustively running EDA tools for innumerable architectural solutions. Considering the high cost of obtaining the true values for learning, an active learning algorithm is proposed to select the representative data during learning process, which uses less labeled data while achieving better quality of Pareto frontier. Experimental results demonstrate that our framework can achieve Pareto frontier of high quality over a wide design space, bridging the gap between architectural and physical designs. Source code and data are available at https://github.com/yuzhe630/adder-DSE. [ABSTRACT FROM AUTHOR]

In this paper, we propose an approach to estimate and quantify the degree of extraversion for crowd motion based on individual trajectories. Extraversion is a typical personality that is often observed in human behaviors. We present a composite motion descriptor, which integrates the basic motion information and social metrics, to describe the extraversion of each individual in a crowd. In order to train a universal scoring function that can measure the degrees of extraversion, we incorporate the active learning technique with the relative attribute approach based on the social grouping behavior in crowd motions. In addition, we demonstrate the performance of the proposed method by measuring the degree of extraversion for real individual trajectories in a crowd and analyzing crowd scenes from a real-world dataset. [ABSTRACT FROM AUTHOR]

Applications challenged by the joint problem of concept drift and class imbalance are attracting increasing research interest. This paper proposes a novel Reinforcement Online Active Learning Ensemble for Drifting Imbalanced data stream (ROALE-DI). The ensemble classifier has a long-term stable classifier and a dynamic classifier group which applies a reinforcement mechanism to increase the weight of the dynamic classifiers, which perform better on the minority class, and decreases the weight of the opposite. When the data stream is class imbalanced, the classifiers will lack the training samples of the minority class. To supply training samples, when creating a new classifier, the labeled instances buffer is used to provide instances of the minority class. Then, a hybrid labeling strategy that combines the uncertainty strategy and imbalance strategy is proposed to define whether to obtain the real label of an instance. An experimental evaluation compares the classification performance of the proposed method with semi-supervised and supervised algorithms on both real-world and synthetic data streams. The results show that the ROALE-DI achieves higher Area Under the ROC Curve (AUC) and accuracy values with even fewer real labels, and the labeling cost dynamically adjusts according to the concept drift and class imbalance ratio. [ABSTRACT FROM AUTHOR]

Unsupervised active learning has become an active research topic in the machine learning and computer vision communities, whose goal is to choose a subset of representative samples to be labeled in an unsupervised setting. Most of existing approaches rely on shallow linear models by assuming that each sample can be well approximated by the span (i.e., the set of all linear combinations) of the selected samples, and then take these selected samples as the representative ones for manual labeling. However, the data do not necessarily conform to the linear models in many real-world scenarios, and how to model nonlinearity of data often becomes the key point of unsupervised active learning. Moreover, the existing works often aim to well reconstruct the whole dataset, while ignore the important cluster structure, especially for imbalanced data. In this paper, we present a novel deep unsupervised active learning framework. The proposed method can explicitly learn a nonlinear embedding to map each input into a latent space via a deep neural network, and introduce a selection block to select the representative samples in the learnt latent space through a self-supervised learning strategy. In the selection block, we aim to not only preserve the global structure of the data, but also capture the cluster structure of the data in order to well handle the data imbalance issue during sample selection. Meanwhile, we take advantage of the clustering result to provide self-supervised information to guide the above processes. Finally, we attempt to preserve the local structure of the data, such that the data embedding becomes more precise and the model performance can be further improved. Extensive experimental results on several publicly available datasets clearly demonstrate the effectiveness of our method, compared with the state-of-the-arts. [ABSTRACT FROM AUTHOR]

Human action recognition which recognizes human actions in a video is a fundamental task in computer vision field. Although multiple existing methods with single-view or multi-view have been presented for human action recognition, these recognition approaches cannot be extended into new action recognition or action classification tasks, as well as discover underlying correlations among different views. To tackle the above problem, this paper proposes a new lifelong multi-view subspace learning framework for continuous human action recognition, which could exploit the complementary information amongst different views from a lifelong learning perspective. More specifically, a set of view-specific libraries is established to gradually store the useful information within multiple views. As a new action recognition task comes, we decompose the model parameters into a set of embedded parameters over view-specific libraries. A latent representation subspace is constructed via encouraging it to be close to different view-specific libraries, which can leverage the high-order correlations among different views and further avoid partial information for action recognition task. Meanwhile, we propose to employ an alternating direction strategy to optimize our proposed method. Empirical studies on real-world multi-view action recognition datasets have shown that our proposed framework attains the superior recognition performance and saves the computational time when continually learning new action recognition tasks. [ABSTRACT FROM AUTHOR]

Remote laboratories give students the opportunity of experimenting in STEM by using the Internet to control and measure an experimental setting. Remote laboratories are increasingly used in the classroom to complement, or substitute for, hands-on laboratories, so it is important to know its learning value. While many authors approach this question through qualitative analyses, this paper reports a replicated quantitative study that evaluates the teaching performance of one of these resources, the virtual instrument systems in reality (VISIR) remote laboratory. VISIR, described here, is the most popular remote laboratory for basic analog electronics. This paper hypothesizes that use of a remote laboratory has a positive effect on students’ learning process. This report analyzes the effect of the use of VISIR in five different groups of students from two different academic years (2013–2014 and 2014–2015), with three teachers and at two educational levels. The empirical experience focuses on Ohm’s Law. The results obtained are reported using a pretest and post-test design. The tests were carefully designed and analyzed, and their reliability and validity were assessed. The analysis of knowledge test question results shows that the post-test scores are higher that the pretest. The difference is significant according to Wilcoxon test ( p <0.001 ), and produces a Cohen effect size of 1.0. The VISIR remote laboratory’s positive effect on students’ learning processes indicates that remote laboratories can produce a positive effect in students’ learning if an appropriate activity is used. [ABSTRACT FROM PUBLISHER]

Engineering education research has empirically validated the effectiveness of active learning over traditional instructional methods. However, the dissemination of education research into instructional practice has been slow. Faculty workshops for current and future instructors offer a solution to promote the widespread adoption of active learning in engineering classrooms. However, most of the existing research has relied on faculty self-reporting to evaluate the success of engineering faculty workshops. Researchers have noted variations in self-reporting and the actual classroom implementation. In this paper, using classroom observations, faculty interviews, student surveys, and focus groups, the authors examine an engineering instructor's postworkshop implementation of active learning in an electrical engineering course. The findings demonstrate the influence of faculty conceptions of teaching in the selection and design of activities and the subsequent impact of these design choices on student engagement. The authors report the instructor's and students' responses to the active learning exercises and present recommendations for engineering faculty development. [ABSTRACT FROM PUBLISHER]

Deep neural networks, in particular convolutional networks, have rapidly become a popular choice for analyzing histopathology images. However, training these models relies heavily on a large number of samples manually annotated by experts, which is cumbersome and expensive. In addition, it is difficult to obtain a perfect set of labels due to the variability between expert annotations. This paper presents a novel active learning (AL) framework for histopathology image analysis, named PathAL. To reduce the required number of expert annotations, PathAL selects two groups of unlabeled data in each training iteration: one “informative” sample that requires additional expert annotation, and one “confident predictive” sample that is automatically added to the training set using the model’s pseudo-labels. To reduce the impact of the noisy-labeled samples in the training set, PathAL systematically identifies noisy samples and excludes them to improve the generalization of the model. Our model advances the existing AL method for medical image analysis in two ways. First, we present a selection strategy to improve classification performance with fewer manual annotations. Unlike traditional methods focusing only on finding the most uncertain samples with low prediction confidence, we discover a large number of high confidence samples from the unlabeled set and automatically add them for training with assigned pseudo-labels. Second, we design a method to distinguish between noisy samples and hard samples using a heuristic approach. We exclude the noisy samples while preserving the hard samples to improve model performance. Extensive experiments demonstrate that our proposed PathAL framework achieves promising results on a prostate cancer Gleason grading task, obtaining similar performance with 40% fewer annotations compared to the fully supervised learning scenario. An ablation study is provided to analyze the effectiveness of each component in PathAL, and a pathologist reader study is conducted to validate our proposed algorithm. [ABSTRACT FROM AUTHOR]