Amirfarrokh Iranitalab
Author directory2026
UCVE: Graph Structured Retrieval for Compliance Validation
Emily Chen | Michelle Menachery | Rahul Nenavath | Himanshu Kumar | Amirfarrokh Iranitalab
Proceedings of the Natural Legal Language Processing Workshop 2026
Emily Chen | Michelle Menachery | Rahul Nenavath | Himanshu Kumar | Amirfarrokh Iranitalab
Proceedings of the Natural Legal Language Processing Workshop 2026
Structured compliance validation requires determining whether every obligation in a predefined requirement space is satisfied, violated, or unaddressed by a given document. This can be described as a coverage problem that existing retrieval and classification systems, by treating requirements as independent, are not designed to solve. We introduce UCVE, a domain-agnostic framework that represents compliance requirement spaces as a CRG and performs retrieval via spectral reranking over its reinforcement learning-weighted Laplacian. Edges between requirement nodes are learned via reinforcement learning with a traversal reward grounded in violation detection, reshaping the graph’s community structure such that low-pass spectral filtering distinguishes relevant from irrelevant obligation clusters. Evaluating across three compliance domains, UCVE averages 4.3% matched-K recall lift over flat cosine retrieval and consistently outperforms strong retrieval and graph-based baselines.
Beyond the Vacuum: Combinatorial Strategy Selection for Competitor-Aware Generative Engine Optimization
Vaibhav Sourirajan | Yao Zhang | Himanshu Kumar | Sahil Wadhwa | Mann Patel | Amirfarrokh Iranitalab
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Vaibhav Sourirajan | Yao Zhang | Himanshu Kumar | Sahil Wadhwa | Mann Patel | Amirfarrokh Iranitalab
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Generative Engine Optimization (GEO) has emerged as a novel paradigm for transforming content to increase visibility in Large Language Model (LLM) responses. Traditional GEO methods, however, select rewriting strategies in isolation, ignoring a critical externality: as adoption of content optimization grows, optimal strategies for rewriting content change. We formalize GEO as a *competitor-aware* strategy selection problem and propose a two-phase pipeline to solve it: (1) We use Bayesian Optimization of Combinatorial Structures (BOCS) to efficiently search the space of rewriting strategies, (2) We generate preference pairs and grounded reasoning traces from the BOCS black-box observations to fine-tune a language model to analyze a document corpus and propose optimal rewriting strategy combinations. We achieve state-of-the-art performance across several impression metrics over existing agentic and single-heuristic methods on both geo-bench and our synthetically augmented competitive dataset geo-benchcomp. Our method also transfers to multiple out-of-distribution datasets, proving effective across domains, queries, and document types.