HARP: Hierarchical Adaptive Ranking with Preference-Adaptive Fusion for Query-Based CVE Prioritization

• URL: http://arxiv.org/abs/2608.19430v1
• Date: Wed, 19 Aug 2026 20:29:00 GMT
• Title: HARP: Hierarchical Adaptive Ranking with Preference-Adaptive Fusion for Query-Based CVE Prioritization
• Abstract summary: We propose a graph-grounded multi-view framework that ranks candidates from a natural-language query together with a support bank of historical labeled examples.<n>HarP retrieves evidence from a vulnerability knowledge graph, scores candidates with policy-conditioned global, enterprise, and user views, and fits view-fusion weights from sampled supports.
• Score: 84.9738509922482
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Vulnerability prioritization is inherently preference dependent, since the same CVE can receive different remediation priority under different operational preference scenarios. Existing scoring systems and ranking methods typically assume a fixed criterion. In practice, organizations already operate under a preference scenario, but this preference is often implicit and difficult to express as a written prompt instruction, while triage queries usually do not encode it. Past validated triage cases under the current scenario are more readily available. We study query-based CVE prioritization in this setting and propose HARP, a graph-grounded multi-view framework that ranks candidates from a natural-language query together with a support bank of historical labeled examples from the current preference scenario, without requiring an explicit textual summary of that scenario. HARP retrieves evidence from a vulnerability knowledge graph, scores candidates with policy-conditioned global, enterprise, and user views, and fits view-fusion weights from sampled supports. Experiments across three preference scenarios and multiple backbone LLMs show that HARP outperforms multiple baselines, expressing our method's effectiveness.

Related papers

• ORDER: Task-Conditioned Routing for Retrieval-Augmented Generation [3.6028767235872965]
  In this paper, we introduce a query-conditioned RAG framework that jointly adapts indexing and retrieval to the incoming query.<n>We evaluate our framework on large-scale, heterogeneous historical archives and show that conditioning both indexing and retrieval on the query consistently outperforms both naive baselines and strong state-of-the-art RAG systems.
  arXiv  Detail & Related papers  (2026-09-15T11:23:16Z)
• VIBE-Bench: Evaluating Personalized Large Language Models When Profiles Don't Mean Preferences [40.195544693657396]
  Existing benchmarks largely assume that preference can be retrieved from semantically related history.<n>We study an underexplored but practically important regime, profile-preference conceptual misalignment.<n>We introduce VIBE-Bench, a benchmark with two psychology-grounded tasks and 12,239 dialogues.
  arXiv  Detail & Related papers  (2026-09-01T08:45:28Z)
• Which Histories Matter for Time Series Forecasting? Learning Predictive Relevance with Future Supervision [0.0]
  A normalized-pattern retriever learns a listwise future-compatibility target while keeping inference-time scoring strictly past-only.<n>Our method retains similarity-based candidate generation but reranks its candidates by a more predictive relevance criterion.<n>Across six benchmarks, the reranker improves Pattern retrieval while revealing candidate-global, query-specific, and mixed relevance regimes.
  arXiv  Detail & Related papers  (2026-08-24T13:15:29Z)
• F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking [79.49893545611779]
  Large Language Models (LLMs) can generate a subset and order it within a single autoregressive pass.<n>This flexibility introduces a new optimization challenge: the model must search an output space while receiving utility feedback only after the full ranked list is generated.<n>This credit assignment gap makes end-to-end optimization unstable and sample-inefficient.<n>We propose a unified framework that performs both within a single autoregressive rollout and optimize them end-to-end via factorized group-relative policy optimization.
  arXiv  Detail & Related papers  (2026-05-13T04:52:33Z)
• CaST-POI: Candidate-Conditioned Spatiotemporal Modeling for Next POI Recommendation [18.263381277536357]
  Next Point-of-Interest (POI) recommendation plays a crucial role in location-based services by predicting users' future mobility patterns.<n>Existing methods typically compute a single user representation from historical trajectories and use it to score all candidate POIs uniformly.<n>We propose CaST-POI, a candidate-conditioned model for next POI recommendation.
  arXiv  Detail & Related papers  (2026-02-10T07:10:18Z)
• Multifaceted Scenario-Aware Hypergraph Learning for Next POI Recommendation [6.180520055741916]
  Next Point-of-Interest (POI) recommendation plays a crucial role in inferring user preferences from historical check-in trajectories.<n>Existing sequential and graph-based methods frequently neglect significant mobility variations across distinct contextual scenarios.<n>We propose the Multifaceted Scenario-Aware Hypergraph Learning method (MSAHG), a framework that adopts a scenario-splitting paradigm for next POI recommendation.
  arXiv  Detail & Related papers  (2026-01-09T06:29:55Z)
• Order Matters: Rethinking Prompt Construction in In-Context Learning [52.19217980839306]
  In-context learning (ICL) enables large language models to perform new tasks by conditioning on a sequence of examples.<n>Most prior work assumes that which examples are chosen has a far greater effect on performance than how those examples are ordered.<n>We revisit this assumption and conduct a systematic comparison between the effect of selection and ordering.
  arXiv  Detail & Related papers  (2025-11-12T19:57:55Z)
• Robust Preference Alignment via Directional Neighborhood Consensus [13.313830197011983]
  We introduce Robust Preference Selection (RPS), a post-hoc, training-free method by leveraging directional neighborhood consensus.<n>RPS samples multiple responses from a local neighborhood of related preferences to create a superior candidate pool.<n>Our work presents a practical, theoretically-grounded solution for enhancing the reliability of preference-aligned models.
  arXiv  Detail & Related papers  (2025-10-23T12:39:20Z)
• Vague Preference Policy Learning for Conversational Recommendation [48.868921530958666]
  Conversational recommendation systems commonly assume users have clear preferences, leading to potential over-filtering.<n>We introduce the Vague Preference Multi-round Conversational Recommendation (VPMCR) scenario, employing a soft estimation mechanism to accommodate users' vague and dynamic preferences.<n>Our work advances CRS by accommodating users' inherent ambiguity and relative decision-making processes, improving real-world applicability.
  arXiv  Detail & Related papers  (2023-06-07T14:57:21Z)
• Going beyond research datasets: Novel intent discovery in the industry setting [60.90117614762879]
  This paper proposes methods to improve the intent discovery pipeline deployed in a large e-commerce platform. We show the benefit of pre-training language models on in-domain data: both self-supervised and with weak supervision. We also devise the best method to utilize the conversational structure (i.e., question and answer) of real-life datasets during fine-tuning for clustering tasks, which we call Conv.
  arXiv  Detail & Related papers  (2023-05-09T14:21:29Z)
• Session-Aware Query Auto-completion using Extreme Multi-label Ranking [61.753713147852125]
  We take the novel approach of modeling session-aware query auto-completion as an e Multi-Xtreme Ranking (XMR) problem. We adapt a popular XMR algorithm for this purpose by proposing several modifications to the key steps in the algorithm. Our approach meets the stringent latency requirements for auto-complete systems while leveraging session information in making suggestions.
  arXiv  Detail & Related papers  (2020-12-09T17:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.