2011
DOI: 10.1016/j.neucom.2010.06.033
|View full text |Cite
|
Sign up to set email alerts
|

Incremental online sparsification for model learning in real-time robot control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 51 publications
(30 citation statements)
references
References 14 publications
0
30
0
Order By: Relevance
“…two datasets from the same model but having different density distributions will be classified as two different models. The authors of [16], [17] proposed an online sparsification method by using an independency measure to control the sample pruning. This method nevertheless suffers from high computational demand and memory overhead since for a dictionary of saved data points of size n, a matrix of size (n − 1) has to be saved for every sample.…”
Section: A Related Workmentioning
confidence: 99%
“…two datasets from the same model but having different density distributions will be classified as two different models. The authors of [16], [17] proposed an online sparsification method by using an independency measure to control the sample pruning. This method nevertheless suffers from high computational demand and memory overhead since for a dictionary of saved data points of size n, a matrix of size (n − 1) has to be saved for every sample.…”
Section: A Related Workmentioning
confidence: 99%
“…Thus, we use measures that allow the robot to quantify where in the search domain there exists useful data that needs to be collected. While there exists many measures that can select important data subject to a learning task, we use a measure of linear independence [7,19,20]. This measure is often used in sparse Gaussian processes [7,20] where a data set D = {x i , y i } M i=1 is comprised of M input measurements x i ∈ R v and M output measurements y i ∈ R c such that each data point maximizes the measure of linear independence.…”
Section: Definition 2 a Dynamical Systemmentioning
confidence: 99%
“…While there exists many measures that can select important data subject to a learning task, we use a measure of linear independence [7,19,20]. This measure is often used in sparse Gaussian processes [7,20] where a data set D = {x i , y i } M i=1 is comprised of M input measurements x i ∈ R v and M output measurements y i ∈ R c such that each data point maximizes the measure of linear independence. We use this measure of independence, also known as a measure of importance, to create a distribution for which the robot will provide area coverage in the search domain for active data collection.…”
Section: Definition 2 a Dynamical Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…Another model learning method Sparse Incremental Gaussian Process Regression (SI-GPR) was developed and demonstrated to learn and adapt to changing dynamics on a 7-DoF rigid body robot arm [10]. This method used a learned dynamics model as a feed forward term and used a PD feedback controller to stabilize the system.…”
Section: Introductionmentioning
confidence: 99%