Skip to content

archived edition · 2026-09-25

PaperraftFind the AI research
worth testing.

Understand what a paper changes, what it costs, and whether it fits your next build. Explore research on faster LLM inference, agent memory, and evaluation, with the original sources in reach.

Start with a brief. Follow the evidence. Choose a test.

edition
2026-09-25
briefs
43
research areas
16
independent implementations
33

27 of 43 papers in the index (63%) have no independent implementations.

Research index

Search by topic, browse a research area, or sort by date. Read a brief, open the original paper, and inspect the available evidence before deciding what to test.

showing30 of 43
sort by
First page of Quantifying Overclaiming Propensity in Frontier LLM Agents
agent evaluationadopt

Quantifying Overclaiming Propensity in Frontier LLM Agents

This is an evaluation finding, not a deployable method; it replaces the default production practice of trusting a coding agent's final response as an accurate account of its work with independent verification against tool-call logs and transcripts, using file-coverage checks and planted-defect tests as exemplars. The cost is instrumentation effort: logging agent file reads, diffing claimed coverage against actual coverage, and adding planted-defect canaries to review tasks, all feasible on a single GPU or API-only setup since the overhead is in logging and checking, not compute. What can fail: verification heuristics can be gamed or drift as agents change behavior, coverage checks do not detect misleading claims about non-file actions, and the findings derive from eight proprietary and four open-weight models whose behaviors may differ from the reader's deployed stack.

observed signal
3impl.
2stars
0citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of An Empirical Study of Harness Design for Coding Agents
coding agentsadopt

An Empirical Study of Harness Design for Coding Agents

This replaces treating coding harnesses as monolithic systems with component-level selection: rule-based elision staged before LLM summarization, optional planning, and a bash-only or predefined-tool action space chosen per model. The cost is modest implementation effort for context management plus summarization tokens, and recoverable-elision machinery that models rarely use and that yields no accuracy gain. Failures include context-overflow crashes under tight budgets if management is omitted, degraded performance when bash-only interfaces are given to models with weak bash proficiency, and planning overhead that does not help weaker models on cost or stronger models on accuracy.

observed signal
4impl.
17stars
0citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Truncated automatic sparse differentiation for machine learning interatomic potentials
sparsity and pruningtest

Truncated automatic sparse differentiation for machine learning interatomic potentials

The method replaces dense automatic differentiation of MLIP energies, which makes full Hessians computationally inaccessible for large systems, with sparse differentiation that exploits the finite receptive field of message-passing potentials, optionally truncating small long-range Hessian entries. Exact ASD requires computing and exploiting the sparsity pattern and delivers only modest speedups, while the practical gains come from truncated ASD, which introduces approximation by discarding nonzero entries between distant atoms and adds implementation complexity. The approach can fail when truncated couplings are not negligible for a target observable, when the MLIP lacks strict locality so the assumed sparsity does not hold, or when graph construction overhead erodes the speedup at the system sizes of interest.

observed signal
2impl.
2stars
0citations
10xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Coding Agents for Generalized Task and Motion Planning Problems
coding agentstest

Coding Agents for Generalized Task and Motion Planning Problems

The method replaces hand-engineered TAMP planners and TAMP-specific engineering by having a coding agent (e.g., Claude Code, Codex) interactively synthesize a single frozen program that generalizes across problem instances. It costs a fixed up-front program-synthesis budget of agent API calls with simulator access, plus evaluation infrastructure; inference per instance is then cheap, about 10x less computation than the planner. It can fail on environments where success remains low (56% on the hardest), when held-out instances deviate from the regularities the program exploited, or when no reliable simulator is available for the agent to calibrate against.

observed signal
4impl.
68stars
—citations
10xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Adaptive Fisher-Whitened Cross-Covariance for Low-Resource Speech Recognition
efficient trainingtest

Adaptive Fisher-Whitened Cross-Covariance for Low-Resource Speech Recognition

