arXiv (All)
open access
On The Robustness-Resolution Tradeoff In Temporal Quantization Of Event Streams
Event pipelines often discretize asynchronous timestamps before learning. This step looks harmless, but its stability depends directly on temporal resolution. We study this dependence at the representation level. We first show that hard temporal binning is discontinuous: an arbitrarily small timesta
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
- Tractable Gap-Constraint Languages for Complex Event Recognition#287203
- Detecting temporalities#687677
- RDQ: Residual Distribution Quantization for Large Language Models#998293
- Efficient Temporal Datalog Materialisation for Composite Event Recognition#155412
- Black Hole Information and Observability as Structural Projection: A Temporal Rate Ontology Framework#90675
Record · ID 1036978
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