跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 23,827 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.11662

Enhancing Balance and Posture in Material Handling Tasks with a Wearable Robotic Tail

Eisa Anwar, Sajeeva Abeywardena, Stuart C. Miller, Ildar Farkhatdinov

原文摘要

Frequent heavy lifting is linked to musculoskeletal strain, with lower back pain affecting up to 40% of manual labourers. Inspired by animals using tails for balance, we developed a wearable robotic tail as a dynamic counterbalance. Ten participants performed an imitated shelf loading/unloading task across three conditions: active tail, passive tail, and no tail. Kinematics, centre of pressure, and muscle activation (gastrocnemius, erector spinae, tibialis anterior, biceps brachii) were measured. Compared with no tail, the active tail achieved >20 mm reduction in centre of pressure peak displacement, 4.3 degree reduction in trunk motion, and >9% and >20% reductions in erector spinae and gastrocnemius activity, respectively. The passive tail produced smaller reductions, suggesting passive counterbalancing helps while active movement augments it further. Biceps brachii activation increased with the active versus passive tail. The ankle kinematics and tibialis anterior activation were unchanged. These findings support wearable robotic tails for improving balance during material handling.

cs.RO

新论文 · v1arXiv:2611.11659

RADE: Risk-Adjusted Deployment Efficiency, A Framework for Routing, Memory, and Escalation in Safe LLM Systems

Chaymaa Abbas, Kareem Hassani, Mariette Awad

原文摘要

A deployed language model does not merely answer questions. It spends computation, consumes time, consults evidence, exposes memory, invites or avoids human review, and sometimes makes mistakes whose consequences are radically unequal. Yet LLM systems are still commonly compared as if the relevant object were a single model and the relevant outcome were a single benchmark score. This paper argues that the unit of analysis should instead be the deployment policy: the mechanism that decides when to retrieve, when to remember, when to call a larger model, when to verify, and when not to answer at all. We introduce risk-adjusted deployment efficiency (RADE), a system-level objective that scores the utility a deployment delivers net of inference, retry, oversight, and priced expected failure cost, while treating harms that cannot be priced as hard budgets alongside constraints on latency, privacy, and resources. The framework brings selective routing, retrieval and governed memory, efficient specialization, uncertainty estimation, abstention, and human escalation into a common account. We then examine five deployment regimes in which the same nominal LLM capability leads to different rational architectures, and propose a reporting protocol based on risk-coverage behavior, end-to-end cost, update drift, memory exposure, evidence quality, and escalation load. The central claim is modest but consequential: frontier capability should be treated as a resource to allocate, not a default state to maintain. A safe and sustainable system is not the one that always uses the strongest model; it is the one that spends capability where the reduction in risk or increase in utility justifies the cost.

cs.AI

新论文 · v1arXiv:2611.11658

Measuring Generative AI Content in Political Campaigns: Evidence of Rising Adoption and Non-Disclosure

Anna-Maria Gueorguieva, Nic Weber

原文摘要

The use of generative AI in political campaigns has drawn public concern and policy attention. Public concerns range from distrust of candidates to skepticism about the authenticity and accuracy of political advertising, including AI-generated images and video. Nearly half of U.S. states have enacted laws that prohibit, or require disclosure of, "materially deceptive" AI-generated content (AIGC) in elections to guard against these concerns. This study measures how candidates and their campaigns produce and circulate AIGC during an election cycle. We develop two measures that estimate not only wether campaigns use AIGC, but how much they produce (magnitude) and in what forms (modality). We apply these measures to a novel dataset of text and images from the campaign websites, X accounts, and emails of 12,977 candidates for U.S. political office from 2023 to 2025. We report three findings. First, detectable AIGC from campaigns increased significantly across modalities over the observation window, and campaigns that use AIGC frequently do not disclose it. Second, incumbents' campaigns produced significantly less AIGC than challengers' campaigns. Third, candidates in states with AIGC disclosure or prohibition laws do not produce measurably less AIGC than candidates in other states. Our method and findings have implications for transparency and trust in elections, and on state laws that regulate AI use in campaigns. Because current state laws largely target mainly "materially deceptive" content, we identify additional policy mechanisms that could increase electoral transparency and improve trust as AIGC becomes more prevalent.

cs.AI

新论文 · v1arXiv:2611.11657

Inside the Trading Loop: Markets, Models, and Moves with LLM Agents

Renee Jia, Di Mu, Yao Yu, Tianrui Liu

原文摘要

We built a hybrid multi-agent trading system that combines large language model (LLM) analysts with momentum-based portfolio construction and rule-based execution. Company-news and macroeconomic agents return structured reports to a coordinator that sets stock weights and cash reserves. We evaluate the portfolio engine using its broker-recorded paper account, which operated with deterministic fallbacks, and compare LLM-enabled configurations through retrospective replays. From March 11 to August 28, 2026, the account returned 34.5%, compared with 14.4% for the S&P 500 fund SPY over the same dates. This raw return advantage came with a larger maximum drawdown. Reconstructed policies also finish above matched SPY and QQQ references when assessments are used in the same session or deferred to the next. Design comparisons examine cash authority, selective invocation, and response contracts. A constant-cash control gives a return estimate close to stance-based sizing, and shorter report contracts improve observed parsing but can change recommendations.

