Research

New papers ranked by attention, with their code, models and discussion linked. Pick a field on the left.

Week Month Quarter All

Newest Most relevant

Papers

Research

New papers ranked by attention, with their code, models and discussion linked. Pick a field on the left.

Week Month Quarter All

Newest Most relevant

Papers

arXiv cs.CROct 12
ATTCK-R: Knowledge-Aware Long-Horizon Jailbreaking for Protected LLMs
Md Mushfiqur Rahman, Tobias Rohde, Rahul Tripathi, Khalil Elkhalil, Kevin Lybarger
As large language models are deployed behind increasingly sophisticated safety mechanisms, evaluating their robustness under realistic adversarial conditions becomes increasingly difficult and critical. Existing jailbreaking evaluations often rely on static prompts, limited interaction horizons, or lightly protected systems, failing to reflect protected deployment settings with prompt-based safety protections. We show that the introduction of a prompt-based safety protection reduces the average attack success rate of a strong multi-turn baseline from 0.896 to 0.608 (32.1\% relative), demonstrating that unprotected evaluations substantially overestimate real-world vulnerabilities. We propose Adaptive Traceback and Tactic Curation for Knowledge-based Red-teaming (ATTCK-R), a planning-driven multi-turn red teaming framework designed for protected black-box systems. ATTCK-R models jailbreaking as a long-horizon trajectory optimization problem using a structured belief state, introduces optimization-based tactic curation to abstract reusable strategies from prior successes and failures, and employs informed traceback to resume attacks from strategically meaningful states rather than…
PDF
arXiv cs.CVOct 12▲ 15
RAR: Rate-Adaptive Rollout for Time-Consistent Interactive World Models
Yaoyang Liu, Dongyu Yan, Yihua Du, Shengju Qian, Zeke Xie +3
Video-based interactive world models aim to enable real-time, user-controllable environments. Yet most existing systems are trained and rolled out at a fixed temporal rate, limiting both runtime-rate adaptation and physical-horizon coverage -- a limitation we term temporal-rate coupling. Specifically, when runtime generation throughput differs from the learned temporal rate, the generated world evolves unintentionally more slowly or quickly. Moreover, using a single temporal rate imposes an inherent trade-off between temporal granularity and physical horizon: higher rates capture finer motion but cover a shorter duration under a fixed context window. To address both limitations, we introduce Rate-Adaptive Rollout (RAR), a framework that enables interactive world models to roll out at controllable temporal rates. At its core, Stride-RoPE aligns latent frames sampled at different rates on a shared physical-time coordinate, enabling consistent multi-rate rollout, unseen-rate generalization, and online rate switching without discarding history. Meanwhile, RAR uses multi-stride video sampling to enable joint learning of fine-grained dynamics and long-horizon evolution. Across action-…
CodePDF
arXiv cs.AIOct 12
FON: A Draft-Revise Dual-Organ Language Model without Sequence-Level Quadratic Attention
Helong Hu, Hongdan Pan, Shuiqing Hu
Self-attention assigns two functions to one mechanism-where to read and how to mix-at the price of O(L^2) training, an O(T) decode state, and position signals bound to the training length. Existing attention-free alternatives all optimize the single function of generation. We propose FON (Fusion-Organ Network), which differentiates one weight stack into a drafting organ (multi-tap learnable delays + content-adaptive recursion; causal, O(S) training, O(1) decode state, no sequence-level quadratic attention) and a revision organ that re-processes the written prefix through multi-scale ripple kernels injected via weak gates, never generating. At 30M parameters, iso-parameter and iso-token budget, FON reaches perplexity 131.03 on WikiText-103, beating Transformer (197.73) and Mamba2 (152.53); the advantage persists under all depth-aligned baselines and at the 70M tier (-20.8%). At 8x length extrapolation FON degrades by ~8-9% without positional-encoding engineering, between ALiBi and RoPE. The revision channel provides a structural pathway for in-domain infilling that causal architectures lack in principle (+19% over on-demand coupling), at a perplexity cost indistinguishable within…
PDF
arXiv cs.CVOct 12
Learning Temporal Evidence Selection for Video Anomaly Understanding
Hangil Park, Seungheon Kim, Tae-Kyun Kim
Video anomaly understanding (VAU) aims to generate language-level interpretations of anomalous events in long videos, requiring visual evidence that supports explanation beyond anomaly detection alone. Existing VAU pipelines commonly rely on anomaly-centric or predefined temporal sampling strategies, which efficiently emphasize suspicious moments but overlook contextual cues, object interactions, and temporally distributed evidence needed for reasoning. Motivated by recent progress in learnable temporal selection for long-video question answering, we revisit VAU temporal sampling as a downstream-aligned evidence selection problem. We introduce the semantic-conditioned Temporal Sampling Q-Former that learns to select temporal visual evidence through the VAU generation objective. Since generic VAU prompts provide weak video-specific guidance, we condition the sampler on CLIP-embedded object tags automatically extracted from the input video. These tags are used only for temporal evidence selection and are not appended to the LLM generation prompt, separating sampler conditioning from prompt augmentation. The proposed sampler operates in visual-token space, computes soft temporal…
PDF
arXiv cs.AIOct 12
Memory-Efficient Integer-Only Training of Deep Neural Networks
Hazem Hesham Yousef Shalby, Fabrizio Pittorino, Manuel Roveri
Training neural networks in reduced precision can yield significant efficiency gains, yet all existing methods that scale to standard computer vision benchmarks retain floating-point in at least one stage, typically the weight update or optimizer state. We present a training algorithm that scales to modern deep neural networks, in which every tensor (weights, gradients, and activations) is stored as INT8, and every operation (forward pass, backward pass, weight update, optimizer update) is performed in integer arithmetic. Specifically, tensors are stored as signed integer mantissas paired with explicit power-of-two exponents, on which integer-only operations are performed using five custom composable building blocks (products, sums, divide-by-constant, nonlinear functions, and weight updates). This allows complete implementation of trainable integer layers, including convolutions, batch and layer normalization, softmax, and GELU. A per-group velocity mechanism with independent exponent tracking preserves gradient precision across neurons and channels with diverse magnitudes. As every tensor fits in INT8, training memory is roughly 4x smaller than the FP32 baseline. We validate…
PDF
arXiv cs.LGOct 12
SLDBench v2: Active Scaling Law Discovery
Lingbei Meng, Rui Huang, Zhirong Shen, Jinxin Liu, Lingxiao Jing +3
Scaling laws predict large-model performance from small experiments, but finding a reliable law itself requires costly experiments. SLDBench tests whether language-model agents can discover scaling laws when all experimental results are given upfront. We introduce SLDBench v2 with two extensions. First, we expand the corpus from 8 to 127 scenarios spanning language-model pretraining, downstream performance, and vision-language transfer, and select 30 challenging scenarios on which a reference power-law fit reaches $R^2 \le 0.8$; they represent at least $1.09 \times 10^{23}$ FLOPs of source-reported training compute. Second, we introduce active scaling law discovery: an agent chooses which experiments to run, pays each one's recorded cost (e.g., training FLOPs), and revises its law as outcomes arrive, and is scored on the same hidden extrapolation targets as in the passive setting. Across 8 frontier agent systems, median $R^2$ drops from 0.72-0.75 (passive) to 0.24-0.57 (active), and prediction error rises 1.5-4.7 times, depending on the system. Agents favor cheap experiments, spending 8-44% of the full-pool cost on average; low-cost acquisition can yield strong predictions, but…
PDF
arXiv cs.CVOct 12
ClothAtlas: Joint Garment Identification and State Estimation under Self-Occlusion
Jens Lundell, Alberta Longhini, Lei Shu, Hemal Arora, Evan Robert +4
Garment manipulation requires inferring both garment identity and complete configuration from partial, self-occluded observations. This creates a chicken-and-egg problem: completing a partial observation requires a garment-specific deformation prior, while identifying the garment requires a configuration that explains the observation. We introduce ClothAtlas, which jointly identifies garments and estimates their complete configurations from partial point clouds and a library of canonical meshes. A shared graph-conditioned flow-matching model samples configurations for each candidate mesh and ranks candidates by observation fit. The model accommodates different mesh shapes, vertex counts, and connectivities, allowing new garments to be added from canonical meshes alone without retraining. On held-out DexGarmentLab garments, ClothAtlas ranks the correct mesh first among 221 candidates for all 22 test garments from a single flat observation. From a single self-occluded observation, it identifies 15/22 garments, compared with 8/22 for a deterministic graph estimator. Persistent vertex identities support grasp-target localization on real garments, reducing mean error from 15.4 to 6.4…
PDF
arXiv cs.CVOct 12
3D Gaussian Splatting for Fine-grained Urban Scene Reconstruction via Semantic-guided Density Control and Loss Design
Yueling Liao, San Jiang, Xing Zhang, Zhongwen Hu
3D Gaussian Splatting (3DGS) has been becoming a promising 3D reconstruction technique because of its advantage of high-fidelity rendering effect with high efficiency. However, it still suffers from coarse density control and semantically blind loss functions when reconstructing the fine-grained structures in complex urban scenes. Thus, this study proposes SG-GS, a semantic-guided 3DGS method for fine-grained structure reconstruction. It takes the semantic segmentation deduced by the Segment Anything Model (SAM) as a constraint and systematically integrates it into both Gaussian density control and loss function design. On the one hand, a semantic-constrained adaptive density control mechanism is constructed, which dynamically allocates gradient thresholds to different semantic regions of the scene and introduces an additional boundary-enhanced densification strategy, so that new Gaussians are directed to structurally critical regions. On the other hand, a multi-feature guided loss function is designed, and fine-grained supervision signals are gradually introduced through a phased progressive training strategy, alleviating the artifacts caused by the lack of semantic constraints…
PDF
arXiv cs.LGOct 12
Fast Quantized Johnson$-$Lindenstrauss Transforms
Angelos Korakitis, Vasileios Nakos
Quantization has emerged as one of the primary techniques for reducing the memory footprint of large language models during inference. A prominent example is Quantized Johnson$-$Lindenstrauss (QJL), which compresses KV caches using 1-bit asymmetric quantization while approximately preserving the inner products required by the attention mechanism. Recent theoretical and practical work aims at replacing the dense Gaussian projections used by the aforementioned transforms with more structured embeddings $-$ such as compositions of randomized Hadamard transforms $-$ while retaining the same embedding dimension. In this paper, we introduce two constructions based on a composition of randomized Hadamard transforms, albeit with a Gaussian rather than Rademacher diagonal in the second stage. The first adds Gaussian dithering to smooth the quantizer, while the second inserts a random permutation to regularize the covariance structure of the resulting Gaussian measurements. We prove embedding-dimension and running-time guarantees analogous to those of Fast JL in the non-quantized setting. The first construction achieves $m=O(\varepsilon^{-2}\log^2(d/δ))$, while the second achieves…
PDF
arXiv cs.AIOct 12
REVEAL: Reverse Engineering Agentic Latents from Frontier-Model Traces
Yuetian Du, Meng Wang, Yucheng Wang, Zhangzhe Chen, Wei Wang +7
Frontier LLM agents perform complex interactive tasks, but their inference costs motivate transferring their experience to smaller open-source agents. Distillation and latent communication typically require target-model training or access to source-model internals. We study how textual frontier-model trajectories can provide reusable local controls for a frozen agent. Inspired by protocol reverse engineering, we introduce $\textit{Agentic Latents}$, comprising anchored states and dynamic profiles of feedback--response cycles elicited by replay in the target model. Our training-free framework, $\textbf{REVEAL}$ ($\textbf{REV}$erse $\textbf{E}$ngineering $\textbf{A}$gentic $\textbf{L}$atents), uses these profiles and trajectory outcomes to match and select local events from successful and failed rollouts of the same task and source model. Their response-transition contrasts yield a target-specific steering direction, applied before each response. Within-benchmark evaluations on Terminal-Bench 2.1 and Humanity's Last Exam with tools report higher accuracy than unmodified agents across three targets. Representation analyses and behavioral case studies support reusing frontier-model…
PDF
arXiv cs.CVOct 12
ProGAN-Based Synthetic Image Generation for Industrial Visual Inspection of Metallic Parts
Hossein Omid Beiki, Sepehr Asgari, Oliver Petrovic, Christian Brecher
Automated visual inspection is essential for efficient repair and recycling of metallic components. AI-based defect detection is a strong fit. However, it is often constrained by scarce, low-diversity training data. To address this gap, we study Generative AI-driven synthetic image generation using Progressive Growing GANs (ProGAN). We implement a ProGAN pipeline with Wasserstein loss and gradient penalty and evaluate key hyperparameters on two public datasets, MVTec AD (metal nut) and MPDD (tube). As a result, training remained stable and the model yielded realistic images. These images can augment training data, improve robustness, and reduce the cost of collecting rare defects.
PDF
arXiv stat.MLOct 12
Moment-Based Anomaly Detection in High-Dimensional Mixed Data
Davide Ferrari, Andrea Nicolodi
We propose an anomaly detection method for high-dimensional mixed-type data that maps heterogeneous features to a common scale via standardized moment-based transformations, yielding interpretable feature-level anomaly scores. These scores are combined through a dependence-aware aggregation step to construct the Mixed-data Influence (MDI) score, accounting for correlations across features and providing a unified measure of how strongly an observation departs from the reference data distribution. By incorporating higher-order moments, the MDI can detect anomalies that arise not only from location shifts, but also from changes in variability, skewness, and other distributional characteristics. The aggregation mechanism allows our method to capture both sparse anomalies concentrated in a small number of features and weak, coordinated deviations distributed across many features. We empirically investigate the distribution and thresholding behavior of the MDI score across different sample sizes, dimensions, dependence structures, and data types. Simulation experiments and two real-data applications, to multi-omics and ESG data, evaluate finite-sample calibration, detection…
PDF
arXiv cs.MAOct 12
RelLedger: Relational Information Governance for LLM Agent Organizations
Junxi Huang, Wenshuo Chen, Nuoxuan Li, Kailong Wang, Meitong Shen +5
In LLM agent organizations, shared records determine which facts are available for later decisions. A sender consults interaction histories before deciding whether to report an event. A delivery gap across histories does not show whose relationship drove the choice or whether the resulting record matters downstream. We introduce RelLedger to audit these links. It holds the event, evidence, risk, and message fixed while crossing the sender's histories with the event target and an unrelated actor. Role reassignment and history rewrites locate the controlling cue. Message and cost interventions show when the effect appears. An attribution ledger maps each claim to its required response cells and separates missing interventions from sampling uncertainty. Recipient replay follows delivered information into downstream decisions. Executable workflows for a simulated one-person company extend the audit to retrieved histories, tool calls, and shared ledger updates. Across GPT, Gemini, Claude, DeepSeek, and Qwen, the audit reveals model-specific control paths and smaller relation gaps under explicit loss rules. Claude sends the same factual notice 62.22 percentage points more often with…
PDF
arXiv cs.AIOct 12
agent-risk: Risk Assessment for Changes to AI Agents
Yue Zhao, Zixiang Xu, Angela Huyue Zhang, S. Alex Yang, Xiyang Hu
Before changing a deployed AI agent (a stricter safety gate, a new model), organizations must approve the change, starting from existing logs. Extending classical risk analysis to partial records and partial changes to running systems, agent-risk replays logged episodes, assuming nothing else changes and the agent does not anticipate the change. The log settles episodes acting as before, a declared stop value settles stopped ones, and the rest need logged support, a saved-state rerun, or a bound. We prove what logs must record for exact replay and which saved states serve a gate family. For independent episodes, we bound the reruns a decision needs and tolerable drift from live behavior. In a bash sandbox, a 7,200-episode log alone decided neither of two retry gates, which let the agent act after refusals the log never shows. Rerunning only each gate's blocked episodes from saved states reached both live decisions at half the agent calls of a live test sized post hoc for them, given the log. Without per-step harm, a stopping gate's certified harm ceiling rose up to 2.5-fold, since the log hides whether harm preceded the stop. Approval thus needs evidence designed in advance: log…
PDF
arXiv cs.CVOct 12
DepthTile: Depth-Guided Existing-Image Self-Tiling with Input-Side Tileability Assessment
Rui Wang, Xi Chen, Hui Dai, Piaopiao Yu, Yixue Hao +2
Existing-image self-tiling aims to transform a given image into a seamlessly repeatable tile while preserving its original semantics and local details. This task requires weak editing to retain the source but leave periodic seams, whereas strong editing improves tileability at the large risk of content drift.Existing diffusion-based tiling pipelines alleviate boundary discontinuities, yet lack awareness of which regions are geometrically important to preserve. In this work, we propose DepthTile, a depth-guided self-tiling method whose generation module requires no retraining of the diffusion backbone. It converts monocular depth into a spatial preservation prior and integrates it into the timestep-dependent masking mechanism of Tiled Diffusion. DepthTile converts depth into a spatial editability map and fuses it with the differential diffusion mask. This strengthens source preservation in near-field regions indicated by the monocular depth prior while retaining editing flexibility near compatible background boundaries. To access when self-tiling is feasible, we introduce the Self-Tiling Ability Score (STAS), a lightweight input-side predictor based on RGB, gradient, depth, and…
PDF
arXiv cs.CVOct 12
FlowAvatar: Real-Time Full-Body Avatars from Sparse Egocentric Inputs on Consumer XR Devices
Chenfeng Gao, Taeyoung Yeon, Sungheon Park, Vasco Xu, Anish Prabhu +2
Prior avatar embodiment research has studied tracking completeness (how faithfully the body, hands, and face are sensed and reproduced) and personalized appearance in isolation, each requiring specialized lab equipment. How these factors interact on consumer hardware remains an open question, because no existing system unifies body pose, face, hands, and personalized appearance on a standalone headset. We present FlowAvatar, a system enabling real-time personalized look-alike avatars with full-body pose, hand articulation, facial expression, and eye gaze tracking from sparse egocentric inputs on consumer XR devices (Meta Quest Pro). Our pose model achieves competitive spatial accuracy and state-of-the-art temporal consistency on the AMASS benchmark against prior works with comprehensive spatial and temporal losses validated through architecture and loss ablations, while running in real-time. Two user studies (N=12, N=10) provide converging evidence that tracking completeness and personalized appearance serve complementary roles: tracking completeness broadly improves perceived motion quality, while only their combination achieves positive total embodiment.
PDF
arXiv cs.LGOct 12
A Survey of Flow Matching in Reinforcement Learning
Nabuat Zaman Nahim, Fairoz Nower Khan, Peizhong Ju
Flow Matching (FM) has recently emerged as a principled and efficient generative modeling framework for reinforcement learning (RL), enabling expressive, multimodal policy parameterizations via deterministic probability transport. Compared to diffusion-based policies that rely on stochastic denoising chains, FM uses sampling based on ordinary differential equations (ODEs), with learned velocity fields, which can substantially reduce inference latency and simplify the incorporation of RL objectives. As research in flow-based RL rapidly accelerates across offline continuous control, online fine-tuning, and foundation model alignment, the literature has become highly fragmented. In this survey, we provide a comprehensive taxonomy of flow-matching approaches in reinforcement learning. We organize the literature along two axes: the target distribution being modeled (e.g., action policies, value critics, transition dynamics) and the mechanism of RL signal integration (e.g., energy-weighted regression, flow-based policy gradients, and group relative policy optimization). Furthermore, we survey emerging frontiers such as discrete and non-Euclidean action spaces, provide a systematic…
PDF
arXiv cs.CLOct 12
Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory
Burin Naowarat, Hao Tang, Sharon Goldwater
Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional "temporal subspace." Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to…
PDF
arXiv cs.CVOct 12
Graph3R: Unifying View Graph Initialization with Feed-Forward Reconstruction
Jingwen Yu, Hengli Wang, Jianhao Jiao, Zhonghang Liu, Ping Tan +1
Feed-forward reconstruction recovers camera poses and dense geometry from image sets whose views are assumed to come from a single scene. In practice, uncurated image collections often contain views from disjoint scenes, and reconstructing these views jointly can corrupt camera poses and geometry. Existing pipelines typically resolve view associations in separate stages before final reconstruction, leaving view graph initialization and reconstruction inference only loosely coupled. We introduce Graph3R, which unifies view graph initialization with feed-forward reconstruction through a shared geometric representation. A lightweight verification head predicts pairwise covisibility from the multi-view features of $π^3$ to construct a view graph. This graph classifies the input views into scene groups. For each group, we mask the shared features before decoding camera poses and dense geometry. Reusing the multi-view features allows Graph3R to reconstruct disjoint scenes separately with a single backbone pass. Across three benchmarks, Graph3R improves average maximum recall at 100% precision by upto 8.99 percentage points over the baseline, while improving reconstruction quality on…
PDF
arXiv astro-ph.IMOct 12
Deep learning methods for gamma event selection in TAIGA-IACT image analysis in stereo-mode
E. O. Gres, A. P. Kryukov, P. A. Volchigov, A. P. Demichev, J. J. Dubenskaya +4
In astrophysical complex TAIGA there are four Imaging Atmospheric Cherenkov telescopes (IACTs), located at a distance of 300-500 m from each other, due to which extensive air showers (EAS) generated by cosmic and gamma radiation are recorded by a single telescope or by multiple telescopes simultaneously (stereo-mode). The analysis of EAS images from two or more Cherenkov telescopes together is of particular interest, since for this approach the reconstruction of physical parameters of the primary gamma ray is much more accurate than in mono-observations. However, the gamma-ray event reconstruction strongly depends on the quality of the hadron background suppression of the classifier, therefore, the gamma event selection stage is one of the important ones in the further analysis of IACT data. We propose and study several neural network methods for gamma event selection in joint TAIGA-IACT image analysis. Neural network methods we suggested involves a single-stage analysis of IACT images from two telescopes, while the second method considers the formation of autoencoder-derived essential features that contain the EAS physical parameters, including the type of primary particle.
PDF

