Lattice point sets for deterministic learning and approximate optimization problems.
In this brief, the use of lattice point sets (LPSs) is investigated in the context of general learning problems (including function estimation and dynamic optimization), in the case where the classic empirical risk minimization (ERM) principle is considered and there is freedom to choose the sampling points of the input space. Here it is proved that convergence of the ERM principle is guaranteed when LPSs are employed as training sets for the learning procedure, yielding up to a superlinear convergence rate under some regularity hypotheses on the involved functions. Preliminary simulation results are also provided.
Cervellera
Cristiano
C
Istituto di Studi sui Sistemi Intelligenti per l'Automazione,Consiglio Nazionale delle Ricerche, Genova, Italy. cervellera@ge.issia.cnr.it
D003198:Computer Simulation; D006801:Humans; D007858:Learning / Q000502:physiology*; D016571:Neural Networks, Computer; D012815:Signal Processing, Computer-Assisted