Papers with Code 아카이브
Mathematical Induction
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 1
- 보존된 평가 기록
- 2
Tests the language model's capability to understand induction by asking the model to verify the correctness of an induction argument.
Source: BIG-bench
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Dynamic Logistic Ensembles with Recursive Probability and Automatic Subset Splitting for Enhanced Binary Classification
A Unified Analysis for Finite Weight Averaging
Autograding Mathematical Induction Proofs with Natural Language Processing
SNIP: Bridging Mathematical Symbolic and Numeric Realms with Unified Pre-training
Analysis of function approximation and stability of general DNNs in directed acyclic graphs using un-rectifying analysis
Training Compute-Optimal Large Language Models
Scaling Language Models: Methods, Analysis & Insights from Training Gopher
Derivation of the Backpropagation Algorithm Based on Derivative Amplification Coefficients
Automation of Mathematical Induction as part of the History of Logic
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.