{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5FKUAMJUCZQNDBO4ON4I36YN65","short_pith_number":"pith:5FKUAMJU","schema_version":"1.0","canonical_sha256":"e9554031341660d185dc73788dfb0df7746c3b66d2c267ff42f941d66460365e","source":{"kind":"arxiv","id":"2406.04312","version":2},"attestation_state":"computed","paper":{"title":"ReNO: Enhancing One-step Text-to-Image Models through Reward-based Noise Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexey Dosovitskiy, Karsten Roth, Luca Eyring, Shyamgopal Karthik, Zeynep Akata","submitted_at":"2024-06-06T17:56:40Z","abstract_excerpt":"Text-to-Image (T2I) models have made significant advancements in recent years, but they still struggle to accurately capture intricate details specified in complex compositional prompts. While fine-tuning T2I models with reward objectives has shown promise, it suffers from \"reward hacking\" and may not generalize well to unseen prompt distributions. In this work, we propose Reward-based Noise Optimization (ReNO), a novel approach that enhances T2I models at inference by optimizing the initial noise based on the signal from one or multiple human preference reward models. Remarkably, solving this"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.04312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-06-06T17:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"48d7e104b0dad4fd5a1daede6ec9bee896c83559bc97af4d0d844ef3e96ace27","abstract_canon_sha256":"7f2774ce264bc3134f6efcc5a90426976653c167f83b52b175382dc7e5f3e22c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:14.751155Z","signature_b64":"QjRt+mLk9GKFgqCF3UKYcU7c1hm3Y44DLq/X91liNe3v39vEyK/kTpu0XJELjtK8L7nf2E/5uzRzoNUaFpIZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9554031341660d185dc73788dfb0df7746c3b66d2c267ff42f941d66460365e","last_reissued_at":"2026-07-05T09:29:14.750672Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:14.750672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReNO: Enhancing One-step Text-to-Image Models through Reward-based Noise Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexey Dosovitskiy, Karsten Roth, Luca Eyring, Shyamgopal Karthik, Zeynep Akata","submitted_at":"2024-06-06T17:56:40Z","abstract_excerpt":"Text-to-Image (T2I) models have made significant advancements in recent years, but they still struggle to accurately capture intricate details specified in complex compositional prompts. While fine-tuning T2I models with reward objectives has shown promise, it suffers from \"reward hacking\" and may not generalize well to unseen prompt distributions. In this work, we propose Reward-based Noise Optimization (ReNO), a novel approach that enhances T2I models at inference by optimizing the initial noise based on the signal from one or multiple human preference reward models. Remarkably, solving this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04312","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.04312/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.04312","created_at":"2026-07-05T09:29:14.750724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.04312v2","created_at":"2026-07-05T09:29:14.750724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04312","created_at":"2026-07-05T09:29:14.750724+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FKUAMJUCZQN","created_at":"2026-07-05T09:29:14.750724+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FKUAMJUCZQNDBO4","created_at":"2026-07-05T09:29:14.750724+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FKUAMJU","created_at":"2026-07-05T09:29:14.750724+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22958","citing_title":"PG-MAP: Joint MAP Optimization for Inference-Time Alignment of Diffusion and Flow-Matching Models","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27147","citing_title":"How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01151","citing_title":"Lagrangian Perturbation Diffusion Steering: Latent Reinforcement Learning for Generative Policies","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27147","citing_title":"How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2501.09732","citing_title":"Inference-Time Scaling for Diffusion Models beyond Scaling Denoising Steps","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27147","citing_title":"How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23540","citing_title":"Oracle Noise: Faster Semantic Spherical Alignment for Interpretable Latent Optimization","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65","json":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65.json","graph_json":"https://pith.science/api/pith-number/5FKUAMJUCZQNDBO4ON4I36YN65/graph.json","events_json":"https://pith.science/api/pith-number/5FKUAMJUCZQNDBO4ON4I36YN65/events.json","paper":"https://pith.science/paper/5FKUAMJU"},"agent_actions":{"view_html":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65","download_json":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65.json","view_paper":"https://pith.science/paper/5FKUAMJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.04312&json=true","fetch_graph":"https://pith.science/api/pith-number/5FKUAMJUCZQNDBO4ON4I36YN65/graph.json","fetch_events":"https://pith.science/api/pith-number/5FKUAMJUCZQNDBO4ON4I36YN65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65/action/storage_attestation","attest_author":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65/action/author_attestation","sign_citation":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65/action/citation_signature","submit_replication":"https://pith.science/pith/5FKUAMJUCZQNDBO4ON4I36YN65/action/replication_record"}},"created_at":"2026-07-05T09:29:14.750724+00:00","updated_at":"2026-07-05T09:29:14.750724+00:00"}