paper-with-me

홈 › Papers

Hard Math -- Easy UVM: Pragmatic solutions for verifying hardware algorithms using UVM

2024-12-06 · Mark Litterick, Aleksandar Ivankovic, Bojan Arsov, Aman Kumar

This paper presents pragmatic solutions for verifying complex mathematical algorithms implemented in hardware in an efficient and effective manner. Maximizing leverage of a known-answer-test strategy, based on predefined data scenarios combined with design-for-verification modes, we demonstrate how to find and isolate concept and design bugs early in the flow. The solutions presented are based on real project experience with single chip radar sensors for a variety of applications. The verification environments supporting the presented strategies are based on SystemVerilog and the Universal Verification Methodology.

📄 PDF Abstract BibTeX arXiv:2412.04919

Code (0)

등록된 구현이 없습니다.

Tasks

Math

Similar Papers 제목 키워드 기반

Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervision

2024-03-14 · Zhiqing Sun, Longhui Yu, Yikang Shen, Weiyang Liu 외

Current AI alignment methodologies rely on human-provided demonstrations or judgments, and the learned capabilities of AI systems would be upper-bounded by human capabilities as a result. This raises a challenging resear…

MathReinforcement Learning (RL)RerankingRe-Ranking

Deep Learning for Generalised Planning with Background Knowledge

2024-10-10 · Dillon Z. Chen, Rostislav Horčík, Gustav Šír

Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of…

Deep Learning

Accelerating Sparse Deep Neural Networks

2021-04-16 · Asit Mishra, Jorge Albericio Latorre, Jeff Pool, Darko Stosic 외

As neural network model sizes have dramatically increased, so has the interest in various techniques to reduce their parameter counts and accelerate their execution. An active area of research in this field is sparsity -…

GPUMath

Prover-Verifier Games improve legibility of LLM outputs

2024-07-18 · Jan Hendrik Kirchner, Yining Chen, Harri Edwards, Jan Leike 외

One way to increase confidence in the outputs of Large Language Models (LLMs) is to support them with reasoning that is clear and easy to check -- a property we call legibility. We study legibility in the context of solv…

Math

Hard Negative Sample-Augmented DPO Post-Training for Small Language Models

2025-12-17 · Haocheng Lu, Minjun Zhu, Henry Yu arxiv

Large language models (LLMs) continue to struggle with mathematical reasoning, and common post-training pipelines often reduce each generated solution to a binary outcome: correct or incorrect. This perspective is limiti…

Reinforcement LearningMathematical Reasoning