Pith. Sign in

RECORD

State Following (StaF) Kernel Functions for Function Approximation

Optimization and Control · Submitted 16 Mar 2015

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The results of the simulation indicate that fewer basis functions are required to guarantee stability and approximate optimality than are required when a global approximation approach is used.

how it is stated · hedged possibility 0.60 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1503.04854 (version 2)
Pith IDBPQMUQ5S, Pith's permanent record of this paper and its review
CitationJoel A. Rosenfeld, Rushikesh Kamalapurkar, Warren E. Dixon. "State Following (StaF) Kernel Functions for Function Approximation." arXiv:1503.04854 (2015). https://pith.science/paper/BPQMUQ5S
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,926 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.22 · human participants 0.02 · controlled comparison 0.56 · randomized assignment 0.01 · states quantitative result 0.54 · compares with prior results 0.87 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

A function approximation method is developed that aims to approximate a function in a small neighborhood of a state that travels within a compact set. The development is based on the theory of universal reproducing kernel Hilbert spaces over the $n$-dimensional Euclidean space. Several theorems are introduced that support the development of this State Following (StaF) method. In particular, it is shown that there is a bound on the number of kernel functions required for the maintenance of an accurate function approximation as a state moves through a compact set. Additionally, a weight update law, based on gradient descent, is introduced where arbitrarily close accuracy can be achieved provided the weight update law is iterated at a sufficient frequency, as detailed in Theorem 6.1. To illustrate the advantage, the impact of the StaF method is that for some applications the number of basis functions can be reduced. The StaF method is applied to an adaptive dynamic programming (ADP) application to demonstrate that stability is maintained with a reduced number of basis functions. Simulation results demonstrate the utility of the StaF methodology for the maintenance of accurate function approximation as well as solving an infinite horizon optimal regulation problem through ADP. The results of the simulation indicate that fewer basis functions are required to guarantee stability and approximate optimality than are required when a global approximation approach is used.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 A function approximation method is developed that aims to approximate a function in a small neighborhood of a state that travels within a compact set. contribution 0.96 0.87 0.07 asserted 0.99
s1 The development is based on the theory of universal reproducing kernel Hilbert spaces over the $n$-dimensional Euclidean space. method 0.75 0.47 0.03 asserted 1.00
s2 Several theorems are introduced that support the development of this State Following (StaF) method. contribution 0.97 0.91 0.04 asserted 0.98
s3 In particular, it is shown that there is a bound on the number of kernel functions required for the maintenance of an accurate function approximation as a state moves through a compact set. result 0.89 0.92 0.22 asserted 1.00
s4 Additionally, a weight update law, based on gradient descent, is introduced where arbitrarily close accuracy can be achieved provided the weight update law is iterated at a sufficient frequency, as detailed in Theorem 6.1. method 0.52 0.92 0.12 asserted 0.89
s5 To illustrate the advantage, the impact of the StaF method is that for some applications the number of basis functions can be reduced. interpretation 0.66 0.70 0.16 hedged possibility 0.65
s6 The StaF method is applied to an adaptive dynamic programming (ADP) application to demonstrate that stability is maintained with a reduced number of basis functions. method 0.41 0.92 0.17 asserted 1.00
s7 Simulation results demonstrate the utility of the StaF methodology for the maintenance of accurate function approximation as well as solving an infinite horizon optimal regulation problem through ADP. result 0.93 0.95 0.27 asserted 1.00
s8 The results of the simulation indicate that fewer basis functions are required to guarantee stability and approximate optimality than are required when a global approximation approach is used. result 0.77 0.93 0.49 hedged possibility 0.60

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 0.59.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

A function approximation method is developed that aims to approximate a function in a small neighborhood of a state that travels within a compact set. The development is based on the theory of universal reproducing kernel Hilbert spaces over the $n$-dimensional Euclidean space. Several theorems are introduced that support the development of this State Following (StaF) method. In particular, it is shown that there is a bound on the number of kernel functions required for the maintenance of an accurate function approximation as a state moves through a compact set. Additionally, a weight update law, based on gradient descent, is introduced where arbitrarily close accuracy can be achieved provided the weight update law is iterated at a sufficient frequency, as detailed in Theorem 6.1. To illustrate the advantage, the impact of the StaF method is that for some applications the number of basis functions can be reduced. The StaF method is applied to an adaptive dynamic programming (ADP) application to demonstrate that stability is maintained with a reduced number of basis functions. Simulation results demonstrate the utility of the StaF methodology for the maintenance of accurate function approximation as well as solving an infinite horizon optimal regulation problem through ADP. The results of the simulation indicate that fewer basis functions are required to guarantee stability and approximate optimality than are required when a global approximation approach is used.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.