Least Squares Policy Evaluation Algorithms with Linear Function Approximation
Discrete Event Dynamic Systems
A space-time diffusion scheme for peer-to-peer least-squares estimation
Proceedings of the 5th international conference on Information processing in sensor networks
Simulation-based optimal sensor scheduling with application to observer trajectory planning
Automatica (Journal of IFAC)
Top-down vs bottom-up methodologies in multi-agent system design
Autonomous Robots
Brief paper: An adaptive optimization scheme with satisfactory transient performance
Automatica (Journal of IFAC)
Large scale nonlinear control system fine-tuning through learning
IEEE Transactions on Neural Networks
Boundedness and convergence of online gradient method with penalty for feedforward neural networks
IEEE Transactions on Neural Networks
Asynchronous gossip algorithms for stochastic optimization
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
When does online BP training converge?
IEEE Transactions on Neural Networks
IEEE Transactions on Information Theory
Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
SIAM Journal on Optimization
On stochastic gradient and subgradient methods with adaptive steplength sequences
Automatica (Journal of IFAC)
Multi-robot three-dimensional coverage of unknown areas
International Journal of Robotics Research
Variable risk control via stochastic optimization
International Journal of Robotics Research
Convergence of chaos injection-based batch backpropagation algorithm for feedforward neural networks
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
| Hi-index | 0.07 |
Minimizing a separable convex objective subject to an ordering restriction on its variables is a generalization of a class of problems in statistical estimation and inventory control. It is shown that a pool adjacent violators (PAV) algorithm can be ...