Reviewerly/exHarmony huggingface dataset:
Prediction of Body Weight of a Person Lying on a Smart Mat in Nonrestraint and Unconsciousness Conditions

We want to predict body weight while lying in bed for an elderly patient who is unable to move by himself/herself. To this end, we have implemented a prototype system that estimates the body weight of a person lying on a smart mat in nonrestraint and unconsciousness conditions. A total of 128 FSR (force sensing resistor) sensors were placed in a 16 × 8-grid structure on the smart mat. We formulated three methods based on the features to be applied: segmentation, average cumulative sum of pressure, and serialization. All the proposed methods were implemented with four different machine-learning models: regression, deep neural network (DNN), convolutional neural network (CNN), and random forest. We compared their performance using MAE and RMSE as evaluation criteria. From the experimental results, we chose the serialization method with the DNN model as the best model. Despite the limitations of the presence of dead space due to the wide spacing between the sensors and the small dataset, the MAE and the RMSE of the body weight prediction of the proposed method was 4.608 and 5.796, respectively. That is, it showed an average error of ±4.6 kg for the average weight of 72.9 kg.
HEVC Watermarking Techniques for Authentication and Copyright Applications: Challenges and Opportunities

Recently, High-Efficiency Video Coding (HEVC/H.265) has been chosen to replace previous video coding standards, such as H.263 and H.264. Despite the efficiency of HEVC, it still lacks reliable and practical functionalities to support authentication and copyright applications. In order to provide this support, several watermarking techniques have been proposed by many researchers during the last few years. However, those techniques are still suffering from many issues that need to be considered for future designs. In this paper, a Systematic Literature Review (SLR) is introduced to identify HEVC challenges and potential research directions for interested researchers and developers. The time scope of this SLR covers all research articles published during the last six years starting from January 2014 up to the end of April 2020. Forty-two articles have met the criteria of selection out of 343 articles published in this area during the mentioned time scope. A new classification has been drawn followed by an identification of the challenges of implementing HEVC watermarking techniques based on the analysis and discussion of those chosen articles. Eventually, recommendations for HEVC watermarking techniques have been listed to help researchers to improve the existing techniques or to design new efficient ones.
Featuring Causal Order in Teleportation With Two Quantum Teleportation Channels

Causal order can improve the quantum information transmission in teleportation due a noisy entangled resource by using an appropriate measurement state on the control state ruling the causal order. In this work, we get analytically the fidelity for the entire process under an arbitrary measurement over such control state and then we get a perfect teleportation by selecting the optimal measurement on it. We also analyse other values characterizing the imperfect entangled state where a perfect teleportation can not be reached. Notably, we determine that the best fidelity does not depend on the probabilities of the control state but on the imperfect initial resource entangled.
Full Deep Neural Network Training On A Pruned Weight Budget.

We introduce a DNN training technique that learns only a fraction of the full parameter set without incurring an accuracy penalty. To do this, our algorithm constrains the total number of weights updated during backpropagation to those with the highest total gradients. The remaining weights are not tracked, and their initial value is regenerated at every access to avoid storing them in memory. This can dramatically reduce the number of off-chip memory accesses during both training and inference, a key component of the energy needs of DNN accelerators. By ensuring that the total weight diffusion remains close to that of baseline unpruned SGD, networks pruned using our technique are able to retain state-of-the-art accuracy across network architectures -- including networks previously identified as difficult to compress, such as Densenet and WRN. With ResNet18 on ImageNet, we observe an 11.7$\times$ weight reduction with no accuracy loss, and up to 24.4$\times$ with a small accuracy impact.
Restricted Minimum Error Entropy Criterion for Robust Classification

The minimum error entropy (MEE) criterion is a powerful approach for non-Gaussian signal processing and robust machine learning. However, the instantiation of MEE on robust classification is a rather vacancy in the literature. The original MEE purely focuses on minimizing Renyi's quadratic entropy of the prediction errors, which could exhibit inferior capability in noisy classification tasks. To this end, we analyze the optimal error distribution with adverse outliers and introduce a specific codebook for restriction, which optimizes the error distribution toward the optimal case. Half-quadratic-based optimization and convergence analysis of the proposed learning criterion, called restricted MEE (RMEE), are provided. The experimental results considering logistic regression and extreme learning machine on synthetic data and UCI datasets, respectively, are presented to demonstrate the superior robustness of RMEE. Furthermore, we evaluate RMEE on a noisy electroencephalogram dataset, so as to strengthen its practical impact.
Single-state semi-quantum key distribution protocol and its security proof