cs.AI

版本更新 · v2arXiv:2608.09073

Latent World Models with Monotone Planning Costs for Image-Goal Navigation

Amirhosein Chahe, Siwei Cai, Lifeng Zhou

原文摘要

Image-goal navigation with latent world models requires not only accurate future prediction, but also a planning cost that reliably ranks candidate action sequences. We define the cost as the cosine distance between the predicted future embedding and the goal embedding, and show that poor cost ordering can mislead sampling-based planners such as Cross-Entropy Method (CEM). To address this, we propose a latent world model built on a frozen DINO-family encoder and train it with two complementary objectives. An autoregressive rollout loss reduces the gap between training and multi-step planning rollouts, while a Monotone Cost Ranking (MCR) loss directly encourages increasingly perturbed action sequences to receive higher planning costs. We also study InfoNCE-based action-contrastive training and find that temporal permutation negatives distort the latent geometry and degrade planning performance. On the GNM navigation dataset, our method outperforms Navigation World Models (NWM), DINO-WM, OmniVLA, and NoMaD, achieving state-of-the-art image-goal navigation performance while reducing orientation error by $2.7\times$ over the same-encoder DINO WM baseline. We also deploy the model zero-shot on a physical robot, where it follows goal-directed paths in unseen indoor and outdoor environments.

cs.RO

新论文 · v1arXiv:2611.11656

Means vs. Foundation Models for Emergency Call Forecasting

Feriel Fass, Djemel Ziou, Marie-Flavie Auclair-Fortier

原文摘要

This study investigates whether generalized means can achieve forecasting performance comparable to that of TimeGPT for daily emergency call volume prediction. Specifically, two families of generalized means, the Hölder means (HM) and the Lehmer means (LM), are evaluated against fine-tuned TimeGPT across forecasting horizons ranging from one to seven days. Forecasting performance is assessed on a real-world emergency call dataset using multiple error metrics, and Diebold-Mariano test. Experimental results show that HM and LM achieve nearly identical predictive performance across all forecasting horizons. For short-term forecasting, both generalized means outperform TimeGPT, with reductions of mean absolute error (MAE) approximately 1.24\% and 2.48\% at horizons of one and three days, respectively. Conversely, TimeGPT achieves a lower error at the seven-day horizon, with an descresing of MAE by 1.98\%. However, Diebold-Mariano tests reveal no statistically significant differences between the methods at the evaluated horizons. These findings suggest that generalized means can provide competitive forecasting performance compared with a energyvore foundation model.

cs.LG

版本更新 · v2arXiv:2606.08612

Facial Expression Recognition in the Deep Learning Era: A Systematic Multi-Criteria Review of Methods, Models, Datasets, Performance, Challenges, and Future Research Directions

Spyridon Georgiou, Aggelos Psiris, Spyridon Evangelatos, Thomas Lagkas, Vasileios Argyriou, Panagiotis Sarigiannidis, Iraklis Varlamis, Georgios Th. Papadopoulos

原文摘要

Facial Expression Recognition (FER) has advanced rapidly over the last decade, driven by the shift from handcrafted descriptors and shallow classifiers to deep convolutional, attention-based, vision-language, and foundation-model architectures, and by the parallel growth of large-scale in-the-wild benchmarks spanning categorical, dimensional, compound, micro-expression, Action Unit (AU), and intensity-estimation tasks. Yet the deep learning-based FER landscape has so far been reviewed only along narrow task-, architecture-, or application-specific axes, leaving a holistic, systematically organized account of its recent advances missing. This survey addresses that gap with a comprehensive review of recent deep learning-based FER, explicitly linked to the wider Facial Affect Recognition (FAR) domain. Its main contributions are: a) A description of FER's evolution into five distinct phases, from handcrafted features and classical machine learning to attention-based, vision-language, and foundation-model approaches, with the key milestone works of each, b) A multi-criteria taxonomy analyzing the literature along seven complementary axes: recognition task, input modality, face pre-processing pipeline, network architecture, learning strategy, acquisition setting, and application domain, c) A per-criterion comparative analysis, with critical insights into the strengths and limitations of each category under in-the-wild conditions, d) A task-organized review of public FER datasets, with their annotation schemes, modalities, and evaluation protocols, e) A compilation of performance metrics and a per-task quantitative comparison of representative state-of-the-art methods on widely adopted benchmarks, and f) A discussion of current challenges and promising future directions.

cs.CV

版本更新 · v5arXiv:2607.08837

Prompt Driven Exploration: Language as an Exploration Space for VLA Reinforcement Learning

Sunshine Jiang, John Marangola, David Zhang, Raghuram Kowdeed, Ruiyang Luo, Nitish Dashora, Richard Li, Pulkit Agrawal 等 9 位作者

原文摘要

