Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Report
Data sources: ZENODO
addClaim

Differential Privacy Noise Scaling for LLaMA-2 Meta-Reasoning Accuracy and Throughput

Authors: Assignee Research;

Differential Privacy Noise Scaling for LLaMA-2 Meta-Reasoning Accuracy and Throughput

Abstract

This report synthesises findings from 13 peer-reviewed papers addressing the following research question: To what extent can differential privacy noise scaling be optimized to maintain meta-reasoning accuracy on GSM8K while improving the inference throughput of LLaMA-2 models on other reasoning. 9 claims were extracted from source literature; 9 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 9.2/10. This report is a machine-generated literature synthesis and does not constitute original research.Research goal: To what extent can differential privacy noise scaling be optimized to maintain meta-reasoning accuracy on GSM8K while improving the inference throughput of LLaMA-2 models on other reasoning benchmarks like MATH or SVAMP?Autonomous literature synthesis. Automated review score: 9.2/10. Full text and citation available at Assignee Research.

Powered by OpenAIRE graph
Found an issue? Give us feedback