3 citations · 3 across the 6 of their papers we have counts for
6 papers
GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
Curie Kim, Carsten Portner, Mingju Liu +6
Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in op…
GalaxyDiT: Efficient Video Generation with Guidance Alignment and Adaptive Proxy in Diffusion Transformers
Zhiye Song, Steve Dai, Ben Keller +1
Diffusion models have revolutionized video generation, becoming essential tools in creative content generation and physical simulation. Transformer-based architectures (DiTs) and c…
TurboSAT: Gradient-Guided Boolean Satisfiability Accelerated on GPU-CPU Hybrid System
Steve Dai, Cunxi Yu, Kalyan Krishnamani +1
While accelerated computing has transformed many domains of computing, its impact on logical reasoning, specifically Boolean satisfiability (SAT), remains limited. State-of-the-art…
Pretraining Large Language Models with NVFP4
NVIDIA, Felix Abecassis, Anjulie Agrusa +87
Large Language Models (LLMs) today are powerful problem solvers across many domains, and they continue to get stronger as they scale in model size, training set size, and training…
SQ-DM: Accelerating Diffusion Models with Aggressive Quantization and Temporal Sparsity
Zichen Fan, Steve Dai, Rangharajan Venkatesan +2
Diffusion models have gained significant popularity in image generation tasks. However, generating high-quality content remains notably slow because it requires running model infer…
Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networks
Nan Wu, Yingjie Li, Cong Hao +3
Reasoning high-level abstractions from bit-blasted Boolean networks (BNs) such as gate-level netlists can significantly benefit functional verification, logic minimization, datapat…