TCUQ: Single-Pass Uncertainty Quantification from Temporal Consistency with Streaming Conformal Calibration for TinyML

• URL: http://arxiv.org/abs/2508.12905v1
• Date: Mon, 18 Aug 2025 13:12:14 GMT
• Title: TCUQ: Single-Pass Uncertainty Quantification from Temporal Consistency with Streaming Conformal Calibration for TinyML
• Abstract summary: TCUQ is a single pass, label free uncertainty monitor for streaming TinyML.<n>It converts short horizon temporal consistency captured via lightweight signals on posteriors.<n>A streaming conformal layer turns this score into a budgeted accept/abstain rule.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce TCUQ, a single pass, label free uncertainty monitor for streaming TinyML that converts short horizon temporal consistency captured via lightweight signals on posteriors and features into a calibrated risk score with an O(W ) ring buffer and O(1) per step updates. A streaming conformal layer turns this score into a budgeted accept/abstain rule, yielding calibrated behavior without online labels or extra forward passes. On microcontrollers, TCUQ fits comfortably on kilobyte scale devices and reduces footprint and latency versus early exit and deep ensembles (typically about 50 to 60% smaller and about 30 to 45% faster), while methods of similar accuracy often run out of memory. Under corrupted in distribution streams, TCUQ improves accuracy drop detection by 3 to 7 AUPRC points and reaches up to 0.86 AUPRC at high severities; for failure detection it attains up to 0.92 AUROC. These results show that temporal consistency, coupled with streaming conformal calibration, provides a practical and resource efficient foundation for on device monitoring in TinyML.

Related papers

• SILK: Closing the Time-of-Check-to-Time-of-Use Gap in RoT-Protected AI Systems [1.082233332885939]
  SILK (Streaming Inline Lightweight Keying) is an in-place integrity mechanism that verifies the weight stream at the final pre-compute boundary.<n>A lightweight streaming checker recomputes these checks without separate authentication tags and uses commit gating to prevent unverified weights from reaching computation engine.
  arXiv  Detail & Related papers  (2026-08-26T21:06:34Z)
• SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning [3.1061484260786014]
  This paper uses spike-based data representation as an effective encoding mechanism that incorporates temporal structure into quantum feature preparation.<n>A novel spike-driven temporal encoding method is proposed that converts real-valued tabular features into leaky-and-fire spike trains and maps spike statistics to quantum rotations.<n>Under stratified cross-validation, SPATE yields stronger representations across multiple datasets.
  arXiv  Detail & Related papers  (2026-04-13T05:41:03Z)
• Don't Waste Bits! Adaptive KV-Cache Quantization for Lightweight On-Device LLMs [8.332279450103151]
  Large Language Models (LLMs) have achieved remarkable progress across reasoning, generation, and decision-making tasks.<n>On-device LLM inference is heavily constrained by the memory and bandwidth overhead of the key-value (KV) cache.<n>We propose adaptive KV-cache quantization, a learned policy that assigns bit-width proportional to token importance.
  arXiv  Detail & Related papers  (2026-04-06T14:45:49Z)
• Inference-Time Chain-of-Thought Pruning with Latent Informativeness Signals [6.5422130090856925]
  Self-Truncation Best-of-N (ST-BoN) mitigates this by truncating unpromising paths early.<n>We present KL-Adjusted Pruned Path Algorithm (KAPPA), an inference-time method that combines Kullback-Leibler divergence, confidence, and entropy into a principled scoring function.
  arXiv  Detail & Related papers  (2025-11-01T20:41:22Z)
