paper-with-me

홈 › Papers

Cannot See the Forest for the Trees: Invoking Heuristics and Biases to Elicit Irrational Choices of LLMs

2025-05-03 · Haoming Yang, Ke Ma, Xiaojun Jia, Yingfei Sun, Qianqian Xu, Qingming Huang

Despite the remarkable performance of Large Language Models (LLMs), they remain vulnerable to jailbreak attacks, which can compromise their safety mechanisms. Existing studies often rely on brute-force optimization or manual design, failing to uncover potential risks in real-world scenarios. To address this, we propose a novel jailbreak attack framework, ICRT, inspired by heuristics and biases in human cognition. Leveraging the simplicity effect, we employ cognitive decomposition to reduce the complexity of malicious prompts. Simultaneously, relevance bias is utilized to reorganize prompts, enhancing semantic alignment and inducing harmful outputs effectively. Furthermore, we introduce a ranking-based harmfulness evaluation metric that surpasses the traditional binary success-or-failure paradigm by employing ranking aggregation methods such as Elo, HodgeRank, and Rank Centrality to comprehensively quantify the harmfulness of generated content. Experimental results show that our approach consistently bypasses mainstream LLMs' safety mechanisms and generates high-risk content, providing insights into jailbreak attack risks and contributing to stronger defense strategies.

📄 PDF Abstract BibTeX arXiv:2505.02862

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fairness-guided SMT-based Rectification of Decision Trees and Random Forests

2020-11-22 · Jiang Zhang, Ivan Beschastnikh, Sergey Mechtaev, Abhik Roychoudhury

Data-driven decision making is gaining prominence with the popularity of various machine learning models. Unfortunately, real-life data used in machine learning training may capture human biases, and as a result the lear…

BIG-bench Machine LearningDecision MakingFairnessProgram Repair

Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees

2022-01-01 · CVPR 2022 1 · Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán

Ensemble methods based on decision trees, such as Random Forests or boosted forests, have long been established as some of the most powerful, off-the-shelf machine learning models, and have been widely used in comput…

Jump Like A Squirrel: Optimized Execution Step Order for Anytime Random Forest Inference

2026-03-02 · Daniel Biebert, Christian Hakert, Kay Heider, Daniel Kuhse 외 arxiv

Due to their efficiency and small size, decision trees and random forests are popular machine learning models used for classification on resource-constrained systems. In such systems, the available execution time for inf…

Simplest Streaming Trees

2021-10-16 · Haoyin Xu, Jayanta Dey, Sambit Panda, Joshua T. Vogelstein

Decision forests, including random forests and gradient boosting trees, remain the leading machine learning methods for many real-world data problems, especially on tabular data. However, most of the current implementati…

Continual LearningTransfer Learning

Decision tree heuristics can fail, even in the smoothed setting

2021-07-02 · Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan

Greedy decision tree learning heuristics are mainstays of machine learning practice, but theoretical justification for their empirical success remains elusive. In fact, it has long been known that there are simple target…