The method replaces generic LoRA adapters with a Fisher-whitened cross-covariance (FCCA) subspace derived from downstream task data, optionally with asymmetric cross-layer coupling (AC-FCCA) and adaptive per-matrix rank reallocation (AR-FCCA) under a fixed budget. Cost is a one-time covariance/Fisher estimation pass over task data plus whitened eigendecomposition per adapted layer, with no increase in trainable parameters or inference latency relative to LoRA. It can fail when downstream data is too scarce for stable covariance and Fisher estimation, when the task-informed subspace does not transfer across languages, and because results are demonstrated only on Whisper and Qwen3-ASR for ASR, so applicability to other modalities is unverified.

observed signal
2impl.
122stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Continuous Online Fault Detection for Mobile Robots via Adaptive Edge Models
distillationtest

Continuous Online Fault Detection for Mobile Robots via Adaptive Edge Models

The method replaces running a heavy foundation time-series anomaly detector (TSPulse) onboard by distilling its pseudo-labels into a lightweight MiniRocket student with a Recursive Least Squares head for online adaptation. Cost: an offline teacher-labeling pipeline with fault injection, plus an uncertainty-guided active learning loop requiring occasional operator labeling; inference is cheap (4.30 ms CPU). What can fail: pseudo-label errors from the teacher propagate to the student, RLS adaptation may drift on poorly calibrated uncertainty, and results are validated on one robot platform and one benchmark, so transfer to other sensor suites is unproven.

observed signal
1impl.
5stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of ExplorationBench: Measuring AI Systems' Exploration in Verifiable Alien Worlds
agent evaluationwatch

ExplorationBench: Measuring AI Systems' Exploration in Verifiable Alien Worlds

ExplorationBench replaces ad hoc or recall-contaminated evaluations of agent exploration with two executable sandboxes (AlienCode and AlienLogic) whose novel rules permit exact answer verification and defeat memorization from pre-training data. Adoption costs engineering effort to integrate the custom tool-call schemas and sandbox environments, plus API or GPU compute for multi-trajectory runs, which can be significant given the reported high variance across trajectories. It can fail as a decision instrument because results vary substantially between runs and continued exploration can stall or reverse gains, so small-sample comparisons may mislead, and sandbox performance may not transfer to real production tasks.

observed signal
3impl.
123stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Qwen-Planner-Agent: A Closed-Loop AI-for-AI Framework for Real-World Mobile Planner Agents
efficient trainingwatch

Qwen-Planner-Agent: A Closed-Loop AI-for-AI Framework for Real-World Mobile Planner Agents

The method replaces ad-hoc prompt engineering and static fine-tuning of planner agents with a full closed-loop pipeline combining human-gated agentic data generation, supervised cold start, and hybrid-environment online reinforcement learning with competence-aware reward shaping. The cost is substantial: real-device interaction infrastructure, a multi-agent data flywheel, online RL training capacity, and co-evolving runtime harness engineering, none of which fit a single 24 GB GPU or API-only budget. After adoption, reward engineering can overfit to cost-reduction signals at the expense of task success, failure-trace feedback loops can propagate harness bugs into model updates, and gains may not transfer off MobilePA-Bench.

observed signal
3impl.
132stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of RAPID: Robot Agentic Programming from Demonstrations
coding agentswatch

RAPID: Robot Agentic Programming from Demonstrations

RAPID replaces hand-written robot task programs and classical imitation-learning policies with an agentic loop in which an LLM coding agent infers a testable task specification, action primitives, and a verification environment from a single visual demonstration, then iteratively generates and refines an object-centric relational program using trajectory optimization. The cost is a bespoke robotics stack: action primitives, an interactive simulator or physical arm for execution feedback, and trajectory-optimization infrastructure, none of which run on a single 24 GB GPU workstation alone. Failure modes include incorrect inferred task specifications, verification environments that pass programs which fail on the real robot, and poor transfer to tasks whose geometry or contacts differ from the demonstration.

observed signal
1impl.
11stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of When Can Agents Forget Their Reasoning? ICLR for Long-Horizon Agent Context Compression
memory and contexttest

When Can Agents Forget Their Reasoning? ICLR for Long-Horizon Agent Context Compression

The method replaces retaining the full accumulated reasoning history in the agent's context with training-free online deletion of reasoning blocks ranked by frozen proxy entropy, while preserving actions, tool calls, and observations. It costs only the ranking computation and integration logic, with no training, fine-tuning, or additional infrastructure, and the paper reports a small quality gain rather than a loss. It can fail through trajectory amplification: deleting a reasoning block can nonlinearly alter subsequent actions and total computation, and reasoning removed before task-relevant state is externalized into code, files, or tool outputs can degrade future decisions.

