Reviewerly/exHarmony huggingface dataset:
Look Before You Leap! Designing a Human-Centered AI System for Change Risk Assessment

Reducing the number of failures in a production system is one of the most challenging problems in technology driven industries, such as, the online retail industry. To address this challenge, change management has emerged as a promising sub-field in operations that manages and reviews the changes to be deployed in production in a systematic manner. However, it is practically impossible to manually review a large number of changes on a daily basis and assess the risk associated with them. This warrants the development of an automated system to assess the risk associated with a large number of changes. There are a few commercial solutions available to address this problem but those solutions lack the ability to incorporate domain knowledge and continuous feedback from domain experts into the risk assessment process. As part of this work, we aim to bridge the gap between model-driven risk assessment of change requests and the assessment of domain experts by building a continuous feedback loop into the risk assessment process. Here we present our work to build an end-to-end machine learning system along with the discussion of some of practical challenges we faced related to extreme skewness in class distribution, concept drift, estimation of the uncertainty associated with the model's prediction and the overall scalability of the system.
Pengaruh Penggunaan Media Pembelajaran Scrapbook untuk Meningkatkan Hasil Belajar IPA Peserta Didik Kelas IV Sekolah Dasar

The results of observations of science learning in class show that there are still many students who seem to have difficulty reading and understanding what the teacher is saying. Likewise, teachers have not used media that can help students understand learning more easily. Thus, there is a need for innovative changes in learning that are able to help students learn science more easily and interestingly. This study aims to determine: 1) the effect of student learning outcomes in science lessons; and 2) The effect of student learning outcomes in learning using Scrapbook learning media. Experimental method with quantitative and quasi-experimental approach in the form of One Group Pretest-Posttest Design. The research was conducted in the fourth grade of SDN 3 Mekarbakti Garut. The results of the study are as follows: 1) There is an effect of student learning outcomes in science lessons 2) The effect of student learning outcomes after using Scrapbook learning media. The conclusion in this study is that there is a significant effect of learning outcomes on science subjects after using Scrapbook learning media
Quantum Local Differential Privacy and Quantum Statistical Query Model

Quantum statistical queries provide a theoretical framework for investigating the computational power of a learner with limited quantum resources. This model is particularly relevant in the current context, where available quantum devices are subject to severe noise and have limited quantum memory. On the other hand, the framework of quantum differential privacy demonstrates that noise can, in some cases, benefit the computation, enhancing robustness and statistical security. In this work, we establish an equivalence between quantum statistical queries and quantum differential privacy in the local model, extending a celebrated classical result to the quantum setting. Furthermore, we derive strong data processing inequalities for the quantum relative entropy under local differential privacy and apply this result to the task of asymmetric hypothesis testing with restricted measurements. Finally, we consider the task of quantum multi-party computation under local differential privacy. As a proof of principle, we demonstrate that the parity function is efficiently learnable in this model, whereas the corresponding classical task requires exponentially many samples.
Progressive Cross-modal Knowledge Distillation for Human Action Recognition

Wearable sensor-based Human Action Recognition (HAR) has achieved remarkable success recently. However, the accuracy performance of wearable sensor-based HAR is still far behind the ones from the visual modalities-based system (i.e., RGB video, skeleton, and depth). Diverse input modalities can provide complementary cues and thus improve the accuracy performance of HAR, but how to take advantage of multi-modal data on wearable sensor-based HAR has rarely been explored. Currently, wearable devices, i.e., smartwatches, can only capture limited kinds of non-visual modality data. This hinders the multi-modal HAR association as it is unable to simultaneously use both visual and non-visual modality data. Another major challenge lies in how to efficiently utilize multimodal data on wearable devices with their limited computation resources. In this work, we propose a novel Progressive Skeleton-to-sensor Knowledge Distillation (PSKD) model which utilizes only time-series data, i.e., accelerometer data, from a smartwatch for solving the wearable sensor-based HAR problem. Specifically, we construct multiple teacher models using data from both teacher (human skeleton sequence) and student (time-series accelerometer data) modalities. In addition, we propose an effective progressive learning scheme to eliminate the performance gap between teacher and student models. We also designed a novel loss function called Adaptive-Confidence Semantic (ACS), to allow the student model to adaptively select either one of the teacher models or the ground-truth label it needs to mimic. To demonstrate the effectiveness of our proposed PSKD method, we conduct extensive experiments on Berkeley-MHAD, UTD-MHAD, and MMAct datasets. The results confirm that the proposed PSKD method has competitive performance compared to the previous mono sensor-based HAR methods.
Underwater Object Tracking By Image Enhancement And Feature Fusion