Exploration is essential to reinforcement learning (RL) since a policy cannot improve by repeatedly sampling the behaviors it already prefers. Standard methods inject stochasticity in the action space, but such jitter only yields rollouts close to the original action distribution. Escaping a weak policy often requires global perturbations that action noise cannot produce. Large language models (LLMs) and vision-language-action (VLA) models offer a pathway: they condition the policy on a natural language prompt, and since the rollout follows from it, modifying the prompt induces global changes. The challenge is finding prompts that induce useful global changes. With a weak policy that rarely succeeds, reward is too sparse to select on. Our idea is to refine prompts from the rollouts themselves: a vision-language model (VLM) reasons over the rollout video, diagnoses how the policy responded, and rewrites the prompt to elicit better behavior next time. Sampling a prompt and holding it fixed throughout a rollout provides episode-level commitment, analogous to posterior-sampling exploration. We call this strategy Prompt Driven Exploration (PDE). Across manipulation and reasoning tasks, PDE enables RL to learn successful policies even from zero-reward starts, and improves sample efficiency more broadly. Our website is available at https://xinyunsunshine.github.io/prompt-rl.

cs.LG · cs.AI

新论文 · v1arXiv:2611.11653

Exploring Mixed-Reality for Enhancing Driver Warning Systems: A Preliminary Study on Attention-Shifting Methods and Hazard Perception

Shih-Yu Ma, Nolan Robert Brady, Xu Han, Neng-Hao Yu, Tom Yeh

原文摘要

Modern vehicles are equipped with advanced sensors and capabilities, yet engaging human drivers effectively in hazard perception remains a challenging research area. This paper investigates the potential of mixed reality (MR) to enhance driver warning systems. The study examines the impact of attention-shifting methods, including visual cues, audio cues, and a combination of both, on drivers' hazard perception. A preliminary study involving six participants was conducted, and the NASA-TLX analysis did not yield significant differences. However, through the use of functional near-infrared spectroscopy (fNIRS), we unveil distinct brain activation patterns associated with visual and sound cues. Further research with larger sample sizes and diverse driving scenarios is required to validate and expand upon these preliminary results.

cs.HC

新论文 · v1arXiv:2611.11651

Optimizing Multi-Tier Intermediation in Programmatic Advertising: A DAG-Based Mechanism for Supply Path Optimization

Amelia Bădică, Costin Bădică

原文摘要

Digital programmatic advertising operates through complex, multi-hop supply chains. The opacity of these intermediary networks leads to significant efficiency losses, often referred to as the ``ad-tech tax.'' While current industry practices utilize heuristic Supply Path Optimization (SPO) to trim inefficient routes, they fail to optimize the equilibrium of the entire network. This paper extends previous work on Directed Acyclic Graph (DAG) intermediation models by applying them to traceable programmatic supply chains mapped via the OpenRTB SupplyChain object. We introduce multi-attribute utility functions and Mixed-Integer Linear Programming (MILP) to account for substitutable routing (OR nodes) and percentage-based fee structures. Furthermore, we outline a computational methodology and experimental framework using public \texttt{schain} and \texttt{sellers.json} data to benchmark optimal Nash social welfare against current uncoordinated market outcomes.

cs.AI

新论文 · v1arXiv:2611.11650

FlowEval: How Much Adaptation Does an Embodied Foundation Model Need at Deployment?

Zhang Xi-Jia, Roman Yakunin, Shivang Chopra, Chengyue Huang, Che Chen, Siddharth Karamcheti, Zsolt Kira

原文摘要

Large-scale pretraining is reducing the amount of adaptation required to deploy embodied foundation models, but it is not guaranteed that a pretrained model already provide the level of performance required in every deployment. Practitioners therefore need to understand how well a pretrained model matches a target deployment and how much adaptation data is left to be collected. We study whether a small set of successful target-domain demonstrations can reveal whether and how much target-domain data will be required before any adaptation. We introduce FlowEval, a set of training-free metrics that use the flow-matching objective to probe an embodied foundation model with a set of demonstrations. FlowEval quantifies predictive disagreement on successful target demonstrations to assess how well a pretrained model fits a target deployment. Across four embodied foundation model families: Pi-0.5, MolmoAct2, GR00T, and DreamZero, FlowEval distinguishes seen from unseen deployments across real-world and simulated manipulation. Further, by finetuning Pi-0.5 and GR00T on 17 RoboCasa365 manipulation tasks, we showed that FlowEval correlates with how success rate improves as additional adaptation data is provided. Together, these results suggest that FlowEval can serve as a lightweight, training-free diagnostic of how much model--deployment adaptation may be required.

cs.RO

新论文 · v1arXiv:2611.11649

A Trust Region Approach for Learning Schrödinger Bridges

Takeshi Koshizuka, Denis Blessing, Max Zimmer, Sebastian Pokutta, Lorenz Richter

原文摘要