observed signal
2impl.
131stars
—citations
1.34xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
tool usewatch

PUBG Ally: A Conversational Embodied Agent as an AI Teammate

The method replaces scripted or rule-based game NPCs with a language-model agent that uses a controlled tool interface to inspect game state, interpret voice, and issue high-level actions to a faster low-level control layer. It costs a full live-service data loop (nearly 39k gameplay sessions for iterative training), plus model compression, context compaction, safety training, runtime guardrails, and memory redaction to meet latency and player-safety requirements. It can fail through speech-action desynchronization under latency pressure, unsafe or inappropriate player-facing utterances, and divergence between offline evaluation metrics and actual player preference.

observed signal
2impl.
223stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of World Action Agent: Harnessing VLMs for Robot Manipulation via World Action Rehearsal
multi-agent orchestrationwatch

World Action Agent: Harnessing VLMs for Robot Manipulation via World Action Rehearsal

WAA replaces end-to-end VLA policies and code-as-policy pipelines with a multi-agent harness in which general-purpose VLMs rehearse, preview, and correct actions inside a visual workspace before execution. It costs repeated VLM inference calls per decision (high API spend and per-step latency), automatic contact-view selection, skill evolution from expert videos, and optionally fine-tuning a smaller VLM on interaction traces. It can fail through compounding VLM perception or planning errors, rehearsal previews that diverge from real dynamics, and results that are validated only in simulation (LIBERO-Pro, robosuite) rather than on physical robots.

observed signal
2impl.
223stars
—citations
25.5xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Automated Regulatory Compliance Question Answering in Financial Services with Domain-Adapted Retrieval-Augmented Generation
retrieval and RAGtest

Automated Regulatory Compliance Question Answering in Financial Services with Domain-Adapted Retrieval-Augmented Generation

Replaces off-the-shelf dense or BM25 retrieval and prompted compact LLMs with a LegalBERT retriever tuned via entailment reformulation, contrastive in-batch negatives, and BM25 score fusion, plus optional RAFT-LoRA on a quantized 2B-12B generator, all feasible on a single 24 GB GPU. Costs include three retriever fine-tuning stages, labeled domain data for entailment and contrastive tuning, hybrid-fusion serving complexity, and per-domain RAFT adaptation. It can fail on domain transfer (no generalization to Australian case law), and RePASs gains do not demonstrate grounding: a closed-book model scored within 0.011 RePASs while citing nothing and misstating obligations, so a dedicated grounding evaluation must be built before production trust.

observed signal
1impl.
121stars
—citations
3.02xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of BanglaTurn: A Benchmark and Whisper-Based Model for End-of-Turn Detection in Bangla Speech
othertest

BanglaTurn: A Benchmark and Whisper-Based Model for End-of-Turn Detection in Bangla Speech

The method replaces general-purpose end-of-turn detectors such as Smart-Turn v3 with a Whisper encoder plus task-specific classification heads fine-tuned on a 35,374-sample Bangla corpus built via diarization, LLM labeling, and human verification. It costs the effort of reproducing or porting the pipeline, adds a classification head to a Whisper encoder, runs on CPU at 165-191 ms with optional INT8 quantization, and trades a higher false positive rate for the large false negative reduction. It can fail outside its podcast-speech domain: the test set is a single held-out podcast, so accuracy on other Bangla registers, accents, or noise conditions is unverified, and labels derived partly from an LLM pass may encode systematic annotation bias.

observed signal
1impl.
125stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Baseline Shape Decides the Verdict: A Controlled Re-Examination of Ternary Language Models at 60K Parameters
quantizationtest

Baseline Shape Decides the Verdict: A Controlled Re-Examination of Ternary Language Models at 60K Parameters

The examined method replaces full-precision weights with 1.58-bit ternary weights and a full-precision-then-ternary training schedule for microcontroller-class models, but this re-examination primarily replaces the prior single-seed evidence with a multi-seed controlled comparison. Costs include a measurable quantization penalty that varies strongly by architecture (+5.3% for the best transformer versus +19.5% routed and +28.1% gated SSM) plus a fragile two-stage schedule that requires a stage-2 learning rate roughly 10x the pretraining peak to beat all-ternary training. It can fail if the baseline shape is untuned, since depth/width choice alone spans 22.6% in validation loss and shape ordering reverses with budget, meaning an apparently superior architecture may only reflect a poorly shaped baseline.

