Publications
| Conference and Journal Papers | |||
|---|---|---|---|
| Near-optimal Approximate Discrete and Continuous Submodular Function Minimization | SODA 2020 | Informal Summary | |
| Sample Amplification: Increasing Dataset Size even when Learning is Impossible | Informal Summary | ||
| A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families [merged] | NeurIPS 2019 | Informal Summary | |
| An Efficient Algorithm For High-Dimensional Log-Concave Maximum Likelihood [original] | Informal Summary | ||
| Hardness of 2D Motion Planning Under Obstacle Uncertainty | Informal Summary | ||
| Hardness of 3D Motion Planning Under Obstacle Uncertainty | WAFR 2018 | Informal Summary | |
| Provably Safe Robot Navigation with Obstacle Uncertainty (Journal Version) | IJRR | Informal Summary | |
| Provably Safe Robot Navigation with Obstacle Uncertainty (Conference Version) | RSS 2017 | Informal Summary | |
| Reducing FPGA Algorithm Area by Avoiding Redundant Computation | ICRA 2015 | Informal Summary |
Brian Axelrod’s masters thesis, done under the supervision of Leslie Pack Kaelbling and Tomás Lozano-Pérez at MIT, can be found here.