Semi-quantum key distribution (SQKD) can share secret keys by using less quantum resource than its fully quantum counterparts, and this likely makes SQKD become more practical and realizable. In this paper, we present a new SQKD protocol by introducing the idea of B92 protocol in fully quantum cryptography into SQKD. In this protocol, the sender Alice just sends one quantum state to the classical Bob and Bob just prepares a fixed state in the preparation process. It is much simpler than the existing SQKD and potentially much easier to be implemented. It can be seen as a semi-quantum version of B92 protocol, compared to the protocol BKM07 as the semi-quantum version of BB84 in fully quantum cryptography. We verify that it is more efficient than the existing single-state SQKD protocols by introducing an efficiency parameter. Specifically, we prove it is secure against a restricted collective attack by computing a lower bound of the key rate in the asymptotic scenario. Then we can find a threshold value of errors such that for all error rates less than this value, the secure key can be definitely established between the legitimate users definitely. We make an illustration of how to compute the threshold value in case the reverse channel is a depolarizing one with parameter [Formula: see text]. Though the threshold value is a little smaller than those of some existing SQKD protocols, it can be comparable to the B92 protocol in fully quantum cryptography.
FGCRec: Fine-Grained Geographical Characteristics Modeling for Point-of-Interest Recommendation

With the popularity of location-based social networks (LBSNs), Point-of-Interest (POI) recommendation has become an essential location-based service to help people explore novel locations. Although the massive check-in data bring a good opportunity, there are still many challenges in building personalized POI recommender systems based on geographical information. First, current coarse-grained geographical models provide considerably limited improvements on POI recommendations and fail to capture the overall impact of fine-grained geographical characteristics in LBSNs. Second, previous methods such as matrix factorization always give equal weight to each positive example and may not distinguish between their different contributions in learning the objective function. To cope with these challenges, we develop a fine-grained POI recommendation framework that makes full use of the geographical characteristics from both users’ and locations’ perspectives. For capturing the fine-grained geographical influence, we present a unified probability distribution model based on four key geographical characteristics. For mining more contribution information from positive examples, we assign a higher weight to highlight the contribution of a higher check-in frequency by employing a logistic matrix factorization. Finally, experimental results on two real-world datasets demonstrate the effectiveness and superiority of the proposed method.
Multiple instance learning on deep features for weakly supervised object detection with extreme domain shifts

Weakly supervised object detection (WSOD) using only image-level annotations has attracted a growing attention over the past few years. Whereas such task is typically addressed with a domain-specific solution focused on natural images, we show that a simple multiple instance approach applied on pre-trained deep features yields excellent performances on non-photographic datasets, possibly including new classes. The approach does not include any fine-tuning or cross-domain learning and is therefore efficient and possibly applicable to arbitrary datasets and classes. We investigate several flavors of the proposed approach, some including multi-layers perceptron and polyhedral classifiers. Despite its simplicity, our method shows competitive results on a range of publicly available datasets, including paintings (People-Art, IconArt), watercolors, cliparts and comics and allows to quickly learn unseen visual categories.
Parallel in time dynamics with quantum annealers

Abstract Recent years have witnessed an unprecedented increase in experiments and hybrid simulations involving quantum computers. In particular, quantum annealers. There exist a plethora of algorithms promising to outperform classical computers in the near-term future. Here, we propose a parallel in time approach to simulate dynamical systems designed to be executed already on present-day quantum annealers. In essence, purely classical methods for solving dynamics systems are serial. Therefore, their parallelization is substantially limited. In the presented approach, however, the time evolution is rephrased as a ground-state search of a classical Ising model. Such a problem is solved intrinsically in parallel by quantum computers. The main idea is exemplified by simulating the Rabi oscillations generated by a two-level quantum system (i.e. qubit) experimentally.
Multi-Task Learning for Registering Images With Large Deformation

Accurate registration of prostate magnetic resonance imaging (MRI) images of the same subject acquired at different time points helps diagnose cancer and monitor the tumor progress. However, it is very challenging especially when one image was acquired with the use of endorectal coil (ERC) but the other was not, which causes significant deformation. Classical iterative image registration methods are also computationally intensive. Deep learning based registration frameworks have recently been developed and demonstrated promising performance. However, the lack of proper constraints often results in unrealistic registration. In this paper, we propose a multi-task learning based registration network with anatomical constraint to address these issues. The proposed approach uses a cycle constraint loss to achieve forward/backward registration and an inverse constraint loss to encourage diffeomorphic registration. In addition, an adaptive anatomical constraint aiming for regularizing the registration network with the use of anatomical labels is introduced through weak supervision. Our experiments on registering prostate MR images of the same subject obtained at different time points with and without ERC show that the proposed method achieves very promising performance under different measures in dealing with the large deformation. Compared with other existing methods, our approach works more efficiently with average running time less than a second and is able to obtain more visually realistic results.
Contrast trees and distribution boosting