Papers

Open problems across fields

Reliable request execution in streaming video generation1 paper raises it · 0 address it
Models struggle to follow incremental multimodal requests while maintaining state consistency and visual fidelity.
- StreamEval: Evaluating Interactive Streaming Video Generation Modelsraises
End-to-end deep search in real-world open Web environments1 paper raises it · 0 address it
Agents cannot reliably explore, integrate, and verify evidence from diverse, interactive, and heterogeneous web sources.
- Deep Search in Real-World Web Environmentsraises
Prior-consistent solutions for ambiguous nonlinear inverse problems1 paper raises it · 1 addresses it
Diffusion-based samplers often favor measurement-consistent but prior-inconsistent solutions in ambiguous cases, masking failures with best-of-k reporting.
- Beyond Best-of-$k$: Prior-Consistent DAPS for Ambiguous Nonlinear Inverse Problemsraises · addresses
Explainable artifact detection in AI-generated videos1 paper raises it · 1 addresses it
Detectors often fail to identify subtle artifacts or justify their decisions with faithful evidence.
- Verus-Insight: Towards Explainable Artifact Detection in AI-Generated Videosraises · addresses
Temporal trajectory modeling for clinical risk prediction1 paper raises it · 1 addresses it
Existing multimodal approaches underutilize irregular, heterogeneous clinical data accumulated over time for accurate inpatient risk prediction.
- TRACE: Tracking Multimodal Clinical Trajectories for Inpatient Risk Predictionraises · addresses

