Hi everyone!
Next Thursday, February 6th at 9:00-10:00 AM pacific time, we’ll have the next FPTalks Community Meeting on this Zoom: https://washington.zoom.us/j/92831331326
We’re super excited to welcome Mridul Aanjaneya from Rutgers to present on Low-dimensional Linear Program Solvers.
Linear program solvers are widely used for many tasks in programming
languages, such as designing math libraries, repairing deep neural
networks, analyzing vulnerabilities in C source code, etc. Quite often,
this linear program is "low-dimensional", i.e., there are a lot more
constraints than the number of variables, or vice-versa. In such
situations, it is possible to design very efficient algorithms that
converge to a solution that satisfies the maximum number of constraints.
This talk will present some of our recent work that leverages two key
insights from computational geometry: random sampling and geometric
duality, with applications to the design of correctly-rounded Math
libraries for different bitwidth floating-point representations.
Looking forward to seeing everyone!
As a reminder, if you would like to give a talk or know of someone that would be great for an FPBench Community meeting, please have them fill out the speaker suggestion form!
Best regards,
Ian Briggs