Significance Often machine learning methods are applied and results reported in cases where there is little to no information concerning accuracy of the output. Simply because a computer program returns a result does not ensure its validity. If decisions are to be made based on such results it is important to have some notion of their veracity. Contrast trees represent an approach for assessing the accuracy of many types of machine-learning estimates that are not amenable to standard validation methods. In situations where inaccuracies are detected boosted contrast trees can often improve performance. A special case, distribution boosting, provides an assumption-free method for estimating the full probability distribution of an outcome variable given any set of joint input predictor variable values.
Semi-Supervised Deep Learning for Multi-Tissue Segmentation from Multi-Contrast MRI

Segmentation of thigh tissues (muscle, fat, inter-muscular adipose tissue (IMAT), bone, and bone marrow) from magnetic resonance imaging (MRI) scans is useful for clinical and research investigations in various conditions such as aging, diabetes mellitus, obesity, metabolic syndrome, and their associated comorbidities. Towards a fully automated, robust, and precise quantification of thigh tissues, herein we designed a novel semi-supervised segmentation algorithm based on deep network architectures. Built upon Tiramisu segmentation engine, our proposed deep networks use variational and specially designed targeted dropouts for faster and robust convergence, and utilize multi-contrast MRI scans as input data. In our experiments, we have used 150 scans from 50 distinct subjects from the Baltimore Longitudinal Study of Aging (BLSA). The proposed system made use of both labeled and unlabeled data with high efficacy for training, and outperformed the current state-of-the-art methods with dice scores of 97.52%, 94.61%, 80.14%, 95.93%, and 96.83% for muscle, fat, IMAT, bone, and bone marrow tissues, respectively. Our results indicate that the proposed system can be useful for clinical research studies where volumetric and distributional tissue quantification is pivotal and labeling is a significant issue. To the best of our knowledge, the proposed system is the first attempt at multi-tissue segmentation using a single end-to-end semi-supervised deep learning framework for multi-contrast thigh MRI scans.
Fluctuation-guided search in quantum annealing

In this paper, the author shows how the uneven sampling of ground-state manifolds due to quantum fluctuations can be exploited to trade optimality of the solution for flexibility, where some variables can be changed at little or no cost. Leveraging this tradeoff could be practically important, e.g., in hybrid algorithms where some penalties cannot be directly implemented on the annealer.
Bot detection in twitter landscape using unsupervised learning

The aim of this paper is to identify and understand bot activity in twitter discussion. The prevalence of Twitter bots have gained significant limelight recently due to their misuse in influencing public sentiment for political gains. For our analysis, we use Twitter data of 2019 Canadian Elections. We perform principal component analysis and K-means clustering on the data set. Using the results we isolate bots from human accounts.
Zeroth-Order Algorithms for Smooth Saddle-Point Problems

Saddle-point problems have recently gained increased attention from the machine learning community, mainly due to applications in training Generative Adversarial Networks using stochastic gradients. At the same time, in some applications only a zeroth-order oracle is available. In this paper, we propose several algorithms to solve stochastic smooth (strongly) convex-concave saddle-point problems using zeroth-order oracles and estimate their convergence rate and its dependence on the dimension $n$ of the variable. In particular, our analysis shows that in the case when the feasible set is a direct product of two simplices, our convergence rate for the stochastic term is only by a $\log n$ factor worse than for the first-order methods. We also consider a mixed setup and develop 1/2th-order methods that use zeroth-order oracle for the minimization part and first-order oracle for the maximization part. Finally, we demonstrate the practical performance of our zeroth-order and 1/2th-order methods on practical problems.
MP4Rec: Explainable and Accurate Top-N Recommendations in Heterogeneous Information Networks

Neural network-based recommendation algorithms have become the state-of-the-art in recommender systems and can achieve very high predictive accuracy.However, these models are usually considered as black boxes in terms of their interpretability due to the complex structure of their hidden layers.In this research work, we propose MP4Rec, a recommender system using heterogeneous information networks to provide both accurate and explainable recommendations.MP4Rec uses of user-user and item-item similarity matrices and applies a newly proposed pair-wise objective function to make top-N recommendations which are transparent and explainable.The similarity matrices are created from metapaths constructed with the PathSim algorithm, node embeddings with cosine similarity or their combinations.The proposed pair-wise objective function incorporates an additional soft constraint for pushing more explainable items into the top-N recommendations.We have performed several experiments that show the effectiveness of our model by outperforming the state-of-the-art and providing both accurate and explainable recommendations in three well-known datasets.
Card guessing with partial feedback

