Pengming Wang

According to our database, Pengming Wang authored at least 11 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Mathematical discoveries from program search with large language models.

Bernardino Romera-Paredes, Mohammadamin Barekatain, Alexander Novikov, Matej Balog, M. Pawan Kumar, Emilien Dupont, Francisco J. R. Ruiz, Jordan S. Ellenberg, Pengming Wang, Omar Fawzi, Pushmeet Kohli, Alhussein Fawzi

Nat., January, 2024

2023

Optimizing Memory Mapping Using Deep Reinforcement Learning.

Pengming Wang, Mikita Sazanovich, Berkin Ilbeyi, Phitchaya Mangpo Phothilimthana, Manish Purohit, Han Yang Tay, Ngân Vu, Miaosen Wang, Cosmin Paduraru, Edouard Leurent, Anton Zhernov, Julian Schrittwieser, Thomas Hubert, Robert Tung, Paula Kurylowicz, Kieran Milan, Oriol Vinyals, Daniel J. Mankowitz

CoRR, 2023

2021

Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs.

Nicolas Sonnerat, Pengming Wang, Ira Ktena, Sergey Bartunov, Vinod Nair

CoRR, 2021

2020

Solving Mixed Integer Programs Using Neural Networks.

Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O'Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, Yori Zwols

CoRR, 2020

2018

Descriptive complexity of constraint problems.

Pengming Wang

PhD thesis, 2018

2017

Definability of semidefinite programming and lasserre lower bounds for CSPs.

Anuj Dawar, Pengming Wang

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The pebbling comonad in Finite Model Theory.

Samson Abramsky, Anuj Dawar, Pengming Wang

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Lasserre Lower Bounds and Definability of Semidefinite Programming.

Anuj Dawar, Pengming Wang

CoRR, 2016

2015

From approximate factorization to root isolation with application to cylindrical algebraic decomposition.

Kurt Mehlhorn, Michael Sagraloff, Pengming Wang

J. Symb. Comput., 2015

A Definability Dichotomy for Finite Valued CSPs.

Anuj Dawar, Pengming Wang

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2013

From approximate factorization to root isolation.

Kurt Mehlhorn, Michael Sagraloff, Pengming Wang

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013