← Search

Utku Umur ACIKALIN

2 accepted papers

2026

Unsupervised Combinatorial Probabilistic Reasoning: Probabilistic Coin Change Problem

AAAI 2026technical

We introduce the Probabilistic Coin Change Problem (PCCP), a novel variant of the classical Combination Coin Change Problem (CCCP), motivated by a real-world scientific inverse task. The goal of CCCP is to enumerate all unordered combinations of coin denominations that sum to a given target. In PCCP

Cited by 0Source ↗PDF ↗Scholar ↗
2025

Learning to Explore and Exploit with GNNs for Unsupervised Combinatorial Optimization

ICLR 2025poster

Combinatorial optimization (CO) problems are pervasive across various domains, but their NP-hard nature often necessitates problem-specific heuristic algorithms. Recent advancements in deep learning have led to the development of learning-based heuristics, yet these approaches often struggle with li…

Cited by 0Source ↗PDF ↗Scholar ↗