Scholarlink

<p>Combinatorial optimization focuses on finding the most favorable combinations of discrete variables under predefined constraints. Notable challenges in this field include the maximum satisfiability and maximum independent set problems. The inherent discreteness of these problems precludes them from being differentiable in their standard formulations. This paper explores an innovative approach to differentiable discrete optimization by utilizing recently discovered dataless neural networks. These networks offer a means to construct a singular differentiable function mirroring the complexities of the maximum independent set problem. Leveraging the framework of dataless neural networks, we extend this methodology to derive differentiable representations for a range of <b>NP-hard</b> discrete problems, providing rigorous proof of their validity. Our proposed differentiable formulations present a pathway for integrating continuous differentiable optimization techniques into traditional discrete optimization paradigms, offering a roadmap for future empirical exploration.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Advancing discrete optimization: novel approaches with dataless neural networks

  • 期刊论文

  • 发表日期：

    2025年11月2日

查看全文
  • Sangram K. Jena,
  • K. Subramani,
  • Alvaro Velasquez

摘要

Combinatorial optimization focuses on finding the most favorable combinations of discrete variables under predefined constraints. Notable challenges in this field include the maximum satisfiability and maximum independent set problems. The inherent discreteness of these problems precludes them from being differentiable in their standard formulations. This paper explores an innovative approach to differentiable discrete optimization by utilizing recently discovered dataless neural networks. These networks offer a means to construct a singular differentiable function mirroring the complexities of the maximum independent set problem. Leveraging the framework of dataless neural networks, we extend this methodology to derive differentiable representations for a range of NP-hard discrete problems, providing rigorous proof of their validity. Our proposed differentiable formulations present a pathway for integrating continuous differentiable optimization techniques into traditional discrete optimization paradigms, offering a roadmap for future empirical exploration.