GUARD-D-LLM: An LLM-Based Risk Assessment Engine for the Downstream uses of LLMs
sundaraparipurnan Narayanan, Sandeep Vishwakarma

TL;DR
This paper introduces GUARD-D-LLM, an innovative LLM-based risk assessment engine that identifies, ranks, and mitigates risks in downstream LLM applications, addressing a critical gap in practical AI risk management.
Contribution
It presents a novel risk assessment framework leveraging multiple intelligent agents to evaluate and mitigate risks specific to downstream LLM uses, filling a gap in existing research.
Findings
Successfully identifies and ranks risks in LLM applications
Provides targeted mitigation suggestions for specific use cases
Facilitates early risk detection and mitigation in LLM development
Abstract
Amidst escalating concerns about the detriments inflicted by AI systems, risk management assumes paramount importance, notably for high-risk applications as demanded by the European Union AI Act. Guidelines provided by ISO and NIST aim to govern AI risk management; however, practical implementations remain scarce in scholarly works. Addressing this void, our research explores risks emanating from downstream uses of large language models (LLMs), synthesizing a taxonomy grounded in earlier research. Building upon this foundation, we introduce a novel LLM-based risk assessment engine (GUARD-D-LLM: Guided Understanding and Assessment for Risk Detection for Downstream use of LLMs) designed to pinpoint and rank threats relevant to specific use cases derived from text-based user inputs. Integrating thirty intelligent agents, this innovative approach identifies bespoke risks, gauges their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBiomedical Text Mining and Ontologies · Occupational Health and Safety Research