Given the complex underwater optical imaging process and low image quality, it is difficult to extract the features of the underwater object to be tracked accurately. Meanwhile, the difficulty of underwater object tracking is further exacerbated by the high degree of freedom in the motion of the underwater object, which is often characterized by morphological changes and rapid movements. To address the above problems, the paper proposes an underwater object tracking method with image enhancement and feature fusion(IEFF). A novel underwater image enhancement method based on color correction and light attenuation prior is added to efficient convolution operators(ECO) for tracking. The object feature extraction and sample space model are also improved in ECO. Experimental results on the self-built database show that the area under the curve of success ratio for our method is better than ECO and other methods.
EPP: interpretable score of model predictive power

The most important part of model selection and hyperparameter tuning is the evaluation of model performance. The most popular measures, such as AUC, F1, ACC for binary classification, or RMSE, MAD for regression, or cross-entropy for multilabel classification share two common weaknesses. First is, that they are not on an interval scale. It means that the difference in performance for the two models has no direct interpretation. It makes no sense to compare such differences between datasets. Second is, that for k-fold cross-validation, the model performance is in most cases calculated as an average performance from particular folds, which neglects the information how stable is the performance for different folds. In this talk, we introduce a new EPP rating system for predictive models. We also demonstrate numerous advantages for this system, First, differences in EPP scores have probabilistic interpretation. Based on it we can assess the probability that one model will achieve better performance than another. Second, EPP scores can be directly compared between datasets. Third, they can be used for navigated hyperparameter tuning and model selection. Forth, we can create embeddings for datasets based on EPP scores.
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks

Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of fine-grained complexity allows us to prove optimal lower-bounds on the complexity of various computational problems, based on the conjectured hardness of certain natural, well-studied problems. This theory has recently been extended to the quantum setting, in two independent papers by Buhrman, Patro, and Speelman (arXiv:1911.05686), and by Aaronson, Chia, Lin, Wang, and Zhang (arXiv:1911.01973). In this paper, we further extend the theory of fine-grained complexity to the quantum setting. A fundamental conjecture in the classical setting states that the 3SUM problem cannot be solved by (classical) algorithms in time O(n^{2-a}), for any a&gt;0. We formulate an analogous conjecture, the Quantum-3SUM-Conjecture, which states that there exist no sublinear O(n^{1-b})-time quantum algorithms for the 3SUM problem. Based on the Quantum-3SUM-Conjecture, we show new lower-bounds on the time complexity of quantum algorithms for several computational problems. Most of our lower-bounds are optimal, in that they match known upper-bounds, and hence they imply tight limits on the quantum speedup that is possible for these problems.
A study for Image compression using Re-Pair algorithm

The compression is an important topic in computer science which allows we to storage more amount of data on our data storage. There are several techniques to compress any file. In this manuscript will be described the most important algorithm to compress images such as JPEG and it will be compared with another method to retrieve good reason to not use this method on images. So to compress the text the most encoding technique known is the Huffman Encoding which it will be explained in exhaustive way. In this manuscript will showed how to compute a text compression method on images in particular the method and the reason to choice a determinate image format against the other. The method studied and analyzed in this manuscript is the Re-Pair algorithm which is purely for grammatical context to be compress. At the and it will be showed the good result of this application.
Continuous abstract wavelet transform on homogeneous space

The support of wavelet transform associated with square integrable irreducible representation of a homogeneous space is shown to have infinite measure. Pointwise homogeneous approximation property for wavelet transform has been investigated. An analogue of Heisenberg type inequality has been also obtained for wavelet transform
$\mathrm{P}$-Optimal Proof Systems for Each $\mathrm{coNP}$-Complete Set and no Complete Problems in $\mathrm{NP}\cap\mathrm{coNP}$ Relative to an Oracle

We build on a working program initiated by Pudl\'ak [Pud17] and construct an oracle relative to which each $\mathrm{coNP}$-complete set has $\mathrm{P}$-optimal proof systems and $\mathrm{NP}\cap\mathrm{coNP}$ does not have complete problems.
Implementation of Optical Deep Neural Networks using the Fabry-Perot Interferometer

