Efficient sampling in approximate dynamic programming algorithms
Computational Optimization and Applications
Water reservoir control under economic, social and environmental constraints
Automatica (Journal of IFAC)
Optimizing low-discrepancy sequences with an evolutionary algorithm
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Lattice point sets for deterministic learning and approximate optimization problems
IEEE Transactions on Neural Networks
Computational Optimization and Applications
Functional Optimization Through Semilocal Approximate Minimization
Operations Research
A numerical method for minimum distance estimation problems
Journal of Multivariate Analysis
Evolutionary optimization of low-discrepancy sequences
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.01 |
The general problem of reconstructing an unknown function from a finite collection of samples is considered, in case the position of each input vector in the training set is not fixed beforehand but is part of the learning process. In particular, the consistency of the empirical risk minimization (ERM) principle is analyzed, when the points in the input space are generated by employing a purely deterministic algorithm (deterministic learning). When the output generation is not subject to noise, classical number-theoretic results, involving discrepancy and variation, enable the establishment of a sufficient condition for the consistency of the ERM principle. In addition, the adoption of low-discrepancy sequences enables the achievement of a learning rate of O(1/L), with L being the size of the training set. An extension to the noisy case is provided, which shows that the good properties of deterministic learning are preserved, if the level of noise at the output is not high. Simulation results confirm the validity of the proposed approach.