Skip to content

Content Archive

98 items (43 posts + 55 reading notes)

2026 (58)

Note

IEA: Amateur-Friendly Conversational Image Editing Agent via Three Stages of Multitask Alignment

The authors propose IEA, a conversational image editing agent that performs editing by manipulating parameterized tools within an explicit action space. It employs a three-stage multitask alignment training process: expert editing distilled SFT, GRPO-based reinforcement learning, and large-scale synthetic fine-tuning, to achieve interpretable editing trajectories and user intent summarization.

Note

Correct Looks Better: Pairwise Comparisons Reveal Accuracy Rankings

The authors transform five established benchmarks into free-form generation evaluations to demonstrate that model rankings derived from pairwise comparisons (e.g., Elo ratings) align highly with accuracy rankings based on ground truth. The study finds that pairwise comparison rankings accurately reflect model performance even with weaker evaluators, while style and bias exert limited influence on overall rankings.

Note

The Confident Liar: Diagnosing Multi-Agent Debate with Log-Probabilities and LLM-as-Judge

The authors investigate the relationship between token-level log-probability distributions, LLM-as-judge scores, and final task accuracy within multi-agent debates. The paper utilizes a two-agent (Constructor and Auditor) debate architecture, incorporating LLM judges for fine-grained scoring of the reasoning process. It aims to diagnose reasoning quality and task correctness in external evaluations via internal confidence signals.

Note

PADD: Path-Aligned Decompression Distillation for Non-Router Teacher to Guide MoE Student Learning

The authors propose the Path-Aligned Decompression Distillation (PADD) framework, aiming to distill knowledge from dense teacher models without explicit routing to Mixture of Experts (MoE) student models. The method initializes expert functionality through teacher neuron clustering and combines online adaptive distillation with path refinement strategy optimization to achieve efficient knowledge transfer and routing learning under a fixed computational budget.

Note

UniSVQ: 2-bit Unified Scalar-Vector Quantization

The authors propose the UniSVQ framework, unifying scalar and vector quantization by parameterizing codebooks as affine transformations of integer lattices. This approach maintains compatibility with optimized integer kernels while preserving vector quantization flexibility, introducing a data-driven block-level fine-tuning strategy to minimize reconstruction error.

Note

How Does Reasoning Flow? Tracing Attention-Induced Information Flow for Targeted RL in LLMs

The authors propose the FlowTracer framework, which traces answer-oriented reasoning flows by constructing attention-induced directed acyclic graphs. The method utilizes aggregated attention weights as edge capacities and extracts the information flow backbone through flow conservation constraints, thereby assigning credit to tokens based on flow throughput.

Note

Dynamic Linear Attention

The authors propose the Dynamic Linear Attention (DLA) framework, which employs information-aware dynamic state merging and capacity-bounded memory modeling to address the inability of fixed state merging strategies in existing linear attention methods to adapt to dynamic token importance. The method adaptively determines state boundaries based on token-level information changes, preserving high-resolution representations at semantic transitions while compressing stable regions.

Note

Flexible Kernels for Protein Property Prediction

The authors propose a class of sequence kernels utilizing evolutionary substitution matrices and local linearity, integrated with Gaussian Processes to construct protein property prediction models. This approach exhibits efficiency under sparse data conditions and can incorporate structural information from foundation models through structure-aware substitution matrices.

Note

When Does Language Matter? Multilingual Instructions Reveal Step-wise Language Sensitivity in Vision-Language-Action Models

The authors conduct the first systematic multilingual evaluation of VLA models, finding that non-English instructions lead to a significant drop in success rates. The study reveals that language influence is highly uneven across task execution steps and proposes a reasoning-time intervention method based on step-wise language sensitivity to align representations.

Note

MLUBench: A Benchmark for Lifelong Unlearning Evaluation in MLLMs

The authors propose MLUBench, a large-scale benchmark comprising 127 entities and 9 categories to evaluate the lifelong unlearning capabilities of Multimodal Large Language Models (MLLMs). Additionally, they introduce the LUMoE method, which leverages a Mixture of Experts mechanism to mitigate cumulative performance degradation resulting from continuous unlearning.

Note

Zero-source LLM Hallucination Detection with Human-like Criteria Probing

The authors propose the Human-like Criteria Probing for Hallucination Detection (HCPD) paradigm, simulating the multi-faceted reasoning of human evaluators. The core is the Human-like Criteria Probing (HCP) mechanism, where an LLM agent adaptively decomposes judgments into a weighted set of interpretable criteria and aggregates scores. It employs a reward-based alignment scheme utilizing semantic consistency for weak supervision, and uses multi-sampling aggregation during inference to ensure robustness.

