Imitation Learning With Additional Constraints on Motion Style Using Parametric Bias

2021 ◽  
Vol 6 (3) ◽  
pp. 5897-5904
Author(s):  
Kento Kawaharazuka ◽  
Yoichiro Kawamura ◽  
Kei Okada ◽  
Masayuki Inaba
2005 ◽  
Author(s):  
Frderick L. Crabbe ◽  
Rebecca Hwa

2021 ◽  
Vol 13 (2) ◽  
pp. 268
Author(s):  
Xiaochen Lv ◽  
Wenhong Wang ◽  
Hongfu Liu

Hyperspectral unmixing is an important technique for analyzing remote sensing images which aims to obtain a collection of endmembers and their corresponding abundances. In recent years, non-negative matrix factorization (NMF) has received extensive attention due to its good adaptability for mixed data with different degrees. The majority of existing NMF-based unmixing methods are developed by incorporating additional constraints into the standard NMF based on the spectral and spatial information of hyperspectral images. However, they neglect to exploit the nature of imbalanced pixels included in the data, which may cause the pixels mixed with imbalanced endmembers to be ignored, and thus the imbalanced endmembers generally cannot be accurately estimated due to the statistical property of NMF. To exploit the information of imbalanced samples in hyperspectral data during the unmixing procedure, in this paper, a cluster-wise weighted NMF (CW-NMF) method for the unmixing of hyperspectral images with imbalanced data is proposed. Specifically, based on the result of clustering conducted on the hyperspectral image, we construct a weight matrix and introduce it into the model of standard NMF. The proposed weight matrix can provide an appropriate weight value to the reconstruction error between each original pixel and the reconstructed pixel in the unmixing procedure. In this way, the adverse effect of imbalanced samples on the statistical accuracy of NMF is expected to be reduced by assigning larger weight values to the pixels concerning imbalanced endmembers and giving smaller weight values to the pixels mixed by majority endmembers. Besides, we extend the proposed CW-NMF by introducing the sparsity constraints of abundance and graph-based regularization, respectively. The experimental results on both synthetic and real hyperspectral data have been reported, and the effectiveness of our proposed methods has been demonstrated by comparing them with several state-of-the-art methods.


2021 ◽  
Author(s):  
Markku Suomalainen ◽  
Fares J. Abu-dakka ◽  
Ville Kyrki

AbstractWe present a novel method for learning from demonstration 6-D tasks that can be modeled as a sequence of linear motions and compliances. The focus of this paper is the learning of a single linear primitive, many of which can be sequenced to perform more complex tasks. The presented method learns from demonstrations how to take advantage of mechanical gradients in in-contact tasks, such as assembly, both for translations and rotations, without any prior information. The method assumes there exists a desired linear direction in 6-D which, if followed by the manipulator, leads the robot’s end-effector to the goal area shown in the demonstration, either in free space or by leveraging contact through compliance. First, demonstrations are gathered where the teacher explicitly shows the robot how the mechanical gradients can be used as guidance towards the goal. From the demonstrations, a set of directions is computed which would result in the observed motion at each timestep during a demonstration of a single primitive. By observing which direction is included in all these sets, we find a single desired direction which can reproduce the demonstrated motion. Finding the number of compliant axes and their directions in both rotation and translation is based on the assumption that in the presence of a desired direction of motion, all other observed motion is caused by the contact force of the environment, signalling the need for compliance. We evaluate the method on a KUKA LWR4+ robot with test setups imitating typical tasks where a human would use compliance to cope with positional uncertainty. Results show that the method can successfully learn and reproduce compliant motions by taking advantage of the geometry of the task, therefore reducing the need for localization accuracy.


Vaccines ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 657
Author(s):  
Jai S. Bolton ◽  
Hannah Klim ◽  
Judith Wellens ◽  
Matthew Edmans ◽  
Uri Obolski ◽  
...  

The antigenic drift theory states that influenza evolves via the gradual accumulation of mutations, decreasing a host’s immune protection against previous strains. Influenza vaccines are designed accordingly, under the premise of antigenic drift. However, a paradox exists at the centre of influenza research. If influenza evolved primarily through mutation in multiple epitopes, multiple influenza strains should co-circulate. Such a multitude of strains would render influenza vaccines quickly inefficacious. Instead, a single or limited number of strains dominate circulation each influenza season. Unless additional constraints are placed on the evolution of influenza, antigenic drift does not adequately explain these observations. Here, we explore the constraints placed on antigenic drift and a competing theory of influenza evolution – antigenic thrift. In contrast to antigenic drift, antigenic thrift states that immune selection targets epitopes of limited variability, which constrain the variability of the virus. We explain the implications of antigenic drift and antigenic thrift and explore their current and potential uses in the context of influenza vaccine design.


Author(s):  
Alireza Shamsoshoara ◽  
Fatemeh Afghah ◽  
Erik Blasch ◽  
Jonathan Ashdown ◽  
Mehdi Bennis
Keyword(s):  

2021 ◽  
pp. 102079
Author(s):  
Kerstin Kläser ◽  
Thomas Varsavsky ◽  
Pawel Markiewicz ◽  
Tom Vercauteren ◽  
Alexander Hammers ◽  
...  

Author(s):  
Eva García-Martín ◽  
Niklas Lavesson ◽  
Håkan Grahn ◽  
Emiliano Casalicchio ◽  
Veselka Boeva

AbstractRecently machine learning researchers are designing algorithms that can run in embedded and mobile devices, which introduces additional constraints compared to traditional algorithm design approaches. One of these constraints is energy consumption, which directly translates to battery capacity for these devices. Streaming algorithms, such as the Very Fast Decision Tree (VFDT), are designed to run in such devices due to their high velocity and low memory requirements. However, they have not been designed with an energy efficiency focus. This paper addresses this challenge by presenting the nmin adaptation method, which reduces the energy consumption of the VFDT algorithm with only minor effects on accuracy. nmin adaptation allows the algorithm to grow faster in those branches where there is more confidence to create a split, and delays the split on the less confident branches. This removes unnecessary computations related to checking for splits but maintains similar levels of accuracy. We have conducted extensive experiments on 29 public datasets, showing that the VFDT with nmin adaptation consumes up to 31% less energy than the original VFDT, and up to 96% less energy than the CVFDT (VFDT adapted for concept drift scenarios), trading off up to 1.7 percent of accuracy.


Sign in / Sign up

Export Citation Format

Share Document