OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach

2024-08-22 · Hao Hu, Shaowei Cai

The growing interest in Explainable Artificial Intelligence (XAI) motivates promising studies of computing optimal Interpretable Machine Learning models, especially decision trees. Such models generally provide optimality in compact size or empirical accuracy. Recent works focus on improving efficiency due to the natural scalability issue. The application of such models to practical problems is quite limited. As an emerging problem in circuit design, Approximate Logic Synthesis (ALS) aims to reduce circuit complexity by sacrificing correctness. Recently, multiple heuristic machine learning methods have been applied in ALS, which learns approximated circuits from samples of input-output pairs. In this paper, we propose a new ALS methodology realizing the approximation via learning optimal decision trees in empirical accuracy. Compared to previous heuristic ALS methods, the guarantee of optimality achieves a more controllable trade-off between circuit complexity and accuracy. Experimental results show clear improvements in our methodology in the quality of approximated designs (circuit complexity and accuracy) compared to the state-of-the-art approaches.

📄 PDF Abstract BibTeX arXiv:2408.12304

Code (0)

등록된 구현이 없습니다.

Tasks

Explainable artificial intelligenceExplainable Artificial Intelligence (XAI)Interpretable Machine Learning

Methods 이 논문이 사용한 방법론

ALS 설명 없음

Focus 설명 없음

Probably Approximately Correct MDP Learning and Control With Temporal Logic Constraints

2014-04-28 · Jie Fu, Ufuk Topcu

We consider synthesis of control policies that maximize the probability of satisfying given temporal logic specifications in unknown, stochastic environments. We model the interaction between the system and its environme…

Probably Approximately Correct Explanations of Machine Learning Models via Syntax-Guided Synthesis

2020-09-18 · Daniel Neider, Bishwamittra Ghosh

We propose a novel approach to understanding the decision making of complex machine learning models (e.g., deep neural networks) using a combination of probably approximately correct learning (PAC) and a logic inference …

BIG-bench Machine Learning Decision Making

Deep-PowerX: A Deep Learning-Based Framework for Low-Power Approximate Logic Synthesis

2020-07-03 · Ghasem Pasandi, Mackenzie Peterson, Moises Herrera, Shahin Nazarian 외

This paper aims at integrating three powerful techniques namely Deep Learning, Approximate Computing, and Low Power Design into a strategy to optimize logic at the synthesis level. We utilize advances in deep learning to…

Topological Guided Actor-Critic Modular Learning of Continuous Systems with Temporal Objectives

2023-04-20 · Lening Li, Zhentian Qian

This work investigates the formal policy synthesis of continuous-state stochastic dynamic systems given high-level specifications in linear temporal logic. To learn an optimal policy that maximizes the satisfaction proba…

Motion Planning reinforcement-learning Reinforcement Learning

Policy Synthesis and Reinforcement Learning for Discounted LTL

2023-05-26 · Rajeev Alur, Osbert Bastani, Kishor Jothimurugan, Mateo Perez 외

The difficulty of manually specifying reward functions has led to an interest in using linear temporal logic (LTL) to express objectives for reinforcement learning (RL). However, LTL has the downside that it is sensitive…

PAC learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+1