Publications

A complete list can be found in my Google Scholar and DBLP profile. * denotes corresponding author, # denotes co-first author.

Thesis

Yanchen Deng. Study on Inference-based Algorithms for Distributed Constraint Optimization Problems. Master’s thesis, Chongqing University. 2018. (In Chinese, winner of Outstanding Thesis of Chongqing Municipality) [paper]

Yanchen Deng, Shufeng Kong, Caihua Liu, Bo An. Deep attentive belief propagation: Integrating reasoning and learning for solving constraint optimization problems. Proceedings of the Thirty-sixth Annual Conference on Neural Information Processing Systems (NeurIPS’22), accepted, 2022. (acceptance rate: 25.6%, CCF-A) [paper] [code]
Chen Dingding, Ziyu Chen, Yanchen Deng, Zhongshi He, Lulu Wang. Inference-based complete algorithms for asymmetric distributed constraint optimization problems. Artificial Intelligence Review, accepted, 2022. (SCI, IF=9.588)
Yanchen Deng, Shufeng Kong, Bo An. Pretrained cost model for distributed constraint optimization problems. Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI’22), pp.9331-9340. 2022. (acceptance rate: 15.0%, CCF-A) [paper] [code]

Yanchen Deng, Bo An. Utility distribution matters: Enabling fast belief propagation for multi-agent optimization with dense local utility function. Journal of Autonomous Agents and Multi-Agent Systems, Vol.35, No.2, Article 24, 2021. (CCF-B) [paper] [code]
Yanchen Deng, Runsheng Yu, Xinrun Wang, Bo An. Neural regret matching for distributed constraint optimization problems. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI’21), pp.146-153. 2021. (acceptance rate: 13.9%, CCF-A) [paper]

Yanchen Deng, Bo An. Speeding up incomplete GDL-based algorithms for multi-agent optimization with dense local utilities. Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI’20), pp.31-38. 2020. (acceptance rate: 12.6%, CCF-A; Invited to JAAMAS fast-track publication) [paper]
Dingding Chen, Yanchen Deng^#, Ziyu Chen, Zhongshi He, Wenxin Zhang. A hybrid tree-based algorithm to solve asymmetric distributed constraint optimization problems. Journal of Autonomous Agents and Multi-Agent Systems, Vol.34, Article 50. 2020. (CCF-B) [paper]
Dingding Chen, Yanchen Deng, Ziyu Chen, Wenxing Zhang, Zhongshi He. HS-CAI: A hybrid DCOP algorithm via combining search with context-based inference. Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI’20), pp.7087-7094. 2020. (acceptance rate: 20.6%, CCF-A) [paper] [code]
Ziyu Chen, Wenxin Zhang, Yanchen Deng*, Dingding Chen, Qing Li. RMB-DPOP: Refining MB-DPOP by reducing redundant inferences. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’20), pp.249-257. 2020. (acceptance rate: 23.0%, CCF-B) [paper] [code]

Yanchen Deng, Ziyu Chen, Dingding Chen, Wenxin Zhang, Xingqiong Jiang. AsymDPOP: Complete inference for asymmetric distributed constraint optimization problems. Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI’19), pp.223-230. 2019. (acceptance rate: 17.9%, CCF-A) [paper]
Ziyu Chen, Xingqiong Jiang, Yanchen Deng*, Dingding Chen, Zhongshi He. A generic approach to accelerating belief propagation based incomplete algorithms for DCOPs via a branch-and-bound technique. Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI’19), pp.6038-6045. 2019. (acceptance rate: 16.2%, CCF-A) [paper]
Yanchen Deng, Ziyu Chen, Dingding Chen, Xingqiong Jiang, Qiang Li. PT-ISABB: A hybrid tree-based complete algorithm to solve asymmetric distributed constraint optimization problems. Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’19), pp.1506-1514. 2019. (acceptance rate: 24.0%, CCF-B; Invited to JAAMAS fast-track publication) [paper] [code]

Ziyu Chen, Yanchen Deng*, Tengfei Wu, Zhongshi He. A class of iterative refined Max-sum algorithms via non-consecutive value propagation strategies. Journal of Autonomous Agents and Multiagent Systems, 32(6): 822-860. 2018. (CCF-B) [paper]
Ziyu Chen, Tengfei Wu, Yanchen Deng, Cheng Zhang. An ant-based algorithm to solve distributed constraint optimization problems. Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI’18), pp.4654-4661. 2018. (acceptance rate: 24.6%, CCF-A) [paper]

Ziyu Chen, Yanchen Deng, Tengfei Wu. An iterative refined Max-sum AD algorithm via single-side value propagation and local search. Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’17), pp.195-202. 2017. (acceptance rate: 27.3%, CCF-B) [paper]
Zhepeng Yu, Ziyu Chen, Jingyuan He, Yanchen Deng. A partial decision scheme for local search algorithms for distributed constraint optimization problems. Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’17), pp.187-194. 2017. (acceptance rate: 27.3%, CCF-B) [paper]