The New AI Efficiency: Dynamic Memory, Agentic Systems, and Human Agency
2026-06-15 00:00 UTC
Highlights
- The KV-cache is being redefined as an active, editable memory substrate that enables new serving architectures and composable generation without recomputation.
- Quantization techniques are now explicitly designed to preserve reasoning fidelity by protecting the low-entropy symbolic tokens and disaggregating outlier channels that cause catastrophic precision loss in chain-of-thought.
- As LLM-based agents undertake autonomous tasks, research reveals critical weaknesses in delegation contracts, memory-based side-channel attacks, and the need for human-centric task allocation that incorporates cognitive load and trust.
- Robotics policy training now achieves rapid adaptation and cross-embodiment transfer through retrieval-augmented policies, contact-level interfaces, and structural skill reuse, dramatically reducing data requirements.
- LLM evaluation is undermined by overlooked psychometric flaws, including systematic judge bias and language- or phase-specific blind spots that erode the reliability of benchmarks and leaderboards.
A fundamental shift is underway in artificial intelligence research, moving away from the brute-force scaling of model size toward systems that are dynamic, memory-aware, and interaction-centric, with efficiency, security, and human agency as guiding priorities. This transformation is evident across multiple fronts. The reimagining of the key-value cache as an editable memory substrate challenges conventional assumptions about inference serving and compositional reasoning. Quantization strategies are being redesigned to protect the fragile symbolic tokens essential for chain-of-thought accuracy. In agentic settings, progress demands more than task completion—it requires robust delegation contracts, defense against memory side-channel attacks, and allocation frameworks that respect human cognitive limits. Meanwhile, robotics and embodied AI achieve rapid policy learning and cross-embodiment transfer through retrieval-augmented and contact-level designs. Even evaluation itself is being scrutinized for psychometric flaws in LLM judges, prompting calls for more trustworthy benchmarks. Complementing these applied currents, structural innovations in model architectures—persistent cross-pass memory, expert feature reuse, and geometric activations—demonstrate that capability can advance without proportional parameter growth. Together, these developments trace a coherent arc toward more agile, secure, and human-centered intelligent systems.
The KV-Cache as Editable Memory: Rethinking LLM Serving and Composition
The KV-cache is undergoing a fundamental redefinition, being elevated from a passive acceleration buffer to an active, editable memory substrate that fundamentally reshapes serving architectures and state management in transformer generation. The causal probes in 1 demonstrate that during prefill, transformers memoize field-conditioned conclusions onto downstream aggregator tokens, turning the KV-cache into a reusable notebook of intermediate deductions rather than a frozen byproduct. This conceptual shift—supported by up to 14× speedups when editing a single field within a long static prefix 1—directly motivates treating the cache as mutable and composable, rather than a throwaway artifact.
This redefinition gains urgency from the systemic instabilities that arise when the cache is not actively managed. In memory-constrained serving, the continuous growth of the KV-cache under autoregressive decoding creates “service-induced congestion,” an endogenous pressure that triggers eviction cascades and throughput collapse in production systems such as vLLM and SGLang 2. The failure mode is a direct consequence of naive admission control that treats the cache as a monolithic, uneditable block, subject only to wholesale eviction. Extending the editable-memory perspective, these observations imply that smarter cache management—capable of selectively retaining, discarding, or recomputing memoized conclusions—is not merely an optimization but a necessity for stable, high-throughput serving 2.
Yet treating the KV-cache as editable state reveals a subtle brittleness. When attempting to replicate a decoder state by re-feeding a transcript prefix as a fresh prompt, the floating-point reduction order in attention and matrix-multiplication kernels depends on batch composition and prefill-decode splitting, making the reproduced KV-cache diverge from the original 3. This replay noise corrupts counterfactual token-credit estimates far above the replica floor, with Jaccard overlaps between token-selection sets dropping as low as 0.34 3. The perturbation is mean-zero, so aggregated metrics may remain stable, but any threshold-based decision that relies on exact state fidelity is materially compromised 3. This result stands in productive tension with the editable-memory paradigm: it confirms the cache is indeed a high-fidelity, context-sensitive state representation, but one whose precise content cannot be reproduced by simply replaying the token sequence. Servicing architectures that treat the KV-cache as an editable, composable memory must therefore account for this non-determinism, either by enforcing deterministic recomputation or by designing algorithms robust to the resulting noise. Together, these findings 1, 3, 18 chart a trajectory from a static, opaque acceleration structure toward a dynamic, managed memory layer, where efficiency, stability, and counterfactual fidelity are yoked to how we store, edit, and reuse the memoized record of a model’s reasoning.
Reasoning-Centric Quantization: Overcoming Precision Bottlenecks in Chain-of-Thought
The catastrophic potential of quantization in chain-of-thought reasoning stems from a subtle concentration of errors: failures overwhelmingly land on low-entropy symbolic tokens—digits, operators, and logical connectives—where even minute noise inflates sampling errors that cascade through multi-step traces 4. ReQAT confronts this directly with Selective Entropy Minimization (SEM), an auxiliary loss that reinforces model confidence precisely at these low-entropy positions, thereby preserving full-precision reasoning accuracy within a 4‑bit floating‑point quantization‑aware training framework 4. By hardening the token‑level decisions where a single mistaken symbolic commitment can derail an entire chain, SEM targets the very sites where precision loss is most catastrophic 4.
Simultaneously, the pursuit of uniform low‑bit inference has been blocked by outlier values that historically demanded higher‑precision storage, forcing mixed‑precision fallbacks with costly format conversions and data movement. MosaicQuant dismantles this barrier by disaggregating weight matrices into a dense 4‑bit base for inliers and a sparse 4‑bit residual that captures outlier‑induced errors, keeping the entire inference pipeline in 4‑bit without accuracy degradation 5. This inlier‑outlier separation achieves near‑FP16 performance on LLaMA3 and Qwen3 models (3B–32B), demonstrating that uniform low‑bit execution can be realized without sacrificing outlier fidelity 5.
Where SEM defends the front‑end token‑level fragility of reasoning traces 4, MosaicQuant secures the back‑end representational integrity needed for uniform low‑bit compute 5. The two strategies are not competing but complementary: one mitigates the entropy spikes at the most critical symbolic steps, the other obviates precision heterogeneity in weight representation. Together they articulate a reasoning‑centric quantization framework that abandons the prior assumption that aggressive compression must either impair chain‑of‑thought fidelity or rely on mixed precision. This convergence shows quantization maturing from a generic compression tool into a precision strategy that actively upholds the integrity of multi‑step inference, strategically allocating bits to the computations where they matter most for coherent symbolic thought 4, 5.
The Agentic Turn: Bridging Delegation, Security, and Collaborative Task Allocation
The transition from static model serving to agentic operation redefines the boundary between human and machine labor, but the infrastructure for delegation, security, and collaborative task allocation remains critically underdeveloped. As large language model agents take on autonomous coding and terminal work, research exposes vulnerabilities that arise not from model capability gaps, but from mismatches between agent design and human cognitive realities. A triad of concerns—insecure persistent state, fragile delegation contracts, and unprincipled task handoff—converge on a single imperative: frameworks that embed human trust and cognitive load into the delegation process are not optional, but foundational.
Security threats have evolved beyond prompt injection to exploit the temporal persistence that distinguishes agents from stateless chatbots. FragFuse demonstrates that long-term memory creates a temporal side channel that bypasses access-control guardrails, achieving an average bypass success rate of 86.3% 6. This vulnerability is orthogonal to traditional input-based defenses, because it fragments and sequences queries across multiple interactions to reconstruct unauthorized information from the agent’s persistent memory. In parallel, terminal agents that rely on static command denylists suffer from a fragility problem: a single harmful goal can be implemented through a combinatorially large set of shell commands that easily circumvent deny-lists 7. The practical severity of this brittleness is compounded by approval fatigue, with users accepting 93% of ask-list prompts 7. Together, these findings show that load-bearing security controls—both memory-level access enforcement and command-level filtering—erode when human attention is the ultimate gating mechanism, creating an environment where automation bias is directly exploitable.
The delegation itself is undermined by a parallel lack of structure. Even when agents operate within intended bounds, they rarely volunteer the evidence that human reviewers need to efficiently verify their work. An empirical study of software delegation contracts found that without explicit contracting, agents seldom provide review-critical information such as changed-file rationales, known limitations, or residual risks 8. The result is that the cognitive burden of verification shifts almost entirely onto the human reviewer, negating the efficiency gains that delegation promises. Notably, contracts disproportionately improved the reviewability of output from weaker models 8, indicating that delegation protocols must be calibrated not only to task complexity but to the agent’s reliability profile.
A direct response to these intertwined problems emerges from the SCAN framework, which extends Vygotsky’s Zone of Proximal Development by introducing a “known to GenAI” dimension 9. By mapping tasks onto four sub-zones—Substitute, Complement, Aid, and Non-negotiable—based on the learner’s real-time knowledge state and GenAI’s general capabilities, SCAN grounds allocation decisions in a model of when collaboration risks over-reliance, automation bias, and deskilling 9. This human-centric zoning implicitly addresses the security gaps exposed by 6 and 7 by reserving critical actions for zones where human judgment is structurally preserved, and it operationalizes the insight from 8 that delegation without cognitive safeguards is self-defeating. Rather than treating delegation as a binary handoff, SCAN’s graduated categories align agent autonomy with the user’s ability to maintain meaningful oversight, thereby bridging the previously disconnected domains of security, contract design, and collaborative task allocation.
Efficient Physical World Adaptation: From Fast Policy Training to Cross-Embodiment Transfer
The shift toward efficient physical-world adaptation in robotics is manifesting through three complementary innovations that collectively minimize data and computation while expanding the scope of transfer. FlashNav demonstrates that deep reinforcement learning (DRL)–based navigation policies can be trained in under 20 seconds by reformulating the training loop as a task-specific systems problem, stripping away rendering and full physics to retain only MDP-essential components such as occupancy geometry and range 10. This compression reduces wall-clock training from hours to seconds on desktop GPUs, making on-robot adaptation and rapid policy iteration practical 10. Where FlashNav achieves a dramatic speedup in optimization, the RECAP framework eliminates training altogether for new task acquisition. RECAP introduces a retrieval-conditioned action policy for vision-language-action models that adapts to unseen tasks entirely at test time simply by indexing cheap pool-embodiment demonstrations—e. g., human-hand videos—into a retrieval pool, thereby shifting the adaptation burden from parameter updates to data indexing 11. The policy parameterizes actions as a residual over the retrieved trajectories, so adding a task requires no fine-tuning, only an expansion of the indexed set 11. This retrieval-driven strategy thus extends the logic of rapid adaptation from training-time acceleration to zero-training task expansion.
Extending the efficiency frontier across embodiments, a cross-embodiment force–position interface makes contact feedback, not just motion, transferable across structurally different dexterous hands 12. Existing methods align finger motions but leave force feedback tied to each hand’s specific sensing, preventing transfer of compliant grasping; by expressing contact in comparable physical units, this interface enables stable, contact-rich manipulation without per-hand retraining 12. The approach addresses a limitation that retrieval-augmented policies alone do not solve: even when task demonstrations are indexed, executing them on a new embodiment can fail if force-level interaction is missing. The contact-level interface therefore complements retrieval-based task adaptation by allowing the same retrieved skill to be physically realized across varied morphologies 6, 15. Combined, these works outline a coherent research direction: ultrathin training budgets enable on-robot policy bootstrapping 10; test-time retrieval from cheap demonstration pools eliminates per-task fine-tuning 11; and embodiment-independent contact representations allow those retrieved skills to be deployed with compliant grasping on heterogeneous hands 12. This convergence points to robotics systems that require dramatically fewer computational and data resources for policy learning while inherently supporting cross-task and cross-embodiment transfer.
Reevaluating Evaluation: Psychometric Flaws in LLM Judges and Benchmarks
The conceptualization of LLM evaluators and benchmarks as transparent, objective instruments has come under strain. A series of investigations illuminates unacknowledged psychometric properties that contaminate rankings and subvert the trust placed in automated assessment pipelines. These findings converge on a shared diagnosis: single-number metrics and aggregate benchmarks systematically conceal measurement noise, bias, and phase-dependent blind spots.
A foundational challenge emerges from work that reframes LLM-based judges as measurement instruments rather than simple accuracy classifiers. Applying a psychometric lens reveals that judges do not simply report signal; they introduce their own "dark current"—manufactured preferences in the absence of true quality differences—and shift their internal criterion in response to irrelevant surface features of the evaluated text 13. Such behavior means that the scalar win rates and accuracy scores typically reported for judge models conflate genuine sensitivity to output quality with response biases and contextual drift, undermining the validity of comparative claims derived from them. The measurement-instrument perspective exposes that current judge reporting practices, which omit reliability coefficients, differential item functioning, or construct validity evidence, leave the evaluation infrastructure itself unevaluated 13.
This vulnerability is compounded when judges face adversarial input. The first general framework for assessing the adversarial robustness of multimodal LLM judges demonstrates that small, targeted perturbations to images or text can flip quality and safety evaluations 14. Since these multimodal judges are increasingly deployed at scale to monitor content and maintain leaderboard integrity, their fragility to adversarial manipulation introduces a threat vector that scalar aggregate metrics are blind to: a system appearing robust in standard benchmarks may collapse under trivial, imperceptible modifications. The finding extends the measurement critique from 13 by showing that not only do judges suffer from internal psychometric noise, but their outputs are also actively destabilizable in deployment settings, making leaderboard positions contingent on unaccounted security assumptions 14.
The same pattern of overlooked confounds extends into the design of multilingual benchmarks, which underpin claims about LLMs’ global capabilities. By applying an Item Response Theory framework to parallel multilingual test sets, researchers uncovered systematic biases: undetected translation errors and conflated cultural knowledge distort difficulty estimates across languages 15. A model’s ranking shift between languages may therefore reflect artifacts of test construction rather than genuine cross-lingual transfer. This challenges the commonplace interpretation of aggregated multilingual performance scores and demonstrates that, without item-level psychometric modeling, allegedly equivalent benchmarks impose language- and culture-specific blind spots that mislead comparative assessments 15.
These critiques are not confined to model-output evaluation; they also surface in hardware benchmarking. A phase-aware methodology that isolates Prefill and Decode performance on heterogeneous accelerators reveals that conventional end-to-end aggregate metrics, such as total throughput or average latency, obscure critical trade-offs 16. For instance, a GPU may dominate batched Prefill throughput while a GroqRack delivers lower Decode latency under unbatchable conditions, yet a single figure of merit erases this distinction and promotes suboptimal accelerator selection. The failure to report phase-disaggregated metrics constitutes a benchmarking blind spot formally analogous to the judge and translation artifacts: what appears as a simple rank ordering collapses a multivariate performance space into a deceptive scalar 16.
Taken together, these findings expose a structural crisis in LLM evaluation: judge biases, adversarial brittleness, translation-induced construct variance, and aggregate hardware metrics each represent a species of psychometric oversight that undermines trust in the leaderboards and comparative studies that guide model development and deployment. The evidence does not point to isolated flaws but to a systematic under-specification of the measurement properties underlying evaluation instruments, calling for a fundamental rethinking of how evaluation reliability is established and reported.
Beyond Scale: Structural Innovations in Model Architectures
Foundational model design is moving beyond the paradigm of monolithic scaling laws toward a suite of structural innovations that embed persistent memory, reuse computation at the granularity of expert submodules, and refactor generative processes through geometric latent spaces—each yielding efficiency and capability gains without the commensurate parameter growth that linear scaling would demand. The Reservoir Attention Network (RAN) directly challenges the stateless assumption of standard transformers by injecting a fixed, randomly initialized reservoir into mid-layer attention, which furnishes pretrained models with persistent cross‑pass state between independent forward passes 17. This architectural intervention decouples memory from the context window, enabling state retention without expanding the model’s parameter count per inference call.
While RAN introduces cross‑pass persistence, MoECa targets intra‑pass computational redundancy within diffusion transformers that use mixture‑of‑experts (MoE). It identifies a structural mismatch: token‑level feature caching fails to account for the fact that each token update is internally decomposed across multiple routed expert branches, each exhibiting heterogeneous temporal evolution across denoising timesteps 18. By realigning caching granularity to match this expert‑level decomposition, MoECa dramatically reduces redundant computation that would otherwise scale with both the number of experts and the sequence length 18. The result is an efficiency leap obtained not by adding parameters but by exploiting the existing expert structure more intelligently.
A complementary logic governs Drift-RAE, which extends the efficiency‑oriented redesign beyond attention and feed‑forward blocks to the generative trajectory of a flow transformer. It distills a pretrained multi‑step flow transformer directly into a single‑step generator operating in the latent space of a Representation Autoencoder (RAE) 19. The RAE latent space serves as a geometrically compact, semantically rich manifold that stabilizes distillation, yielding a 1‑step synthesis quality that competes with multi‑step diffusion models 19. This represents a form of geometric activation function: the transformation into and out of the RAE space condenses the generative mapping, drastically reducing sample‑time computation without inflating the parameter footprint of the original teacher network.
Taken together, these three approaches illustrate a convergence away from scaling‑centric design. RAN provides persistent state without per‑pass parameter growth, MoECa redeploys existing expert capacity through decomposition‑aware caching, and Drift-RAE collapses the generative process into a compact geometric latent space 17, 18, 19. They are not isolated tweaks but coordinated manifestations of a principle that structural insight—into cross‑pass memory, expert‑level temporal heterogeneity, and semantically grounded latent geometry—can substitute for raw parameter scaling in obtaining more capable and efficient models.
Briefly Noted
Careful dissection of reasoning pipelines revealed that performance gains often stem from execution rather than representation. A three-route framework disentangling code-based and natural-language reasoning showed that accuracy leaps from roughly 17% to nearly 49% only when external code execution is introduced, clarifying that the deterministic execution step, not structured code syntax, drives the advantage 20. Similarly, a dense credit-assignment method cured a critical failure in self-distillation for LLM reasoning, where conditioning on ground-truth answers produced a flat “silence floor” on terse tasks because the scalar reward could not localize which token caused a mistake 21. A parallel insight into attention mechanics uncovered that Rotary Positional Embeddings inherently attenuate attention between graph-adjacent nodes in linearized sequences, a structural distortion correctable by a graph-aware alignment that lifted node classification accuracy by up to 18.6% 22.
Safety and coordinated physical action saw advances that blend learned models with formal guarantees or human oversight. A symbolic POMDP formulation automatically constructed from visual demonstrations gave robots explicit observation and belief models for online planning under perception and execution uncertainty, moving beyond brittle open-world visuomotor planners 23. For multi-robot teams, a diffusion transformer treated each robot as a discrete token and generated coordinated, safety-satisfying trajectories in a single feed-forward pass, outperforming classical iterative methods without successive individual planning 24. Shared autonomy bridged this gap for pretrained vision-language-action policies: a lightweight blending framework enabled sparse corrective teleoperation to steer brittle out-of-distribution behaviors without sacrificing autonomous proficiency 25. And a GPU-accelerated robust MPC pipeline that plans directly in the latent space of a pixel-trained world model closed the loop between learning and safety, providing probabilistically safe control from raw visual input 26.
Outside core planning and reasoning, notable developments addressed security, assistive technology, and immersive media. A gray-box adversarial attack framework leveraged discrete diffusion language models to craft jailbreak prompts that preserve semantic meaning, bypassing filters without the typical “jailbreak tax” paid by meaning-altering rewrites 27. For neurodegenerative speech disorders, a novel policy-optimization framework reduced word error rates dramatically in severe conditions by rewarding faithful recovery of patient intent rather than fluent paraphrases, offering a path beyond generic text-generation objectives 28. Finally, a multi-stage pipeline for 4D head avatars bridged the gap between generalizable feed-forward predictors and per-subject refiners via a shared mesh-bound representation, achieving zero-shot cross-domain generalization while slashing per-subject optimization from hundreds of thousands of iterations to a fraction 29.
Synthesis and Outlook
The convergence of these research threads reveals a field actively reconstructing its foundational assumptions around state, precision, and interaction. The redefinition of the KV-cache as an editable memory substrate directly reinforces the push for efficient, reasoning-aware quantization, as both pursue granular control over the transformer’s internal state to preserve fidelity—yet this shared focus on low-level memory manipulation introduces a direct conflict with the agentic turn’s exposure of memory side-channel vulnerabilities. Agent autonomy demands persistent, editable context, but without robust security guarantees, the very mechanisms that enable dynamic task allocation and cross-session reasoning become attack surfaces. The emphasis on human-centric delegation frameworks and cognitive load further complicates this picture: as architectures evolve toward persistent cross-pass state and expert-level feature reuse, the question of what and when to offload to an agent becomes inseparable from how memory is managed and protected. The psychometric flaws identified in LLM judges and benchmarks amplify this tension, as evaluating an agent’s task-allocation decisions and long-term state management remains contingent on metrics whose own reliability is underexamined. Simultaneously, the dramatic reductions in policy training data and the rise of cross-embodiment transfer in robotics mirror the beyond-scale architectural innovations in language models, both driven by structural reuse rather than blind scaling. These parallels suggest a joint trajectory toward systems that are less monolithic and more compositional, where efficiency gains from quantization and modular design must be reconciled with the security, trust, and evaluation frameworks required for real-world agency. An open question remains: how can a shared, editable memory substrate support secure, human-centered agent delegation while maintaining the ultra-efficient, precision-aware execution demanded by next-generation serving architectures?
This review draws on 29 developments: 29 Tier A research sources. The base is unusually strong, though several findings still await independent replication before they can be treated as settled.
Canonical Sources & Links
- [1] Models Take Notes at Prefill: KV Cache Can Be Editable and Composable — arXiv · Tier A/research_paper
- [2] Service-Induced Congestion in Memory-Constrained LLM Serving — arXiv · Tier A/research_paper
- [3] Re-feeding Is Not Replaying: Measuring Replay Noise in Counterfactual Token-Credit Estimation — arXiv · Tier A/research_paper
- [4] ReQAT: Achieving Full-Precision Reasoning Accuracy with 4-bit Floating-Point Quantization-Aware Training — arXiv · Tier A/research_paper
- [5] MosaicQuant: Inlier-Outlier Disaggregation for Unified 4-Bit LLM Quantization — arXiv · Tier A/research_paper
- [6] FragFuse: Bypassing Access Control of Large Language Model Agents via Memory-Based Query Fragmentation and Fusion — arXiv · Tier A/research_paper
- [7] One Goal, Many Commands: Characterizing Denylist Fragility in AI Agents — arXiv · Tier A/research_paper
- [8] Software Delegation Contracts: Measuring Reviewability in AI Coding-Agent Work — arXiv · Tier A/research_paper
- [9] SCAN: A Decision-Making Framework for Effective Task Allocation with Generative AI — arXiv · Tier A/research_paper
- [10] FlashNav: Ultra-Fast Policy Training for Robot Navigation within 20 Seconds — arXiv · Tier A/research_paper
- [11] Retrieve, Don't Retrain: Extending Vision Language Action Models to New Tasks at Test Time — arXiv · Tier A/research_paper
- [12] Transferring Contact, Not Just Motion: Compliant Grasping Across Dexterous Hands — arXiv · Tier A/research_paper
- [13] LLM Judges Have Dark Current: A Psychometric Datasheet for LLM-as-a-Judge Evaluation — arXiv · Tier A/research_paper
- [14] On the Adversarial Robustness of Multimodal LLM Judges — arXiv · Tier A/research_paper
- [15] Extending Item Response Theory for Efficient and Meaningful Multilingual Evaluation — arXiv · Tier A/research_paper
- [16] Prefill/Decode-Aware Evaluation of LLM Inference on Emerging AI Accelerators — arXiv · Tier A/research_paper
- [17] The Reservoir Attention Network: Cross-Pass State in Pretrained Transformers via Content-Addressable Reservoir Injection — arXiv · Tier A/research_paper
- [18] MoECa: Aligning Feature Reuse with Expert Decomposition in Diffusion Transformers — arXiv · Tier A/research_paper
- [19] Distilling Drifting Transformers with Representation Autoencoders — arXiv · Tier A/research_paper
- [20] Is Code Better Than Language for Algorithmic Reasoning — arXiv · Tier A/research_paper
- [21] Localizing Credit at the Divergence: Path-Conditioned Self-Distillation for LLM Reasoning — arXiv · Tier A/research_paper
- [22] Formalizing and Mitigating Structural Distortion in LLM Attention for Graph Reasoning — arXiv · Tier A/research_paper
- [23] PO-PDDL: Learning Symbolic POMDPs from Visual Demonstrations for Robot Planning Under Uncertainty — arXiv · Tier A/research_paper
- [24] Robots as Tokens: Unified Diffusion Transformer for Coordinated Multi-Robot Trajectory Generation — arXiv · Tier A/research_paper
- [25] SAPS: Shared Autonomy for Policy Steering by Blending Teleoperation with a Pretrained VLA — arXiv · Tier A/research_paper
- [26] Pixels to Proofs: Probabilistically-Safe Latent World Model Control via Parallel Conformal Robust MPC — arXiv · Tier A/research_paper
- [27] Greedy Coordinate Diffusion: Effective and Semantically Coherent Adversarial Attacks via Diffusion Guidance — arXiv · Tier A/research_paper
- [28] AP-GRPO: Anchor-Gated Phonetic Alignment with Policy Optimization for Pathological Speech Reconstruction — arXiv · Tier A/research_paper
- [29] SpatialAvatar-0: High-Quality 4D Head Avatar with Multi-Stage Reconstruction — arXiv · Tier A/research_paper