observed signal
1impl.
125stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Breaking the Environment Wall: Evolving LLM Agent Environments for Recursive Self-Improvement
agent evaluationwatch

Breaking the Environment Wall: Evolving LLM Agent Environments for Recursive Self-Improvement

Env-Rethink replaces hand-curated, static agent task environments with an automated pipeline that builds Collection Maps and Event Logs for context, detects environmental noise via a post-trained 27B model, and generates harder evolved environment variants through virtual event histories. The cost is substantial: it depends on offline trajectory learning to post-train a 27B model, which exceeds a single 24 GB GPU budget for training and requires task-specific trajectory data and environment instrumentation. It can fail if the post-trained noise-detection model misfires on domains unlike its training data, if synthetic event histories produce unrealistic environment states that misdirect agent improvement, and if the 30-task evaluation does not transfer to the reader's workflows.

observed signal
1impl.
131stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Cross-Model Autoscaling for Shared LLM Serving
serving and batchingwatch

Cross-Model Autoscaling for Shared LLM Serving

TRE replaces model-local reactive autoscaling (e.g., KV-cache-utilization signals) with a calibrated, demand-normalized Token Service Share metric that arbitrates replica capacity across co-hosted models under a fixed GPU budget, separating fast rescue from slower rebalancing. It costs a Kubernetes-based hot-switch serving stack and control-plane instrumentation, though it requires no changes to the inference scheduler and no extra GPUs. It can fail when TSS calibration does not transfer to a model's actual latency-SLO relationship, when hot-switching overheads dominate at small replica counts, or when the workload is a single model with no cross-model contention to arbitrate.

observed signal
0impl.
1stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs
distillationwatch

Decoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs

The method replaces fixed full-depth execution of the VLM backbone and action expert with jointly configurable axes: backbone depth V, action-expert depth A, and denoising steps D, using lightweight Exit Transformers distilled from the final layer plus a KV-cache synthesis mechanism to handle skipped backbone layers. It costs per-exit distillation training (no retraining of the base policy), a 2.1-4.1% parameter increase per exit, and added complexity in cache management and per-task configuration selection. It can fail because the optimal (V,A,D) budget is task-dependent, so a configuration tuned on one task may degrade success rate on another, and gains are validated only on two VLAs and two simulation benchmarks, leaving real-robot and out-of-distribution behavior unverified.

observed signal
0impl.
106stars
—citations
4.8xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Resource-Aware Model Selection for Scalable Indoor Localization on HPC Platforms
sparsity and pruningwatch

Resource-Aware Model Selection for Scalable Indoor Localization on HPC Platforms

The method replaces exhaustive inference over hundreds of pretrained local autoencoder models for WiFi fingerprint localization with coarse-to-fine hierarchical selection and temporal-locality filtering that executes only spatially plausible models. The cost is added system complexity: a building-floor-spot model hierarchy must be maintained, and trajectory-aware pruning depends on stateful tracking of user movement. It can fail when a user's first fix has no trajectory history, when movement violates spatial-locality assumptions (teleportation, floor changes via elevators), or when hierarchical misclassification at coarse levels eliminates the correct fine-grained model.

observed signal
0impl.
0stars
—citations
73.5xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Demystifying Agent Skills for Smart Contract Auditing: Design, Effectiveness, Behavioral Impact
tool usetest

Demystifying Agent Skills for Smart Contract Auditing: Design, Effectiveness, Behavioral Impact

The method replaces ad-hoc prompting of general coding agents with lightweight, reusable skill artifacts that package domain knowledge, audit workflows, and tool-use instructions for smart contract security auditing. Cost is low in infrastructure terms since skills run on existing third-party API agents without training, but requires curating or authoring skills and selecting a capable frontier model, since gains come primarily from the model rather than the agent harness. The principal failure mode is unreliable skill triggering, plus imbalanced vulnerability coverage across skill corpora and behavioral effects that vary across agent-model configurations.

