4 papers
Hyperflux: Pruning Reveals Importance
Eugen Barbulescu, Antonio Alexoaie, Lucian Busoniu
Network pruning is used to reduce inference latency and power consumption in large neural networks. However, most methods focus on empirical results at the expense of understanding…
Value iteration with stopping criterion: finite iterations, stability, and near-optimality guarantees
Mathieu Granzotto, Romain Postoyan, Dragan NeÅ¡iÄ +2
Value iteration (VI) is a cornerstone of dynamic programming that allows computing near-optimal feedback laws for general plant dynamics and cost functions. In practice, however, i…
Fast Neural-Network Approximation of Active Target Search Under Uncertainty
Bilal Yousuf, Zsofia Lendek, Lucian Busoniu
We address the problem of searching for an unknown number of stationary targets at unknown positions with a mobile agent. A probability hypothesis density filter is used to estimat…
An optimistic planning algorithm for switched discrete-time LQR
Mathieu Granzotto, Romain Postoyan, Dragan NeÅ¡iÄ +2
We introduce TROOP, a tree-based Riccati optimistic online planner, that is designed to generate near-optimal control laws for discrete-time switched linear systems with switched q…