We study the numerical approximation of Schrödinger Bridges in the setting where samples from the target distribution are unavailable and only an unnormalized target density is given. In this regime, the widely used iterative proportional fitting (IPF) procedure (and its variants) often exhibits severe numerical instabilities, stemming from ill-conditioned underlying control problems and from the fact that the optimal solution may lie far from the initialization. To address these issues, we propose a trust region variant of IPF that constrains successive updates to remain at a fixed Kullback-Leibler divergence from the current iterate. This restriction significantly improves numerical stability. Moreover, we show that the resulting method admits an interpretation as a mirror descent scheme with an adaptively chosen step size. We demonstrate the effectiveness of our approach on several challenging sampling tasks.

cs.LG · stat.ML

版本更新 · v2arXiv:2602.14404

Boule or Baguette? A Study on Task Topology, Length Generalization, and the Benefit of Reasoning Traces

William L. Tong, Ege Cakar, Cengiz Pehlevan

原文摘要

Recent years have witnessed meteoric progress in reasoning models: neural networks that generate intermediate reasoning traces (RTs) before producing a final output. Despite the rapid advancement, our understanding of how RTs support reasoning, and where this paradigm fails, remain incomplete. To promote greater clarity, we introduce PITA: a novel large-scale dataset of over 23 million statements in propositional logic and their corresponding proofs. As a benchmark for robust reasoning, we focus on length generalization: if a model is trained to determine truth or falsity on statements with proofs up to fixed length, how well does it generalize to statements requiring longer proofs? We propose notions of (1) task depth and (2) task breadth, which measure respectively (1) the number of proof steps required to solve a proposition and (2) the number of unique propositions within a task family. We vary these quantities across subsets of PITA, and find that RT models generalize well on relatively broad and shallow subsets, while deteriorating on relatively narrow and deep subsets compared to non-RT baselines. As a controlled point of comparison, we study a separate, tractable transitive inference task that exhibits qualitatively similar behavior. Our accompanying theory explains the scalings observed in this simpler setting, suggesting one mechanism by which breadth can favor RT models while depth can expose long-context weaknesses. Our findings suggest salient benefits and limitations of proof-like reasoning traces in controlled length-generalization settings.

cs.AI · cs.LG · cs.NE

新论文 · v1arXiv:2611.11646

ColNav: Uncertainty-Aware Spacetime Collision Checking with Bounding Volume Hierarchies

Sanjeev Ramkumar Sudha, Lars Ivar Hatledal, Erlend M. Coates

原文摘要

Safe navigation for mobile robots in dynamic and uncertain environments requires planning paths that avoid collisions with other moving targets. Typically this involves forward propagating the robot motion and checking for collisions at sampled points in space and time. Such methods can miss collisions between sampled points and are not robust to uncertainty in the state estimates. We propose ColNav, a robust collision check formulation with geometric volumes. The key aspect of our approach is encoding the uncertainty in the targets' and the ego robot's positions and velocities into spacetime tubes, in two variants that consume bounded-set and Gaussian uncertainty descriptions, respectively. The tubes are organised in bounding volume hierarchies, so that a single tree traversal covers the entire horizon, rather than testing sampled time instants, and returns a robust geometric certificate together with an estimate of the time to collision. Static and dynamic obstacles share the same representation. Our approach reaches the goal with a 100% success rate under prediction model mismatch, where the best baseline reaches 65%, and maintains up to three times the clearance in dense traffic. We also validate real-time operation on a physical robot.

cs.RO

版本更新 · v2arXiv:2510.11361

A protocol to reduce worst-case latency in deflection-based on-chip networks

Leandro Soares Indrusiak

原文摘要

We present a novel protocol that reduces worst-case packet latency in deflection-based on-chip interconnect networks. It enforces the deflection of the header of a packet but not its payload, resulting in a reduction in overall network traffic and, more importantly, worst-case packet latency due to decreased pre-injection latency.

cs.NI · cs.PF

新论文 · v1arXiv:2611.11644

MICE: Multi-animal Interaction Context Encoder - A Hierarchical Foundation Model for Mouse Behavior

Yen-Shuo Su, Weihan Li, Anqi Wu

原文摘要

Quantifying mouse behavior from pose is a foundational tool in neuroscience, ethology, drug discovery, and animal welfare. Self-supervised foundation models are a natural fit, but a foundation model for mouse behavior must handle social behavior - many behaviors that matter (aggression, courtship, mounting, allogrooming) are inherently multi-animal. Existing self-supervised pose models fall short: they encode each animal independently and discard interaction signal, hard-code the animal count, and pretrain one dataset at a time. We introduce MICE (Multi-animal Interaction Context Encoder), a hierarchical foundation model for mouse behavior that pretrains jointly on six mouse-pose corpora spanning one to four mice and 7 to 27 keypoints. MICE combines a hierarchical individual encoder capturing per-mouse kinematics at multiple temporal scales with a Perceiver-style social encoder whose learned latent codebook decouples parameter count from animal count, so a single checkpoint serves any group size without retraining. Across four evaluation protocols spanning six datasets, MICE matches or exceeds prior keypoint-based baselines, and layer-wise probing shows the social stage incrementally improves discriminability beyond the individual encoder. Code, weights, and data are available at https://github.com/eric0708/MICE.

cs.CV · cs.LG · q-bio.NC

新论文 · v1arXiv:2611.11641