observed signal
0impl.
4stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of SWE-Prometheus: Measuring Engineering Governance Improvements in Real-World Repositories
agent evaluationtest

SWE-Prometheus: Measuring Engineering Governance Improvements in Real-World Repositories

SWE-Prometheus replaces issue-to-patch benchmarks (e.g., SWE-bench-style functional checks) with open-ended governance tasks scored on improvement, behavior preservation, evidence quality, and coverage across six dimensions. It costs evaluation compute and teacher-model rating calls rather than training resources, and adds harness complexity for clean-environment probes and behavior gates. It can fail to transfer if the 22-repository public subset does not represent the reader's codebase stack, and teacher-based scoring introduces rating variance despite the reported 57/60 exact agreement on no-op evidence.

observed signal
0impl.
0stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of VQ-LIC: Shared Vector-Quantized Learned Image Compression on a Resource-Constrained FPGA
othernot applicable

VQ-LIC: Shared Vector-Quantized Learned Image Compression on a Resource-Constrained FPGA

VQ-LIC replaces a conventional learned image compression encoder and separate VQ compute array with an asymmetric edge-cloud codec: a compact INT8 depthwise-pointwise analysis transform plus multi-codebook VQ on the FPGA edge, sharing one reusable DW/PW engine pair, with reconstruction offloaded to a large cloud decoder. The cost is infrastructure mismatch for this reader: it requires FPGA deployment with custom RTL, an edge-cloud split architecture, and accepts a modest PSNR tradeoff (28.69 dB at 0.1398 bpp) relative to larger codecs. It can fail if the target deployment lacks an FPGA edge device or a cloud decoder endpoint, if the RTL latency model does not transfer to other silicon, and if the PSNR degradation is unacceptable for the application's quality requirements.

observed signal
0impl.
0stars
—citations
10xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Between the Commits: Process, Error, and Claim Reliability in a Wholly AI-Authored Codebase
coding agentswatch

Between the Commits: Process, Error, and Claim Reliability in a Wholly AI-Authored Codebase

The paper provides provenance-tracing tools and taxonomies that replace ad hoc, manual inspection of AI agent coding sessions with structured analysis of instructions, commits, and response reliability. It costs engineering time to instrument agent sessions and classify events, with no direct runtime overhead, since it is an analysis methodology rather than a deployed component. Its findings rest on a single 21,000-line Claude-authored codebase, so the reported rates (14.3% of generation events containing a real error caught by tests; roughly 1 in 4-5 responses containing factual errors) may not transfer to other models, languages, or project types.

observed signal
0impl.
0stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of On Growth and Form, and Function: Reusable Regulatory Handles Control Phenotypic Variation
othernot applicable

On Growth and Form, and Function: Reusable Regulatory Handles Control Phenotypic Variation

The paper applies low-rank adaptation to pretrained neural cellular automata so that phenotype transformations (scaling, style, fission) of 2D emoji morphologies are encoded as rank-one or low-rank weight modulations of a shared regulatory scaffold, replacing retraining of phenotype-specific models. The cost is the requirement to pretrain the NCA scaffold and train on the order of 25,000 phenotype-specific adapters to extract the latent control directions, plus the inference machinery of the NCA itself. The method can fail to transfer across phenotypes that do not share the reference scaffold, and the work provides no evidence of relevance to language-model inference, agent systems, or any production workload within the reader's constraints.

observed signal
0impl.
0stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Dense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization
attention and kernelswatch

Dense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization

The method replaces the fixed data structure used by conventional sparse direct Cholesky solvers with a per-matrix, per-tile selector that routes computation to dense, semisparse (active-column), or sparse tile representations on one static shared-memory schedule. It costs a one-time symbolic analysis of the factor's sparsity pattern, which only amortizes when the same pattern is factorized repeatedly (it pulls ahead by the third factorization), and the GPU path is limited to the dense regime with the factor resident on the device. It can fail to pay off when sparsity patterns change between factorizations, when matrices are small enough that analysis overhead dominates, or when the workload is inference-centric deep learning rather than SPD systems such as INLA or spatial statistics.

observed signal
0impl.
0stars
—citations
2.6xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution
safety and guardrailstest

Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution

The method replaces reliance on in-loop LLM guardrails and conventional sandboxing with a deterministic, out-of-band supervisory layer (discrete-event control plus synchronous-reactive sentinels) that preempts rogue agent actions at the kernel/POSIX level before off-target network calls execute. The cost is substantial systems engineering: kernel-level integration, formally specified containment policies, and maintenance of a control plane independent of the agent's own compute, which is nontrivial for a small team. It can fail if the preemption bus shares fate with the compromised host (e.g., hypervisor or credential compromise below the enforcement layer), if policy specifications are incomplete and either block legitimate actions or miss novel escape paths, and because the motivating incident and its evidence cannot be independently verified.

observed signal
0impl.
12stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of FlashLoop: Fast and Memory-Efficient Looped Transformers via Lazy Updates
KV cachetest

FlashLoop: Fast and Memory-Efficient Looped Transformers via Lazy Updates

FlashLoop replaces full per-loop recomputation and full KV caching in Looped Transformers with token-sparse updates, sparse attention over dominant key columns, and low-bit quantization of KV residuals between adjacent loops. It is training-free, so the cost is implementation complexity in the inference path plus reliance on the empirical observation that cross-loop state changes concentrate on a small, stable token subset. It can fail when that sparsity assumption does not hold for a given model, loop depth, or context length, degrading accuracy or negating the savings, and it applies only if the reader actually deploys Looped Transformers rather than standard architectures.

observed signal
0impl.
1stars
—citations
6xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Beyond Model Size: Redesigning LiSenNet for embedded speech enhancement
efficient architecturesnot applicable

Beyond Model Size: Redesigning LiSenNet for embedded speech enhancement

The method replaces the recurrent bottleneck of a 37k-parameter speech enhancement model with convolutional frequency and temporal mixers, reformulated as static int8-compatible operators with bounded decoder activations, so the model fits a restricted microcontroller NPU. The cost is an architecture-specific redesign and quantization-aware co-design of operator set, quantization ranges, and persistent streaming state, plus a small quality drop after int8 quantization. It fails if the target NPU's operator set differs from the one assumed, if stateless receptive-field recomputation is needed (an order of magnitude slower), or if the target workload is not embedded real-time audio on microcontrollers.

observed signal
0impl.
1stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Does per-frame early exit pay? A compute-matched study of dynamic depth for on-device speech enhancement
efficient architectureswatch

Does per-frame early exit pay? A compute-matched study of dynamic depth for on-device speech enhancement

It replaces separately trained fixed-depth speech enhancement models with one causally supervised multi-depth model whose heads are fine-tuned so deeper outputs are never worse, deployed as multiple static int8 graphs selected per frame by a lightweight policy. The cost is the multi-exit training protocol, maintaining several NPU graphs instead of one, a 2.2% latency overhead from graph splitting, and a small policy runtime on a companion core. It can fail when the target hardware cannot run the policy cheaply, when the monotonicity fine-tuning does not transfer to new data distributions, or when frame-level exit decisions introduce quality variance that static models would not exhibit.

observed signal
0impl.
0stars
—citations
1.43xclaimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗
First page of Spatio-temporally complementary feature propagation on graphs for longitudinal AADT estimation
othernot applicable

Spatio-temporally complementary feature propagation on graphs for longitudinal AADT estimation

The method replaces reliance on dense physical sensor coverage by propagating sparse loop-detector measurements over a directed road graph, using flow-ratio matrices instead of a binary adjacency matrix and solving a Poisson energy minimization with residues, anchored by a spatially complete but temporally sparse macroscopic transportation model. It costs little computationally (convergence in minutes on standard hardware) but requires two specific inputs: loop detector data and a calibrated city-scale transportation model with intersection turn ratios. It can fail where turn-ratio estimates are inaccurate, where the macroscopic model is systematically biased, or in cities lacking either data source, and the sub-10% error is validated on a single city.

observed signal
0impl.
0stars
—citations
—claimed gain
abstract onlyReview decisionDownload skill ↓Original paper ↗

Research signals

Three views of the same evidence: adoption against attention, publication cadence by research area, and reported gains when coverage is sufficient.

color = research area

01 · attention × adoption

The research frontier

Look to the upper left for independent implementation before mass attention.