Future developments in deep learning applications requiring large datasets will be limited by power and speed limitations of silicon based Von-Neumann computing architectures. Optical architectures provide a low power and high speed hardware alternative. Recent publications have suggested promising implementations of optical neural networks (ONNs), showing huge orders of magnitude efficiency and speed gains over current state of the art hardware alternatives. In this work, the transmission of the Fabry-Perot Interferometer (FPI) is proposed as a low power, low footprint activation function unit. Numerical simulations of optical CNNs using the FPI based activation functions show accuracies of 98% on the MNIST dataset. An investigation of possible physical implementation of the network shows that an ONN based on current tunable FPIs could be slowed by actuation delays, but rapidly developing optical hardware fabrication techniques could make an integrated approach using the proposed FPI setups a powerful solution for previously inaccessible deep learning applications.
Educación a distancia la opción emergente frente a la pandemia

In this paper, the authors will talk about the development of technological platforms and tools that will support the creation and implementation of techno-pedagogical paradigms to tech the XXI Century generations. By proving how the innovative model of the open and distance learning universities (UNAD, for its Spanish acronym) is not run out and can be renewed, taking as an example the COVID-19 pandemic and analyzing the carriers that provide change to a new education, where the need of innovation in higher education in open and distance modalities is an urgent matter. Undoubtedly, learning is one of the human capacities that has most influenced their development and evolution. Thus, the e-education concept is presented as an effort to develop talents and human capacities using the Internet and new information and communication technologies (ICT). This will allow introducing a generalized remote mode, which will create a different culture adjusting the school curriculum to an online strategy, and not a rigid one, that involves technological improvements, so general and specialized knowledge are combined to the needs of scientific, technological, and social development. Teachers work with students differently and provide help through more knowledge and experience. Recent studies are showing that there are more open and online options for teacher professional development and teachers access the Internet to expand their development opportunities through social media platforms. In this sense, the non-attendance process of education has improved its relevance globally. Although, the COVID-19 pandemic caused an accelerator effect on the digital transformation of the educational institutions.
Exploring Hate Speech Detection with HateXplain and BERT

Hate Speech takes many forms to target communities with derogatory comments, and takes humanity a step back in societal progress. HateXplain is a recently published and first dataset to use annotated spans in the form of rationales, along with speech classification categories and targeted communities to make the classification more humanlike, explainable, accurate and less biased. We tune BERT to perform this task in the form of rationales and class prediction, and compare our performance on different metrics spanning across accuracy, explainability and bias. Our novelty is threefold. Firstly, we experiment with the amalgamated rationale class loss with different importance values. Secondly, we experiment extensively with the ground truth attention values for the rationales. With the introduction of conservative and lenient attentions, we compare performance of the model on HateXplain and test our hypothesis. Thirdly, in order to improve the unintended bias in our models, we use masking of the target community words and note the improvement in bias and explainability metrics. Overall, we are successful in achieving model explanability, bias removal and several incremental improvements on the original BERT implementation.
Building a visual semantics aware object hierarchy

The semantic gap is defined as the difference between the linguistic representations of the same concept, which usually leads to misunderstanding between individuals with different knowledge backgrounds. Since linguistically annotated images are extensively used for training machine learning models, semantic gap problem (SGP) also results in inevitable bias on image annotations and further leads to poor performance on current computer vision tasks. To address this problem, we propose a novel unsupervised method to build visual semantics aware object hierarchy, aiming to get a classification model by learning from pure-visual information and to dissipate the bias of linguistic representations caused by SGP. Our intuition in this paper comes from real-world knowledge representation where concepts are hierarchically organized, and each concept can be described by a set of features rather than a linguistic annotation, namely visual semantic. The evaluation consists of two parts, firstly we apply the constructed hierarchy on the object recognition task and then we compare our visual hierarchy and existing lexical hierarchies to show the validity of our method. The preliminary results reveal the efficiency and potential of our proposed method.
Personalization and Relevance in NLG

Despite the recent advances in language modeling techniques, personalization remains a challenge for many NLP tasks. In this talk, we will explore personalization through several different lens to understand how we can make progress on this front, and emphasize why human-centered approach is a crucial part of the solution. First, I will challenge the ground-truth assumption in the context of user or situation sensitive language tasks. In other words, I will argue that the same question might be addressed differently by a system, depending on the user or the situation they are currently facing. Then we’ll discuss what are our user needs, and how can we design these tasks to produce useful and relevant responses, but also what potential harms we should be aware of working on personalization [5]. Next, we will look into personalization in the augmentative and alternative communication (AAC) world. Specifically, how through an icon-based language, individuals with compromised language abilities (that may arise due to Traumatic Brain injury (TBI) or Cerebral Palsy (CP)), we can accommodate their needs and what are the challenges in developing icon-based language models [3]. Third, in the process of personalization, models are expected to accommodate and adapt to the specific language and jargon spoken by the user. What are remaining challenges for deep learning architectures in the process of adapting user data or new domains [2, 4]. Finally, I will share work-in-progress where through Wizard-of-Oz (WoZ) experiments [1] we identify and learn useful actions of social conversational systems in classroom setting.
Adversarial Robustness against Multiple and Single $l_p$-Threat Models via Quick Fine-Tuning of Robust Classifiers

