\n \n \n
\n
\n\n \n \n \n \n \n Euclidean Distance Matrix-based Rapid Fault Detection and Exclusion.\n \n \n \n\n\n \n Knowles, D.; and Gao, G.\n\n\n \n\n\n\n
Navigation: Journal of the Institute of Navigation. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{knowles2023euclidean,\n title={Euclidean Distance Matrix-based Rapid Fault Detection and Exclusion},\n author={Knowles, Derek and Gao, Grace},\n journal={Navigation: Journal of the Institute of Navigation},\n year={2023}\n}\n\n% J35\n% Sriramya Bhamidipati, Shreyas Kousik and Grace Gao, Set-Valued Shadow Matching Using Zonotopes for 3-D Map-Aided GNSS Localization, Navigation: Journal of the Institute of Navigation. Accepted.\n% couldn't find in NAVIGATION open access? (https://navi.ion.org/search/)\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online planning for constrained POMDPs with continuous spaces through dual ascent.\n \n \n \n \n\n\n \n Jamgochian, A.; Corso, A.; and Kochenderfer, M. J.\n\n\n \n\n\n\n In
International Conference on Automated Planning and Scheduling (ICAPS), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Jamgochian2023icaps,\n author = {Arec Jamgochian and Anthony Corso and Mykel J. Kochenderfer},\n booktitle = icaps,\n title = {Online planning for constrained {POMDP}s with continuous spaces through dual ascent},\n year = {2023},\n doi = {10.1609/icaps.v33i1.27195},\n url = {https://arxiv.org/abs/2212.12154},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n SHAIL: Safety-aware hierarchical adversarial imitation learning for autonomous driving in urban environments.\n \n \n \n \n\n\n \n Jamgochian, A.; Buehrle, E.; Fischer, J.; and Kochenderfer, M. J.\n\n\n \n\n\n\n In
IEEE International Conference on Robotics and Automation (ICRA), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Jamgochian2023icra,\n author = {Arec Jamgochian and Etienne Buehrle and Johannes Fischer and Mykel J. Kochenderfer},\n booktitle = icra,\n title = {{SHAIL}: Safety-aware hierarchical adversarial imitation learning for autonomous driving in urban environments},\n year = {2023},\n doi = {10.1109/ICRA48891.2023.10161449},\n url = {https://arxiv.org/abs/2204.01922},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Safe and efficient navigation in extreme environments using semantic belief graphs.\n \n \n \n \n\n\n \n Ginting, M. F.; Kim, S.; Peltzer, O.; Ott, J.; Jung, S.; Kochenderfer, M. J.; and Agha-mohammadi, A.\n\n\n \n\n\n\n In
IEEE International Conference on Robotics and Automation (ICRA), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Ginting2023icra,\n author = {Muhammad Fadhil Ginting and Sung-Kyun Kim and Oriana Peltzer and Joshua Ott and Sunggoo Jung and Mykel J. Kochenderfer and Ali-akbar Agha-mohammadi},\n booktitle = icra,\n title = {Safe and efficient navigation in extreme environments using semantic belief graphs},\n year = {2023},\n doi = {10.1109/ICRA48891.2023.10161056},\n url = {https://arxiv.org/pdf/2304.00645.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Modeling human driving behavior through generative adversarial imitation learning.\n \n \n \n \n\n\n \n Bhattacharyya, R.; Wulfe, B.; Phillips, D. J.; Kuefler, A.; Morton, J.; Senanayake, R.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
IEEE Transactions on Intelligent Transportation Systems, 24(3): 2874–2887. 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Bhattacharyya2023,\n author = {Raunak Bhattacharyya and Blake Wulfe and Derek J. Phillips and Alex Kuefler and Jeremy Morton and Ransalu Senanayake and Mykel J. Kochenderfer},\n journal = ieeetits,\n title = {Modeling human driving behavior through generative adversarial imitation learning},\n year = {2023},\n number = {3},\n pages = {2874--2887},\n volume = {24},\n doi = {10.1109/tits.2022.3227738},\n url = {https://arxiv.org/abs/2006.06412},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Bayesian safety validation for black-box systems.\n \n \n \n \n\n\n \n Moss, R. J.; Kochenderfer, M. J.; Gariel, M.; and Dubois, A.\n\n\n \n\n\n\n In
aiaa_aviation, 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Moss2023,\n author = {Robert J. Moss and Mykel J. Kochenderfer and Maxime Gariel and Arthur Dubois},\n booktitle = aiaa_aviation,\n title = {Bayesian safety validation for black-box systems},\n year = {2023},\n doi = {10.2514/6.2023-3596},\n url = {https://arxiv.org/abs/2305.02449},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Multirobot navigation using partially observable Markov decision processes with belief-based rewards.\n \n \n \n\n\n \n Tzikas, A. E.; Knowles, D.; Gao, G. X.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
Journal of Aerospace Information Systems, 20(8): 437–525. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Tzikas2023,\n author = {Alexandros E. Tzikas and Derek Knowles and Grace X. Gao and Mykel J. Kochenderfer},\n journal = jais,\n title = {Multirobot navigation using partially observable {M}arkov decision processes with belief-based rewards},\n year = {2023},\n number = {8},\n pages = {437--525},\n volume = {20},\n doi = {10.2514/1.i011146},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n BetaZero: Belief-state planning for long-horizon POMDPs using learned approximations.\n \n \n \n\n\n \n Moss, R. J.; Corso, A.; Caers, J.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
arxiv. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Moss2023betazero,\n author = {Moss, Robert J. and Corso, Anthony and Caers, Jef and Kochenderfer, Mykel J.},\n journal = arxiv,\n title = {Beta{Z}ero: {B}elief-state planning for long-horizon {POMDP}s using learned approximations},\n year = {2023},\n doi = {10.48550/ARXIV.2306.00249},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Model-based Validation as Probabilistic Inference.\n \n \n \n\n\n \n Delecki, H.; Corso, A.; and Kochenderfer, M. J.\n\n\n \n\n\n\n In
Conference on Learning for Dynamics and Control (L4DC), 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Delecki2023,\n author = {Delecki, Harrison and Corso, Anthony and Kochenderfer, Mykel J.},\n booktitle = {Conference on Learning for Dynamics and Control (L4DC)},\n title = {Model-based Validation as Probabilistic Inference},\n year = {2023},\n doi = {10.48550/ARXIV.2305.09930},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Backward reachability analysis of neural feedback loops: Techniques for linear and nonlinear systems.\n \n \n \n\n\n \n Rober, N.; Katz, S. M.; Sidrane, C.; Yel, E.; Everett, M.; Kochenderfer, M. J.; and How, J. P.\n\n\n \n\n\n\n
IEEE Open Journal of Control Systems, 2: 108–124. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Rober2023,\n author = {Nicholas Rober and Sydney M. Katz and Chelsea Sidrane and Esen Yel and Michael Everett and Mykel J. Kochenderfer and Jonathan P. How},\n journal = {{IEEE} Open Journal of Control Systems},\n title = {Backward reachability analysis of neural feedback loops: {T}echniques for linear and nonlinear systems},\n year = {2023},\n pages = {108--124},\n volume = {2},\n doi = {10.1109/ojcsys.2023.3265901},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Experience filter: Using past experiences on unseen tasks or environments.\n \n \n \n \n\n\n \n Yildiz, A.; Yel, E.; Corso, A. L.; Wray, K. H.; Witwicki, S. J.; and Kochenderfer, M. J\n\n\n \n\n\n\n In
IEEE Intelligent Vehicles Symposium (IV), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Yildiz2023iv,\n author = {Anil Yildiz and Esen Yel and Anthony L. Corso and Kyle H. Wray and Stefan J. Witwicki and Mykel J Kochenderfer},\n booktitle = iv,\n title = {Experience filter: {U}sing past experiences on unseen tasks or environments},\n year = {2023},\n doi = {10.1109/IV55152.2023.10186722},\n url = {https://arxiv.org/abs/2305.18633},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Incorporating human path preferences in robot navigation with minimal interventions.\n \n \n \n \n\n\n \n Peltzer, O.; Asmar, D. M.; Schwager, M.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
arxiv. 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Peltzer2023,\n author = {Peltzer, Oriana and Asmar, Dylan M. and Schwager, Mac and Kochenderfer, Mykel J.},\n journal = arxiv,\n title = {Incorporating human path preferences in robot navigation with minimal interventions},\n year = {2023},\n url = {https://arxiv.org/abs/2303.03530},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n A Holistic Assessment of the Reliability of Machine Learning Systems.\n \n \n \n\n\n \n Corso, A.; Karamadian, D.; Valentin, R.; Cooper, M.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
arxiv. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Corso2023,\n author = {Anthony Corso and David Karamadian and Romeo Valentin and Mary Cooper and Mykel J. Kochenderfer},\n journal = arxiv,\n title = {A Holistic Assessment of the Reliability of Machine Learning Systems},\n year = {2023},\n doi = {10.48550/ARXIV.2307.10586},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Efficient determination of safety requirements for perception systems.\n \n \n \n \n\n\n \n Katz, S. M.; Corso, A. L.; Yel, E.; and Kochenderfer, M. J.\n\n\n \n\n\n\n In
Digital Avionics Systems Conference (DASC), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Katz2023dasc,\n author = {Sydney M. Katz and Anthony L. Corso and Esen Yel and Mykel J. Kochenderfer},\n booktitle = dasc,\n title = {Efficient determination of safety requirements for perception systems},\n year = {2023},\n doi = {10.1109/DASC58513.2023.10311157},\n url = {https://arxiv.org/pdf/2307.01371.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n AVOIDDS: Aircraft vision-based intruder detection dataset and simulator.\n \n \n \n \n\n\n \n Smyers, E. Q.; Katz, S. M.; Corso, A.; and Kochenderfer, M. J.\n\n\n \n\n\n\n In
neurips, 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{Smyers2023,\n author = {Elysia Quinn Smyers and Sydney Michelle Katz and Anthony Corso and Mykel J. Kochenderfer},\n booktitle = neurips,\n title = {{AVOIDDS}: {A}ircraft vision-based intruder detection dataset and simulator},\n year = {2023},\n url = {https://arxiv.org/abs/2306.11203},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Optimality guarantees for particle belief approximation of POMDPs.\n \n \n \n\n\n \n Lim, M. H.; Becker, T. J.; Kochenderfer, M. J.; Tomlin, C. J.; and Sunberg, Z. N.\n\n\n \n\n\n\n
Journal of Artificial Intelligence Research, 77: 1591–1636. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Lim2023,\n author = {Michael H. Lim and Tyler J. Becker and Mykel J. Kochenderfer and Claire J. Tomlin and Zachary N. Sunberg},\n journal = jair,\n title = {Optimality guarantees for particle belief approximation of {POMDPs}},\n year = {2023},\n pages = {1591--1636},\n volume = {77},\n doi = {10.1613/jair.1.14525},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Active preference-based Gaussian process regression for reward learning and optimization.\n \n \n \n\n\n \n Bıyık, E.; Huynh, N.; Kochenderfer, M. J.; and Sadigh, D.\n\n\n \n\n\n\n
International Journal of Robotics Research. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Biyik2023,\n author = {Bıyık, Erdem and Huynh, Nicolas and Kochenderfer, Mykel J. and Sadigh, Dorsa},\n journal = {International Journal of Robotics Research},\n title = {Active preference-based {G}aussian process regression for reward learning and optimization},\n year = {2023},\n doi = {10.1177/02783649231208729},\n}\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Fast and scalable signal inference for active robotic source seeking.\n \n \n \n \n\n\n \n Denniston, C. E.; Peltzer, O.; Ott, J.; Moon, S.; Kim, S.; Sukhatme, G.; Kochenderfer, M. J.; Schwager, M.; and Agha-mohammadi, A.\n\n\n \n\n\n\n In
IEEE International Conference on Robotics and Automation (ICRA), 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Denniston2023,\n\tauthor = {Christopher E. Denniston and Oriana Peltzer and Joshua Ott and Sangwoo Moon and Sung-Kyun Kim and Gaurav Sukhatme and Mykel J. Kochenderfer and Mac Schwager and Ali-akbar Agha-mohammadi},\n\tbooktitle = icra,\n\tdate-added = {2024-05-27 12:20:23 -0700},\n\tdate-modified = {2024-05-27 12:20:23 -0700},\n\tdoi = {10.1109/ICRA48891.2023.10161445},\n\ttitle = {Fast and scalable signal inference for active robotic source seeking},\n\turl = {https://arxiv.org/abs/2301.02362},\n\tyear = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Foundation Models in Robotics: Applications, Challenges, and the Future.\n \n \n \n\n\n \n Firoozi, R.; Tucker, J.; Tian, S.; Majumdar, A.; Sun, J.; Liu, W.; Zhu, Y.; Song, S.; Kapoor, A.; Hausman, K.; Ichter, B.; Driess, D.; Wu, J.; Lu, C.; and Schwager, M.\n\n\n \n\n\n\n 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@misc{firoozi2023foundation,\n\tarchiveprefix = {arXiv},\n\tauthor = {Roya Firoozi and Johnathan Tucker and Stephen Tian and Anirudha Majumdar and Jiankai Sun and Weiyu Liu and Yuke Zhu and Shuran Song and Ashish Kapoor and Karol Hausman and Brian Ichter and Danny Driess and Jiajun Wu and Cewu Lu and Mac Schwager},\n\tdate-added = {2024-05-27 14:23:55 -0700},\n\tdate-modified = {2024-05-27 14:23:55 -0700},\n\teprint = {2312.07843},\n\tprimaryclass = {cs.RO},\n\ttitle = {Foundation Models in Robotics: Applications, Challenges, and the Future},\n\tyear = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Incorporating human path preferences in robot navigation with minimal interventions.\n \n \n \n \n\n\n \n Peltzer, O.; Asmar, D. M.; Schwager, M.; and Kochenderfer, M. J.\n\n\n \n\n\n\n
arxiv. 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{Peltzer2023,\n\tauthor = {Peltzer, Oriana and Asmar, Dylan M. and Schwager, Mac and Kochenderfer, Mykel J.},\n\tdate-added = {2024-05-27 12:20:23 -0700},\n\tdate-modified = {2024-05-27 12:20:23 -0700},\n\tjournal = arxiv,\n\ttitle = {Incorporating human path preferences in robot navigation with minimal interventions},\n\turl = {https://arxiv.org/abs/2303.03530},\n\tyear = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Local non-cooperative games with principled player selection for scalable motion planning.\n \n \n \n\n\n \n Chahine, M.; Firoozi, R.; Xiao, W.; Schwager, M.; and Rus, D.\n\n\n \n\n\n\n In
2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 880–887, 2023. IEEE\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{chahine2023local,\n\tauthor = {Chahine, Makram and Firoozi, Roya and Xiao, Wei and Schwager, Mac and Rus, Daniela},\n\tbooktitle = {2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)},\n\tdate-added = {2024-05-27 12:22:50 -0700},\n\tdate-modified = {2024-05-27 12:22:50 -0700},\n\torganization = {IEEE},\n\tpages = {880--887},\n\ttitle = {Local non-cooperative games with principled player selection for scalable motion planning},\n\tyear = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n VeriX: Towards Verified Explainability of Deep Neural Networks.\n \n \n \n \n\n\n \n Wu, M.; Wu, H.; and Barrett, C.\n\n\n \n\n\n\n In Oh, A.; Neumann, T.; Globerson, A.; Saenko, K.; Hardt, M.; and Levine, S., editor(s),
Advances in Neural Information Processing Systems 36 (NeurIPS 2023), volume 36, pages 22247–22268, 2023. Curran Associates, Inc.\n
\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{WWB23,\n url = "https://proceedings.neurips.cc/paper_files/paper/2023/file/46907c2ff9fafd618095161d76461842-Paper-Conference.pdf",\n author = "Min Wu and Haoze Wu and Clark Barrett",\n title = "VeriX: Towards Verified Explainability of Deep Neural Networks",\n booktitle = "Advances in Neural Information Processing Systems 36 (NeurIPS 2023)",\n editor = "A. Oh and T. Neumann and A. Globerson and K. Saenko and M. Hardt and S. Levine",\n publisher = "Curran Associates, Inc.",\n pages = "22247--22268",\n volume = 36,\n mon = dec,\n year = 2023,\n category = "Conference Publications",\n abstract = "We present VeriX (Verified eXplainability), a system for\n producing optimal robust explanations and generating\n counterfactuals along decision boundaries of machine learning\n models. We build such explanations and counterfactuals\n iteratively using constraint solving techniques and a\n heuristic based on feature-level sensitivity ranking. We\n evaluate our method on image recognition benchmarks and a\n real-world scenario of autonomous aircraft taxiing."\n}\n\n
\n
\n\n\n
\n We present VeriX (Verified eXplainability), a system for producing optimal robust explanations and generating counterfactuals along decision boundaries of machine learning models. We build such explanations and counterfactuals iteratively using constraint solving techniques and a heuristic based on feature-level sensitivity ranking. We evaluate our method on image recognition benchmarks and a real-world scenario of autonomous aircraft taxiing.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Soy: An Efficient MILP Solver for Piecewise-Affine Systems.\n \n \n \n \n\n\n \n Wu, H.; Wu, M.; Sadigh, D.; and Barrett, C.\n\n\n \n\n\n\n In
2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '23), pages 6281–6288, October 2023. IEEE\n
Detroit, MI, USA\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{WWS+23,\n url = "https://doi.org/10.1109/IROS55552.2023.10342011",\n author = "Wu, Haoze and Wu, Min and Sadigh, Dorsa and Barrett, Clark",\n title = "Soy: An Efficient {MILP} Solver for Piecewise-Affine Systems",\n booktitle = "2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '23)",\n publisher = "IEEE",\n pages = "6281--6288",\n month = oct,\n year = 2023,\n doi = "10.1109/IROS55552.2023.10342011",\n note = "Detroit, MI, USA",\n category = "Conference Publications",\n abstract = "Piecewise-affine (PWA) systems are widely used for modeling and\n control of robotics problems including modeling contact\n dynamics. A common approach is to encode the control problem\n of the PWA system as a Mixed-Integer Convex Program (MICP),\n which can be solved by general-purpose off-the-shelf MICP\n solvers. To mitigate the scalability challenge of solving\n these MICP problems, existing work focuses on devising\n efficient and strong formulations of the problems, while less\n effort has been spent on exploiting their specific structure\n to develop specialized solvers. The latter is the theme of\n our work. We focus on efficiently handling one-hot\n constraints, which are particularly relevant when encoding\n PWA dynamics. We have implemented our techniques in a tool,\n Soy, which organically integrates logical reasoning,\n arithmetic reasoning, and stochastic local search. For a set\n of PWA control benchmarks, Soy solves more problems, faster,\n than two state-of-the-art MICP solvers.",\n}\n\n
\n
\n\n\n
\n Piecewise-affine (PWA) systems are widely used for modeling and control of robotics problems including modeling contact dynamics. A common approach is to encode the control problem of the PWA system as a Mixed-Integer Convex Program (MICP), which can be solved by general-purpose off-the-shelf MICP solvers. To mitigate the scalability challenge of solving these MICP problems, existing work focuses on devising efficient and strong formulations of the problems, while less effort has been spent on exploiting their specific structure to develop specialized solvers. The latter is the theme of our work. We focus on efficiently handling one-hot constraints, which are particularly relevant when encoding PWA dynamics. We have implemented our techniques in a tool, Soy, which organically integrates logical reasoning, arithmetic reasoning, and stochastic local search. For a set of PWA control benchmarks, Soy solves more problems, faster, than two state-of-the-art MICP solvers.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n DNN Verification, Reachability, and the Exponential Function Problem.\n \n \n \n \n\n\n \n Isac, O.; Zohar, Y.; Barrett, C.; and Katz, G.\n\n\n \n\n\n\n In Pérez, G. A.; and Raskin, J., editor(s),
$34^{th}$ International Conference on Concurrency Theory (CONCUR '23), volume 279, of
Leibniz International Proceedings in Informatics (LIPIcs), pages 26:1–26:18, Dagstuhl, Germany, September 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik\n
Antwerp, Belgium\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{IZB+23,\n url = "https://drops.dagstuhl.de/opus/volltexte/2023/19020/",\n author = "Isac, Omri and Zohar, Yoni and Barrett, Clark and Katz, Guy",\n title = "{DNN} Verification, Reachability, and the Exponential Function Problem",\n booktitle = "$34^{th}$ International Conference on Concurrency Theory (CONCUR '23)",\n pages = "26:1--26:18",\n series = "Leibniz International Proceedings in Informatics (LIPIcs)",\n ISBN = "978-3-95977-299-0",\n ISSN = "1868-8969",\n month = sep,\n year = 2023,\n volume = 279,\n editor = "P\\'{e}rez, Guillermo A. and Raskin, Jean-Fran\\c{c}ois",\n publisher = "Schloss Dagstuhl -- Leibniz-Zentrum f{\\"u}r Informatik",\n address = "Dagstuhl, Germany",\n doi = "10.4230/LIPIcs.CONCUR.2023.26",\n note = "Antwerp, Belgium",\n category = "Conference Publications",\n abstract = "Deep neural networks (DNNs) are increasingly being deployed to\n perform safety-critical tasks. The opacity of DNNs, which\n prevents humans from reasoning about them, presents new\n safety and security challenges. To address these challenges,\n the verification community has begun developing techniques\n for rigorously analyzing DNNs, with numerous verification\n algorithms proposed in recent years. While a significant\n amount of work has gone into developing these verification\n algorithms, little work has been devoted to rigorously\n studying the computability and complexity of the underlying\n theoretical problems. Here, we seek to contribute to the\n bridging of this gap. We focus on two kinds of DNNs: those\n that employ piecewise-linear activation functions (e.g.,\n ReLU), and those that employ piecewise-smooth activation\n functions (e.g., Sigmoids). We prove the two following\n theorems: (i) the decidability of verifying DNNs with a\n particular set of piecewise-smooth activation functions,\n including Sigmoid and tanh, is equivalent to a well-known,\n open problem formulated by Tarski; and (ii) the DNN\n verification problem for any quantifier-free linear\n arithmetic specification can be reduced to the DNN\n reachability problem, whose approximation is\n NP-complete. These results answer two fundamental questions\n about the computability and complexity of DNN verification,\n and the ways it is affected by the network’s activation\n functions and error tolerance; and could help guide future\n efforts in developing DNN verification tools.",\n}\n\n
\n
\n\n\n
\n Deep neural networks (DNNs) are increasingly being deployed to perform safety-critical tasks. The opacity of DNNs, which prevents humans from reasoning about them, presents new safety and security challenges. To address these challenges, the verification community has begun developing techniques for rigorously analyzing DNNs, with numerous verification algorithms proposed in recent years. While a significant amount of work has gone into developing these verification algorithms, little work has been devoted to rigorously studying the computability and complexity of the underlying theoretical problems. Here, we seek to contribute to the bridging of this gap. We focus on two kinds of DNNs: those that employ piecewise-linear activation functions (e.g., ReLU), and those that employ piecewise-smooth activation functions (e.g., Sigmoids). We prove the two following theorems: (i) the decidability of verifying DNNs with a particular set of piecewise-smooth activation functions, including Sigmoid and tanh, is equivalent to a well-known, open problem formulated by Tarski; and (ii) the DNN verification problem for any quantifier-free linear arithmetic specification can be reduced to the DNN reachability problem, whose approximation is NP-complete. These results answer two fundamental questions about the computability and complexity of DNN verification, and the ways it is affected by the network’s activation functions and error tolerance; and could help guide future efforts in developing DNN verification tools.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Convex Bounds on the Softmax Function with Applications to Robustness Verification.\n \n \n \n \n\n\n \n Wei, D.; Wu, H.; Wu, M.; Chen, P.; Barrett, C.; and Farchi, E.\n\n\n \n\n\n\n In Ruiz, F.; Dy, J.; and van de Meent, J., editor(s),
Proceedings of The $26^{th}$ International Conference on Artificial Intelligence and Statistics (AISTATS '23), volume 206, of
Proceedings of Machine Learning Research, pages 6853–6878, April 2023. PMLR\n
Valencia, Spain\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InProceedings{WWW+23,\n url = "https://proceedings.mlr.press/v206/wei23c.html",\n author = "Wei, Dennis and Wu, Haoze and Wu, Min and Chen, Pin-Yu and Barrett, Clark and Farchi, Eitan",\n title = "Convex Bounds on the Softmax Function with Applications to Robustness Verification",\n booktitle = "Proceedings of The $26^{th}$ International Conference on Artificial Intelligence and Statistics (AISTATS '23)",\n volume = "206",\n series = "Proceedings of Machine Learning Research",\n publisher = "PMLR",\n editor = "Ruiz, Francisco and Dy, Jennifer and van de Meent, Jan-Willem",\n month = apr,\n pages = "6853--6878",\n year = "2023",\n note = "Valencia, Spain",\n category = "Conference Publications",\n abstract = "The softmax function is a ubiquitous component at the output of\n neural networks and increasingly in intermediate layers as\n well. This paper provides convex lower bounds and concave\n upper bounds on the softmax function, which are compatible\n with convex optimization formulations for characterizing\n neural networks and other ML models. We derive bounds using\n both a natural exponential-reciprocal decomposition of the\n softmax as well as an alternative decomposition in terms of\n the log-sum-exp function. The new bounds are provably and/or\n numerically tighter than linear bounds obtained in previous\n work on robustness verification of transformers. As\n illustrations of the utility of the bounds, we apply them to\n verification of transformers as well as of the robustness of\n predictive uncertainty estimates of deep ensembles."\n}\n\n
\n
\n\n\n
\n The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible with convex optimization formulations for characterizing neural networks and other ML models. We derive bounds using both a natural exponential-reciprocal decomposition of the softmax as well as an alternative decomposition in terms of the log-sum-exp function. The new bounds are provably and/or numerically tighter than linear bounds obtained in previous work on robustness verification of transformers. As illustrations of the utility of the bounds, we apply them to verification of transformers as well as of the robustness of predictive uncertainty estimates of deep ensembles.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Tighter Abstract Queries in Neural Network Verification.\n \n \n \n \n\n\n \n Cohen, E.; Elboher, Y. Y.; Barrett, C.; and Katz, G.\n\n\n \n\n\n\n In Piskac, R.; and Voronkov, A., editor(s),
Proceedings of $24^{th}$ International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '23), volume 94, of
EPiC Series in Computing, pages 124–143, March 2023. EasyChair\n
Manizales, Columbia\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{CEB+23,\n url = "https://easychair.org/publications/paper/q7L6",\n author = "Elazar Cohen and Yizhak Yisrael Elboher and Clark Barrett and Guy Katz",\n title = "Tighter Abstract Queries in Neural Network Verification",\n booktitle = "Proceedings of $24^{th}$ International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '23)",\n series = "EPiC Series in Computing",\n publisher = "EasyChair",\n volume = 94,\n pages = "124--143",\n editor = "Ruzica Piskac and Andrei Voronkov",\n month = mar,\n year = 2023,\n note = "Manizales, Columbia",\n doi = "10.29007/3mk7",\n category = "Conference Publications",\n abstract = "Neural networks have become critical components of reactive\n systems in various do- mains within computer science. Despite\n their excellent performance, using neural networks entails\n numerous risks that stem from our lack of ability to\n understand and reason about their behavior. Due to these\n risks, various formal methods have been proposed for verify-\n ing neural networks; but unfortunately, these typically\n struggle with scalability barriers. Recent attempts have\n demonstrated that abstraction-refinement approaches could\n play a significant role in mitigating these limitations; but\n these approaches can often produce net- works that are so\n abstract, that they become unsuitable for verification. To\n deal with this issue, we present CEGARETTE, a novel\n verification mechanism where both the system and the property\n are abstracted and refined simultaneously. We observe that\n this approach allows us to produce abstract networks which\n are both small and sufficiently accurate, allowing for quick\n verification times while avoiding a large number of\n refinement steps. For evaluation purposes, we implemented\n CEGARETTE as an extension to the recently proposed CEGAR-NN\n framework. Our results are highly promising, and demonstrate\n a significant improvement in performance over multiple\n benchmarks.",\n}\n\n
\n
\n\n\n
\n Neural networks have become critical components of reactive systems in various do- mains within computer science. Despite their excellent performance, using neural networks entails numerous risks that stem from our lack of ability to understand and reason about their behavior. Due to these risks, various formal methods have been proposed for verify- ing neural networks; but unfortunately, these typically struggle with scalability barriers. Recent attempts have demonstrated that abstraction-refinement approaches could play a significant role in mitigating these limitations; but these approaches can often produce net- works that are so abstract, that they become unsuitable for verification. To deal with this issue, we present CEGARETTE, a novel verification mechanism where both the system and the property are abstracted and refined simultaneously. We observe that this approach allows us to produce abstract networks which are both small and sufficiently accurate, allowing for quick verification times while avoiding a large number of refinement steps. For evaluation purposes, we implemented CEGARETTE as an extension to the recently proposed CEGAR-NN framework. Our results are highly promising, and demonstrate a significant improvement in performance over multiple benchmarks.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Toward Certified Robustness Against Real-World Distribution Shifts.\n \n \n \n \n\n\n \n Wu, H.; Tagomori, T.; Robey, A.; Yang, F.; Matni, N.; Pappas, G.; Hassani, H.; Păsăreanu, C.; and Barrett, C.\n\n\n \n\n\n\n In McDaniel, P.; and Papernot, N., editor(s),
Proceedings of the 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), pages 537–553, February 2023. IEEE\n
Raleigh, NC\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{WTR+23,\n url = "http://theory.stanford.edu/~barrett/pubs/WTR+23.pdf",\n author = "Haoze Wu and Teruhiro Tagomori and Alexander Robey and Fengjun Yang and Nikolai Matni and George Pappas and Hamed Hassani and Corina P{\\u{a}}s{\\u{a}}reanu and Clark Barrett",\n title = "Toward Certified Robustness Against Real-World Distribution Shifts",\n booktitle = "Proceedings of the 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)",\n publisher = "IEEE",\n editor = "Patrick McDaniel and Nicolas Papernot",\n month = feb,\n pages = "537--553",\n doi = "10.1109/SaTML54575.2023.00042",\n year = 2023,\n note = "Raleigh, NC",\n category = "Conference Publications",\n abstract = "We consider the problem of certifying the robustness of deep\n neural networks against real-world distribution shifts. To do\n so, we bridge the gap between hand-crafted specifications and\n realistic deployment settings by considering a\n neural-symbolic verification framework in which generative\n models are trained to learn perturbations from data and\n specifications are defined with respect to the output of\n these learned models. A pervasive challenge arising from this\n setting is that although S-shaped activations (e.g., sigmoid,\n tanh) are common in the last layer of deep generative models,\n existing verifiers cannot tightly approximate S-shaped\n activations. To address this challenge, we propose a general\n meta-algorithm for handling S-shaped activations which\n leverages classical notions of counter-example-guided\n abstraction refinement. The key idea is to ``lazily'' refine\n the abstraction of S-shaped functions to exclude spurious\n counter-examples found in the previous abstraction, thus\n guaranteeing progress in the verification process while\n keeping the state-space small. For networks with sigmoid\n activations, we show that our technique outperforms\n state-of-the-art verifiers on certifying robustness against\n both canonical adversarial perturbations and numerous\n real-world distribution shifts. Furthermore, experiments on\n the MNIST and CIFAR-10 datasets show that\n distribution-shift-aware algorithms have significantly higher\n certified robustness against distribution shifts.",\n}\n\n
\n
\n\n\n
\n We consider the problem of certifying the robustness of deep neural networks against real-world distribution shifts. To do so, we bridge the gap between hand-crafted specifications and realistic deployment settings by considering a neural-symbolic verification framework in which generative models are trained to learn perturbations from data and specifications are defined with respect to the output of these learned models. A pervasive challenge arising from this setting is that although S-shaped activations (e.g., sigmoid, tanh) are common in the last layer of deep generative models, existing verifiers cannot tightly approximate S-shaped activations. To address this challenge, we propose a general meta-algorithm for handling S-shaped activations which leverages classical notions of counter-example-guided abstraction refinement. The key idea is to ``lazily'' refine the abstraction of S-shaped functions to exclude spurious counter-examples found in the previous abstraction, thus guaranteeing progress in the verification process while keeping the state-space small. For networks with sigmoid activations, we show that our technique outperforms state-of-the-art verifiers on certifying robustness against both canonical adversarial perturbations and numerous real-world distribution shifts. Furthermore, experiments on the MNIST and CIFAR-10 datasets show that distribution-shift-aware algorithms have significantly higher certified robustness against distribution shifts.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Safeguarding Learning-Based Planners Under Motion and Sensing Uncertainties Using Reachability Analysis.\n \n \n \n\n\n \n Shetty, A.; Dai, A.; Tzikas, A.; and Gao, G.\n\n\n \n\n\n\n In
2023 IEEE International Conference on Robotics and Automation (ICRA), pages 7872–7878, 2023. IEEE\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{shetty2023safeguarding,\n title={Safeguarding Learning-Based Planners Under Motion and Sensing Uncertainties Using Reachability Analysis},\n author={Shetty, Akshay and Dai, Adam and Tzikas, Alexandros and Gao, Grace},\n booktitle={2023 IEEE International Conference on Robotics and Automation (ICRA)},\n pages={7872--7878},\n year={2023},\n organization={IEEE}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Neural Radiance Maps for Extraterrestrial Navigation and Path Planning.\n \n \n \n\n\n \n Dai, A.; Gupta, S.; and Gao, G.\n\n\n \n\n\n\n In
Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023), pages 1606–1620, 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{dai2023neural,\n title={Neural Radiance Maps for Extraterrestrial Navigation and Path Planning},\n author={Dai, Adam and Gupta, Shubh and Gao, Grace},\n booktitle={Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023)},\n pages={1606--1620},\n year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Bounding GPS-Based Positioning and Navigation Uncertainty for Autonomous Drifting via Reachability.\n \n \n \n\n\n \n Wu, A.; Mohanty, A.; Zaman, A.; and Gao, G.\n\n\n \n\n\n\n In
Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023), pages 712–726, 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{wu2023bounding,\n title={Bounding GPS-Based Positioning and Navigation Uncertainty for Autonomous Drifting via Reachability},\n author={Wu, Asta and Mohanty, Adyasha and Zaman, Anonto and Gao, Grace},\n booktitle={Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023)},\n pages={712--726},\n year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Neural city maps: A case for 3d urban environment representations based on radiance fields.\n \n \n \n\n\n \n Partha, M.; Gupta, S.; and Gao, G.\n\n\n \n\n\n\n In
Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023), pages 1953–1973, 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{partha2023neural,\n title={Neural city maps: A case for 3d urban environment representations based on radiance fields},\n author={Partha, Mira and Gupta, Shubh and Gao, Grace},\n booktitle={Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023)},\n pages={1953--1973},\n year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Tightly coupled graph neural network and kalman filter for smartphone positioning.\n \n \n \n\n\n \n Mohanty, A.; and Gao, G.\n\n\n \n\n\n\n In
Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023), pages 175–187, 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{mohanty2023tightly,\n title={Tightly coupled graph neural network and kalman filter for smartphone positioning},\n author={Mohanty, Adyasha and Gao, Grace},\n booktitle={Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023)},\n pages={175--187},\n year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Neural city maps for GNSS nlos prediction.\n \n \n \n\n\n \n Neamati, D.; Gupta, S.; Partha, M.; and Gao, G.\n\n\n \n\n\n\n In
Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023), pages 2073–2087, 2023. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{neamati2023neural,\n title={Neural city maps for GNSS nlos prediction},\n author={Neamati, Daniel and Gupta, Shubh and Partha, Mira and Gao, Grace},\n booktitle={Proceedings of the 36th International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2023)},\n pages={2073--2087},\n year={2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Learning GNSS positioning corrections for smartphones using graph convolution neural networks.\n \n \n \n\n\n \n Mohanty, A.; and Gao, G.\n\n\n \n\n\n\n
NAVIGATION: Journal of the Institute of Navigation, 70(4). 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{mohanty2023learning,\n title={Learning GNSS positioning corrections for smartphones using graph convolution neural networks},\n author={Mohanty, Adyasha and Gao, Grace},\n journal={NAVIGATION: Journal of the Institute of Navigation},\n volume={70},\n number={4},\n year={2023},\n publisher={Institute of Navigation}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Discovering Closed-Loop Failures of Vision-Based Controllers Via Reachability Analysis.\n \n \n \n\n\n \n Chakraborty, K.; and Bansal, S.\n\n\n \n\n\n\n
IEEE Robotics and Automation Letters. 2023.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{chakraborty2023discovering,\n title={Discovering Closed-Loop Failures of Vision-Based Controllers Via Reachability Analysis},\n author={Chakraborty, Kaustav and Bansal, Somil},\n journal={IEEE Robotics and Automation Letters},\n year={2023},\n publisher={IEEE}\n}
\n
\n\n\n\n
\n\n\n\n\n\n