Pith. sign in

REVIEW 1 cited by

Approximation with Random Shallow ReLU Networks with Applications to Model Reference Adaptive Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.17142 v2 pith:MR5O55AU submitted 2024-03-25 math.OC cs.LGcs.SYeess.SY

classification math.OCcs.LGcs.SYeess.SY
keywords networkscontrolneuraladaptiveapproximationbiasesweightsfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Neural networks are regularly employed in adaptive control of nonlinear systems and related methods of reinforcement learning. A common architecture uses a neural network with a single hidden layer (i.e. a shallow network), in which the weights and biases are fixed in advance and only the output layer is trained. While classical results show that there exist neural networks of this type that can approximate arbitrary continuous functions over bounded regions, they are non-constructive, and the networks used in practice have no approximation guarantees. Thus, the approximation properties required for control with neural networks are assumed, rather than proved. In this paper, we aim to fill this gap by showing that for sufficiently smooth functions, ReLU networks with randomly generated weights and biases achieve $L_{\infty}$ error of $O(m^{-1/2})$ with high probability, where $m$ is the number of neurons. It suffices to generate the weights uniformly over a sphere and the biases uniformly over an interval. We show how the result can be used to get approximations of required accuracy in a model reference adaptive control application.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Orthogonal greedy algorithm for linear operator learning with shallow neural network

    math.NA 2025-01 conditional novelty 6.0 of 10

    Orthogonal greedy training of shallow ReLU networks is adapted to kernel estimation for linear operators, with stated convergence rates and large accuracy gains over neural operator baselines.

Pith tools