RULER: Instance-aware Rubric Rewards for SVG Generation
Summary
RULER introduces instance-aware rubric rewards for SVG generation, using a vision-language judge to optimize reinforcement learning and significantly improve performance over previous methods.
View Cached Full Text
Cached at: 09/23/26, 03:32 AM
Paper page - RULER: Instance-aware Rubric Rewards for SVG Generation
Source: https://huggingface.co/papers/2609.25270
Abstract
GeneratingScalableVectorGraphics(SVG)codefromnatural-languageinstructionsisanopen-endedtaskwithoutabsolutevisualgroundtruth,leavingbothevaluationandpolicyoptimizationwithoutafaithfulsignal.Scalarmetrics(CLIP,Aesthetic)calibratedonnaturalimagestransferpoorlytostylizedvectorcontent,andreusingthemasRLrewardstriggersrewardhacking.Weaddressbothlimitationswithrubric-basedscoring.Wefirstestablishempiricallythatpromptingavision-languagejudgewithamulti-axisrubriccorrelateswithhumanjudgmentsfarbetterthanscalarmetrics,bothacrosssamplesandwithininstructions.Buildingonthisfinding,weintroduceRULER(Instance-awareRubricRewardsforReinforcementLearning),whichconvertseachinstructionintoaninstance-awarerubricofsixitemsspanningsemantic,visual,andstylisticaxes;ajudgeVLMscoresrenderedrolloutsitem-by-item,andtheweightedsatisfactionsformafine-grainedrewardoptimizedviaGroupRelativePolicyOptimization.Becausetherubricisderivedfromtextalone,RULERrequiresneitherpairedSVGgroundtruthnorhumanpreferencelabels.OnMMSVG-IllustrationandMMSVG-Icon,RULERliftstherubricscorefrom0.432/0.395to0.693/0.683,surpassingdedicatedSVGspecialistsandmatchingthesubstantiallylargerDeepSeek-V3,withablationsidentifyingrubricdesignastheactiveleverforRLonopen-endedSVGgeneration.Theprojectpageisavailableathttps://hangyuran.github.io/RULER/.
View arXiv pageView PDFProject pageAdd to collection
Get this paper in your agent:
hf papers read 2609\.25270
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.25270 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.25270 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.25270 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
AutoRubric-T2I: Robust Rule-Based Reward Model for Text-to-Image Alignment
AutoRubric-T2I automatically generates and selects explicit rubrics to guide Vision-Language Model judges for text-to-image generation, achieving high-quality reward signals with minimal human annotation and improving generation quality in downstream tasks.
Not Every Rubric Teaches Equally: Policy-Aware Rubric Rewards for RLVR
This paper introduces POW3R, a policy-aware rubric reward framework for reinforcement learning with verifiable rewards (RLVR). It shows that static rubric aggregation misallocates learning signal, and POW3R achieves faster convergence and better performance across multiple settings.
V-Rubrics: Visual Faithfulness via Rubric-Based Reinforcement Learning
Introduces a rubric-based reinforcement learning method to improve visual faithfulness in vision-language models by decomposing responses into atomic propositions and scoring them on visual faithfulness, reasoning consistency, and instruction following.
Auto-Rubric as Reward: From Implicit Preferences to Explicit Multimodal Generative Criteria
This paper introduces the Auto-Rubric as Reward (ARR) framework, which externalizes implicit preference knowledge into explicit rubrics for multimodal alignment. It proposes Rubric Policy Optimization (RPO) to stabilize policy gradients, achieving better performance in text-to-image and image editing tasks.
RUBRIC-ARROW: Alternating Pointwise Rubric Reward Modeling for LLM Post-training in Non-verifiable Domains
RUBRIC-ARROW presents an alternating framework for reward modeling that improves upon rubric-based methods by reducing ties and leveraging pairwise preference data, achieving competitive accuracy and gains for LLM post-training in non-verifiable domains.