Fast Polynomial Transcendentals for LLMs
cs.LG
Submitted: 2026-09-03
Updated: 2026-09-03
Code: https://github.com/MrHuff/fast-polynomial-transcendentals
Sources
- Low-Cost FlashAttention with Fused Exponential and Multiplication Hardware Operators
- Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge
- Training Verifiers to Solve Math Word Problems
- Gemma 2: Improving Open Language Models at a Practical Size
- Measuring Massive Multitask Language Understanding
- K-TanH: Efficient TanH For Deep Learning
- RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
- Pointer Sentinel Mixture Models
- Theory, Analysis, and Best Practices for Sigmoid Self-Attention
- AutoNumerics-Zero: Automated Discovery of State-of-the-Art Mathematical Functions
- WinoGrande: An Adversarial Winograd Schema Challenge at Scale
- GLU Variants Improve Transformer
- NLI:Non-uniform Linear Interpolation Approximation of Nonlinear Operations for Efficient LLMs Inference
- FlashAttention-4: Algorithm and Kernel Pipelining Co-Design for Asymmetric Hardware Scaling
- HellaSwag: Can a Machine Really Finish Your Sentence?
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks