Papers with Code 아카이브
GSM8K
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 2
- 보존된 평가 기록
- 3
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression
KisMATH: Do LLMs Have Knowledge of Implicit Structures in Mathematical Reasoning?
CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs
any4: Learned 4-bit Numeric Representation for LLMs
Activation Steering for Chain-of-Thought Compression
IRanker: Towards Ranking Foundation Model
Scaling Speculative Decoding with Lookahead Reasoning
CommVQ: Commutative Vector Quantization for KV Cache Compression
Plan for Speed -- Dilated Scheduling for Masked Diffusion Language Models
AgentGroupChat-V2: Divide-and-Conquer Is What LLM-Based Multi-Agent System Need
Fractional Reasoning via Latent Steering Vectors Improves Inference Time Compute
Xolver: Multi-Agent Reasoning with Holistic Experience Learning Just Like an Olympiad Team
Re-Initialization Token Learning for Tool-Augmented Large Language Models
Excessive Reasoning Attack on Reasoning LLMs
LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing
LearnAlign: Reasoning Data Selection for Reinforcement Learning in Large Language Models Based on Improved Gradient Alignment
Fast on the Easy, Deep on the Hard: Efficient Reasoning via Powered Length Penalty
PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models
Slimming Down LLMs Without Losing Their Minds
Learning a Continue-Thinking Token for Enhanced Test-Time Scaling
Unsupervised Elicitation of Language Models
Enhancing Reasoning Capabilities of Small Language Models with Blueprints and Prompt Template Search
Guideline Forest: Experience-Induced Multi-Guideline Reasoning with Stepwise Aggregation
Topology of Reasoning: Understanding Large Reasoning Models through Reasoning Graph Properties
Text-to-LoRA: Instant Transformer Adaption
Automatic Robustness Stress Testing of LLMs as Mathematical Problem Solvers
Model Unlearning via Sparse Autoencoder Subspace Guided Projections
Evaluation of LLMs for mathematical problem solving
Discriminative Policy Optimization for Token-Level Reward Models
Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models
Can LLMs Reason Abstractly Over Math Word Problems Without CoT? Disentangling Abstract Formulation From Arithmetic Computation
CoThink: Token-Efficient Reasoning via Instruct Models Guiding Reasoning Models
Maximizing Confidence Alone Improves Reasoning
The Price of Format: Diversity Collapse in LLMs
System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcuts
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.