@book{awodeyCategoryTheory2010, location = {{Oxford ; New York}}, title = {Category Theory}, edition = {2nd ed}, isbn = {978-0-19-958736-0 978-0-19-923718-0}, pagetotal = {311}, number = {52}, series = {Oxford Logic Guides}, publisher = {{Oxford University Press}}, date = {2010}, keywords = {Categories (Mathematics)}, author = {Awodey, Steve}, } @book{gowersPrincetonCompanionMathematics2010, title = {The {{Princeton}} Companion to Mathematics}, publisher = {{Princeton University Press}}, date = {2010}, author = {Gowers, Timothy and Barrow-Green, June and Leader, Imre}, } @inbook{wignerUnreasonableEffectivenessMathematics1990, langid = {english}, title = {The {{Unreasonable Effectiveness}} of {{Mathematics}} in the {{Natural Sciences}}}, isbn = {978-981-02-0233-0 978-981-4503-48-8}, url = {http://www.worldscientific.com/doi/abs/10.1142/9789814503488_0018}, booktitle = {Mathematics and {{Science}}}, publisher = {{WORLD SCIENTIFIC}}, urldate = {2019-03-03}, date = {1990-08}, pages = {291-306}, author = {Wigner, Eugene P.}, bookauthor = {Mickens, Ronald E}, doi = {10.1142/9789814503488_0018} } @article{harnad1990_symbol_groun_probl, author = {Stevan Harnad}, title = {The Symbol Grounding Problem}, journal = {Physica D: Nonlinear Phenomena}, volume = {42}, number = {1-3}, pages = {335-346}, year = {1990}, doi = {10.1016/0167-2789(90)90087-6}, url = {https://doi.org/10.1016/0167-2789(90)90087-6}, DATE_ADDED = {Thu Nov 7 14:36:52 2019}, } @Book{marcus2019_reboot_ai, author = {Marcus, Gary}, title = {Rebooting AI : building artificial intelligence we can trust}, year = 2019, publisher = {Pantheon Books}, address = {New York}, isbn = 9781524748258, } @article{miller2003_cognit_revol, author = {George A Miller}, title = {The Cognitive Revolution: a Historical Perspective}, journal = {Trends in Cognitive Sciences}, volume = {7}, number = {3}, pages = {141-144}, year = {2003}, doi = {10.1016/s1364-6613(03)00029-9}, url = {https://doi.org/10.1016/s1364-6613(03)00029-9}, DATE_ADDED = {Thu Dec 26 11:09:31 2019}, } @book{kahneman2011_think_fast_slow, author = {Kahneman, Daniel}, title = {Thinking, Fast and Slow}, year = 2011, publisher = {Farrar, Straus and Giroux}, url = {https://books.google.fr/books?id=SHvzzuCnuv8C}, isbn = 9780374275631, lccn = 2012533187, } @incollection{yurochkin2019_hierar_optim_trans_docum_repres, author = {Yurochkin, Mikhail and Claici, Sebastian and Chien, Edward and Mirzazadeh, Farzaneh and Solomon, Justin M}, booktitle = {Advances in Neural Information Processing Systems 32}, pages = {1599--1609}, title = {Hierarchical Optimal Transport for Document Representation}, url = {http://papers.nips.cc/paper/8438-hierarchical-optimal-transport-for-document-representation.pdf}, year = 2019, } @article{peyreComputationalOptimalTransport2019, langid = {english}, title = {Computational {{Optimal Transport}}}, volume = {11}, issn = {1935-8237, 1935-8245}, url = {http://www.nowpublishers.com/article/Details/MAL-073}, doi = {10.1561/2200000073}, number = {5-6}, journaltitle = {Foundations and Trends in Machine Learning}, urldate = {2019-02-20}, date = {2019}, pages = {355-206}, author = {Peyré, Gabriel and Cuturi, Marco}, file = {/home/dimitri/Nextcloud/Zotero/storage/GLNYIRM9/Peyré and Cuturi - 2019 - Computational Optimal Transport.pdf} } @book{santambrogioOptimalTransportApplied2015, location = {{Cham}}, title = {Optimal {{Transport}} for {{Applied Mathematicians}}}, volume = {87}, isbn = {978-3-319-20827-5 978-3-319-20828-2}, url = {http://link.springer.com/10.1007/978-3-319-20828-2}, series = {Progress in {{Nonlinear Differential Equations}} and {{Their Applications}}}, publisher = {{Springer International Publishing}}, urldate = {2019-02-01}, date = {2015}, author = {Santambrogio, Filippo}, file = {/home/dimitri/Nextcloud/Zotero/storage/8NHLGF5U/Santambrogio - 2015 - Optimal Transport for Applied Mathematicians.pdf}, doi = {10.1007/978-3-319-20828-2} } @book{villaniOptimalTransportOld2009, location = {{Berlin}}, title = {Optimal Transport: Old and New}, isbn = {978-3-540-71049-3}, shorttitle = {Optimal Transport}, pagetotal = {973}, number = {338}, series = {Grundlehren Der Mathematischen {{Wissenschaften}}}, publisher = {{Springer}}, date = {2009}, keywords = {Probabilities,Dynamics,Dynamique,Géométrie différentielle,Geometry; Differential,Mathematical optimization,Optimisation mathématique,Probabilités,Problèmes de transport (Programmation),Transportation problems (Programming)}, author = {Villani, Cédric}, file = {/home/dimitri/Nextcloud/Zotero/storage/XMWCC335/Villani - 2009 - Optimal transport old and new.pdf}, note = {OCLC: ocn244421231} } @InProceedings{DBLP:conf/emnlp/PenningtonSM14, author = {Jeffrey Pennington and Richard Socher and Christopher D. Manning}, title = {Glove: Global Vectors for Word Representation}, year = 2014, booktitle = {Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, {EMNLP} 2014, October 25-29, 2014, Doha, Qatar, {A} meeting of SIGDAT, a Special Interest Group of the {ACL}}, pages = {1532-1543}, doi = {10.3115/v1/d14-1162}, url = {https://doi.org/10.3115/v1/d14-1162}, crossref = {DBLP:conf/emnlp/2014}, timestamp = {Tue, 28 Jan 2020 10:28:11 +0100}, biburl = {https://dblp.org/rec/conf/emnlp/PenningtonSM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{pennington2014_glove, author = "Pennington, Jeffrey and Socher, Richard and Manning, Christopher", title = "{G}love: Global Vectors for Word Representation", booktitle = "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing ({EMNLP})", year = 2014, pages = "1532--1543", doi = "10.3115/v1/D14-1162", url = {https://doi.org/10.3115/v1/D14-1162}, address = "Doha, Qatar", month = oct, publisher = "Association for Computational Linguistics", } @incollection{mikolovDistributedRepresentationsWords2013, title = {Distributed {{Representations}} of {{Words}} and {{Phrases}} and Their {{Compositionality}}}, url = {http://papers.nips.cc/paper/5021-distributed-representations-of-words-and-phrases-and-their-compositionality.pdf}, booktitle = {Advances in {{Neural Information Processing Systems}} 26}, urldate = {2019-08-13}, date = {2013}, pages = {3111--3119}, author = {Mikolov, Tomas and Sutskever, Ilya and Chen, Kai and Corrado, Greg S and Dean, Jeff}, } @book{wentzel1988_operat, author = {Wentzel, Elena S.}, title = {Operations research: a methodological approach}, year = {1988}, publisher = {Mir publishers}, address = {Moscow}, isbn = {9785030002279}, } @book{williams2013_model, author = {Williams, H. Paul}, title = {Model building in mathematical programming}, year = {2013}, publisher = {Wiley}, url = {https://www.wiley.com/en-fr/Model+Building+in+Mathematical+Programming,+5th+Edition-p-9781118443330}, address = {Chichester, West Sussex}, isbn = {9781118443330}, } @book{chvatal1983_linear, author = {Chv{\'a}tal, Va{\v{s}}ek}, title = {Linear programming}, year = {1983}, publisher = {W.H. Freeman}, address = {New York}, isbn = {0716715872}, } @book{vanderbei2014_linear, author = {Vanderbei, Robert}, title = {Linear programming : foundations and extensions}, year = {2014}, publisher = {Springer}, address = {New York}, isbn = {9781461476306}, } @Book{dantzig1997_linear, author = {Dantzig, George}, title = {Linear programming 1: Introduction}, year = 1997, publisher = {Springer}, url = {https://www.springer.com/gp/book/9780387948331}, address = {New York}, isbn = 9780387226330, } @Book{dantzig2003_linear, author = {Dantzig, George}, title = {Linear programming 2: Theory and Extensions}, year = 2003, publisher = {Springer}, url = {https://www.springer.com/gp/book/9780387986135}, address = {New York}, isbn = 9780387215693, } @Book{bertsimas1997_introd, author = {Bertsimas, Dimitris and Tsitsiklis, John N.}, title = {Introduction to linear optimization}, year = 1997, publisher = {Athena Scientific}, url = {http://www.athenasc.com/linoptbook.html}, address = {Belmont, Massachusetts}, isbn = 9781886529199, } @Book{maros2003_comput, author = {Maros, Istv{\'a}n}, title = {Computational techniques of the simplex method}, year = 2003, publisher = {Kluwer Academic Publishers}, address = {Boston}, isbn = 9781402073328, } @Book{nocedal2006_numer, author = {Nocedal, Jorge}, title = {Numerical optimization}, year = 2006, publisher = {Springer}, url = {https://www.springer.com/gp/book/9780387303031}, address = {New York}, isbn = 9780387303031, } @Book{boyd2004_convex, author = {Boyd, Stephen}, title = {Convex optimization}, year = 2004, publisher = {Cambridge University Press}, address = {Cambridge, UK New York}, isbn = 9780521833783, } @Book{kochenderfer2019_algor, author = {Kochenderfer, Mykel}, title = {Algorithms for optimization}, year = 2019, publisher = {The MIT Press}, address = {Cambridge, Massachusetts}, isbn = 9780262039420, } @Book{stillwell2010_mathem_its_histor, author = {John Stillwell}, title = {Mathematics and Its History}, year = 2010, publisher = {Springer}, url = {https://doi.org/10.1007/978-1-4419-6053-5}, DATE_ADDED = {Fri Nov 6 14:39:47 2020}, doi = {10.1007/978-1-4419-6053-5}, isbn = 9781441960528, series = {Undergraduate Texts in Mathematics}, } @article{sola2017_quater_kinem_error_state_kalman_filter, author = {Sol{\`a}, Joan}, title = {Quaternion Kinematics for the Error-State Kalman Filter}, journal = {CoRR}, year = {2017}, url = {http://arxiv.org/abs/1711.02508v1}, abstract = {This article is an exhaustive revision of concepts and formulas related to quaternions and rotations in 3D space, and their proper use in estimation engines such as the error-state Kalman filter. The paper includes an in-depth study of the rotation group and its Lie structure, with formulations using both quaternions and rotation matrices. It makes special attention in the definition of rotation perturbations, derivatives and integrals. It provides numerous intuitions and geometrical interpretations to help the reader grasp the inner mechanisms of 3D rotation. The whole material is used to devise precise formulations for error-state Kalman filters suited for real applications using integration of signals from an inertial measurement unit (IMU).}, archivePrefix ={arXiv}, eprint = {1711.02508}, primaryClass = {cs.RO}, } @article{welchIntroductionKalmanFilter2006, title = {An {{Introduction}} to the {{Kalman Filter}}}, volume = {7}, issn = {10069313}, url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.79.6578&rep=rep1&type=pdf}, doi = {10.1.1.117.6808}, abstract = {In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation. The Kalman filter is a set of mathematical equations that provides an efficient computational (recursive) means to estimate the state of a process, in a way that minimizes the mean of the squared error. The filter is very powerful in several aspects: it supports estimations of past, present, and even future states, and it can do so even when the precise nature of the modeled system is unknown. The purpose of this paper is to provide a practical introduction to the discrete Kalman filter. This introduction includes a description and some discussion of the basic discrete Kalman filter, a derivation, description and some discussion of the extended Kalman filter, and a relatively simple (tangible) example with real numbers \& results.}, number = {1}, journaltitle = {In Practice}, date = {2006}, pages = {1--16}, author = {Welch, Greg and Bishop, Gary}, file = {/home/dimitri/Nextcloud/Zotero/storage/LJ7QQCXF/Bishop, Welch - Unknown - An Introduction to the Kalman Filter.pdf}, eprinttype = {pmid}, eprint = {20578276} } @inproceedings{joldes2020_algor_manip_quater_float_point_arith, author = {M. {Jolde{\c{s}}} and J. -M. {Muller}}, title = {Algorithms for Manipulating Quaternions in Floating-Point Arithmetic}, booktitle = {2020 {IEEE} 27th Symposium on Computer Arithmetic {(ARITH)}}, year = 2020, pages = {48-55}, doi = {10.1109/ARITH48897.2020.00016}, url = {https://doi.org/10.1109/ARITH48897.2020.00016}, }