Spectral Stability, Fatou Basin Contraction, and Machine-Checked Multipliers in Holomorphic Extensions of Generalized Syracuse Dynamics

Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı, Emrah Yurtseven, Murat Emre Özkaya

原文摘要

We embed the Syracuse operator $T(n) = n/2$ (even $n$), $T(n) = (3n+1)/2$ (odd $n$) and the Collatz map $C(n)$ into $\mathbb{C}$ via entire functions of exponential type $π$: $f(z) = \frac{1}{4}(1 + 4z - (1 + 2z)\cos(πz))$ and $F(z) = \frac{1}{4}(2 + 7z - (2 + 5z)\cos(πz))$. We prove five results: (1) every integer periodic cycle $C \subset \mathbb{N}^+$ of $T$ is a strictly attracting Fatou cycle of $f$ with multiplier $μ_f(C) = 3^{N_{\mathrm{odd}}}/2^N = \prod_{n \in C\text{ odd}} \frac{3n}{3n+1} \in (0,1)$, and $μ_f(O_{1,2}) = μ_F(O_{1,4,2}) = 3/4 < 1$; (2) on the Fatou basin $B(O_{1,2})$, $g = f^{\circ 2}$ conjugates to $Φ_j(g(z)) = \frac{3}{4}Φ_j(z)$ with Koenigs Taylor jets $c_2(1) = -\frac{13}{2}π^2$ and $d_2(2) = -\frac{9}{2}π^2$; (3) the Schwarzian derivative is strictly negative on $\mathbb{Z}$ ($S(f)(n) \le 3π^2 - \frac{3}{8}π^4 \approx -6.9196 < 0$), and a repelling Julia 2-cycle $O_{\mathrm{rep}} \subset J(f)$ ($μ\approx 1.2148 > 1$) isolates $B(O_{1,2})$; (4) on $(\mathbb{Z}_2, μ_{\mathrm{Haar}})$, the 2-adic Lyapunov exponent $λ_{\mathrm{Haar}} = \frac{1}{2}\ln(3/4) \approx -0.143841 < 0$ equals $\frac{1}{2}\ln|μ_f(O_{1,2})|$; and (5) we certify 20 theorems in Lean 4 (anc/CollatzAttractor.lean, 0 sorry). These results establish local Fatou invariants and 2-adic ergodic averages for $f(z)$, leaving open whether every $n_0 \in \mathbb{N}^+$ lies in $\bigcup_{k \ge 0} f^{-k}(B(O_{1,2}))$.

cs.LO · cs.SC · math.CV · math.DS

版本更新 · v2arXiv:2610.04273

Integrated Imputation-Classification for Supervised Learning with Missing Data

Yue Liu, Ben Liang, Ali Tizghadam, Ilijc Albanese

原文摘要

We study supervised classification problems with missing feature values. Existing approaches often decouple imputation from classification, producing imputations that may be plausible but uninformative for prediction. Instead, we propose the Integrated Imputation and Classification Network (IICN), which jointly trains an imputer and an ${(n{+}1)}$-class discriminator adversarially with a single class-supervised objective, where the discriminator learns to distinguish among the $n$ true classes and an additional ``imputed'' class. We prove that it admits a global optimum where the imputer and discriminator together implement marginalization over missing coordinates and yield a Bayes-optimal classifier. We evaluate IICN on FashionMNIST, CIFAR-10, and tabular datasets with naturally occurring missingness. IICN outperforms classical impute-then-classify pipelines and recent generative baselines, showing strong robustness and accuracy in challenging settings.

cs.LG

新论文 · v1arXiv:2611.11640

Feel My Focus: Gaze-Triggered Digital Twin Creation for Remote Collaboration

Shih-Yu Ma, Suibi Che-Chuan Weng, Ming-Yuan Pai, Tom Yeh, Ellen Yi-Luen Do

原文摘要

We present Feel My Focus, a gaze-triggered mixed reality (MR) demonstration that enables rapid creation and sharing of lightweight 3D digital twins during remote collaboration. Unlike systems that use gaze primarily as a referential pointer, Feel My Focus treats sustained visual attention as a generative action: a fixation on a physical object initiates single-image capture, attention-guided segmentation, and one-shot 3D reconstruction, allowing a remote partner to inspect and discuss the object in situ. The system integrates gaze-tracking glasses, modular segmentation and reconstruction services, and an MR client for runtime streaming and interaction. This design prioritizes responsiveness and experiential continuity over photometric fidelity. We report observations from a public demonstration, highlighting design trade-offs, failure modes, and user control considerations for deploying gaze-triggered generative systems in real-world collaborative settings.

cs.HC · cs.CV · cs.GR

版本更新 · v2arXiv:2609.26705

When are bosonic Gaussian states classical to learn?

Senrui Chen, Antonio Anna Mele, Francesco Anna Mele, John Preskill

原文摘要

