ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Test-time Compute”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ROcs.AIcs.CVEmpiricalRecentJun 10, 2026

DIRECT: When and Where Should You Allocate Test-Time Compute in Embodied Planners?

Jadelynn Dao, Milan Ganai, Yasmina Abukhadra, Ajay Sridhar +6 more

This paper introduces DIRECT, a routing framework that allocates test-time compute per prompt to improve the success--cost Pareto frontier for embodied agents.

View →
cs.LGcs.AIRecentMay 27, 2026

On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective

Zhi Zhou, Ming Yang, Shi-Yu Tian, Kun-Yang Yu +2 more

The paper establishes the first theoretical framework for analyzing the learnability of Test-Time Adaptation (TTA) under non-stationary data streams by introducing Recovery Complexity, which quantifie…

View →
cs.CRcs.ARcs.LGRecentMar 20, 2026

Hawkeye: Reproducing GPU-Level Non-Determinism

Erez Badash, Dan Boneh, Ilan Komargodski, Megha Srivastava

Hawkeye is a system that allows perfect, precision-preserving reproduction of GPU-level matrix multiplication operations on a CPU, enabling efficient and trustworthy third-party auditing of machine le…

View →
cs.CRRecentApr 25, 2026

Core Logic and Algorithmic Performance Enhancements for a System Vulnerability Analysis Technique for Complex Mission Critical Systems Implementation

Matthew Tassava, Cameron Kolodjski, Jordan Milbrath, Jeremy Straub

The paper details significant enhancements to the SONARR system's core logic, replacing restrictive Boolean logic with generic data type support and adding multi-compute capabilities to improve vulner…

View →
cs.AIcs.CRRecentMar 26, 2026

On the Foundations of Trustworthy Artificial Intelligence

TJ Dunham

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

View →
cs.CRcs.OSRecentMay 30, 2026

Beyond Edge Coverage: Per-Task Data-Flow Extraction at Kernel Function Boundaries via LLVM

Yunseong Kim

The paper introduces BOUNDARY FLOW, an LLVM-based framework that enhances kernel fuzzing and analysis by extracting per-task, state-aware data-flow information (arguments and return values) at functio…

View →
cs.SEcs.AIRecentMay 31, 2026

FVSpec: Real-World Property-Based Tests as Lean Challenges

Quinn Dougherty, Max von Hippel, Hazel Shackleton, Mike Dodds

The paper introduces FVSpec, a large-scale benchmark that translates thousands of real-world Python property-based tests into formal Lean 4 specifications to evaluate AI models for formal software ver…

View →
cs.ARRecentJun 1, 2026

O-POPE: High-Frequency Pipelined Outer Product based GEMM acceleration with minimal buffering overhead

Danilo Cammarata, Angelo Garofalo, Luca Benini

O-POPE is a novel outer-product engine that accelerates floating-point GEMM by repurposing FPU pipeline registers as buffers, achieving high utilization and improved energy efficiency.

View →
cs.CRcs.AIcs.LGRecentMay 21, 2026

Characterizing the Fault Response of the Intel Neural Compute Stick 2 Under Single-Pulse Electromagnetic Fault Injection

Štefan Kučerák, Jakub Breier, Xiaolu Hou

The paper systematically characterizes the fault response of the Intel NCS2 accelerator to electromagnetic fault injection, revealing a major degradation mode that is undetectable by standard inferenc…

View →
cs.CRcs.AIcs.GTRecentApr 24, 2026

Reconstructive Authority Model: Runtime Execution Validity Under Partial Observability

Marcelo Fernandez - TraslaIA

The paper introduces the Reconstructive Authority Model (RAM), a novel framework that proves execution validity by assessing state coverage rather than just state integrity, showing that existing atte…

View →
cs.ARcs.CLcs.CRRecentApr 20, 2026

Enabling AI ASICs for Zero Knowledge Proof

Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang +5 more

The paper introduces MORPH, a framework that reformulates Zero-Knowledge Proof (ZKP) computations to efficiently utilize AI ASICs like TPUs, achieving up to 10x higher throughput on NTT.

View →
cs.CRRecentMay 13, 2026

EBCC: Enclave-Backed Confidential Containers via OCI-Compatible Runtime Integration

Di Lu, Qingwen Zhang, Yujia Liu, Xuewen Dong +3 more

The paper introduces EBCC, an OCI-compatible runtime architecture that manages composite confidential-computing workloads by integrating TEE-backed execution into the standard container lifecycle.

View →
quant-phcs.CRRecentMay 13, 2026

QCIVET: A Quantum--Classical Pipeline Integrity Framework with Contract-Based Subtype Verification and Hash-Chained Audit Traces

Esra Yeniaras, Muhammad Amin Karimov

QCIVET introduces a novel contract-based framework to ensure the integrity of hybrid quantum-classical pipelines by verifying both the structure (syntactic) and the behavior (semantic) of quantum stag…

View →
cs.CRcs.DCRecentApr 17, 2026

PoSME: Proof of Sequential Memory Execution via Latency-Bound Pointer Chasing with Causal Hash Binding

David L. Condrey

The paper introduces PoSME, a cryptographic primitive that enforces strict sequential memory execution by chaining data-dependent writes, providing verifiable delay and authorship attestation.

View →
cs.CRRecentJun 4, 2026

GCD: Garbled, Corrected, Demonstrandum -- Fixing and Proving Go's Extended GCD Implementation

Linard Arquint

This paper fixes two subtle bugs in Go's extended GCD implementation, which is critical for RSA key generation, and formally proves the correctness and termination of the corrected code.

View →
cs.CRcs.LGRecentMay 29, 2026

Bit-Exact AI Inference Verification Without Performance Tradeoffs

Naci Cankaya

The paper proposes a method for bit-exact verification of AI inference outputs without sacrificing performance, demonstrating that deterministic, precise re-computation is possible even across differe…

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
cs.CRcs.ARRecentMar 28, 2026

Attacking AI Accelerators by Leveraging Arithmetic Properties of Addition

Masoud Heidary, Biresh Kumar Joardar

The paper introduces a novel hardware aging attack that exploits the commutative properties of addition to induce unbalanced stress on AI accelerator transistors, significantly degrading model accurac…

View →
cs.CRRecentMar 31, 2026

HPCCFA: Leveraging Hardware Performance Counters for Control Flow Attestation

Claudius Pott, Luca Wilke, Jan Wichelmann, Thomas Eisenbarth

The paper introduces HPCCFA, a novel mechanism that leverages Hardware Performance Counters (HPCs) to provide hardware-backed Control Flow Attestation (CFA) on commodity CPUs, thereby enhancing the se…

View →