A major drawback of adversarially robust models, in particular for large scale datasets like ImageNet, is the extremely long training time compared to standard ones. Moreover, models should be robust not only to one $l_p$-threat model but ideally to all of them. In this paper we propose Extreme norm Adversarial Training (E-AT) for multiple-norm robustness which is based on geometric properties of $l_p$-balls. E-AT costs up to three times less than other adversarial training methods for multiple-norm robustness. Using E-AT we show that for ImageNet a single epoch and for CIFAR-10 three epochs are sufficient to turn any $l_p$-robust model into a multiple-norm robust model. In this way we get the first multiple-norm robust model for ImageNet and boost the state-of-the-art for multiple-norm robustness to more than $51\%$ on CIFAR-10. Finally, we study the general transfer via fine-tuning of adversarial robustness between different individual $l_p$-threat models and improve the previous SOTA $l_1$-robustness on both CIFAR-10 and ImageNet. Extensive experiments show that our scheme works across datasets and architectures including vision transformers.
A Brief Survey on Adaptive Video Streaming Quality Assessment

Quality of experience (QoE) assessment for adaptive video streaming plays a significant role in advanced network management systems. It is especially challenging in case of dynamic adaptive streaming schemes over HTTP (DASH) which has increasingly complex characteristics including additional playback issues. In this paper, we provide a brief overview of adaptive video streaming quality assessment. Upon our review of related works, we analyze and compare different variations of objective QoE assessment models with or without using machine learning techniques for adaptive video streaming. Through the performance analysis, we observe that hybrid models perform better than both quality-of-service (QoS) driven QoE approaches and signal fidelity measurement. Moreover, the machine learning-based model slightly outperforms the model without using machine learning for the same setting. In addition, we find that existing video streaming QoE assessment models still have limited performance, which makes it difficult to be applied in practical communication systems. Therefore, based on the success of deep learned feature representations for traditional video quality prediction, we also apply the off-the-shelf deep convolutional neural network (DCNN) to evaluate the perceptual quality of streaming videos, where the spatio-temporal properties of streaming videos are taken into consideration. Experiments demonstrate its superiority, which sheds light on the future development of specifically designed deep learning frameworks for adaptive video streaming quality assessment. We believe this survey can serve as a guideline for QoE assessment of adaptive video streaming.
On the Structure of Misère Impartial Games

We consider the abstract structure of the monoid M of mis\`ere impartial game values. Several new results are presented, including a proof that the group of fractions of M is almost torsion-free; a method of calculating the number of distinct games born by day 7; and some new results on the structure of prime games. Also included are proofs of a few older results due to Conway, such as the Cancellation Theorem, that are essential to the analysis but whose proofs are not readily available in the literature. Much of the work presented here was done jointly with John Conway and Dan Hoey, and I dedicate this paper to their memory.
Ask Question First for Enhancing Lifelong Language Learning

Lifelong language learning aims to stream learning NLP tasks while retaining knowledge of previous tasks. Previous works based on the language model and following data-free constraint approaches have explored formatting all data as "begin token (\textit{B}) + context (\textit{C}) + question (\textit{Q}) + answer (\textit{A})" for different tasks. However, they still suffer from catastrophic forgetting and are exacerbated when the previous task's pseudo data is insufficient for the following reasons: (1) The model has difficulty generating task-corresponding pseudo data, and (2) \textit{A} is prone to error when \textit{A} and \textit{C} are separated by \textit{Q} because the information of the \textit{C} is diminished before generating \textit{A}. Therefore, we propose the Ask Question First and Replay Question (AQF-RQ), including a novel data format "\textit{BQCA}" and a new training task to train pseudo questions of previous tasks. Experimental results demonstrate that AQF-RQ makes it easier for the model to generate more pseudo data that match corresponding tasks, and is more robust to both sufficient and insufficient pseudo-data when the task boundary is both clear and unclear. AQF-RQ can achieve only 0.36\% lower performance than multi-task learning.