2025-06-18 12:00:00 2025-06-18 13:00:00 America/Indiana/Indianapolis Summer 2025 Seminar Series Yuezhu Xu ECLipsE: Efficient Compositional Lipschitz Constant Estimation Zhuoli Yin ViTSP: A Vision Language Models Guided Framework for Large-Scale Traveling Salesman Problems GRIS 134

June 18, 2025

Summer 2025 Seminar Series
Yuezhu Xu

ECLipsE: Efficient Compositional Lipschitz Constant Estimation

Zhuoli Yin

ViTSP: A Vision Language Models Guided Framework for Large-Scale Traveling Salesman Problems

Summer 2025 Seminar Series
Yuezhu Xu

ECLipsE: Efficient Compositional Lipschitz Constant Estimation

Zhuoli Yin

ViTSP: A Vision Language Models Guided Framework for Large-Scale Traveling Salesman Problems

Event Date: June 18, 2025
Speaker: Zhuoli Yin
Yuezhu Xu
Time: 12:00 - 1:00 PM
Location: GRIS 134
Priority: No
School or Program: Industrial Engineering
College Calendar: Show

*In Person Only

*Brown bag lunch (bring your own food)

 

Yuezhu Xu

ABSTRACT:  
The Lipschitz constant plays a crucial role in certifying the robustness of neural networks to input perturbations. Since calculating the exact Lipschitz constant is NP-hard, efforts have been made to obtain tight upper bounds on the Lipschitz constant. Typically, this involves solving a large matrix verification problem, the computational cost of which grows significantly for both deeper and wider networks. In this paper, we provide a compositional approach to estimate Lipschitz constants for deep feed-forward neural networks. We first obtain an exact decomposition of the large matrix verification problem into smaller sub-problems. Then, leveraging the underlying cascade structure of the network, we develop two algorithms. The first algorithm explores the geometric features of the problem and enables us to provide Lipschitz estimates that are comparable to existing methods by solving small semidefinite programs (SDPs) that are only as large as the size of each layer. The second algorithm relaxes these sub-problems and provides a closed-form solution to each sub-problem for extremely fast estimation, altogether eliminating the need to solve SDPs. The two algorithms represent different levels of trade-offs between efficiency and accuracy. Finally, we demonstrate that our approach provides a steep reduction in computation time (as much as several thousand times faster, depending on the algorithm for deeper networks) while yielding Lipschitz bounds that are very close to or even better than those achieved by state-of-the-art approaches in a broad range of experiments. In summary, our approach considerably advances the scalability and efficiency of certifying neural network robustness, making it particularly attractive for online learning tasks.  
 
BIOGRAPHY:  
I am Yuezhu (Ruby) Xu, currently a third-year Ph.D. student in the School of Industrial Engineering at Purdue University. Previously, I earned my master’s degree from the Data Science Institute at Columbia University and completed my undergraduate studies in mathematics at Shanghai Jiao Tong University. Under the mentorship of Dr. Sivaranjani, my research interests lie at provable guarantees in system identification and controller synthesis, physics informed neural network, robustness in learning, and efficient and scalable algorithms using optimization.  
 

Zhuoli Yin

ABSTRACT:
Solving the Traveling Salesman Problem (TSP) is NP-hard yet fundamental for wide real-world applications. Over the decades, exact and heuristic methods were developed for TSPs but they either struggle to scale or require manual parameter calibration. The surge of machine Learning shows promises for such combinatorial optimization problems, but they have poor generalizability to unseen cases. This work proposes ViTSP, a novel framework that leverages pre-trained vision language models (VLMs) to visually guide the solution process for large-scale TSPs. Experiments on real-world TSP instances ranging from 1k to 88k nodes demonstrate that ViTSP consistently achieves solutions with average optimality gaps below 0.2%, outperforming existing machine learning-based methods. Our framework offers a new perspective in fusing pre-trained large models and operations research solvers in solving combinatorial optimization problems, with practical implications for integration into more complex logistics systems.
 
BIOGRAPHY:
Zhuoli Yin is a PhD candidate in the Industrial Engineering program at Purdue University, working under the guidance of Dr. Hua Cai. Zhuoli previously earned a Master of Science in Industrial Engineering from Purdue in 2021.