Inference-Time Mitigation of Adversarial Political Bias in Large Language Models
Summary
This paper proposes inference-time mitigation strategies using Chain of Thought prompting and Direct Preference Optimization to reduce adversarial political bias in large language models, demonstrating significant improvements in political neutrality scores.
View Cached Full Text
Cached at: 08/18/26, 09:46 AM
# Inference-Time Mitigation of Adversarial Political Bias in Large Language Models
Source: [https://arxiv.org/html/2608.14629](https://arxiv.org/html/2608.14629)
Tejaswi V\. Panchagnula1, Bruce Coburn1, Bryce J\. Dietrich2, Robert X\. Browning2, Edward J\. Delp1, Fengqing Zhu1
###### Abstract
As Large Language Models \(LLMs\) become the mainstay for information retrieval and summarization tasks, ensuring that they are always non\-partisan and invulnerable to political bias is a critical step towards safer and more trustworthy Artificial Intelligence \(AI\)\. Current model alignment paradigms, such as reinforcement learning from human feedback \(RLHF\), make LLMs follow overarching safety instructions\. However, this instruction tuning can be exploited via adversarial prompt injection and be used to generate unsafe content\. In particular, political bias has not been specifically targeted by modern alignment techniques as harmful and biased content\. To address this vulnerability of LLMs, we propose mitigation strategies using Chain of Thought \(CoT\) prompting and Direct Preference Optimization \(DPO\)\. Using a public dataset of legislative videos, we generate summaries using LLMs, inject bias via adversarial prompting and evaluate their performance on a four axis scale designed for political summarization\. In this paper, we present different methods to shield LLMs against the injection of political bias\. Our results demonstrate that the proposed Recursive Self\-Correction approach raises model performance from a Political Neutrality Likert scale baseline of 2\.14 to 4\.56, averaged across all models, demonstrating effective inference\-time mitigation of political bias in LLM\-generated summaries\.
Figure 1:An example of political bias expressed by Large Language Models\.## IIntroduction
AI\-generated content has grown by a considerable margin over the last few years\[[23](https://arxiv.org/html/2608.14629#bib.bib27)\]\. Since the widespread adoption of Large Language Models \(LLMs\), we have seen LLMs become the backbone of many applications worldwide\[[27](https://arxiv.org/html/2608.14629#bib.bib17)\]\. LLMs are the main generative model behind applications such as chatbots, writing assistants and content generators\. Given that such applications are being used by the public, LLMs are trained not to output any harmful content\.
LLMs have made their way into political and news media as well, where they are used to write reports and articles\[[11](https://arxiv.org/html/2608.14629#bib.bib28)\]\. With increased use of AI\-generated content in media, there arises a need to identify, mitigate and control political biases that may be exhibited by LLMs\. It is observed that political bias, in particular, can directly influence decision making and shift narratives on various issues and policies\[[8](https://arxiv.org/html/2608.14629#bib.bib1)\]\[[13](https://arxiv.org/html/2608.14629#bib.bib2)\]\. Instruction tuning, which is a process used in the training of LLMs, to make LLMs more user\-friendly can make them more agreeable to user biases as well\[[19](https://arxiv.org/html/2608.14629#bib.bib3)\]\. An example of how instruction tuning can lead to biased outputs, is shown in Figure[1](https://arxiv.org/html/2608.14629#S0.F1)\. In this paper, we present methods to measure and mitigate this bias shown by pre\-trained LLMs taken off\-the\-shelf\. Our main contributions are the following:
- •We propose Recursive Self\-Correction as a method to mitigate political bias using an iterative Chain of Thought \(CoT\) prompt strategy\.
- •We compare inference\-time bias mitigation strategies such as Chain of Thought \(CoT\) prompting, with Direct Preference Optimization \(DPO\), a model fine\-tuning approach we implement in this paper\.
- •We present a multi\-axis evaluation metric using an LLM\-as\-a\-judge\[[29](https://arxiv.org/html/2608.14629#bib.bib16)\]to evaluate summaries generated from political videos\.
In a recent article\[[18](https://arxiv.org/html/2608.14629#bib.bib18)\], Open AI claims that ChatGPT should not have political bias in any direction\. In this study, they showed the bias exhibited by GPT\-4\[[2](https://arxiv.org/html/2608.14629#bib.bib30)\]using a representative set of politically shaped prompts\. GPT\-5 Thinking\[[22](https://arxiv.org/html/2608.14629#bib.bib31)\]is then used as an LLM grader on five axes defined to capture bias in model output\. The results show that GPT\-4 is able to maintain an unbiased stance in the outputs when the prompts are neutral and slightly slanted scenarios\. When the prompts become more emotionally and politically charged, the model stance also changes and bias is introduced in the results as well\. Different prompting and training strategies for mitigating bias in LLMs have been explored by Kojima et al\.\[[14](https://arxiv.org/html/2608.14629#bib.bib23)\]\. They showed that LLMs respond well to zero shot prompting\. On the other hand, Wei et al\.\[[25](https://arxiv.org/html/2608.14629#bib.bib15)\]showed that LLMs can be jailbroken and their pre\-existing safety filters incorporated during instruction tuning can be easily bypassed\.
Figure 2:An overview block diagram showing the input transcript, different methods used for generation of biased summaries and mitigating political bias, the four axes used in the LLM\-as\-a\-judge evaluation and the final corrected summary\.The foundation for this work is video summarization\. Video summarization techniques have traditionally relied on methods such as key\-frame sampling and spatiotemporal extraction\[[7](https://arxiv.org/html/2608.14629#bib.bib34)\]\. LLMs have aided in summarization tasks because of their semantic understanding capabilities and representation power\[[3](https://arxiv.org/html/2608.14629#bib.bib20)\]\. Summarization can range from using only the transcript to incorporating video frames as well\. We discuss and present the different methods involved in the generation of summaries from videos, injection of bias via adversarial prompting and our proposed mitigation strategies\.
## IIMethodology
Although LLM bias is well\-documented, it is difficult apriori to predict its direction, let alone its magnitude, for a given prompt\. Therefore, for this study, we use two different methods to inject bias into LLM outputs and investigate three different approaches to mitigate bias political bias\. An overall block diagram depicting our evaluation framework is shown in Figure[2](https://arxiv.org/html/2608.14629#S1.F2)\.
### II\-AVideo Summarization
For the summarization pipeline, we start by transcribing our videos using Whisper API\[[20](https://arxiv.org/html/2608.14629#bib.bib6)\]\. The transcripts have a mean length of 1,147 words with the maximum length being 2,205 words\. This collection of transcripts are then given to a set of large language models for summarization\. In this work, we only use the textual transcript as a source text during summarization\.
We use the latest iterations of the most downloaded model families from HuggingFace of modest compute requirements, namely the Llama\-3\-8B\-Instruct\[[9](https://arxiv.org/html/2608.14629#bib.bib7)\], Gemma\-2\-9B\-it\[[24](https://arxiv.org/html/2608.14629#bib.bib35)\], Phi\-4\-mini\-Instruct\[[1](https://arxiv.org/html/2608.14629#bib.bib9)\], Ministral\-3\-14B\-Instruct\-2512\-BF16\[[17](https://arxiv.org/html/2608.14629#bib.bib10)\]and Qwen3\.5\-9B\[[28](https://arxiv.org/html/2608.14629#bib.bib11)\]\. These models form the backend infrastructure of many applications today\[[10](https://arxiv.org/html/2608.14629#bib.bib29)\]\. This collection of five LLMs are then asked to summarize each transcript they read\. The word count for the summarization task is set at 100\.
### II\-BLLM\-as\-a\-judge
The LLM\-as\-a\-judge\[[29](https://arxiv.org/html/2608.14629#bib.bib16)\]paradigm grades LLM outputs using another larger model\. Since there is no ground truth data when it comes to content generated by these models, standard quantitative metrics fall short in capturing the complete quality and fidelity of these outputs\. In this work, we use four axes on which the “judge” LLM is asked to grade the summaries, including Information Coverage, Factual Alignment, Argumentative Coherence and Political Neutrality\. All the LLM\-as\-a\-judge evaluations use Qwen\-3\-32B\[[4](https://arxiv.org/html/2608.14629#bib.bib13)\]as the judge model, as it is much larger than the candidate models used in our summarization and learning tasks\. The LLM\-as\-a\-judge evaluation framework has been shown to closely align with human evaluations\[[29](https://arxiv.org/html/2608.14629#bib.bib16)\], although we acknowledge that expert human evaluations continue to be the most desired qualitative metric for such studies\. We propose an expert human evaluation survey as future work\. The four axes cover different aspects of a good quality summary as detailed below\.
- •Information Coverageencapsulates whether the summary captures the core legislative topics and facts discussed in the transcript\.
- •Factual Alignmentanalyses whether the LLM has hallucinated any external details or numbers not explicitly mentioned\.
- •Argumentative Coherencegrades the logical transitions between sentences and the overall readability\.
- •Political Neutralityquestions whether partisan viewpoints are endorsed in the summary output by the LLM\.
All four axes are on a 1\-5 Likert scale with metrics given to the LLM on what traits exhibited in the summary deem a particular score\.
### II\-CBiased Summary Generation
To investigate and quantify the injection of political bias into LLM generated summaries, the LLMs are made to generate summaries under different partisan viewpoints\. We use the transcripts generated in Section[II\-A](https://arxiv.org/html/2608.14629#S2.SS1)as the baseline, reference texts\. Three prompt slants are given to the LLM: Neutral, Liberal and Conservative\. In each prompt style, the role of the LLM has been defined as a “helpful assistant”\. The Neutral viewpoint does not inject any bias into the generated summary\. The liberal viewpoint uses phrases such as “systemic oppression” and “marginalized communities” to induce bias in the LLM output\. Lastly, the conservative viewpoint uses phrases such as “traditional American values” and “government oversight”\. Such phrases are deliberately included to induce bias in the LLM generated summaries, to demonstrate bias injection and correction\. These LLMs are then given the same prompts across the entire sample\.
### II\-DJailbreaking LLMs
Figure 3:Jailbreak prompt exploiting instruction tuning in LLMs\. The given example is for a conservative bias jailbreak prompt\. The salient phrases, which force the model to bypass its safety filters are highlighted in red\. A symmetric prompt was used for liberal bias injection\.Adversarial prompting is the practice of deliberately crafting prompts to bypass LLM safety filters and force a model to act outside its intended guidelines\[[15](https://arxiv.org/html/2608.14629#bib.bib32)\]\. Common adversarial prompting techniques include prompt injection, jailbreaking and prompt leaking\. Understanding these vulnerabilities is critical for AI safety\. By testing these models against adversarial prompting techniques, we can build systems that are resistant to bias and in particular political bias\.
“Jailbreaking” is an adversarial prompting technique which takes advantage of two primary failure modes in current LLM training paradigms\[[25](https://arxiv.org/html/2608.14629#bib.bib15)\]\. In this work we explore jailbreaking LLMs in the context of political summarization\. We use a prompt as shown in Figure[3](https://arxiv.org/html/2608.14629#S2.F3), containing system override phrases\. The prompt emphasizes adopting the specified political bias into the summary\. The LLM is asked to ignore any previous guardrails installed against such attempts\. We test such prompting strategies across all of our evaluated models and use our judge model to test the resultant outputs on our four summarization axes\.
## IIIExperiments
In this paper, we use a 100 video subset from the C\-SPAN Video Library\[[5](https://arxiv.org/html/2608.14629#bib.bib4)\]\. We targeted moderate length videos where the mean duration is 7 minutes 51 seconds with a standard deviation of 2 minutes 27 seconds\. The overall dataset amounts to around 11 hours of video footage of congressional floor proceedings\. These videos were accessed using the tools provided by the C\-SPAN Video Library\[[6](https://arxiv.org/html/2608.14629#bib.bib5)\]\.
In the following experiments, we investigate different methods to mitigate the bias in the LLM output\. We use Chain of Thought prompting, Direct Preference Optimization and Recursive Self\-Correction approaches on the different models and evaluate the outputs on the four axes we define using an LLM\-as\-a\-judge\. These experiments are performed on a single Nvidia GB\-10 GPU with code written in PyTorch\. vLLM\[[16](https://arxiv.org/html/2608.14629#bib.bib24)\]is used as an LLM inference accelerator which uses paged attention\.
### III\-AZero Shot Chain\-of\-Thought
Figure 4:Zero Shot Chain\-of\-Thought Prompt\. The<reasoning\-block\>is shown with its four step formulation\. The salient phrases are highlighted in green, which allow the LLM to detach itself from the bias in the prompt to output an unbiased summary\.To mitigate the bias in the summaries generated earlier, we first utilize a zero shot Chain\-of\-Thought prompting approach\[[14](https://arxiv.org/html/2608.14629#bib.bib23)\]for a low\-cost inference\-time mitigating strategy\. The CoT prompt that we use is a two\-step process\. The first step is to detach the ideology in the biased user prompt given and to maintain strict neutrality and faithfulness to the transcript\. The second step is a<reasoning\-block\>, which act as a set of guidelines, comprising four explicit instructions, including Core Policy Formulation, Argument Mapping, Pivot Strategy Formulation and Neutrality Constraint Statement, as shown in Figure[4](https://arxiv.org/html/2608.14629#S3.F4)\. The model is entirely guided by the structural instructions in the prompt rather than few\-shot demonstrations\. We investigate the results of each of the models using this two\-step zero\-shot CoT mode\.
### III\-BDirect Preference Optimization
To fundamentally alter the weights of the LLM to generate un\-biased summaries during inference when exposed to an biased prompt, we use Direct Preference Optimization \(DPO\)\[[21](https://arxiv.org/html/2608.14629#bib.bib14)\]\. We express the DPO loss by first defining the implicit reward functionrθ\(x,y\)r\_\{\\theta\}\(x,y\)for a given responseyyto promptxx, shown in \([1](https://arxiv.org/html/2608.14629#S3.E1)\):
rθ\(x,y\)=βlogπθ\(y∣x\)πref\(y∣x\)r\_\{\\theta\}\(x,y\)=\\beta\\log\\frac\{\\pi\_\{\\theta\}\(y\\mid x\)\}\{\\pi\_\{\\text\{ref\}\}\(y\\mid x\)\}\(1\)The DPO loss objective, shown in \([2](https://arxiv.org/html/2608.14629#S3.E2)\) is then simplified to a binary cross\-entropy over the reward difference between the preferred responseywy\_\{w\}and the non\-preferred responseyly\_\{l\}:
ℒDPO\(πθ;πref\)=−𝔼\(x,yw,yl\)∼𝒟\[logσ\(rθ\(x,yw\)−rθ\(x,yl\)\)\]\\mathcal\{L\}\_\{\\text\{DPO\}\}\(\\pi\_\{\\theta\};\\pi\_\{\\text\{ref\}\}\)=\-\\mathbb\{E\}\_\{\(x,y\_\{w\},y\_\{l\}\)\\sim\\mathcal\{D\}\}\\Big\[\\log\\sigma\\big\(r\_\{\\theta\}\(x,y\_\{w\}\)\-r\_\{\\theta\}\(x,y\_\{l\}\)\\big\)\\Big\]\(2\)whereπθ\\pi\_\{\\theta\}represents the language model policy being optimized andπref\\pi\_\{\\text\{ref\}\}is the frozen reference model\. The dataset𝒟\\mathcal\{D\}consists of triplets\(x,yw,yl\)\(x,y\_\{w\},y\_\{l\}\), wherexxis the input prompt,ywy\_\{w\}is the preferred response, andyly\_\{l\}is the non\-preferred response\. The hyperparameterβ\\beta, set at 0\.1, controls the strength of the KL divergence penalty, constraining how far the active policyπθ\\pi\_\{\\theta\}can deviate from the reference policyπref\\pi\_\{\\text\{ref\}\}, andσ\\sigmadenotes the logistic sigmoid function\. The loss function aims to push the LLM towards assigning a higher probability to the set of preferred responses while assigning a lower probability to the set of non\-preferred responses\. This approach is then tested on the biased prompting employed earlier without any guardrail CoT prompt, to see whether the model has intrinsically learned the unbiased summarization process\.
TABLE I:Zero\-Shot Performance Comparison: 8B vs\. 70B Architecture\. Both models show similar reduction in performance from a neutral prompt to a biased prompt\.FA\- Factual Alignment,IC\- Information Coverage,PN\- Political Neutrality andAC\- Argumentative Coherence\.
### III\-CRecursive Self\-Correction
Figure 5:Flowchart of the Recursive Self\-Correction Process\. Each box shows a portion of the prompt given to the model at each stage\. The lower portion of each Turn shows a sample from the summary/audit generated by the LLM at that particular Turn\.In this paper, we propose a method to resist jailbreak attacks using a three step Recursive Self\-Correction process, as shown in Figure[5](https://arxiv.org/html/2608.14629#S3.F5)\. We use a three\-stage Chain\-of\-Thought \(CoT\)\[[26](https://arxiv.org/html/2608.14629#bib.bib26)\]based methodology\. In the first stage, the LLM is allowed to produce a baseline summary \(biased\) based on the jailbreak prompt given\. In the second stage, the model is given an “Internal Auditor” role\. The second stage produces an audit block with commentary on its ideological sycophancy, loaded language present, or a partisan framing of the summary\. The final step of the self\-correction process uses the commentary it received from the audit, the original biased summary, the original transcript and the instruction to fix all the errors pointed out by the LLM on the earlier iteration of the summary\.
We use two methods for our implementation of the Recursive Self\-Correction process\. The first is the three turn approach as outlined earlier\. The second approach is to include the<reasoning\-block\>from the Zero\-Shot CoT prompt as an additional guardrail for Turn 1\.
## IVResults
TABLE II:Performance comparison of various alignment and mitigation strategies across evaluated frontier models, using the Political Neutrality axis score on a \(1\-5\) scale\. For the recursive self\-correction methods, the top value represents the score of the initial jailbroken draft \(Turn 1\), and the bottom value represents the score of the final corrected output \(Turn 3\)\. The bold value is the best performing method for Jailbreak prompts and the underlined value is the best method for single prompt bias injection\.Table[II](https://arxiv.org/html/2608.14629#S4.T2)presents an overall view of different methods used to improve the performance of LLMs when prompted adversarially\. The values provided in Table[II](https://arxiv.org/html/2608.14629#S4.T2)are Political Neutrality scores from the LLM\-as\-a\-judge, with a higher score indicating better performance\. Since, the models are graded on a 1\-5 scale, 1 is given to an extremely biased summary and 5 is given to an un\-biased summary\.
### IV\-ABaseline Biased Summaries
In Table[II](https://arxiv.org/html/2608.14629#S4.T2)for the baseline biased summaries, we see the performance decrease to 2\.14 from 4\.24 on the Political Neutrality axis, averaged across all models\. This shows that LLMs are susceptible to biased prompting, in spite of a source transcript\. Qualitatively, the summaries show clear political bias and sycophancy to the user’s views, in spite of a clear transcript to follow during the summarization task\. This can be attributed to the instruction tuning post\-training paradigm which allows LLMs to interact better with users\.
LLM bias is size agnostic\.The results in Table[II](https://arxiv.org/html/2608.14629#S4.T2)show that LLMs across the board perform poorly when given a single biased prompt\. Given that the model sizes we consider range from 3\.5B to 14B parameters, we investigate whether increasing model size would improve the baseline results\. For this study, we used two models from the same family of models to ensure similarity in the training procedures, Llama\-3\-8B\-Instruct and Llama\-3\.1\-70B\[[9](https://arxiv.org/html/2608.14629#bib.bib7)\]\. The results are shown in Table[I](https://arxiv.org/html/2608.14629#S3.T1)\. We observe that merely increasing the model size does not retain its faithfulness to the provided transcript given a biased prompt\. Both models perform similarly on all four defined axes\. Although the larger model adopts a more polished tone while summarizing the transcripts, the bias is still present as in the smaller Llama model\.
### IV\-BBias Mitigation Strategies
Zero Shot Chain\-of\-Thought\.To tackle the injection of bias into LLM generated summaries, the first method implemented to act as a set of guardrails, is a zero\-shot CoT prompt, as outlined in Section[III\-A](https://arxiv.org/html/2608.14629#S3.SS1)\. We see from Table[II](https://arxiv.org/html/2608.14629#S4.T2)that the results for all models improve to the Neutral, unbiased summary performance\. The CoT prompt is successfully able to provide a clear path for the LLM to localize the bias in the prompt given by a user\. Further, it is able to re\-route its focus onto the given transcript and output an un\-biased summary\.
Direct Preference Optimization\.Given that the CoT prompt is able to maintain model performance in spite of a biased prompt, we implement a Direct Preference Optimization to fine\-tune the model\. Since DPO fundamentally alters the weights using Low\-Rank Adaptations\[[12](https://arxiv.org/html/2608.14629#bib.bib25)\], the models essentially become more resistant to adopting the bias in the user prompt\. The results in Table[II](https://arxiv.org/html/2608.14629#S4.T2)show that DPO brings the model performance back to prior performance even when given a biased prompt\.
Figure 6:Radar plot for average performance of all models on the four LLM\-as\-a\-judge axes for Recursive Self\-Correction vs Biased Baseline\.FA\- Factual Alignment,IC\- Information Coverage,PN\- Political Neutrality andAC\- Argumentative Coherence,RSC\- Recursive Self\-Correction \(Turn 3\)\.Effects of Jailbreaking\.Most LLMs have safety filters, which allow the model to refuse responses when prompted with extreme requests, or with severe bias\. We find that only in about 7% of instances out of 1,200 evaluated prompts, the models’ safety filters engaged correctly allowing the model to sidestep the request\. Since jailbreak prompts so cleverly are able to mask the malicious request within a professional task, LLMs generate an output without triggering the safety filter\.
Recursive Self\-Correction\.To tackle the challenge of neutralizing the adversarial jailbreak prompt, we use a Recursive Self\-Correction mechanism using a CoT based iterative prompting strategy, as shown in Figure[5](https://arxiv.org/html/2608.14629#S3.F5)\. From Table[II](https://arxiv.org/html/2608.14629#S4.T2), we are able to see that the model performance at Turn 3 is close to the Neutral unbiased level\. This is a significant improvement as jailbreak is a pertinent problem in LLMs\. Safety filters, which combat jailbreak prompts cover a wide range of prompts for harmful content, but not prompts containing political bias\. We also observe in Table[II](https://arxiv.org/html/2608.14629#S4.T2), that the inclusion of the CoT prompts gives better model performance at Turn 1\. The fact that by Turn 3, both Recursive Self\-Correction methods are able to recover close to Neutral performance shows the rehabilitative power of the proposed method in combating jailbreak style prompts\. A radar plot, with the averaged performance of this method across all models is shown in Figure[6](https://arxiv.org/html/2608.14629#S4.F6), where the proposed Recursive Self\-Correction method shows comparable performance to the Neutral baseline, successfully mitigating the injected bias from the jailbreak prompts\.
## VConclusion
In this paper, we present different methods of political bias mitigation in Large Language Models\. We show different methods by which political bias can be injected into LLM generated summaries, from a single biased prompt to jailbreak attempts\. We also propose strategies to mitigate or prevent bias from appearing in the LLM output summaries\. Our proposed method of a Chain\-of\-Thought prompt successfully returns the LLM performance close to the original Neutral baseline for single biased prompts\. The Recursive Self\-Correction method used to tackle Jailbreak attempts on LLMs, successfully uses the base LLM model to iteratively remove biased aspects from the summary\. We also perform a Direct Preference Optimization to show that LLMs can be fine\-tuned to incorporate such guardrails against political bias\. Thus, in critical and sensitive applications which require an LLM to be faithful to a reference text and be resistant to external biased attacks, these methods may be employed to mitigate and neutralize their effects\.
## References
- \[1\]M\. Abdin, J\. Aneja, H\. Behl, S\. Bubeck, R\. Eldan, S\. Gunasekar, M\. Harrison, R\. J\. Hewett, M\. Javaheripi, P\. Kauffmann,et al\.\(2024\)Phi\-4 technical report\.arXiv preprint arXiv:2412\.08905\.Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.2.2.4)\.
- \[2\]J\. Achiam, S\. Adler, S\. Agarwal, L\. Ahmad, I\. Akkaya, F\. L\. Aleman, D\. Almeida, J\. Altenschmidt, S\. Altman, S\. Anadkat,et al\.\(2023\)Gpt\-4 technical report\.arXiv preprint arXiv:2303\.08774\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p3.1)\.
- \[3\]D\. M\. Argaw, S\. Yoon, F\. C\. Heilbron, H\. Deilamsalehy, T\. Bui, Z\. Wang, F\. Dernoncourt, and J\. S\. Chung\(2024\)Scaling up video summarization pretraining with large language models\.Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,pp\. 8332–8341\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p4.1)\.
- \[4\]J\. Bai, S\. Bai, Y\. Chu, Z\. Cui, K\. Dang, X\. Deng, Y\. Fan, W\. Ge, Y\. Han, F\. Huang, B\. Hui, L\. Ji, M\. Li, J\. Lin, R\. Lin, D\. Liu, G\. Liu, C\. Lu, K\. Lu, J\. Ma, R\. Men, X\. Ren, X\. Ren, C\. Tan, S\. Tan, J\. Tu, P\. Wang, S\. Wang, W\. Wang, S\. Wu, B\. Xu, J\. Xu, A\. Yang, H\. Yang, J\. Yang, S\. Yang, Y\. Yao, B\. Yu, H\. Yuan, Z\. Yuan, J\. Zhang, X\. Zhang, Y\. Zhang, Z\. Zhang, C\. Zhou, J\. Zhou, X\. Zhou, and T\. Zhu\(2023\)Qwen technical report\.arXiv preprint arXiv:2309\.16609\.Cited by:[§II\-B](https://arxiv.org/html/2608.14629#S2.SS2.p1.1)\.
- \[5\]\(2014\)The c\-span video archives: a case study\.The American Archivist77\(2\),pp\. 425–443\.Cited by:[§III](https://arxiv.org/html/2608.14629#S3.p1.1)\.
- \[6\]R\. Browning\(2017\)From analogue to digital: the evolutionary design of the c\-span archives\.Journal of Digital Media Management5\(3\),pp\. 285–292\.Cited by:[§III](https://arxiv.org/html/2608.14629#S3.p1.1)\.
- \[7\]N\. Ejaz, T\. B\. Tariq, and S\. W\. Baik\(2012\)Adaptive key frame extraction for video summarization using an aggregation mechanism\.Journal of Visual Communication and Image Representation23\(7\),pp\. 1031–1040\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p4.1)\.
- \[8\]J\. Fisher, S\. Feng, R\. Aron, T\. Richardson, Y\. Choi, D\. W\. Fisher, J\. Pan, Y\. Tsvetkov, and K\. Reinecke\(2026\)Biased ai can influence political decision\-making\.arXiv preprint arXiv:2410\.06415\.External Links:[Link](https://arxiv.org/abs/2410.06415)Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p2.1)\.
- \[9\]A\. Grattafiori, A\. Dubey, A\. Jauhri, A\. Pandey, A\. Kadian, A\. Al\-Dahle, A\. Letman, A\. Mathur, A\. Schelten, A\. Vaughan,et al\.\(2024\)The llama 3 herd of models\.arXiv preprint arXiv:2407\.21783\.Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1),[§IV\-A](https://arxiv.org/html/2608.14629#S4.SS1.p2.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.2.2.2)\.
- \[10\]X\. Hou, Y\. Zhao, and H\. Wang\(2025\)LLM applications: current paradigms and the next frontier\.arXiv preprint arXiv:2503\.04596\.External Links:[Link](https://arxiv.org/abs/2503.04596)Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1)\.
- \[11\]B\. Hu, Q\. Sheng, J\. Cao, Y\. Shi, Y\. Li, D\. Wang, and P\. Qi\(2024\)Bad actor, good advisor: exploring the role of large language models in fake news detection\.Proceedings of the Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence38\(20\),pp\. 22105–22113\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p2.1)\.
- \[12\]E\. J\. Hu, Y\. Shen, P\. Wallis, Z\. Allen\-Zhu, Y\. Li, S\. Wang, L\. Wang, W\. Chen,et al\.\(2022\)Lora: low\-rank adaptation of large language models\.\.Proceedings of the International Conference on Learning Representations\.Cited by:[§IV\-B](https://arxiv.org/html/2608.14629#S4.SS2.p2.1)\.
- \[13\]J\. T\. Huang, J\. Choi, and Y\. Wan\(2024\)Politically biased moderation drives echo chamber formation: an analysis of user\-driven content removals on reddit\.Available at SSRN 4990476\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p2.1)\.
- \[14\]T\. Kojima, S\. S\. Gu, M\. Reid, Y\. Matsuo, and Y\. Iwasawa\(2022\)Large language models are zero\-shot reasoners\.Proceedings of the Advances in Neural Information Processing Systems35,pp\. 22199–22213\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p3.1),[§III\-A](https://arxiv.org/html/2608.14629#S3.SS1.p1.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.6.6.1)\.
- \[15\]A\. Kumar, C\. Agarwal, S\. Srinivas, A\. J\. Li, S\. Feizi, and H\. Lakkaraju\(2023\)Certifying llm safety against adversarial prompting\.arXiv preprint arXiv:2309\.02705\.Cited by:[§II\-D](https://arxiv.org/html/2608.14629#S2.SS4.p1.1)\.
- \[16\]W\. Kwon, Z\. Li, S\. Zhuang, Y\. Sheng, L\. Zheng, C\. H\. Yu, J\. Gonzalez, H\. Zhang, and I\. Stoica\(2023\)Efficient memory management for large language model serving with pagedattention\.Proceedings of the 29th Symposium on Operating Systems Principles,pp\. 611–626\.Cited by:[§III](https://arxiv.org/html/2608.14629#S3.p2.1)\.
- \[17\]A\. H\. Liu, K\. Khandelwal, S\. Subramanian, V\. Jouault, A\. Rastogi, A\. Sadé, A\. Jeffares, A\. Jiang, A\. Cahill, A\. Gavaudan,et al\.\(2026\)Ministral 3\.arXiv preprint arXiv:2601\.08584\.Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.2.2.5)\.
- \[18\]OpenAI\(2025\-10\)Defining and evaluating political bias in llms\.Note:[https://openai\.com/index/defining\-and\-evaluating\-political\-bias\-in\-llms/](https://openai.com/index/defining-and-evaluating-political-bias-in-llms/)Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p3.1)\.
- \[19\]L\. Ouyang, J\. Wu, X\. Jiang, D\. Almeida, C\. L\. Wainwright, P\. Mishkin, C\. Zhang, S\. Agarwal, K\. Slama, A\. Ray, J\. Schulman, J\. Hilton, F\. Kelton, L\. Miller, M\. Simens, A\. Askell, P\. Welinder, P\. Christiano, J\. Leike, and R\. Lowe\(2022\)Training language models to follow instructions with human feedback\.arXiv preprint arXiv:2203\.02155\.External Links:[Link](https://arxiv.org/abs/2203.02155)Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p2.1)\.
- \[20\]A\. Radford, J\. W\. Kim, T\. Xu, G\. Brockman, C\. McLeavey, and I\. Sutskever\(2022\)Robust speech recognition via large\-scale weak supervision\.arXiv preprint arXiv:2212\.04356\.External Links:[Link](https://arxiv.org/abs/2212.04356)Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p1.1)\.
- \[21\]R\. Rafailov, A\. Sharma, E\. Mitchell, C\. D\. Manning, S\. Ermon, and C\. Finn\(2023\)Direct preference optimization: your language model is secretly a reward model\.Proceedings of the Advances in Neural Information Processing Systems36,pp\. 53728–53741\.Cited by:[§III\-B](https://arxiv.org/html/2608.14629#S3.SS2.p1.3),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.7.7.1)\.
- \[22\]A\. Singh, A\. Fry, A\. Perelman, A\. Tart, A\. Ganesh, A\. El\-Kishky, A\. McLaughlin, A\. Low, A\. Ostrow, A\. Ananthram,et al\.\(2025\)Openai gpt\-5 system card\.arXiv preprint arXiv:2601\.03267\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p3.1)\.
- \[23\]Z\. Sun, Z\. Zhang, X\. Shen, Z\. Zhang, Y\. Liu, M\. Backes, Y\. Zhang, and X\. He\(2025\)Are we in the ai\-generated text world already? quantifying and monitoring aigt on social media\.Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics,pp\. 22975–23005\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p1.1)\.
- \[24\]G\. Team, M\. Riviere, S\. Pathak, P\. G\. Sessa, C\. Hardin, S\. Bhupatiraju, L\. Hussenot, T\. Mesnard, B\. Shahriari, A\. Ramé,et al\.\(2024\)Gemma 2: improving open language models at a practical size\.arXiv preprint arXiv:2408\.00118\.Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.2.2.3)\.
- \[25\]A\. Wei, N\. Haghtalab, and J\. Steinhardt\(2023\)Jailbroken: how does llm safety training fail?\.Proceedings of the Advances in Neural Information Processing Systems36,pp\. 80079–80110\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p3.1),[§II\-D](https://arxiv.org/html/2608.14629#S2.SS4.p2.1)\.
- \[26\]J\. Wei, X\. Wang, D\. Schuurmans, M\. Bosma, F\. Xia, E\. Chi, Q\. V\. Le, D\. Zhou,et al\.\(2022\)Chain\-of\-thought prompting elicits reasoning in large language models\.Proceedings of the Advances in Neural Information Processing Systems35,pp\. 24824–24837\.Cited by:[§III\-C](https://arxiv.org/html/2608.14629#S3.SS3.p1.1)\.
- \[27\]J\. Wu, S\. Yang, R\. Zhan, Y\. Yuan, L\. S\. Chao, and D\. F\. Wong\(2025\)A survey on llm\-generated text detection: necessity, methods, and future directions\.Computational Linguistics51\(1\),pp\. 275–338\.Cited by:[§I](https://arxiv.org/html/2608.14629#S1.p1.1)\.
- \[28\]A\. Yang, A\. Li, B\. Yang, B\. Zhang, B\. Hui, B\. Zheng, B\. Yu, C\. Gao, C\. Huang, C\. Lv,et al\.\(2025\)Qwen3 technical report\.arXiv preprint arXiv:2505\.09388\.Cited by:[§II\-A](https://arxiv.org/html/2608.14629#S2.SS1.p2.1),[TABLE II](https://arxiv.org/html/2608.14629#S4.T2.4.2.2.6)\.
- \[29\]L\. Zheng, W\. Chiang, Y\. Sheng, S\. Zhuang, Z\. Wu, Y\. Zhuang, Z\. Lin, Z\. Li, D\. Li, E\. Xing,et al\.\(2023\)Judging llm\-as\-a\-judge with mt\-bench and chatbot arena\.Proceedings of the Advances in Neural Information Processing Systems36,pp\. 46595–46623\.Cited by:[3rd item](https://arxiv.org/html/2608.14629#S1.I1.i3.p1.1),[§II\-B](https://arxiv.org/html/2608.14629#S2.SS2.p1.1)\.Similar Articles
Cultural Adaptation in Large Language Models for Political Discourse
This paper explores methods for adapting large language models to cultural contexts in political discourse, aiming to improve cross-cultural understanding and reduce bias.
Reducing Political Manipulation with Consistency Training
This paper introduces Political Consistency Training (PCT), a reinforcement learning approach to reduce covert political bias in large language models while maintaining helpfulness, and releases metrics for sentiment and helpfulness consistency.
Confirming Our Biases? Evaluating the Capabilities, Risks, and Societal Impact of Large Language Models
This preprint evaluates how six large language models respond to prompt framing and biased prompts across 160 prompts, finding that LLMs systematically adapt their responses to align with prompt framing even in factual contexts, potentially reinforcing user biases.
Political Plasticity: An Analysis of Ideological Adaptability in Large Language Models
This research paper analyzes 'political plasticity' in Large Language Models, finding that newer models exhibit reliable ideological adaptability when prompted with user examples, whereas older models show limited or unstable responses.
How Far Will They Go? Red-Teaming Online Influence with Large Language Models
This paper introduces a red-teaming framework that measures the 'Overton Window' of political opinions open-source LLMs can express and evaluates how simple jailbreaks expand that range, finding systematic left-leaning biases and vulnerabilities across 30+ models.