Abstract Consider the following experiment: a deck with m copies of n different card types is randomly shuffled, and a guesser attempts to guess the cards sequentially as they are drawn. Each time a guess is made, some amount of ‘feedback’ is given. For example, one could tell the guesser the true identity of the card they just guessed (the complete feedback model) or they could be told nothing at all (the no feedback model). In this paper we explore a partial feedback model, where upon guessing a card, the guesser is only told whether or not their guess was correct. We show in this setting that, uniformly in n , at most $m+O(m^{3/4}\log m)$ cards can be guessed correctly in expectation. This resolves a question of Diaconis and Graham from 1981, where even the $m=2$ case was open.
A Minibatch Proximal Stochastic Recursive Gradient Algorithm Using a Trust-Region-Like Scheme and Barzilai–Borwein Stepsizes

We consider the problem of minimizing the sum of an average of a large number of smooth convex component functions and a possibly nonsmooth convex function that admits a simple proximal mapping. This class of problems arises frequently in machine learning, known as regularized empirical risk minimization (ERM). In this article, we propose mSRGTR-BB, a minibatch proximal stochastic recursive gradient algorithm, which employs a trust-region-like scheme to select stepsizes that are automatically computed by the Barzilai–Borwein method. We prove that mSRGTR-BB converges linearly in expectation for strongly and nonstrongly convex objective functions. With proper parameters, mSRGTR-BB enjoys a faster convergence rate than the state-of-the-art minibatch proximal variant of the semistochastic gradient method (mS2GD). Numerical experiments on standard data sets show that the performance of mSRGTR-BB is comparable to and sometimes even better than mS2GD with best-tuned stepsizes and is superior to some modern proximal stochastic gradient methods.
Always-On Quantum Error Tracking with Continuous Parity Measurements

We investigate quantum error correction using continuous parity measurements to correct bit-flip errors with the three-qubit code. Continuous monitoring of errors brings the benefit of a continuous stream of information, which facilitates passive error tracking in real time. It reduces overhead from the standard gate-based approach that periodically entangles and measures additional ancilla qubits. However, the noisy analog signals from continuous parity measurements mandate more complicated signal processing to interpret syndromes accurately. We analyze the performance of several practical filtering methods for continuous error correction and demonstrate that they are viable alternatives to the standard ancilla-based approach. As an optimal filter, we discuss an unnormalized (linear) Bayesian filter, with improved computational efficiency compared to the related Wonham filter introduced by Mabuchi [New J. Phys. 11, 105044 (2009)]. We compare this optimal continuous filter to two practical variations of the simplest periodic boxcar-averaging-and-thresholding filter, targeting real-time hardware implementations with low-latency circuitry. As variations, we introduce a non-Markovian ``half-boxcar'' filter and a Markovian filter with a second adjustable threshold; these filters eliminate the dominant source of error in the boxcar filter, and compare favorably to the optimal filter. For each filter, we derive analytic results for the decay in average fidelity and verify them with numerical simulations.
Power-law scaling to assist with key challenges in artificial intelligence

Power-law scaling, a central concept in critical phenomena, is found to be useful in deep learning, where optimized test errors on handwritten digit examples converge as a power-law to zero with database size. For rapid decision making with one training epoch, each example is presented only once to the trained network, the power-law exponent increased with the number of hidden layers. For the largest dataset, the obtained test error was estimated to be in the proximity of state-of-the-art algorithms for large epoch numbers. Power-law scaling assists with key challenges found in current artificial intelligence applications and facilitates an a priori dataset size estimation to achieve a desired test accuracy. It establishes a benchmark for measuring training complexity and a quantitative hierarchy of machine learning tasks and algorithms.
Functional Federated Learning in Erlang (ffl-erl)

The functional programming language Erlang is well-suited for concurrent and distributed applications. Numerical computing, however, is not seen as one of its strengths. The recent introduction of Federated Learning, a concept according to which client devices are leveraged for decentralized machine learning tasks, while a central server updates and distributes a global model, provided the motivation for exploring how well Erlang is suited to that problem. We present ffl-erl, a framework for Federated Learning, written in Erlang, and explore how well it performs in two scenarios: one in which the entire system has been written in Erlang, and another in which Erlang is relegated to coordinating client processes that rely on performing numerical computations in the programming language C. There is a concurrent as well as a distributed implementation of each case. Erlang incurs a performance penalty, but for certain use cases this may not be detrimental, considering the trade-off between conciseness of the language and speed of development (Erlang) versus performance (C). Thus, Erlang may be a viable alternative to C for some practical machine learning tasks.