• From Flows to Words: Can Zero-/Few-Shot LLMs Detect Network Intrusions? A Grammar-Constrained, Calibrated Evaluation on UNSW-NB15 [0.41998444721319217]
  Large Language Models (LLMs) can reason over natural-language inputs, but their role in intrusion detection without fine-tuning remains uncertain.<n>This study evaluates a promptonly approach by converting each network flow to a compact textual record and augmenting it with lightweight, domain-inspired flags.<n>We compare zero-shot, instruction-guided, and fewshot prompting to strong neural baselines under identical splits, reporting accuracy, precision, recall, F1, and macro scores.
  arXiv  Detail & Related papers  (2025-10-18T02:11:50Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Adaptive t Design Dummy-Gate Obfuscation for Cryogenic Scale Enforcement [0.0]
  Cloud quantum services can reveal circuit structure and timing through scheduler metadata, latency patterns, and co-tenant interference.<n>We introduce NADGO, a scheduling and obfuscation stack that enforces operational privacy for gate-model workloads.<n>We prototype the approach on a 4-qubit superconducting tile with cryo-CMOS control and evaluate both depth-varied local-random circuits and small QAOA instances.
  arXiv  Detail & Related papers  (2025-08-31T12:12:48Z)
• SNAP-UQ: Self-supervised Next-Activation Prediction for Single-Pass Uncertainty in TinyML [0.0]
  We introduce textbfSNAP-UQ, a single-pass, label-free uncertainty method for TinyML.<n>It estimates risk from emphdepth-wise next-activation prediction: tiny int8 heads forecast the statistics of the next layer from a compressed view of the previous one.<n>The design requires no temporal buffers, auxiliary exits, or repeated forward passes, and adds only a few tens of kilobytes to MCU deployments.
  arXiv  Detail & Related papers  (2025-08-18T13:14:20Z)
• Consistency Trajectory Models: Learning Probability Flow ODE Trajectory of Diffusion [56.38386580040991]
  Consistency Trajectory Model (CTM) is a generalization of Consistency Models (CM) CTM enables the efficient combination of adversarial training and denoising score matching loss to enhance performance. Unlike CM, CTM's access to the score function can streamline the adoption of established controllable/conditional generation methods.
  arXiv  Detail & Related papers  (2023-10-01T05:07:17Z)
• Global Context Aggregation Network for Lightweight Saliency Detection of Surface Defects [70.48554424894728]
  We develop a Global Context Aggregation Network (GCANet) for lightweight saliency detection of surface defects on the encoder-decoder structure. First, we introduce a novel transformer encoder on the top layer of the lightweight backbone, which captures global context information through a novel Depth-wise Self-Attention (DSA) module. The experimental results on three public defect datasets demonstrate that the proposed network achieves a better trade-off between accuracy and running efficiency compared with other 17 state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-09-22T06:19:11Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Parity Measurements using Dispersive Shifts for Surface Codes [0.0]
  Single shot method useful for stabilizer readout based on dispersive shifts. We find a fidelity of 99.8% and gate time of 600 ns using our method and investigate the effects of higher order Z interactions on the system.
  arXiv  Detail & Related papers  (2023-09-13T12:06:46Z)
• Leakage in restless quantum gate calibration [0.5439020425819]
  We develop a simulator of restless circuit execution based on a Markov Chain to study the effect of leakage. We show that restless calibration tolerates up to 0.5% of leakage which is large compared to the $10-4$ gate fidelity of modern single-qubit gates. Our results are obtained with standard qubit state discrimination showing that restless circuit execution is resilient against misclassified non-computational states.
  arXiv  Detail & Related papers  (2023-04-18T20:59:16Z)
• FastFlowNet: A Lightweight Network for Fast Optical Flow Estimation [81.76975488010213]
  Dense optical flow estimation plays a key role in many robotic vision tasks. Current networks often occupy large number of parameters and require heavy computation costs. Our proposed FastFlowNet works in the well-known coarse-to-fine manner with following innovations.
  arXiv  Detail & Related papers  (2021-03-08T03:09:37Z)
• FastEmit: Low-latency Streaming ASR with Sequence-level Emission Regularization [78.46088089185156]
  Streaming automatic speech recognition (ASR) aims to emit each hypothesized word as quickly and accurately as possible. Existing approaches penalize emission delay by manipulating per-token or per-frame probability prediction in sequence transducer models. We propose a sequence-level emission regularization method, named FastEmit, that applies latency regularization directly on per-sequence probability in training transducer models.
  arXiv  Detail & Related papers  (2020-10-21T17:05:01Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.