arXiv (All)
open access
Factorized Scheduling Principle: Learning Interpretable and Transferable Policies via Structured Additive Functions
Scheduling problems arise from repeatedly selecting one item from a set of candidates based on their states. These problems often reduce to assigning priority scores and choosing the highest-ranked item. In this work, we propose a factorized scheduling principle (FSP) framework to learn interpretabl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Pinch of SFT, A Dash of RL: When Reinforcement Learning Helps Long-Horizon Advertising Agents#1036877
- Preference Goal Tuning: Post-Training as Latent Control for Frozen Policies#189228
- Not Every Rubric Teaches Equally: Policy-Aware Rubric Rewards for RLVR#204815
- Towards Better Training Signal: Advantage Clipped Policy Optimization#1132017
- Consensus-based Agentic Large Language Model Framework for Harmonized Tariff Schedule Code Classification#280195
Record · ID 1131779
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive