Xiang Meng

Orcid: 0000-0003-1420-4373

Affiliations:
  • MIT Operation Research Center, MA, USA


According to our database1, Xiang Meng authored at least 13 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
ADMM-Q: An Improved Hessian-based Weight Quantizer for Post-Training Quantization of Large Language Models.
CoRR, May, 2026

MOONSHOT : A Framework for Multi-Objective Pruning of Vision and Large Language Models.
CoRR, April, 2026

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements.
CoRR, April, 2026

2025
TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks.
CoRR, May, 2025

TSENOR: Highly-Efficient Algorithm for Finding Transposable N: M Sparse Masks.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

3BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
An exact penalty approach for optimization with nonnegative orthogonality constraints.
Math. Program., March, 2023

Fast as CHITA: Neural Network Pruning with Combinatorial Optimization.
Proceedings of the International Conference on Machine Learning, 2023

2022
Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features.
Proceedings of the International Conference on Machine Learning, 2022

2019
Robust Control Optimization for Quantum Approximate Optimization Algorithm.
CoRR, 2019


  Loading...