Publication
From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
Publications associées (89)
Six-dimensional sphere packing and linear programming
Maryna Viazovska, Matthew De Courcy-Ireland, Maria Margarethe Dostert
We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn- Triantafillou [Math. Comp. 91 (2021), pp. 491 ...
Amer Mathematical Soc2024Augmented Lagrangian Methods for Provable and Scalable Machine Learning
Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...
EPFL2023DatAFLow: Toward a Data-Flow-Guided Fuzzer
Coverage-guided greybox fuzzers rely on control-flow coverage feedback to explore a target program and uncover bugs. Compared to control-flow coverage, data-flow coverage offers a more fine-grained approximation of program behavior. Data-flow coverage capt ...
2023Six-dimensional sphere packing and linear programming
Maryna Viazovska, Matthew De Courcy-Ireland, Maria Margarethe Dostert
We prove that the Cohn-Elkies linear programming bound for sphere packing is not sharp in dimension 6. The proof uses duality and optimization over a space of modular forms, generalizing a construction of Cohn-Triantafillou to the case of odd weight and no ...
arXiv2022