Fine Tuning Large Language Models for Accurate Fake News Detection
Bibliographic record
Abstract
In the current digital age, false information spreads quickly via social media and other online channels, making it challenging to tell real news from fake. This study introduces a framework for detecting fake news that uses Llama 3 for explanation-based classification in conjunction with conventional machine learning models. Using TF-IDF vectorization and SMOTE for improved balance and feature representation, we experimented with LSTM, SVM, Naive Bayes, Decision Trees, CNN, and Logistic Regression. Because of its capacity for sequential learning, Decision Tree demonstrated impressive results, and Llama 3 produced explanations in natural language to elucidate predictions. A speech-to-text module was also developed, enabling users to speak news statements that are converted into text and analyzed for authenticity.In addition to identifying false information, the framework offers context-aware reasoning, which enhances usability and trust in practical applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".