arXiv (All)
open access
Compressing Value Predictions for Learning-Augmented Metrical Task Systems
Learning-augmented algorithms for metrical task systems (MTS) can exploit predictions of canonical dual values, but existing formulations typically require a prediction for every state. We study whether these predictions can be compressed to a small set of representative states while retaining their
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
- Keep It in Sight: Reward Function Compression Through Goal Visibility#469716
- Learn Here, Move Less Elsewhere: Input-Conditioned Plasticity from Retained-Domain Activation Atlases#1128747
- RoboMonitor: Label-Efficient Runtime Monitoring of Robot Task Execution via Predictive Representation Learning#1105274
- Regression-Based Prediction for Task-Based Program Performance#1027257
- Semi-Supervised Model-Free Bayesian State Estimation from Compressed Measurements#174039
Record · ID 1118292
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