Named by an AI from these papers' abstracts.

Open problems

Rising research topics

Anomaly detectors22+29.4%
Optimal power flow100.0%
Deepfake detection48−4.0%
Electrocardiogram ecg35−16.7%
Forecasting time52−20.0%
CAD models14−22.2%
Medical image segmentation144−23.8%
Multimodal541−26.1%

Rising research topics

Ask the research

Sample

Papers

arXiv cs.CROct 12
ATTCK-R: Knowledge-Aware Long-Horizon Jailbreaking for Protected LLMs
Md Mushfiqur Rahman, Tobias Rohde, Rahul Tripathi, Khalil Elkhalil, Kevin Lybarger
As large language models are deployed behind increasingly sophisticated safety mechanisms, evaluating their robustness under realistic adversarial conditions becomes increasingly difficult and critical. Existing jailbreaking evaluations often rely on static prompts, limited interaction horizons, or lightly protected systems, failing to reflect protected deployment settings with prompt-based safety protections. We show that the introduction of a prompt-based safety protection reduces the average attack success rate of a strong multi-turn baseline from 0.896 to 0.608 (32.1\% relative), demonstrating that unprotected evaluations substantially overestimate real-world vulnerabilities. We propose Adaptive Traceback and Tactic Curation for Knowledge-based Red-teaming (ATTCK-R), a planning-driven multi-turn red teaming framework designed for protected black-box systems. ATTCK-R models jailbreaking as a long-horizon trajectory optimization problem using a structured belief state, introduces optimization-based tactic curation to abstract reusable strategies from prior successes and failures, and employs informed traceback to resume attacks from strategically meaningful states rather than…
PDF
arXiv cs.CVOct 12▲ 15
RAR: Rate-Adaptive Rollout for Time-Consistent Interactive World Models
Yaoyang Liu, Dongyu Yan, Yihua Du, Shengju Qian, Zeke Xie +3
Video-based interactive world models aim to enable real-time, user-controllable environments. Yet most existing systems are trained and rolled out at a fixed temporal rate, limiting both runtime-rate adaptation and physical-horizon coverage -- a limitation we term temporal-rate coupling. Specifically, when runtime generation throughput differs from the learned temporal rate, the generated world evolves unintentionally more slowly or quickly. Moreover, using a single temporal rate imposes an inherent trade-off between temporal granularity and physical horizon: higher rates capture finer motion but cover a shorter duration under a fixed context window. To address both limitations, we introduce Rate-Adaptive Rollout (RAR), a framework that enables interactive world models to roll out at controllable temporal rates. At its core, Stride-RoPE aligns latent frames sampled at different rates on a shared physical-time coordinate, enabling consistent multi-rate rollout, unseen-rate generalization, and online rate switching without discarding history. Meanwhile, RAR uses multi-stride video sampling to enable joint learning of fine-grained dynamics and long-horizon evolution. Across action-…
CodePDF
arXiv cs.AIOct 12
FON: A Draft-Revise Dual-Organ Language Model without Sequence-Level Quadratic Attention
Helong Hu, Hongdan Pan, Shuiqing Hu
Self-attention assigns two functions to one mechanism-where to read and how to mix-at the price of O(L^2) training, an O(T) decode state, and position signals bound to the training length. Existing attention-free alternatives all optimize the single function of generation. We propose FON (Fusion-Organ Network), which differentiates one weight stack into a drafting organ (multi-tap learnable delays + content-adaptive recursion; causal, O(S) training, O(1) decode state, no sequence-level quadratic attention) and a revision organ that re-processes the written prefix through multi-scale ripple kernels injected via weak gates, never generating. At 30M parameters, iso-parameter and iso-token budget, FON reaches perplexity 131.03 on WikiText-103, beating Transformer (197.73) and Mamba2 (152.53); the advantage persists under all depth-aligned baselines and at the 70M tier (-20.8%). At 8x length extrapolation FON degrades by ~8-9% without positional-encoding engineering, between ALiBi and RoPE. The revision channel provides a structural pathway for in-domain infilling that causal architectures lack in principle (+19% over on-demand coupling), at a perplexity cost indistinguishable within…
PDF
arXiv cs.CVOct 12
Learning Temporal Evidence Selection for Video Anomaly Understanding
Hangil Park, Seungheon Kim, Tae-Kyun Kim
Video anomaly understanding (VAU) aims to generate language-level interpretations of anomalous events in long videos, requiring visual evidence that supports explanation beyond anomaly detection alone. Existing VAU pipelines commonly rely on anomaly-centric or predefined temporal sampling strategies, which efficiently emphasize suspicious moments but overlook contextual cues, object interactions, and temporally distributed evidence needed for reasoning. Motivated by recent progress in learnable temporal selection for long-video question answering, we revisit VAU temporal sampling as a downstream-aligned evidence selection problem. We introduce the semantic-conditioned Temporal Sampling Q-Former that learns to select temporal visual evidence through the VAU generation objective. Since generic VAU prompts provide weak video-specific guidance, we condition the sampler on CLIP-embedded object tags automatically extracted from the input video. These tags are used only for temporal evidence selection and are not appended to the LLM generation prompt, separating sampler conditioning from prompt augmentation. The proposed sampler operates in visual-token space, computes soft temporal…
PDF
arXiv cs.AIOct 12
Memory-Efficient Integer-Only Training of Deep Neural Networks
Hazem Hesham Yousef Shalby, Fabrizio Pittorino, Manuel Roveri
Training neural networks in reduced precision can yield significant efficiency gains, yet all existing methods that scale to standard computer vision benchmarks retain floating-point in at least one stage, typically the weight update or optimizer state. We present a training algorithm that scales to modern deep neural networks, in which every tensor (weights, gradients, and activations) is stored as INT8, and every operation (forward pass, backward pass, weight update, optimizer update) is performed in integer arithmetic. Specifically, tensors are stored as signed integer mantissas paired with explicit power-of-two exponents, on which integer-only operations are performed using five custom composable building blocks (products, sums, divide-by-constant, nonlinear functions, and weight updates). This allows complete implementation of trainable integer layers, including convolutions, batch and layer normalization, softmax, and GELU. A per-group velocity mechanism with independent exponent tracking preserves gradient precision across neurons and channels with diverse magnitudes. As every tensor fits in INT8, training memory is roughly 4x smaller than the FP32 baseline. We validate…
PDF
arXiv cs.LGOct 12
SLDBench v2: Active Scaling Law Discovery
Lingbei Meng, Rui Huang, Zhirong Shen, Jinxin Liu, Lingxiao Jing +3
Scaling laws predict large-model performance from small experiments, but finding a reliable law itself requires costly experiments. SLDBench tests whether language-model agents can discover scaling laws when all experimental results are given upfront. We introduce SLDBench v2 with two extensions. First, we expand the corpus from 8 to 127 scenarios spanning language-model pretraining, downstream performance, and vision-language transfer, and select 30 challenging scenarios on which a reference power-law fit reaches $R^2 \le 0.8$; they represent at least $1.09 \times 10^{23}$ FLOPs of source-reported training compute. Second, we introduce active scaling law discovery: an agent chooses which experiments to run, pays each one's recorded cost (e.g., training FLOPs), and revises its law as outcomes arrive, and is scored on the same hidden extrapolation targets as in the passive setting. Across 8 frontier agent systems, median $R^2$ drops from 0.72-0.75 (passive) to 0.24-0.57 (active), and prediction error rises 1.5-4.7 times, depending on the system. Agents favor cheap experiments, spending 8-44% of the full-pool cost on average; low-cost acquisition can yield strong predictions, but…
PDF
arXiv cs.CVOct 12
ClothAtlas: Joint Garment Identification and State Estimation under Self-Occlusion
Jens Lundell, Alberta Longhini, Lei Shu, Hemal Arora, Evan Robert +4
Garment manipulation requires inferring both garment identity and complete configuration from partial, self-occluded observations. This creates a chicken-and-egg problem: completing a partial observation requires a garment-specific deformation prior, while identifying the garment requires a configuration that explains the observation. We introduce ClothAtlas, which jointly identifies garments and estimates their complete configurations from partial point clouds and a library of canonical meshes. A shared graph-conditioned flow-matching model samples configurations for each candidate mesh and ranks candidates by observation fit. The model accommodates different mesh shapes, vertex counts, and connectivities, allowing new garments to be added from canonical meshes alone without retraining. On held-out DexGarmentLab garments, ClothAtlas ranks the correct mesh first among 221 candidates for all 22 test garments from a single flat observation. From a single self-occluded observation, it identifies 15/22 garments, compared with 8/22 for a deterministic graph estimator. Persistent vertex identities support grasp-target localization on real garments, reducing mean error from 15.4 to 6.4…
PDF
arXiv cs.CVOct 12
3D Gaussian Splatting for Fine-grained Urban Scene Reconstruction via Semantic-guided Density Control and Loss Design
Yueling Liao, San Jiang, Xing Zhang, Zhongwen Hu
3D Gaussian Splatting (3DGS) has been becoming a promising 3D reconstruction technique because of its advantage of high-fidelity rendering effect with high efficiency. However, it still suffers from coarse density control and semantically blind loss functions when reconstructing the fine-grained structures in complex urban scenes. Thus, this study proposes SG-GS, a semantic-guided 3DGS method for fine-grained structure reconstruction. It takes the semantic segmentation deduced by the Segment Anything Model (SAM) as a constraint and systematically integrates it into both Gaussian density control and loss function design. On the one hand, a semantic-constrained adaptive density control mechanism is constructed, which dynamically allocates gradient thresholds to different semantic regions of the scene and introduces an additional boundary-enhanced densification strategy, so that new Gaussians are directed to structurally critical regions. On the other hand, a multi-feature guided loss function is designed, and fine-grained supervision signals are gradually introduced through a phased progressive training strategy, alleviating the artifacts caused by the lack of semantic constraints…
PDF
arXiv cs.LGOct 12
Fast Quantized Johnson$-$Lindenstrauss Transforms
Angelos Korakitis, Vasileios Nakos
Quantization has emerged as one of the primary techniques for reducing the memory footprint of large language models during inference. A prominent example is Quantized Johnson$-$Lindenstrauss (QJL), which compresses KV caches using 1-bit asymmetric quantization while approximately preserving the inner products required by the attention mechanism. Recent theoretical and practical work aims at replacing the dense Gaussian projections used by the aforementioned transforms with more structured embeddings $-$ such as compositions of randomized Hadamard transforms $-$ while retaining the same embedding dimension. In this paper, we introduce two constructions based on a composition of randomized Hadamard transforms, albeit with a Gaussian rather than Rademacher diagonal in the second stage. The first adds Gaussian dithering to smooth the quantizer, while the second inserts a random permutation to regularize the covariance structure of the resulting Gaussian measurements. We prove embedding-dimension and running-time guarantees analogous to those of Fast JL in the non-quantized setting. The first construction achieves $m=O(\varepsilon^{-2}\log^2(d/δ))$, while the second achieves…
PDF
arXiv cs.AIOct 12
REVEAL: Reverse Engineering Agentic Latents from Frontier-Model Traces
Yuetian Du, Meng Wang, Yucheng Wang, Zhangzhe Chen, Wei Wang +7
Frontier LLM agents perform complex interactive tasks, but their inference costs motivate transferring their experience to smaller open-source agents. Distillation and latent communication typically require target-model training or access to source-model internals. We study how textual frontier-model trajectories can provide reusable local controls for a frozen agent. Inspired by protocol reverse engineering, we introduce $\textit{Agentic Latents}$, comprising anchored states and dynamic profiles of feedback--response cycles elicited by replay in the target model. Our training-free framework, $\textbf{REVEAL}$ ($\textbf{REV}$erse $\textbf{E}$ngineering $\textbf{A}$gentic $\textbf{L}$atents), uses these profiles and trajectory outcomes to match and select local events from successful and failed rollouts of the same task and source model. Their response-transition contrasts yield a target-specific steering direction, applied before each response. Within-benchmark evaluations on Terminal-Bench 2.1 and Humanity's Last Exam with tools report higher accuracy than unmodified agents across three targets. Representation analyses and behavioral case studies support reusing frontier-model…
PDF
arXiv cs.CVOct 12
ProGAN-Based Synthetic Image Generation for Industrial Visual Inspection of Metallic Parts
Hossein Omid Beiki, Sepehr Asgari, Oliver Petrovic, Christian Brecher
Automated visual inspection is essential for efficient repair and recycling of metallic components. AI-based defect detection is a strong fit. However, it is often constrained by scarce, low-diversity training data. To address this gap, we study Generative AI-driven synthetic image generation using Progressive Growing GANs (ProGAN). We implement a ProGAN pipeline with Wasserstein loss and gradient penalty and evaluate key hyperparameters on two public datasets, MVTec AD (metal nut) and MPDD (tube). As a result, training remained stable and the model yielded realistic images. These images can augment training data, improve robustness, and reduce the cost of collecting rare defects.
PDF
arXiv stat.MLOct 12
Moment-Based Anomaly Detection in High-Dimensional Mixed Data
Davide Ferrari, Andrea Nicolodi
We propose an anomaly detection method for high-dimensional mixed-type data that maps heterogeneous features to a common scale via standardized moment-based transformations, yielding interpretable feature-level anomaly scores. These scores are combined through a dependence-aware aggregation step to construct the Mixed-data Influence (MDI) score, accounting for correlations across features and providing a unified measure of how strongly an observation departs from the reference data distribution. By incorporating higher-order moments, the MDI can detect anomalies that arise not only from location shifts, but also from changes in variability, skewness, and other distributional characteristics. The aggregation mechanism allows our method to capture both sparse anomalies concentrated in a small number of features and weak, coordinated deviations distributed across many features. We empirically investigate the distribution and thresholding behavior of the MDI score across different sample sizes, dimensions, dependence structures, and data types. Simulation experiments and two real-data applications, to multi-omics and ESG data, evaluate finite-sample calibration, detection…
PDF
arXiv cs.MAOct 12
RelLedger: Relational Information Governance for LLM Agent Organizations
Junxi Huang, Wenshuo Chen, Nuoxuan Li, Kailong Wang, Meitong Shen +5
In LLM agent organizations, shared records determine which facts are available for later decisions. A sender consults interaction histories before deciding whether to report an event. A delivery gap across histories does not show whose relationship drove the choice or whether the resulting record matters downstream. We introduce RelLedger to audit these links. It holds the event, evidence, risk, and message fixed while crossing the sender's histories with the event target and an unrelated actor. Role reassignment and history rewrites locate the controlling cue. Message and cost interventions show when the effect appears. An attribution ledger maps each claim to its required response cells and separates missing interventions from sampling uncertainty. Recipient replay follows delivered information into downstream decisions. Executable workflows for a simulated one-person company extend the audit to retrieved histories, tool calls, and shared ledger updates. Across GPT, Gemini, Claude, DeepSeek, and Qwen, the audit reveals model-specific control paths and smaller relation gaps under explicit loss rules. Claude sends the same factual notice 62.22 percentage points more often with…
PDF
arXiv cs.AIOct 12
agent-risk: Risk Assessment for Changes to AI Agents
Yue Zhao, Zixiang Xu, Angela Huyue Zhang, S. Alex Yang, Xiyang Hu
Before changing a deployed AI agent (a stricter safety gate, a new model), organizations must approve the change, starting from existing logs. Extending classical risk analysis to partial records and partial changes to running systems, agent-risk replays logged episodes, assuming nothing else changes and the agent does not anticipate the change. The log settles episodes acting as before, a declared stop value settles stopped ones, and the rest need logged support, a saved-state rerun, or a bound. We prove what logs must record for exact replay and which saved states serve a gate family. For independent episodes, we bound the reruns a decision needs and tolerable drift from live behavior. In a bash sandbox, a 7,200-episode log alone decided neither of two retry gates, which let the agent act after refusals the log never shows. Rerunning only each gate's blocked episodes from saved states reached both live decisions at half the agent calls of a live test sized post hoc for them, given the log. Without per-step harm, a stopping gate's certified harm ceiling rose up to 2.5-fold, since the log hides whether harm preceded the stop. Approval thus needs evidence designed in advance: log…
PDF
arXiv cs.CVOct 12
DepthTile: Depth-Guided Existing-Image Self-Tiling with Input-Side Tileability Assessment
Rui Wang, Xi Chen, Hui Dai, Piaopiao Yu, Yixue Hao +2
Existing-image self-tiling aims to transform a given image into a seamlessly repeatable tile while preserving its original semantics and local details. This task requires weak editing to retain the source but leave periodic seams, whereas strong editing improves tileability at the large risk of content drift.Existing diffusion-based tiling pipelines alleviate boundary discontinuities, yet lack awareness of which regions are geometrically important to preserve. In this work, we propose DepthTile, a depth-guided self-tiling method whose generation module requires no retraining of the diffusion backbone. It converts monocular depth into a spatial preservation prior and integrates it into the timestep-dependent masking mechanism of Tiled Diffusion. DepthTile converts depth into a spatial editability map and fuses it with the differential diffusion mask. This strengthens source preservation in near-field regions indicated by the monocular depth prior while retaining editing flexibility near compatible background boundaries. To access when self-tiling is feasible, we introduce the Self-Tiling Ability Score (STAS), a lightweight input-side predictor based on RGB, gradient, depth, and…
PDF
arXiv cs.CVOct 12
FlowAvatar: Real-Time Full-Body Avatars from Sparse Egocentric Inputs on Consumer XR Devices
Chenfeng Gao, Taeyoung Yeon, Sungheon Park, Vasco Xu, Anish Prabhu +2
Prior avatar embodiment research has studied tracking completeness (how faithfully the body, hands, and face are sensed and reproduced) and personalized appearance in isolation, each requiring specialized lab equipment. How these factors interact on consumer hardware remains an open question, because no existing system unifies body pose, face, hands, and personalized appearance on a standalone headset. We present FlowAvatar, a system enabling real-time personalized look-alike avatars with full-body pose, hand articulation, facial expression, and eye gaze tracking from sparse egocentric inputs on consumer XR devices (Meta Quest Pro). Our pose model achieves competitive spatial accuracy and state-of-the-art temporal consistency on the AMASS benchmark against prior works with comprehensive spatial and temporal losses validated through architecture and loss ablations, while running in real-time. Two user studies (N=12, N=10) provide converging evidence that tracking completeness and personalized appearance serve complementary roles: tracking completeness broadly improves perceived motion quality, while only their combination achieves positive total embodiment.
PDF
arXiv cs.LGOct 12
A Survey of Flow Matching in Reinforcement Learning
Nabuat Zaman Nahim, Fairoz Nower Khan, Peizhong Ju
Flow Matching (FM) has recently emerged as a principled and efficient generative modeling framework for reinforcement learning (RL), enabling expressive, multimodal policy parameterizations via deterministic probability transport. Compared to diffusion-based policies that rely on stochastic denoising chains, FM uses sampling based on ordinary differential equations (ODEs), with learned velocity fields, which can substantially reduce inference latency and simplify the incorporation of RL objectives. As research in flow-based RL rapidly accelerates across offline continuous control, online fine-tuning, and foundation model alignment, the literature has become highly fragmented. In this survey, we provide a comprehensive taxonomy of flow-matching approaches in reinforcement learning. We organize the literature along two axes: the target distribution being modeled (e.g., action policies, value critics, transition dynamics) and the mechanism of RL signal integration (e.g., energy-weighted regression, flow-based policy gradients, and group relative policy optimization). Furthermore, we survey emerging frontiers such as discrete and non-Euclidean action spaces, provide a systematic…
PDF
arXiv cs.CLOct 12
Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory
Burin Naowarat, Hao Tang, Sharon Goldwater
Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional "temporal subspace." Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to…
PDF
arXiv cs.CVOct 12
Graph3R: Unifying View Graph Initialization with Feed-Forward Reconstruction
Jingwen Yu, Hengli Wang, Jianhao Jiao, Zhonghang Liu, Ping Tan +1
Feed-forward reconstruction recovers camera poses and dense geometry from image sets whose views are assumed to come from a single scene. In practice, uncurated image collections often contain views from disjoint scenes, and reconstructing these views jointly can corrupt camera poses and geometry. Existing pipelines typically resolve view associations in separate stages before final reconstruction, leaving view graph initialization and reconstruction inference only loosely coupled. We introduce Graph3R, which unifies view graph initialization with feed-forward reconstruction through a shared geometric representation. A lightweight verification head predicts pairwise covisibility from the multi-view features of $π^3$ to construct a view graph. This graph classifies the input views into scene groups. For each group, we mask the shared features before decoding camera poses and dense geometry. Reusing the multi-view features allows Graph3R to reconstruct disjoint scenes separately with a single backbone pass. Across three benchmarks, Graph3R improves average maximum recall at 100% precision by upto 8.99 percentage points over the baseline, while improving reconstruction quality on…
PDF
arXiv astro-ph.IMOct 12
Deep learning methods for gamma event selection in TAIGA-IACT image analysis in stereo-mode
E. O. Gres, A. P. Kryukov, P. A. Volchigov, A. P. Demichev, J. J. Dubenskaya +4
In astrophysical complex TAIGA there are four Imaging Atmospheric Cherenkov telescopes (IACTs), located at a distance of 300-500 m from each other, due to which extensive air showers (EAS) generated by cosmic and gamma radiation are recorded by a single telescope or by multiple telescopes simultaneously (stereo-mode). The analysis of EAS images from two or more Cherenkov telescopes together is of particular interest, since for this approach the reconstruction of physical parameters of the primary gamma ray is much more accurate than in mono-observations. However, the gamma-ray event reconstruction strongly depends on the quality of the hadron background suppression of the classifier, therefore, the gamma event selection stage is one of the important ones in the further analysis of IACT data. We propose and study several neural network methods for gamma event selection in joint TAIGA-IACT image analysis. Neural network methods we suggested involves a single-stage analysis of IACT images from two telescopes, while the second method considers the formation of autoencoder-derived essential features that contain the EAS physical parameters, including the type of primary particle.
PDF