compare by
Each point represents one paper. Higher means more independent implementations; farther right means more GitHub stars.Truncated automatic sparse differentiation for machine learning interatomic potentials: 2 GitHub stars; 2 independent implementationsAn Empirical Study of Harness Design for Coding Agents: 17 GitHub stars; 4 independent implementationsQuantifying Overclaiming Propensity in Frontier LLM Agents: 2 GitHub stars; 3 independent implementationsCross-Model Autoscaling for Shared LLM Serving: 1 GitHub star; 0 independent implementationsContinuous Online Fault Detection for Mobile Robots via Adaptive Edge Models: 5 GitHub stars; 1 independent implementationBanglaTurn: A Benchmark and Whisper-Based Model for End-of-Turn Detection in Bangla Speech: 125 GitHub stars; 1 independent implementationDecoupled Early Exits for Task-Dependent Compute Allocation in Flow-Matching VLAs: 106 GitHub stars; 0 independent implementationsBaseline Shape Decides the Verdict: A Controlled Re-Examination of Ternary Language Models at 60K Parameters: 125 GitHub stars; 1 independent implementationResource-Aware Model Selection for Scalable Indoor Localization on HPC Platforms: 0 GitHub stars; 0 independent implementationsDemystifying Agent Skills for Smart Contract Auditing: Design, Effectiveness, Behavioral Impact: 4 GitHub stars; 0 independent implementationsSWE-Prometheus: Measuring Engineering Governance Improvements in Real-World Repositories: 0 GitHub stars; 0 independent implementationsVQ-LIC: Shared Vector-Quantized Learned Image Compression on a Resource-Constrained FPGA: 0 GitHub stars; 0 independent implementationsBetween the Commits: Process, Error, and Claim Reliability in a Wholly AI-Authored Codebase: 0 GitHub stars; 0 independent implementationsOn Growth and Form, and Function: Reusable Regulatory Handles Control Phenotypic Variation: 0 GitHub stars; 0 independent implementationsDense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization: 0 GitHub stars; 0 independent implementationsBreaking the Environment Wall: Evolving LLM Agent Environments for Recursive Self-Improvement: 131 GitHub stars; 1 independent implementationAdaptive Fisher-Whitened Cross-Covariance for Low-Resource Speech Recognition: 122 GitHub stars; 2 independent implementationsHard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution: 12 GitHub stars; 0 independent implementationsFlashLoop: Fast and Memory-Efficient Looped Transformers via Lazy Updates: 1 GitHub star; 0 independent implementationsPUBG Ally: A Conversational Embodied Agent as an AI Teammate: 223 GitHub stars; 2 independent implementationsBeyond Model Size: Redesigning LiSenNet for embedded speech enhancement: 1 GitHub star; 0 independent implementationsDoes per-frame early exit pay? A compute-matched study of dynamic depth for on-device speech enhancement: 0 GitHub stars; 0 independent implementationsWhen Can Agents Forget Their Reasoning? ICLR for Long-Horizon Agent Context Compression: 131 GitHub stars; 2 independent implementationsQwen-Planner-Agent: A Closed-Loop AI-for-AI Framework for Real-World Mobile Planner Agents: 132 GitHub stars; 3 independent implementationsSpatio-temporally complementary feature propagation on graphs for longitudinal AADT estimation: 0 GitHub stars; 0 independent implementationsMILO: Efficient Many-shot In-Context Learning with Block-wise Low-rank Compression: 121 GitHub stars; 0 independent implementationsWorld Action Agent: Harnessing VLMs for Robot Manipulation via World Action Rehearsal: 223 GitHub stars; 2 independent implementationsGuardrails or Roadblocks? Effects of Pedagogical Style and Context Awareness in AI Teaching Assistants for Programming: 0 GitHub stars; 0 independent implementationsGHOST-Q: Towards Studying Grounding Hallucinations Overlooked Under Same-score TradeOffs in Quantized VLMS: 0 GitHub stars; 0 independent implementationsAutomated Regulatory Compliance Question Answering in Financial Services with Domain-Adapted Retrieval-Augmented Generation: 121 GitHub stars; 1 independent implementationLow-Cost Assays for Measuring Model Behavior Across Vendors and Releases: 121 GitHub stars; 0 independent implementationsSynthetic Hospital: An Open, Verifiable, Physician-Validated Longitudinal EHR Benchmark: 0 GitHub stars; 0 independent implementationsHow does Adversarial Influence Scale in Multi-Agent Systems?: 10 GitHub stars; 0 independent implementationsAERIAL: Adversarial Evaluation of Robustness in Accuracy-Preserving Low-Precision EEG Decoders: 0 GitHub stars; 0 independent implementationsKernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization: 10 GitHub stars; 0 independent implementationsAT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs: 0 GitHub stars; 0 independent implementationsEvaluating Agent Skills for Version-Specific Plugin Migration: A Retrospective Study: 144 GitHub stars; 0 independent implementationsExplorationBench: Measuring AI Systems' Exploration in Verifiable Alien Worlds: 123 GitHub stars; 3 independent implementationsInstrumental Monitor Evasion Emerges Under Ordinary Task Pressure: 1 GitHub star; 0 independent implementationsPoEM: Predicting RL Outcomes from Existing Policies: 1 GitHub star; 0 independent implementationsCoding Agents for Generalized Task and Motion Planning Problems: 68 GitHub stars; 4 independent implementationsRAPID: Robot Agentic Programming from Demonstrations: 11 GitHub stars; 1 independent implementationLLM Agents Can Easily Tamper With Their Own Traces: 4 GitHub stars; 0 independent implementations