A fundamental question in physics is: When does classical behavior emerge from quantum systems? Bosonic Gaussian states provide a natural setting to explore this quantum-classical boundary, as they capture both the classical field behavior and the intrinsic quantum nature of light. Here, we address this problem from a learning-theoretic perspective by asking: When are bosonic Gaussian states classical to learn? That is, under what conditions (if any) can an n-mode bosonic Gaussian state be learned with as few samples, and with operations as simple, as are needed to learn a classical 2n-variate Gaussian distribution? We establish a smooth crossover in learnability governed by the state's thermal fluctuations: - Cold Gaussian states are non-classical to learn: When the covariance matrix satisfies $Σ\le(\frac12+O(\frac1n))I$, i.e. close to the vacuum covariance, tomography under single-copy (i.e., non-entangled) measurements fundamentally requires $Ω(n^3)$ copies, strictly exceeding the sample complexity $Θ(n^2)$ of learning classical Gaussian distributions. We show that this hardness persists even when few-copy entangled measurements are allowed. - Warm Gaussian states are classical to learn: When thermal fluctuations exceed the vacuum noise, parameterized by $Σ\ge(\frac12+ν)I$ for any parameter $ν>0$, we prove that single-copy tomography requires $N=Θ\left(n^2\min(n,1+ν^{-1})\right)$ copies. This bound is tight and is achieved by simple, non-adaptive, unentangled heterodyne measurements. Crucially, for $ν=Ω(1)$, the sample complexity drops to $Θ(n^2)$, matching the classical case. Our results tightly characterize a quantum-to-classical crossover in the learnability of bosonic Gaussian states, reveal a novel connection between fundamental physics and statistical learning theory, and have implications for real-world sensing experiments.

quant-ph · cs.IT · cs.LG · math-ph

新论文 · v1arXiv:2611.11636

Trail Making Tests in Extended Reality: A Critical Review with Implications for Cognitive Ageing

Panagiotis Kourtesis

原文摘要

