aiqbench analysis
This paper challenges the prevailing trend of using text generation for aspect-based sentiment analysis (ABSA) by demonstrating that competitive performance can be achieved through a frozen model answering typed decisions without backbone tuning. The approach achieves state-of-the-art results on SemEval-2026 Task III Track A, significantly outperforming large fine-tuned baselines like Llama-3.3 and GPT-OSS while reducing computational overhead.
Decide, Don't Generate: Competitive Dimensional ABSA with Jev's Typed Decisions
arXiv:2609.35293v1 Announce Type: new Abstract: Aspect-based sentiment analysis (ABSA) has largely turned to text generation. We show that competitive dimensional ABSA does not need it. Using Jev, a frozen model that answers typed questions with rubric scores, label probabilities, and yes/no judgments, we decompose all three tasks of SemEval-2026 Task III Track A into such decisions and align them with the annotation scheme through 488 coefficients fitted on CPU, with no text generation and no backbone tuning. On valence-arousal regression over ten corpora in six languages, the system reaches 1.0645 RMSE, the lowest aggregate error of any participating system. On triplet and quadruplet extraction, it reaches 52.09 and 44.06 continuous F1, above fine-tuned Llama-3.3-70B and GPT-OSS-120B baselines. Analyses and ablations show where the accuracy comes from: supervised calibration roughly halves the raw regression error, exact valence-arousal would add only 4.5 F1 to extraction, and the learned combination of span-boundary evidence, not any single signal, carries the extraction systems.
Abstract:Aspect-based sentiment analysis (ABSA) has largely turned to text generation. We show that competitive dimensional ABSA does not need it. Using Jev, a frozen model that answers typed questions with rubric scores, label probabilities, and yes/no judgments, we decompose all three tasks of SemEval-2026 Task III Track A into such decisions and align them with the annotation scheme through 488 coefficients fitted on CPU, with no text generation and no backbone tuning. On valence-arousal regression over ten corpora in six languages, the system reaches 1.0645 RMSE, the lowest aggregate error of any participating system. On triplet and quadruplet extraction, it reaches 52.09 and 44.06 continuous F1, above fine-tuned Llama-3.3-70B and GPT-OSS-120B baselines. Analyses and ablations show where the accuracy comes from: supervised calibration roughly halves the raw regression error, exact valence-arousal would add only 4.5 F1 to extraction, and the learned combination of span-boundary evidence, not any single signal, carries the extraction systems.
14 pages, 2 figures, 9 tables. Code: this https URL
Computation and Language (cs.CL)
arXiv:2609.35293 [cs.CL]
(or arXiv:2609.35293v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.35293 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 258 words
Related coverage
Copy of my FLF Epistemic Case Study Competition
LessWrong · Jul 20, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

Game Design Creativity evals
LessWrong · Oct 12, 2026

OpenRouter: from Seed to Stripe — with OpenRouter’s Alex Atallah & AMP’s Anjney Midha
Latent Space · Sep 25, 2026