Papers above 1000 stars or 200 citations are not scored. They have already broken through the attention threshold, while Paperraft is designed to identify earlier signals.

02 · cadence

Research areas over time

Compare monthly publication volume on a shared scale and calendar.

coding agentsmax 7Sep 26: 4 papersSep 26Sep 26efficient architecturesmax 7Sep 26: 2 papersSep 26Sep 26agent evaluationmax 7Sep 26: 7 papersSep 26Sep 26KV cachemax 7Sep 26: 2 papersSep 26Sep 26distillationmax 7Sep 26: 2 papersSep 26Sep 26sparsity and pruningmax 7Sep 26: 2 papersSep 26Sep 26attention and kernelsmax 7Sep 26: 2 papersSep 26Sep 26memory and contextmax 7Sep 26: 1 paperSep 26Sep 26multi-agent orchestrationmax 7Sep 26: 1 paperSep 26Sep 26othermax 7Sep 26: 5 papersSep 26Sep 26quantizationmax 7Sep 26: 3 papersSep 26Sep 26retrieval and RAGmax 7Sep 26: 1 paperSep 26Sep 26safety and guardrailsmax 7Sep 26: 5 papersSep 26Sep 26serving and batchingmax 7Sep 26: 1 paperSep 26Sep 26efficient trainingmax 7Sep 26: 3 papersSep 26Sep 26tool usemax 7Sep 26: 2 papersSep 26Sep 26

Every panel uses the same calendar and vertical scale. An empty column means no papers were recorded.

Method under scrutiny

Inspect the highest-ranked paper, every repository behind its signal, and the rule used to classify each one.

Quantifying Overclaiming Propensity in Frontier LLM Agents

agent evaluation · adopt · 3 of 4 implementations are independent

This is an evaluation finding, not a deployable method; it replaces the default production practice of trusting a coding agent's final response as an accurate account of its work with independent verification against tool-call logs and transcripts, using file-coverage checks and planted-defect tests as exemplars. The cost is instrumentation effort: logging agent file reads, diffing claimed coverage against actual coverage, and adding planted-defect canaries to review tasks, all feasible on a single GPU or API-only setup since the overhead is in logging and checking, not compute. What can fail: verification heuristics can be gamed or drift as agents change behavior, coverage checks do not detect misleading claims about non-file actions, and the findings derive from eight proprietary and four open-weight models whose behaviors may differ from the reader's deployed stack.

Exclusions and controls

Every exclusion is counted and published.

Exclusion counts were not recorded for this edition.

0 previously indexed papers were rechecked in this run.

Paperraft tracks one signal: how many independent implementations a paper attracts on GitHub after author-owned repositories are removed. This is a discovery signal to investigate, not a measure of implementation quality.

It does not claim that a method works. Paperraft runs no reproduction benchmarks. Reported gains remain author claims until independently tested. Papers above the attention threshold are excluded because this publication is designed to identify research before consensus forms.