Note

TWLA: Achieving Ternary Weights and Low-Bit Activations for LLMs via Post-Training Quantization

The authors propose the TWLA post-training quantization framework, aiming to achieve joint compression of 1.58-bit weights and 4-bit activations. The framework collaboratively optimizes through three modules: Euclidean-to-Manifold Asymmetric Ternary Quantizer, Kronecker Orthogonal Trimodal Reshaping, and Inter-Layer Aware Activation Mixed Precision, addressing weight distribution mismatch and activation long-tail problems.

Note

Functional Cache Grafting: Robust and Rapid Code-Policy Synthesis for Embodied Agents

The authors propose the FCGraft framework, which maintains function-level verified code skeletons and their associated Transformer KV cache library to synthesize new policies using retrieval and grafting mechanisms. This method eliminates redundant prefilling computations through cache stitching and locally adapts to task parameters via cache patching, thereby reducing generation latency and improving robustness.

Note

Reasoning for Mobile User Experience with Multimodal LLMs: Task, Benchmark, and Approach

The authors propose the UXBench benchmark and the UI-UX model, aiming to evaluate and enhance the user experience reasoning capabilities of multimodal large language models on UI screenshots. UXBench contains 2,000 VQA samples covering 8 tasks, while UI-UX is based on Qwen3-VL and enhances the reasoning process through reinforcement learning.

Note

PolyFlow: Safe and Efficient Polytope-Constrained Flow Matching with Constraint Embedding and Projection-free Update

The authors propose the PolyFlow framework, which directly embeds polytope constraints into the flow matching model and dynamics. Through discrete-time flow formulation and a projection-free architecture, it eliminates numerical integration errors and strictly satisfies arbitrary polytope constraints without iterative solvers.

Note

Multi-Agent Reinforcement Learning from Delayed Marketplace Feedback for Objective-Weight Adaptation in Three-Sided Dispatch

The authors propose a reinforcement learning system deployed at DoorDash that leverages delayed marketplace feedback to adaptively adjust dispatch objective weights. Rather than replacing the combinatorial allocation optimizer, store-level policies select discrete multipliers to balance the trade-off between delivery quality and batching efficiency.

Note

Minim: Privacy-Aware Minimal View for Agents via Trusted Local Sanitization

The authors propose the MINIM framework, serving as a trusted local agent to perform privacy-aware minimization of UI states on the client side. Based on the theory of contextual integrity, the method learns sensitivity scores and task-conditional necessity scores for each UI element, driving a ternary disclosure strategy to balance privacy and utility.

Note

One Layer's Trash is Another Layer's Treasure: Adaptive Layer-wise Visual Token Selection in LVLMs

The authors propose an Adaptive Layer-wise Visual Token Selection (ALVTS) framework that utilizes a lightweight selector to dynamically identify important tokens for computation, while secondary tokens skip the current layer and are reintegrated in subsequent layers. Based on low-rank approximation with importance consistency constraints, this method simulates full attention mechanisms without requiring model retraining.

Note

Riemannian Metric Matching for Scalable Geometric Modeling of Distributions

The authors propose a Riemannian metric matching framework utilizing neural networks to learn the Riemannian geometric structure of data. The core involves estimating the carré du champ operator via a denoising probabilistic framework, expressed as the conditional expectation of data random perturbations. This enables sample-level training without explicit kernel construction and amortized inference with constant cost.

Note

ForceForget: Reinforcement Concept Removal for Enhancing Safety in Text-to-Image Models

The authors propose the ForceForget framework, leveraging reinforcement learning to optimize the Concept Erasing Reward (CER), eliminating unsafe content while maintaining the model's interpretability of safe semantics. By introducing a Safe Adapter module to project partial text embeddings, it achieves efficient concept modulation in cross-attention layers, avoiding over-erasure of benign concepts.

Note

CSPO: Constraint-Sensitive Policy Optimization for Safe Reinforcement Learning

The authors propose Constraint-Sensitive Policy Optimization (CSPO), a first-order primal-dual method that incorporates local constraint sensitivity into policy updates. The method adds a correction term based on the shortest directed distance to the safety boundary in the primal objective, adaptively adjusting the correction magnitude using the constraint gradient norm.

2025 (17)

2023 (3)

2022 (11)

2021 (8)

2012 (1)