paper-with-me

홈 › Papers

Learning Elimination Ordering for Tree Decomposition Problem

2020-10-17 · NeurIPS Workshop LMCA 2020 12 · Taras Khakhulin, Roman Schutski, Ivan Oseledets

We propose a Reinforcement Learning-based approach to approximately solve the Tree Decomposition problem. Recently, it was shown that learned heuristics could successfully solve combinatorial problems. We establish that our approach successfully generalizes from small graphs, where an optimal Tree Decomposition can be found by exact algorithms, to large instances of practical interest, while still having very low time-to-solution. On the other hand, the agent-based approach surpasses all classical greedy heuristics by the quality of the solution.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Tree Decomposition

Similar Papers 제목 키워드 기반

Alpha Elimination: Using Deep Reinforcement Learning to Reduce Fill-In during Sparse Matrix Decomposition

2023-10-15 · Arpan Dasgupta, Pawan Kumar

A large number of computational and scientific methods commonly require decomposing a sparse matrix into triangular factors as LU decomposition. A common problem faced during this decomposition is that even though the gi…

Decision MakingDeep Reinforcement Learning

Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition

2014-04-25 · Zongyan Huang, Matthew England, David Wilson, James H. Davenport 외

Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed…

BIG-bench Machine Learning

Revisiting Variable Ordering for Real Quantifier Elimination using Machine Learning

2023-02-27 · John Hester, Briland Hitaj, Grant Passmore, Sam Owre 외

Cylindrical Algebraic Decomposition (CAD) is a key proof technique for formal verification of cyber-physical systems. CAD is computationally expensive, with worst-case doubly-exponential complexity. Selecting an optimal …

Matrix and graph representations of vine copula structures

2022-05-10 · Dániel Pfeifer, Edith Alice Kovács

Vine copulas can efficiently model multivariate probability distributions. This paper focuses on a more thorough understanding of their structures, since in the literature, vine copula representations are often ambiguous…

Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition

2019-04-24 · Matthew England, Dorian Florescu

There has been recent interest in the use of machine learning (ML) approaches within mathematical software to make choices that impact on the computing performance without affecting the mathematical correctness of the re…

BIG-bench Machine Learning