Extended reality (XR) versions of the Trail Making Test and Color Trails Test are promising for assessing and training cognition in older adults. However, each XR adaptation is a new instrument, whose display, interaction technique, timing rules and layouts may change what it measures. This critical narrative review maps these implementations by software lineage and appraises their evidence for assessment and training against common criteria. The Trail Making Test in Virtual Reality (TMT-VR), whose source code was inspected, serves as a measurement case. XR trail-making tests showed convergence with paper and computerised versions, varying by test part and sample, and clinical group differences (e.g., Parkinson's disease, mild cognitive impairment). However, gaps in reliability (e.g., randomised forms), validation (e.g., norms, prospective samples) and reporting (e.g., error handling, build identity) emerged, and no training benefit attributable to the trail-making component was identified. The TMT-VR case shows how interaction technique, timing rule, error handling and unlogged layouts shape a score's meaning. Future tests should log layouts and events, estimate alternate-form reliability and undergo prospective validation, and training trials should isolate the trail-making component. Several XR trail-making tests have moved beyond feasibility, and reported tolerability during supervised sessions supports further evaluation in older adults.

cs.HC · cs.CY

版本更新 · v4arXiv:2609.17989

Whom Do AI Agents Serve? Role-Induced Sponsorship Bias in Decision Models and Generative LLMs

Davood Wadi, Yu Ma

原文摘要

Consumers increasingly delegate product search to AI shopping agents powered by generative large language models (LLMs) or non-generative decision models. Because retail platforms monetize through sponsored listings that consumers typically discount, we examine whether an AI agent's evaluation of sponsored listings depends on who delegates it. Across six LLMs and six decision models in Study 1, consumer-delegated agents penalize sponsored listings, whereas naming a booking platform as principal significantly attenuates this sponsorship penalty without instructions to favor advertisers. This sponsorship bias replicates across prompt wordings and LLM reasoning efforts and operates through reduced pre-choice skepticism in LLMs. In Study 2, attributing the paid placement to the platform amplifies sponsorship bias across both model families, and stricter disclosure wording ("Sponsored" vs. "Promoted") fails to eliminate it. In Study 3, prompt-level mitigation removes platform leniency but can over-correct the sponsorship penalty, whereas consumer-aligned fine-tuning eliminates sponsorship bias and better preserves baseline preferences.

econ.GN · cs.AI

新论文 · v1arXiv:2611.11633

An Interpretable Fuzzy Tree for Turbofan Remaining Useful Life with an Auditable Per-Component Diagnostic Layer

Hugo Henry, Bharadwaj Dogga, Scott Philips, Kelly Cohen

原文摘要

Data-driven remaining useful life (RUL) estimators for turbofan engines are accurate but opaque, and their internal features typically encode remaining life rather than any specific component's state. This paper presents an interpretable genetic fuzzy tree that predicts RUL from cruise-condition sensor means on N-CMAPSS while exposing a per-component diagnostic layer inspectable rule by rule. The tree follows the engine hierarchy: sensors to component health, then to bounded component damage, spool damage, and RUL, so each level answers a different maintenance question. Training is staged so the prognostic objective cannot reshape the diagnostic layers: health leaves are fitted to physical targets and frozen, a deterministic fuzzy damage map with fleet-referenced thresholds is imposed on each component, and only the aggregation is optimized for RUL. It consumes 13 cruise-mean scalars per cycle rather than a trajectory, which removes any sequence model. On the native split it reaches 8.44 cycles RMSE on the multi-fault subset and 11.51 across all modes with 333 free parameters, 411 total rules, 32 to 12,000 times fewer than compiled baselines. An exhaustive sensor search bounds which components are diagnosable under the tested cruise-mean design, and the rule base is structured to admit formal verification, which this study does not discharge.

cs.AI

版本更新 · v2arXiv:2605.14343

Nearest-Neighbor Radii under Dependent Sampling

Yuanyuan Gao, Yilong Hou, Zhexiao Lin

原文摘要

Nearest-neighbor methods are fundamental to classical and modern machine learning, yet their geometric properties are typically analyzed under independent sampling. In this paper, we study the nearest-neighbor radii under dependent sampling. We consider strong mixing dependent observations and ask whether dependence changes the scale of nearest-neighbor neighborhoods. We establish distribution-free almost sure convergence under polynomial mixing and sharp non-asymptotic moment bounds under geometric mixing. The moment bounds depend on the local intrinsic dimension rather than the ambient dimension, making the results applicable to high-dimensional data supported on lower-dimensional manifolds. Synthetic experiments and real-world time-series benchmarks illustrate the theory, showing that nearest-neighbor geometry remains informative under dependent sampling.

cs.LG · math.ST · stat.ML

新论文 · v1arXiv:2611.11629

Practical Deep Learning-Based Block Demapping for mmWave MIMO Systems

Syed Asrar ul haq, Jesus O. Lacruz, Joerg Widmer, Sumit J. Darak

原文摘要

Deep learning is expected to play a central role in 6G systems, by enabling data-driven physical layer designs that can adapt to practical wireless impairments. This is particularly important for millimetre-wave (mmWave) multiple-input multiple-output (MIMO) systems, which are strongly affected by residual channel distortions, interference, and hardware non-idealities that are difficult to capture with analytical models. In this paper, we propose a deep learning-based soft demapper that performs block-wise processing of received symbols instead of conventional symbol-wise detection. The demapper employs a one-dimensional convolutional neural network to learn temporal structure induced by practical propagation and hardware effects, while producing soft bit outputs compatible with soft-decision decoding stages. The proposed approach is trained and evaluated for a 4$\times$4 wideband mmWave MIMO system at 60~GHz, using an over-the-air dataset collected across multiple days and settings. Experimental results demonstrate consistent improvements over a conventional soft-decision demapper, including up to a 2.6$\times$ reduction in bit error rate for 16QAM and up to a 17.6$\times$ reduction for 64QAM under real over-the-air mmWave MIMO conditions. The proposed demapper is further implemented on a Zynq RFSoC platform using a reconfigurable convolution engine and fixed-point arithmetic, achieving an approximately 34.3$\times$ speedup compared to a processor-based implementation, and demonstrating that learning-based demapping can be deployed efficiently on resource-constrained edge hardware.

cs.AR

版本更新 · v2arXiv:2605.08577

Self-Distilling Generative Adversarial Networks

Antoni Nowinowski, Krzysztof Krawiec

原文摘要

In modern GANs, maintaining an Exponential Moving Average (EMA) of the generator's weights is a standard practice, as such an averaged model consistently outperforms the actively trained generator. However, the EMA generator is used for final deployment only and does not influence the training process. To address this missed opportunity, we introduce Self-Distilled GAN (SD-GAN) that employs the EMA generator as a teacher to guide the active generator (student) via perceptual loss. We prove the local asymptotic stability of SD-GAN in the simplified continuous-time Dirac-GAN setting and show that it dampens the parasitic cycling behavior that plagues conventional GANs. Empirical evaluations across established architectures and datasets demonstrate that SD-GAN improves the final image quality on several metrics (FID and random-FID in particular), stabilizes the optimization trajectory and provides additional learning guidance that is not trivially correlated with the conventional adversarial loss. It also proves effective for fine-tuning pretrained GAN models.

cs.CV · cs.LG

版本更新 · v2arXiv:2607.01571

Geometric Signatures of Reasoning: A Spectral Perspective on Task Hardness

Aria Masoomi, Mahsa Bazzaz, Adel Javanmard, Vahab Mirrokni

原文摘要

Chain-of-thought (CoT) reasoning enables large language models (LLMs) to solve complex problems by generating intermediate reasoning steps. While much attention has been paid to the length and content of these reasoning chains, far less is known about their internal geometry. We study the geometry of CoT trajectories in the hidden state space of transformer models, formalizing each reasoning chain as a discrete curve in $\mathbb{R}^d$ and characterizing it through spectral, positional, and kinematic geometric functionals. We introduce the effective dimension $d_ρ$ as a measure of trajectory complexity and empirically show that harder tasks exhibit greater effective dimension. Lastly, we explore how kinematic features of the trajectory, mean position, positional dispersion, initial and final hidden states, mean velocity, mean speed, and speed dispersion, can be used to predict solution correctness before generation is complete, and may inform future early-stopping strategies. Experimentally, on 86 mathematical reasoning problems from the MATH500 dataset and three Qwen2.5 model scales (0.5B, 1.5B, and 7B), $d_ρ$ achieves difficulty-prediction AUROC of $0.90$, $0.94$, and $0.96$, respectively. Seven kinematic and positional features predict correctness from only the first $20\%$ of generated tokens, with AUROC between $0.77$ and $0.88$ across scales. These correctness signatures transfer across held-out questions, establishing that the shape of a model's internal reasoning trajectory is a principled window into both task hardness and solution quality.

cs.LG

新论文 · v1arXiv:2611.11627

Attack Injection to Vehicle Reactions: Extensible Closed-Loop Adversarial Evaluation Framework

Mohamed Gaber, Tahsin Wahid, Mohammad Mamun, Salimur Choudhury

原文摘要

Autonomous vehicles can use information exchanged with other vehicles and roadside infrastructure to support driving decisions. However, applications that rely on this information can make unsafe decisions when it is falsified. Studying the resulting traffic effects requires following received information through application decisions, vehicle reactions, and subsequent interactions. We present an extensible closed-loop adversarial evaluation framework built on VaN3Twin, a platform for traffic and wireless network simulation, with a diverse attack library and a labelled dataset covering benign and attack conditions. A key advantage of the framework is that it can be extended with additional attacks, message paths, receiving applications, and logging fields. The added library contains 76 configurable attack profiles adapted to message formats defined by the European Telecommunications Standards Institute. These profiles are organized into nine groups of related attacks, referred to as suites. The framework connects live attack injection and simulated network delivery to receiving applications, whose selected commands update vehicle movement. The resulting state feeds subsequent message generation, closing the loop. The dataset links physical vehicle states and message exchanges to attack labels, application decisions, selected commands, and traffic outcomes. Evaluation with individual and combined attack suites confirmed execution of all profiles, and every suite produced requests linked to attacked messages. A recorded sequence also showed a vehicle reacting to an attacked message and subsequently influencing another vehicle through an unmodified message describing its updated movement. These findings demonstrate how live injection and vehicle feedback support the study of direct and indirect effects as traffic evolves.

cs.CR · cs.NI

新论文 · v1arXiv:2611.11626

Proof of the Aaronson-Ambainis Conjecture: An Exposition

Guy Blanc, Jordan Docter, Carmen Strassle, Li-Yang Tan

原文摘要

We give an exposition of a recent proof of the Aaronson-Ambainis conjecture, which states that every degree-$d$ polynomial $p : \{0,1\}^n \to [0,1]$ has a variable of influence at least $\mathrm{poly}(\mathrm{Var}(p)/d)$. This implies that quantum query algorithms for decision problems can be efficiently simulated classically on most inputs. It also yields a near-equivalence between the status of the $\mathsf{BPP}$ vs. $\mathsf{BQP}$ problem in the random oracle and unrelativized worlds. We organize the proof around four main steps and discuss how each connects to the literature on the analysis of boolean functions and probabilistic combinatorics. To bring out the key ideas, we do not optimize parameters, and our presentation yields weaker exponents than the original. $\textbf{Authors' note.}$ The proof was discovered by David Turturean using a research system developed at Physical Superintelligence (PSI), in combination with a non-public Anthropic model. The proof was then shared with the authors, who worked to understand it and prepare this exposition. Anthropic's public models were used in this process. The authors did not receive financial compensation from Anthropic or PSI. This article is not intended for publication at a conference or in a journal.

quant-ph · cs.CC

新论文 · v1arXiv:2611.11624

Karhunen-Loève Transforms of Autoregressive Windows Based on Matched Symmetry Groups

Mitchell A. Thornton

原文摘要

The Karhunen-Loève transform of a window of a stationary autoregressive process of any order $p$ is described through its poles, extending the Algebraic Diversity framework, which selects a transform by the matched group. For simple roots every basis vector is a sum of at most $p$ sinusoids, at the frequencies where the spectrum equals the eigenvalue, plus modes decaying from the ends. The window covariance differs from a member of the class diagonalized by the type-II discrete cosine transform by a closed-form matrix of rank $2p$, exactly when no pole is zero, so the eigenvalues interlace spectrum samples on the cosine grid, and the coding-gain loss of the cosine transform is an exact function of that matrix with computable bounds: for the $8\times8$ Markov block of image coding at pole $0.95$ it is below 1.2 percent. By Kronecker's theorem the rank is at most $2\max(p,q)$ for rational spectra; a moving-average window departs in its Hankel corners, and an integrated (ARIMA) window departs by low rank from the type-VII sine class, exact for the random walk. The exact symmetry is generically the reflection and contains a wreath product for interleaved windows; the dihedral group of the even extension is matched approximately, the dominant pole's sign choosing cosine or sine. The two groups give the transform a fast form: a parity fold, half-length cosine cores and a cascade of at most $p$ first-order Cauchy stages, exactly $p$ for a minimal AR($p$) model. The first-order case recovers results obtained by other means.

eess.SP · cs.IT · math.NA