3 papers
cs.AI2026
Hard Constraints Meet Soft Generation: Guaranteed Feasibility for LLM-based Combinatorial Optimization
Yang Liu, Chuan Zhou, Yancheng Chen +3
Large language models (LLMs) have emerged as promising general-purpose solvers for combinatorial optimization (CO), yet they fundamentally lack mechanisms to guarantee solution fea…
cs.NE2025
Conserved active information
Yanchen Chen, Daniel Andrés Díaz-Pachón
We introduce conserved active information , a symmetric extension of active information that quantifies net information gain/loss across the entire search space, respecti…
cs.LG2025
Wide & Deep Learning for Node Classification
Yancheng Chen, Wenguo Yang, Zhipeng Jiang
Wide & Deep, a simple yet effective learning architecture for recommendation systems developed by Google, has had a significant impact in both academia and industry due to its comb…