跳到正文
研踪PaperTrail

版本更新

查看已发布论文的最新修订,在详情页对照实际观测到的版本。

部分采集异常

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+98新增 AI 导读

arXiv 最近完成扫描:2026-11-15 23:30 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 00:20 — 2026-11-16 00:20(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 23:30最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

论文修订列表

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 6,729 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 23:27(北京时间)
版本更新 · v2arXiv:2606.24969

Frequency Domain Reservoir Computing

Klaus Schertler, Xiomara Runge, Andrea Ceni, David Kappel, Claudio Gallicchio

原文摘要

While the quadratic sequence-length bottleneck of transformers has fueled a resurgence in recurrent models, effectively capturing complex dynamics requires architectures that balance efficient training with highly expressive latent states. Echo State Networks (ESNs) offer a compelling approach by utilizing fixed recurrent weights to circumvent backpropagation through time, enabling a closed-form training solution. However, achieving the expressivity needed for complex tasks demands large reservoirs, exposing an $\mathcal{O}(N^2)$ state-update bottleneck that prevents ESNs from matching the scale of contemporary recurrent models. To address this limitation, we introduce Frequency Domain Reservoir Computing (FRESCO), an ESN architecture operating entirely in the frequency domain while avoiding domain-shift overheads to achieve $\mathcal{O}(N)$ complexity for dense, non-linear updates via structured circulant recurrence. By employing a novel dimensional zero-padding input embedding, a packed frequency-domain readout, and a natively applied frequency-domain non-linearity, FRESCO drastically reduces computational costs and energy consumption of training and inference. Furthermore, FRESCO achieves competitive predictive performance on memory benchmarks, sequential classification, and multivariate long-horizon forecasting, offering a scalable and energy-efficient path forward for dense recurrent architectures.

cs.LG

版本更新 · v2arXiv:2609.27932

Binary Quantized Neural Network Training Is W[1]-Hard Parameterized by Input and Output Dimensions

Tao Jiang, Minbo Gao, Shaowei Cai

原文摘要

When the weights and biases of a neural network range over a fixed finite alphabet, training the network to fit a data set exactly becomes a finite combinatorial problem, and parameterized complexity asks which structural quantities of an instance make this problem tractable. Ganian, Sommer, and Sorge (ICLR 2026) showed that training quantized networks is fixed-parameter tractable when parameterized jointly by the input dimension $α$, the output dimension $ω$, and the treewidth of the architecture, and they asked whether $α+ω$ alone suffices. We show that it does not: training binary quantized networks is W[1]-hard parameterized by $α+ω$, so it admits no algorithm with running time $f(α+ω)\cdot|I|^{O(1)}$ for any computable $f$ unless FPT = W[1]. Hardness holds already for exact fitting of $k+1$ examples whose inputs equal their targets and form a coordinatewise prefix chain, and also when all biases are fixed to zero. The proof rests on a one-flip routing equivalence. On such data, nonnegative binary weights force every neuron to switch on at most once, and a network fits the data exactly if and only if the architecture contains vertex-disjoint paths that link each changing input to the corresponding output. Every neuron therefore has one of only $k+1$ activation profiles, yet deciding whether these profiles can be realized simultaneously is as hard as disjoint-path routing. Small input and output dimensions thus limit what each neuron can do locally, but not how the architecture forces neurons to share resources globally.

cs.LG

版本更新 · v2arXiv:2611.10595

Design and Evaluation of Secure Distributed Chaotic Image Encryption on ESP32-S3

Mohammed Almozaini, Fazal Noor, Sohail Alhazmi

原文摘要

The limited computational resources of Internet of Things (IoT) devices present challenges for secure image processing. This paper presents a distributed chaotic image encryption system using independent Wi-Fi-connected ESP32-S3 microcontrollers. A master-worker architecture distributes image blocks through master-coordinated chaotic sequence management, maintaining one logically continuous chaotic sequence by assigning block-specific starting states independently of worker assignments. The implemented system uses reversible chaotic substitution (SUBSTITUTE), while Elliptic Curve Digital Signature Algorithm (ECDSA)-signed discovery messages and Transport Layer Security (TLS) 1.3 with mutual authentication secure device communication. Experimental evaluation using one, two, and four workers demonstrates a reduction in execution time from 43.215 to 15.878 seconds, achieving a speed-up of 2.72 times. The encrypted image achieves a Shannon entropy of 7.999940 bits/byte and near-zero adjacent-pixel correlation. Exact image recovery is verified through matching Secure Hash Algorithm 256-bit (SHA-256) hashes and a Structural Similarity Index (SSIM) value of 1.0. Additional experiments demonstrate successful encryption and decryption using different worker counts and block sizes, automatic task reassignment following worker failure, and rejection of a mismatched private key during TLS authentication. These findings demonstrate the feasibility of secure, flexible, and distributed chaotic image processing across independent resource-constrained IoT devices.

cs.CR

版本更新 · v2arXiv:2607.09767

Listen to the Features: Voice Anonymization Driven by Content Embedding Matching over Signal Reconstruction

Adrien Schneider, Kacper Zabkowski, Anderson Augusma, Fr{é}d{é}rique Letu{é}, Maria Camila Pinzon, Dominique Vaufreydaz

原文摘要

The paper presents a voice anonymization model focusing on preserving content rather than producing realistic speech. It relies on content embeddings extracted from a frozen pretrained wav2vec2 encoder. These embeddings are decoded into an anonymized signal using vector quantization and a HiFi-GAN vocoder, both trained on LibriTTS without any waveform reconstruction loss or speaker embedding mapping. The training objective enforces that embeddings of the anonymized signal match those of the original one. While training, an auxiliary speaker classification branch with a gradient reversal layer is used to discard speakerspecific information. Results show that this straightforward embedding-based approach achieves very low WER (2.53) with an anonymization performance (EER 13.39) ranking within first level for VPC. Notably, emotions are partially preserved (UAR 43.91), even without a supporting training objective, while the anonymized voice is audible without reconstruction loss.

eess.SP · cs.AI

版本更新 · v2arXiv:2605.06466

Diversity Curves for Graph Representation Learning

Katharina Limbeck, Nadja Häusermann, Martin Carrasco, Guy Wolf, Bastian Rieck

原文摘要

Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging. Unsupervised tasks in particular require interpretable, scalable, and reliable size-aware graph representations. Our work addresses these issues by tracking the structural diversity of a graph across coarsening levels. The resulting graph embeddings, which we denote diversity curves, are interpretable by construction, efficient, and directly comparable across coarsening hierarchies. Specifically, we track the spread of graphs, a novel isometry invariant that is inherently well-suited for encoding the metric diversity and geometry of graphs. We utilise edge contraction coarsening and prove that this improves expressivity, thus leading to more powerful graph-level representations than structural descriptors alone. Demonstrating their utility over a range of baseline methods in practice, we use diversity curves to (i) cluster and visualise simulated graphs across varying sizes, (ii) distinguish the geometry of single-cell graphs, (iii) compare the structure of molecular graph datasets, and (iv) characterise geometric shapes.

cs.LG

版本更新 · v2arXiv:2611.07342

Selective Retrieval Routing for Multi-Violation Knowledge Graph Repair

Tung-Wei Lin, Gabe Fierro, Han Li, Tianzhen Hong, Pierluigi Nuzzo, Alberto Sangiovanni-Vincentelli

原文摘要

Knowledge graphs often contain missing or inconsistent facts that undermine the applications built on them. Schema validation detects such violations but does not identify which of several valid repairs recovers the intended graph. External corpora can supply the evidence needed to identify the intended repair, but retrieving from them is costly and not always successful. We propose a framework for selective retrieval in iterative graph repair. An LLM repair agent explores and edits the graph, while a router controls its access to a researcher agent that retrieves external evidence. We extend a violation-injection framework to generate cases with multiple compatible violations and known reference repairs. The agent's repair outcomes on these cases provide supervision for training the deployment-specific router. On two building-automation datasets, researcher access improves repairs for some violations and degrades them for others, with effects differing across deployments. The router uses fewer repair-time tokens than always enabling access in all six evaluation suites. It achieves higher repair $F_1$ than always disabling access in five of six suites.

cs.DB · cs.AI

版本更新 · v3arXiv:2504.01551

Identifying Macro Causal Effects in a C-DMG over ADMGs

Simon Ferreira, Charles K. Assaad

原文摘要

Causal effect identification using causal graphs is a fundamental challenge in causal inference. While extensive research has been conducted in this area, most existing methods assume the availability of fully specified directed acyclic graphs or acyclic directed mixed graphs. However, in complex domains such as medicine and epidemiology, complete causal knowledge is often unavailable, and only partial information about the system is accessible. This paper focuses on causal effect identification within partially specified causal graphs, with particular emphasis on cluster-directed mixed graphs (C-DMGs) which can represent many different acyclic directed mixed graphs (ADMGs). These graphs provide a higher-level representation of causal relationships by grouping variables into clusters, offering a more practical approach for handling complex systems. Unlike fully specified ADMGs, C-DMGs can contain cycles, which complicate their analysis and interpretation. Furthermore, their cluster-based nature introduces new challenges, as it gives rise to two distinct types of causal effects: macro causal effects and micro causal effects, each with different properties. In this work, we focus on macro causal effects, which describe the effects of entire clusters on other clusters. We establish that the do-calculus is both sound and complete for identifying these effects in C-DMGs over ADMGs when the cluster sizes are either unknown or of size greater than one. Additionally, we provide a graphical characterization of non-identifiability for macro causal effects in these graphs.

cs.AI

版本更新 · v2arXiv:2605.14786

Known By Their Actions: Fingerprinting LLM Browser Agents via UI Traces

William Lugoloobi, Samuele Marro, Jabez Magomere, Joss Wright, Chris Russell

原文摘要

As LLM-based agents increasingly browse the web on users' behalf, a natural question arises: can websites passively identify which underlying model powers an agent? Doing so would represent a significant security risk, enabling targeted attacks tailored to known model vulnerabilities. Across 14 frontier LLMs and four web environments spanning information retrieval and shopping tasks, we show that an agent's actions and interaction timings, captured via a passive JavaScript tracker, are sufficient to identify the underlying model with up to 96\% F1 within a fixed harness. Although fingerprints are harness-specific, with cross-harness transfer falling to near chance, pooling traces across harnesses recovers model identification at 0.74 to 0.81 Macro-F1. We further show that strong classifiers can be trained from roughly one third of the available traces, and that identification improves steadily as more events are observed. Injecting randomised timing delays between actions substantially degrades classifier performance, but does not provide robust protection: a classifier retrained on delayed traces largely recovers performance. We release our code and a labelled corpus of agent traces at https://github.com/KabakaWilliam/known_actions.

cs.CR · cs.AI · cs.HC · cs.LG

版本更新 · v2arXiv:2602.03623

Self-supervised Physics-Informed Manipulation of Deformable Linear Objects with Non-negligible Dynamics

Youyuan Long, Gokhan Solak, Sara Zeynalpour, Heng Zhang, Arash Ajoudani

原文摘要

We address dynamic manipulation of deformable linear objects by presenting SPiD, a physics-informed self-supervised learning framework that couples an accurate deformable object model with an augmented self-supervised training strategy. On the modeling side, we extend a mass-spring model to more accurately capture object dynamics while remaining lightweight enough for high-throughput rollouts during self-supervised learning. On the learning side, we train a neural controller using a task-oriented cost, enabling end-to-end optimization through interaction with the differentiable object model. In addition, we propose a self-supervised DAgger variant that detects distribution shift during deployment and performs offline self-correction to further enhance robustness without expert supervision. We evaluate our method primarily on the rope stabilization task, where a robot must bring a swinging rope to rest as quickly and smoothly as possible. Extensive experiments in both simulation and the real world demonstrate that the proposed controller achieves fast and smooth rope stabilization, generalizing across unseen initial states, rope lengths, masses, non-uniform mass distributions, and external disturbances. Additionally, we develop an affordable markerless rope perception method and demonstrate that our controller maintains performance with noisy and low-frequency state updates. Furthermore, we demonstrate the generality of the framework by extending it to the rope trajectory tracking task. Overall, SPiD offers a data-efficient, robust, and physically grounded framework for dynamic manipulation of deformable linear objects, featuring strong sim-to-real generalization.

cs.RO

版本更新 · v2arXiv:2610.19013

Data Density Scaling Laws for Image Self-Distillation

Alvard Barseghyan, Ani Vanyan, Hakob Tamazyan, Hrant Khachatrian

原文摘要

Current scaling law formulations suggest that increasing the number of unique samples in a dataset consistently improves model performance, while repeated exposure to the same samples provides diminishing value. In this work, we challenge this assumption for image self-distillation models. We train iBOT models on random subsets of seven datasets spanning satellite imagery, driving scenes, egocentric video, and natural images, and evaluate their frozen representations on downstream tasks. We propose a density-interaction scaling law that combines unique-image count $U$ and repetition $R$, fitting it on runs with at most 50 million image presentations and testing it at larger budgets $C$. On Maxar dataset, a random subset containing approximately 1.5% of the training pool improves average nearest-neighbor classification accuracy by 3.11 percentage points over training on the full pool at the same budget of 200 million image presentations. Smaller subsets also outperform the full pool on SATLAS and Ego4D, whereas ImageNet favors larger pools at higher budgets. At a fixed subset size, further training can improve performance, lead to a plateau, or reduce performance. Our law captures smaller-subset advantages that the compared baselines cannot represent and improves prediction at higher budgets on Maxar, SATLAS, and Ego4D under nearest-neighbor evaluation. These findings show that both the number of unique images and how often they are repeated matter when allocating a training budget.

cs.LG

版本更新 · v3arXiv:2505.04005

Iterative Orthogonalization Scaling Laws

Devan Selvaraj

原文摘要

The muon optimizer has picked up much attention as of late as a possible replacement to the seemingly omnipresent Adam optimizer. Recently, care has been taken to document the scaling laws of hyper-parameters under muon such as weight decay and learning rate. However, at much larger scales the iterative orthogonalization procedure present in muon may suffer a possible issue as the singular values of random matrices shrink with scale. This paper shows this scaling behavior theoretically and empirically on random matrices but does not suggest what to do about it.

cs.LG

版本更新 · v2arXiv:2611.08982

Stabilizing Vector Approximate Message Passing with Circuit-Designed Lag-Lead Damping

Mohamed Akrout

原文摘要

Vector approximate message passing (VAMP) often fails to converge on ill-conditioned matrices, and its damping factor is tuned either manually or adaptively. Using the fact that VAMP iterations are the discretization of an electric circuit, we show that the denoiser and the likelihood act as nonlinear resistors, the Onsager correction is a mirror resistor and damping is a lag filter. This circuit gives a closed-form loop gain whose spectrum can predict when VAMP fails. Because a lag filter cannot isolate the oscillating modes, we add a lead capacitor whose design often results in a negative capacitance. Across a wide range of condition numbers, our proposed damping strategy achieves a higher convergence rate than adaptive damping and Anderson acceleration at a lower mean iteration cost. On ill-conditioned multipath channels, across ranks and sparsity levels, it also converges more reliably than existing damping baselines.

cs.IT

版本更新 · v3arXiv:2610.18039

Prune-and-Merge: Training-Free Scaling of Vision Transformers

Vatsal, Soumil Malhotra, Priyanshu Chahal, Sanjeev Kumar

原文摘要

Vision Transformers achieve strong performance but incur high computational costs from quadratic token interactions. Training-free token reduction methods improve efficiency, but their robustness remains underexplored. We propose Prune-and Merge ViT, a training-free framework for off-the-shelf models. It combines class attention-based pruning with similarity-based merging to reduce redundancy while preserving semantic information. To evaluate robustness we introduce two metrics. Relative Accuracy Drop (RAD) measures relative accuracy degradation under transformations, and Prediction Flip Rate (PFR) quantifies prediction consistency. On pretrained ViT and DeiT, Prune-and-Merge reduces computation competitively while maintaining robustness and better accuracy than existing token reduction methods. Our analysis suggests that hybrid token reduction does not introduce hallucination-like behavior and preserves prediction stability for common image transformations.

cs.CV · cs.AI

版本更新 · v2arXiv:2607.09553

Writing Bug Reports for Software Repair Agents: What Information Matters Most?

Vincenzo Luigi Bruno, Alessandro Giagnorio, Daniele Bifolco, Leon Wienges, Massimiliano Di Penta, Gabriele Bavota

原文摘要

Software development is increasingly moving toward agentic-first workflows. This includes AI agents responsible for generating initial fixes for submitted issue reports. In this setting, issue reports are no longer merely documentation for human maintainers; they become the primary task specification for the agent. However, little is known about how such reports should be written to maximize the agent's chances of producing a correct fix. We study what makes a bug report agent-ready. Starting from the SWE-Bench Verified benchmark (i.e. a collection of 500 real repository issues with human-written gold patches and test suites for evaluating generated fixes) we manually classify each issue by change type (e.g. bug fix vs refactoring) and annotate each sentence with its information type, such as observed behavior, expected behavior, reproduction steps, localization cues, and suggested fixes. We focus on the 441 issues representing bug reports, and we run on them mini-swe-agent using three LLM backbones (i.e. GPT-5-mini, MiniMax M2.5, and Gemini 3 Flash). We then fit a binomial regression model to estimate the incremental association between each information type and agent success, controlling for confounding factors. Our results suggest that agentic-first reports benefit most from information that narrows the agent's search and repair space. Suggested fixes, expressed either in code or natural language, show the strongest positive associations with pass probability, while localization cues show positive but non-significant associations. An ablation study removing selected information types confirms that agents benefit less from information traditionally useful to humans, such as reproduction steps, and more from sentences that expose a repair direction.

cs.SE

版本更新 · v2arXiv:2502.18733

Cross-Modality Investigation on WESAD Stress Classification

Eric Oliver, Sagnik Dakshit

原文摘要

Deep learning's growing prevalence has driven its widespread use in healthcare, where AI and sensor advancements enhance diagnosis, treatment, and monitoring. In mobile health, AI-powered tools enable early diagnosis and continuous monitoring of conditions like stress. Wearable technologies and multimodal physiological data have made stress detection increasingly viable, but model efficacy depends on data quality, quantity, and modality. This study develops transformer models for stress detection using the WESAD dataset, training on electrocardiograms (ECG), electrodermal activity (EDA), electromyography (EMG), respiration rate (RESP), temperature (TEMP), and 3-axis accelerometer (ACC) signals. The results demonstrate the effectiveness of single-modality transformers in analyzing physiological signals, achieving state-of-the-art performance with accuracy, precision and recall values in the range of $99.73\%$ to $99.95\%$ for stress detection. Furthermore, this study explores cross-modal performance and also explains the same using 2D visualization of the learned embedding space and quantitative analysis based on data variance. Despite the large body of work on stress detection and monitoring, the robustness and generalization of these models across different modalities has not been explored. This research represents one of the initial efforts to interpret embedding spaces for stress detection, providing valuable information on cross-modal performance.

cs.LG · cs.AI

版本更新 · v3arXiv:2605.06749

A Statistical Framework for Algorithmic Collective Action with Multiple Collectives

Claudio Battiloro, Pietro Greiner, Dario Rancati, Bret Nestor, Oumaima Amezgar, Francesca Dominici

原文摘要

As learning systems increasingly shape everyday decisions, Algorithmic Collective Action (ACA), i.e., users coordinating changes to shared data to steer model behavior, offers a complement to regulator-side policy and corporate model design. Real-world collective actions have traditionally been decentralized and fragmented into multiple collectives, despite sharing overarching objectives, with each collective differing in size, strategy, and actionable goals. However, most of the ACA literature focuses on single collective settings. To address this, we propose the first comprehensive statistical framework for ACA with multiple collectives acting on the same system. In particular, we focus on collective action in classification, studying how multiple collectives can influence a classifier's behavior. We provide quantitative statistical bounds on the success of the collectives, considering the role and the interplay of the collectives' sizes and the alignment of their goals. We make such bounds computable by each collective with only partial knowledge of other collectives' sizes and strategies. Finally, we numerically illustrate our framework on simulations inspired by interventions for climate adaptation in smart cities, demonstrating the usefulness of our bounds.

stat.ME · cs.AI

版本更新 · v2arXiv:2609.24609

GraphToolbox: A Configurable Framework for Controlled Benchmarking of Graph Neural Network Forecasting

Eloi Campagne, Yvenn Amara-Ouali, Yannig Goude, Argyris Kalogeratos

原文摘要

Electricity forecasting often involves spatially related signals observed over regions, substations, and feeders, and Graph Neural Networks (GNNs) represent these relations through a graph. Building a complete GNN forecasting experiment is nonetheless laborious, because graph construction, model selection, training, aggregation, and interpretation often require separate tools. We present GraphToolbox, an open-source Python framework that unifies these stages in one configuration-driven pipeline built on PyTorch Geometric. It offers data-driven graph construction, a single interface for most graph convolution operators of PyTorch Geometric and for recurrent graph cells, online expert aggregation, forecasting interpretability, and significance testing on forecasts. We use GraphToolbox to run a controlled benchmark: we compare architectural and modeling choices for French electricity load and net-load forecasting at regional and national levels under a common experimental protocol. On load, most evaluated graph convolutions outperform additive, recurrent, and foundation-model baselines. Pooled XGBoost, trained on the same inputs, has a lower RMSE than the best graph models, although the difference is not significant. Online expert aggregation and daily model updates improve accuracy further. On net-load, graph models outperform additive, recurrent, and XGBoost baselines, with further gains from forecasting the physical components separately. Statistical tests do not identify a single best convolution for load forecasting.

cs.LG · cs.AI

版本更新 · v9arXiv:2503.20550

Structural Origins of Cubic Complexity in Pebble Motion

Tomoki Nakamigawa, Tadashi Sakuma

原文摘要

The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. Kornhauser, Miller, and Spirakis proved that the worst-case shortest solution length on an $N$-vertex graph is $Θ(N^3)$, but the graph structures responsible for this cubic behavior remained unclear. We first show that cubic complexity cannot occur on trees: every feasible instance on an $N$-vertex tree admits a solution sequence of length $\mathrm{O}(N^2\log N)$, constructible in time linear in its length. This is the first $\mathrm{o}(N^3)$ upper bound for PMP on trees. We then extend the method to general graphs. When $2\le N-n=\mathrm{O}(1)$, every instance on a feasible puzzle admits a solution of length $\mathrm{O}(n\,\mathrm{CL}(G)\,\mathrm{D}(G))$, where $\mathrm{D}(G)$ is the diameter and $\mathrm{CL}(G)$ is the maximum length of a shortest cycle through a vertex; this recovers the classical $\mathrm{O}(N^{3/2})$ bound for square grids. We further show that any graph with worst-case shortest solution length $Θ(N^3)$ has a unique biconnected component $X$ of order $Θ(N)$, while all structures attached through any one cut vertex of $X$ have bounded total size. Moreover, $X$ contains no cycle of unbounded sublinear order, and any two intersecting cycles of order $Θ(N)$ share at least as many vertices as there are blanks. Finally, cubic complexity occurs when a cycle of order $Θ(N)$ contains all but $\mathrm{O}(1)$ vertices, whereas two $Θ(N)$-cycles meeting at one vertex have complexity exactly $Θ(N^2\log N)$. We conjecture that the former construction essentially characterizes the cubic regime.

math.CO · cs.CC · cs.DM

版本更新 · v5arXiv:2602.23872

Altitude-Adaptive UAV-to-Map Image Matching for Aerial Geo-Localization

Xingyu Shao, Mengfan He, Liangzheng Sun, Chunyu Li, Ziyang Meng

原文摘要

Matching downward-looking unmanned aerial vehicle (UAV) images to georeferenced satellite or aerial map tiles supports map-based geo-localization when direct positioning signals are degraded or unavailable. Variations in UAV altitude change the observed ground footprint and create a scale mismatch between query images and fixed-scale map references. We address this problem with an altitude-adaptive aerial geo-localization framework. The framework estimates relative altitude from a single image using a frequency-domain representation and regression-as-classification. The predicted altitude-class center defines a scale prior that guides query normalization toward the canonical map scale before full-gallery visual place recognition. A footprint-adaptive margin classifier (FAMC) adjusts training margins according to footprint overlap. Experiments on two synthetic and two real-flight datasets show that, at the 100 m localization threshold, altitude adaptation improves average R@1 and R@5 by 50.68 and 47.20 percentage points, respectively, for our visual place recognition module compared with the same retrieval pipeline without altitude normalization. These results show that a relative-altitude-derived scale prior improves cross-altitude UAV-to-map image matching in the evaluated regions and camera settings.

cs.CV · cs.RO

版本更新 · v2arXiv:2605.05996

Gaussian mixture models in Hilbert spaces via kernel methods

Daniel López-Montero, Antonio Álvarez-López, Marcos Matabuena

原文摘要

Modern datasets across many disciplines increasingly consist of time-evolving, potentially infinite-dimensional random objects, such as dynamic functional data, which are naturally modeled in Hilbert spaces. In these settings, characterizing probability measures, for example, through densities, can be ill-defined or technically challenging. Motivated by clustering applications, we propose a Gaussian mixture framework for Hilbert-space-valued data based on kernel mean embeddings and develop efficient optimization algorithms for estimation. We establish theoretical guarantees showing that the proposed algorithm is well-defined and that the model yields a dense class of approximations in infinite-dimensional spaces. We evaluate the framework through extensive experiments on diverse data geometries, including $L^2$-functional data and graph signals arising in modern medical applications.

stat.ML · cs.LG

版本更新 · v3arXiv:2509.09353

Low-degree lower bounds via almost orthonormal bases

Alexandra Carpentier, Simone Maria Giancola, Christophe Giraud, Nicolas Verzelen

原文摘要

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical--computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems---where the goal is to test a planted distribution $\mathbb{P}'$ against a null distribution $\mathbb{P}$ with independent components---the standard approach is to bound the advantage using an $\mathbb{L}^2(\mathbb{P})$-orthonormal family of polynomials. However, this method breaks down for estimation tasks or more complex testing problems where $\mathbb{P}$ has some planted structures, so that no simple $\mathbb{L}^2(\mathbb{P})$-orthogonal polynomial family is available. To address this challenge, several technical workarounds have been proposed [SW22,SW25], though their implementation can be delicate. In this work, we propose a more direct proof strategy. Focusing on random graph models, we construct a basis of polynomials that is almost orthonormal under $\mathbb{P}$, in precisely those regimes where statistical--computational gaps arise. This almost orthonormal basis not only yields a direct route to establishing low-degree lower bounds, but also allows us to explicitly identify the polynomials that optimize the low-degree criterion. This, in turn, provides insights into the design of optimal polynomial-time algorithms. We illustrate the effectiveness of our approach by recovering known low-degree lower bounds, and establishing new ones for problems such as hidden subcliques, stochastic block models, and seriation models.

stat.ML · cs.LG

版本更新 · v4arXiv:2509.13423

Computational complexity of Berry phase estimation in topological phases of matter

Ryu Hayakawa, Kazuki Sakamoto, Chusei Kiumi

原文摘要

The Berry phase is a fundamental quantity in the classification of topological phases of matter. In this paper, we present a new quantum algorithm and several complexity-theoretical results for the Berry phase estimation (BPE) problems. Our new quantum algorithm achieves BPE in a more general setting than previously known quantum algorithms, with a theoretical guarantee. For the complexity-theoretic results, we consider two main cases. First, we prove $\mathsf{BQP}$-completeness when we are given a guiding state that has a large overlap with the ground state. This result establishes an exponential quantum speedup for estimating the Berry phase. Second, we prove $\mathsf{UQMA} \cap \mathsf{co}$-$\mathsf{UQMA}$-completeness when we have an $\textit{a priori}$ bound for the ground-state energy. Here, $\mathsf{UQMA}$ is the unique witness version of $\mathsf{QMA}$, and $\mathsf{UQMA} \cap \mathsf{co}$-$\mathsf{UQMA}$ precisely captures the complexity of BPE without the known guiding state. Remarkably, this problem is, to our knowledge, the first natural problem complete for $\mathsf{UQMA} \cap \mathsf{co}$-$\mathsf{UQMA}$. These results advance the role of quantum computing in the study of topological phases of matter and provide a pathway for clarifying the connection between topological phases of matter and computational complexity.

quant-ph · cond-mat.str-el · cs.CC

版本更新 · v2arXiv:2606.05156

Temporal Cliques Admit Linear Spanners

Julia Baligacs

原文摘要

A temporal graph is a graph in which every edge carries a non-empty set of time labels, and it is temporally connected if for every two vertices $u$ and $v$, there exists a $u$-$v$-path with non-decreasing time labels. A spanner is a subset of its edges preserving temporal connectivity. Unlike static graphs, temporally connected graphs need not admit sparse spanners; nonetheless, minimizing spanner size is a central and widely studied problem. A particularly intriguing question is whether temporal cliques admit spanners of linear size. Despite considerable effort over the past years, the best known upper bound remained $O(n \log n)$. We finally resolve this question, proving that every temporal clique on $n$ vertices admits a spanner of size $7n$. Moreover, such a spanner can be computed in polynomial time.

cs.DM · math.CO

版本更新 · v2arXiv:2610.35870

Packet Interval Modulation for Uncoordinated NFC Data Networking Around Meander E-Textiles

Shigemi Ishida, Satoshi Ido, Ryo Takahashi

原文摘要

Smart home sensing with low-power wireless nodes is non-intrusive but requires battery maintenance and cannot identify residents. A garment with a meander-coil NFC reader solves both, as it powers battery-free tags on the skin and on nearby objects and attributes every reading to its wearer. Because the number of tags in range changes as the user moves, we propose packet interval modulation (PIM), which encodes sensor values into pulse intervals without reader commands. With five tags, PIM reduces the collision rate of slotted ALOHA from 22.7% to 4.1% while delivering 384 bps, enabling resident-attributed ambient sensing.

cs.NI

版本更新 · v2arXiv:2610.37105

Text Generation in Low-Resource Languages Using Human-Curated Vocabularies

Michael Christlambert Sinanta, Muhammad Dehan Al Kautsar, Amanda Nurul Izzah, Thanh-Nhi Nguyen, Phan Phuong Mai Chau, Zheng Wei Lim, Fajri Koto

原文摘要

Synthetic text generation offers a promising approach to alleviating data scarcity in low-resource languages. However, its effectiveness is inherently limited for languages that are scarcely represented, or entirely absent, in an LLM's pretraining data. At the same time, many such languages have human-curated vocabularies that provide rich lexical and semantic information, often accompanied by grammatical information such as part-of-speech labels. In this work, we ask whether LLMs can leverage these resources to generate coherent text in extremely low-resource and unseen languages. We introduce a framework that combines human-curated vocabularies with a small number of human-written exemplars that provide syntactic signals, while sampling candidate words according to a Zipfian distribution. Across languages with varying levels of resource availability, we evaluate the generated text using lexical diversity, off-target ratio, and human judgments of fluency. Our results show that reasoning-enabled LLMs can generate fluent text even in extremely low-resource languages, with particularly strong results at the sentence level and promising performance at the paragraph level. Our findings highlight a practical pathway for bootstrapping synthetic data in low-resource languages, expanding the amount of usable text even when existing digital resources are extremely limited. Our source code is available at https://github.com/michaelsinanta/vocab2text.

cs.CL

版本更新 · v2arXiv:2608.23034

ST$^2$U: Stateful Test-Time Unlearning via Restricted Knowledge Boundary Control

Xunlei Chen, Qinghui Gong, Ruini Xue, Yaodong Hu, Tian Lan, Wenhong Tian

原文摘要

Controlling restricted knowledge in large language models is essential for model alignment and safe deployment. Test-time unlearning avoids costly retraining and parameter updates by intervening only during inference. However, existing activation-editing methods apply isolated pointwise corrections, overlooking how autoregressive generation continually reconstructs hidden states from the prompt, cache, and generated prefix. Consequently, later states may return to restricted knowledge regions after a locally successful correction, causing restricted knowledge re-entry. In this work, we propose Stateful Test-Time Unlearning via restricted knowledge boundary control (ST$^2$U), which formulates test-time unlearning as trajectory-wide boundary control. ST$^2$U first models restricted knowledge boundaries in low-dimensional invertible coordinates while leaving orthogonal non-target components unchanged. During inference, ST$^2$U monitors risk along the trajectory, applies minimal boundary corrections with contextual anchoring, and propagates historical correction states across tokens to mitigate knowledge re-entry. This trajectory-wide control enables more persistent forgetting while preserving non-target capabilities and limiting inference overhead. Across three benchmarks and three model families, ST$^2$U delivers the strongest overall balance, combining best or second-best retention with competitive forgetting and substantially less restricted knowledge re-entry than test-time baselines (13.76--19.84% versus 30.44--59.10%).

cs.LG · cs.CL

版本更新 · v2arXiv:2605.19557

Density-Ratio Losses for Post-Hoc Learning to Defer

Alexander Soen, Ragnar Thobaben, Joakim Jaldén, Richard Nock

原文摘要

We study post-hoc Learning to Defer (L2D) through the lens of ideal distributions: divergence-regularized reweightings of the data distribution under which a model attains low task loss. We define deferral via the density-ratio between a model's and an expert's ideals. Using the reduction from density-ratio estimation to class-probability estimation, we derive the DR CPE losses for post-hoc L2D scorers. Deferral decisions are then made by thresholding the scorer. For KL-based ideal distributions, our deferral rule recovers Chow's rule under the original distribution and a connection to an expert-tilted Bayes posterior---which incorporates the expert's performance---depending on if the ideal distributions are marginal or joint distributions. This leads to two variants of the DR CPE losses, with the joint variant being computationally convenient in practice. We establish consistency properties of the joint DR CPE losses when considering the zero-one task loss and strongly proper composite CPE losses. Experimentally, our approach is competitive compared to common baselines and is more robust across dataset settings. More broadly, our results cast post-hoc L2D as density-ratio estimation between ideal distributions, bridging Chow-style rules, expert comparison, and elucidating connections to related learning settings including anomaly detection.

stat.ML · cs.LG

版本更新 · v2arXiv:2608.04971

Exploring Cross-Reality Transitions between Projections and Head-Mounted Displays for Immersive Digital Art

Xiangpeng Fu, Mads Haahr

原文摘要

Immersive exhibitions increasingly combine large-scale projections with mixed reality (MR) head-mounted displays (HMDs), but how users perceive transitions across these heterogeneous visualization environments remains underexplored. We investigate cross-reality (CR) object- and scene-level transitions in a hybrid immersive art installation spanning projection, augmented reality (AR), and virtual reality (VR). In a within-subjects study (N=24), we compared a calibrated condition with a bundled inconsistency condition introducing noticeable differences in spatial alignment, visual appearance, and cross-device latency. This contrast was used not to establish perceptual thresholds or hardware targets, but as a diagnostic probe to make transition disruptions more perceptible and discussable. The inconsistency condition reduced presence and increased workload. Interviews showed that spatial misalignment disrupted action-outcome predictability, appearance mismatch reduced aesthetic coherence, and latency weakened perceived responsiveness. Effects also varied by asset type: rigid static assets exposed inconsistencies more clearly, animated skeletal assets shifted attention toward motion, and particle effects often masked small discrepancies. These findings clarify how users perceive projection-MR transitions and support asset-aware design strategies for coherent hybrid immersive art. We also release HUICRSync, an open-source Unreal Engine plugin for prototyping projection-MR CR experiences.

cs.HC · cs.GR

版本更新 · v4arXiv:2607.02137

Adaptive Reparametrized Time for Score-Based Diffusion Sampling

Yilie Huang, Wenpin Tang, Xun Yu Zhou

原文摘要

We study timestep allocation for score-based diffusion sampling, where a learned reverse-time dynamics is discretized on a finite grid. Uniform and hand-crafted schedules are standard choices, but they rely on fixed prescriptions and can therefore be suboptimal. To address this limitation, we propose Adaptive Reparameterized Time (ART), a continuous-time control formulation that learns a time change by treating the speed of the sampling clock as the control, so that a uniform grid on the learned clock induces adaptive timesteps in the original diffusion time. Based on a leading-order Euler error surrogate, ART provides a principled objective for allocating timesteps along the sampling trajectory. To solve this deterministic control problem, we introduce ART-RL, an auxiliary randomized formulation with Gaussian policies that turns schedule learning into a continuous-time reinforcement learning problem. We prove that the randomized ART-RL formulation is equivalent to ART at the optimizer level, in the sense that its optimal Gaussian policy recovers the optimal ART time-warping rate through its mean. We further establish policy evaluation and policy improvement characterizations and derive trajectory-based moment identities that yield implementable actor--critic updates for learning the schedule. Across experiments ranging from controlled low-dimensional settings to image generation, ART-RL can be plugged into existing diffusion samplers by changing only the timestep grid, consistently improving sample quality over strong baseline schedules at matched budgets while leaving the rest of the sampling pipeline unchanged. The learned schedules also exhibit broad generalization, transferring without retraining across sampling budgets, datasets, solvers, pipelines, and representation spaces.

cs.LG · cs.AI · eess.SY · math.OC

版本更新 · v2arXiv:2611.02536

FORGE: Fault-Oriented Rework Code Generation for Executable Interlocking Assembly

Fuqiang Wang, Jiahao Fu, Ren Hefeng, Yining Qian, Chuanting Zhang, Cheng Tan, Yuwen Liu, Jingxuan Wei

原文摘要

Large language models have demonstrated strong capabilities in structured reasoning and code generation, yet identifying an assembly fault does not guarantee the ability to generate executable rework programs. In interlocking assemblies, a locally plausible repair program may violate blocking dependencies, omit required recovery operations, or terminate in an incorrect configuration. We identify this challenge as fault-conditioned executable rework generation, where models must jointly reason about structural failures and generate programs that restore constrained assembly states. To benchmark this capability, we introduce FORGE-Bench, containing 4,000 tasks across 26 interlocking assemblies with five assemblies held out for evaluating generalization to unseen structures. We further propose FORGE (Fault-Oriented Rework Code Generation for Executable Interlocking Assembly), a structured state-to-program framework that decomposes rework generation into Rework Structuring and Action Grounding. Rework Structuring captures fault-induced recovery dependencies, while Action Grounding maps these dependencies into state-conditioned executable actions. Experiments show that locally reasonable repair code is insufficient for reliable assembly recovery, and that connecting structural recovery reasoning with executable action realization is essential for verified target restoration.

cs.AI