跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 19:10 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 19:10最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

论文修订列表

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

找到 8,559 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 19:07(北京时间)
版本更新 · v2arXiv:2502.16617

Optimal Kernel Learning for Gaussian Process Models with High-Dimensional Input

Lulu Kang, Minshen Xu

原文摘要

Gaussian process (GP) regression is a popular surrogate modeling tool for computer simulations in engineering and scientific domains. However, it often struggles with high computational costs and low prediction accuracy when the simulation involves too many input variables. For some simulation models, the outputs may only be significantly influenced by a small subset of the input variables, referred to as the ``active variables''. We propose an optimal kernel learning approach to identify these active variables, thereby overcoming GP model limitations and enhancing system understanding. Our method approximates the original GP model's covariance function through a convex combination of kernel functions, each utilizing low-dimensional subsets of input variables. Inspired by the Fedorov-Wynn algorithm from optimal design literature, we develop an optimal kernel learning algorithm to determine this approximation. We incorporate the effect heredity principle, a concept borrowed from the field of ``design and analysis of experiments'', to facilitate efficient computation. Through several examples, we demonstrate that the proposed method provides competitive prediction and variable selection, with favorable computational performance in the examples considered. It is an effective solution for interpreting the surrogate GP regression and simplifying the complex underlying system.

cs.LG · stat.ME · stat.ML

版本更新 · v2arXiv:2609.38379

Aligned Data Can Induce Misalignment via Context Confusion

Yavuz Bakman, Duygu Nur Yaldiz, Baris Askin, Swastik Roy, Morteza Ziyadi, Salman Avestimehr, Sai Praneeth Karimireddy

原文摘要

Large language models are frequently updated for various use cases, where filtering out misaligned training samples is a common practice for preventing post-update misalignment. However, alignment is inherently context-dependent: a behavior that is aligned in one context may be inappropriate in another. For example, recommending that researchers retain their data for reproducibility is aligned, whereas recommending that a mobile app retain users' sensitive data may violate users' privacy. Starting from this observation, we identify a posttraining phenomenon where aligned training induces misaligned behavior in other contexts. We call this phenomenon context confusion. We demonstrate context confusion across three domains: (1) Gender Equality, (2) Privacy, and (3) Physical Safety. Unlike the broad misalignment seen in emergent misalignment, context confusion causes domain-specific misalignment that evades general alignment evaluations. Further, it is not effectively reduced by injecting general alignment training data, but can be substantially reduced by including targeted alignment data for the misaligned domain or providing in-context learning examples during inference. Lastly, we provide a mechanistic explanation of context confusion. We observe that queries from different domains can undergo similar representational shifts during the fine-tuning. Consequently, a query from a different domain may activate the same behavioral feature learned during fine-tuning, which causes the behavior to transfer to a context where it is misaligned. Based on our findings, we argue that it is difficult to predict the alignment state of a model after training by inspecting the training data alone, which highlights the importance of comprehensive post-training alignment evaluations.

cs.AI · cs.LG

版本更新 · v2arXiv:2608.17014

"It just kind of shows that I went somewhere": An Exploratory Study of Fitness Data Visualization Sharing

Mara Solen, Thomas James Davidson, Emily Wall, Tamara Munzner

原文摘要

The sharing of curated fitness data posts occurs frequently on fitness-focused social platforms such as Strava and on general social media platforms such as Instagram, which is a novel context for visualization. To better understand the process of sharing and designing fitness data posts, as well as the role of visualization within them, we conduct 18 semi-structured interviews with fitness data sharers. From our thematic analysis of the data, we find three novel characteristics for visualization through our study of fitness data sharing: (i) the role of visualization as proof, (ii) the tension between individuality and conformity, and (iii) the complexity of design decisions with regards to effort and desire to share. We also discuss a set of design implications, including a need for more options for visualizations for activities without routes, more user control in fitness data sharing platforms, and maintained ease of use while increasing customization options.

cs.HC · cs.CY

版本更新 · v4arXiv:2507.02976

How Safe Are AI-Generated Patches? A Large-scale Study on Security Risks in LLM and Agentic Automated Program Repair on SWE-bench

Amirali Sajadi, Kostadin Damevski, Preetha Chatterjee

原文摘要

Large language models (LLMs) and agentic frameworks are increasingly used for development tasks such as automated program repair (APR). Prior work has identified security risks in LLM-generated code, but most studies focus on synthetic, simplified, or isolated tasks. We present a large-scale security analysis of LLM-generated patches using 20,000+ GitHub issues from SWE-bench. We evaluate developer-written patches, two standalone LLMs (Llama 3.3 Instruct-70B and GPT-5.4 nano), and four agentic frameworks (OpenHands, AutoCodeRover, HoneyComb, and SWE-agent). We also analyze code, issue, and project-level factors associated with insecure patches. Under our evaluated SWE-bench setup, Llama 3.3 introduced 135 manually confirmed vulnerabilities across the train and test sets, compared with 12 in developer-written patches for the same issues. On the SWE-bench test set, GPT-5.4 nano introduced 3 vulnerabilities compared with 2 in developer patches. All four evaluated agentic frameworks also introduced vulnerabilities. OpenHands had the highest retained count, with 44 vulnerabilities across 11 issue instances. Vulnerabilities are associated with broader code modifications and with issues missing specific information. These results suggest that APR systems require proactive risk assessment methods that consider both generated code and issue context.

cs.CR · cs.LG · cs.SE

版本更新 · v2arXiv:2603.19461

Hyperagents

Jenny Zhang, Bingchen Zhao, Wannan Yang, Jakob Foerster, Jeff Clune, Minqi Jiang, Sam Devlin, Tatiana Shavrina

原文摘要

Self-improving AI systems aim to reduce reliance on human engineering by learning to improve their own learning and problem-solving processes. Existing approaches to self-improvement rely on fixed, handcrafted meta-level mechanisms, fundamentally limiting how fast such systems can improve. The Darwin Gödel Machine (DGM) demonstrates open-ended self-improvement in coding by repeatedly generating and evaluating self-modified variants. Because both evaluation and self-modification are coding tasks, gains in coding ability can translate into gains in self-improvement ability. However, this alignment does not generally hold beyond coding domains. We introduce \textbf{hyperagents}, self-referential agents that integrate a task agent (which solves the target task) and a meta agent (which modifies itself and the task agent) into a single editable program. Crucially, the meta-level modification procedure is itself editable, enabling metacognitive self-modification, improving not only the task-solving behavior, but also the mechanism that generates future improvements. We instantiate this framework by extending DGM to create DGM-Hyperagents (DGM-H), eliminating the assumption of domain-specific alignment between task performance and self-modification skill to potentially support self-accelerating progress on any computable task. Across diverse domains, the DGM-H improves performance over time and outperforms baselines without self-improvement or open-ended exploration, as well as prior self-improving systems. Furthermore, the DGM-H improves the process by which it generates new agents (e.g., persistent memory, performance tracking), and these meta-level improvements transfer across domains and accumulate across runs. DGM-Hyperagents offer a glimpse of open-ended AI systems that do not merely search for better solutions, but continually improve their search for how to improve.

cs.AI

版本更新 · v2arXiv:2601.16955

3D Molecule Generation from Rigid Motifs via SE(3) Flows

Roman Poletukhin, Marcel Kollovieh, Eike Eberhard, Stephan Günnemann

原文摘要

Three-dimensional molecular structure generation is typically performed at the level of individual atoms, yet molecular graph generation techniques often consider fragments as their structural units. Building on the advances in frame-based protein structure generation, we extend these fragmentation ideas to 3D, treating general molecules as sets of rigid-body motifs. Utilising this representation, we employ SE(3)-equivariant generative modelling for de novo 3D molecule generation from rigid motifs. In our evaluations, we observe results competitive with state-of-the-art bond-implicit methods, surpassing them in atom stability on GEOM-Drugs, while yielding a 2x to 10x reduction in generation steps and 3.5x compression in molecular representations compared to standard atom-based methods. We release our code at https://github.com/rpoletukhin/MotiFlow.

cs.LG

版本更新 · v3arXiv:2511.00917

MAESTRO: Orchestrating Robotics Modules with Coding Agents for Zero-Shot Generalist Robots

Junyao Shi, Rujia Yang, Kaitian Chao, Selina Bingqing Wan, Yifei Shao, Jiahui Lei, Jianing Qian, Long Le 等 12 位作者

原文摘要

Today's dominant route to generalist robots scales robotics data to train end-to-end policies. We instead use a vision-language model (VLM) as a coding agent that writes robot programs using a curated library of perception, planning, and control tools. MAESTRO's orchestration harness packages multi-step perception and action procedures into callable tools and guides their use through a plan-act-replan loop, using visual and execution feedback to verify outcomes and recover from failures. With this tool library and harness, MAESTRO matches or surpasses state-of-the-art vision-language-action (VLA) models zero-shot in our tabletop comparison and performs diverse mobile manipulation tasks, without collecting new teleoperation data or invoking a VLA tool. Ablations show that expanding the tool library improves average task progress with the full harness, while adding tools without it does not reliably improve progress. Case studies illustrate MAESTRO's potential for autonomous code improvement across trials, faster execution with VLA tools, and automatic robot data generation. We show that expanding robotics tool libraries together with their orchestration harnesses offers a complementary route to general-purpose robots alongside scaling end-to-end robot training data. Project site: https://maestro-robot.github.io. Code: https://github.com/penn-pal-lab/maestro.

cs.RO · cs.AI

版本更新 · v2arXiv:2505.22909

Learning to Charge More: How Q-Learning Firms Lock In Supracompetitive Prices

Cristian Chica, Yinglong Guo, Gilad Lerman

原文摘要

There is growing experimental evidence that $Q$-learning agents can learn to charge supracompetitive prices. We ask when such behavior persists, whether it emerges, and which strategies support it. In a repeated pricing game in which firms condition on the previous period's price profile, we give conditions on the learned action values under which supracompetitive prices become an absorbing state once experimentation ends. We then show that under softmax exploration these conditions are reached with positive and explicitly bounded probability, both from a random and from an all-zero initial $Q$-table. In the latter case firms lock in supracompetitive prices because they never learn that undercutting pays; the same mechanism can lock in the competitive price, so the long-run outcome is selected by the exploration path. Finally, we give sufficient conditions on the learned table under which the induced strategy is naive collusion, a grim trigger strategy or an increasing-price strategy; grim trigger strategies are subgame perfect under a standard discounting condition, whereas naive collusion is generally not an equilibrium.

econ.GN · cs.AI · cs.GT

版本更新 · v2arXiv:2606.06252

Can Test-Time Reconstruction Close the Loop on Latent Reasoning?

Xiaopeng Yuan, Haibo Jin, Ye Yu, Peng Kuang, Lijun Yu, Yushun Dong, Haohan Wang

原文摘要

Recent work moves intermediate reasoning from natural-language traces into latent or cache-level representations to reduce token overhead and avoid a discrete communication bottleneck. However, this shift also removes a key advantage of textual reasoning: intermediate states are no longer inspectable, making it difficult to determine whether a latent state still preserves the constraints of the original query. As a result, latent reasoning typically operates in an open loop, where a latent state is produced and consumed without an input-anchored fidelity check. We propose ReLAT (Reconstruction-Guided Latent Reasoning At Test Time), a self-supervised test-time training method that closes this loop using the query itself as the reference. Our key observation is that if a latent state faithfully represents a query, the query should be recoverable from it; if the query cannot be recovered, the latent state has lost task-relevant information. ReLAT operationalizes this principle by constructing a differentiable Question -> Latent Thought -> Question cycle and optimizing query reconstruction loss through the latent thought before answer generation. This anchors opaque latent computation to the problem specification it is supposed to represent. Across mathematical reasoning, knowledge QA, and code generation benchmarks on the Qwen family, ReLAT consistently improves over single-model inference, text-based collaboration, open-loop latent collaboration, and alternative test-time training objectives. On Qwen3-8B, ReLAT raises AIME 2024 accuracy from 56.7% to 73.3%, a 16.6-point gain over the strongest open-loop latent baseline.

cs.AI

版本更新 · v2arXiv:2610.09401

Can the Library Speak? Self-Advertised Method Selection for Formal Proving

Xiaopeng Yuan, Suijin Wang, Yanli Wang, Haibo Jin, Peng Kuang, Jerry Wang, Lijun Yu, Haohan Wang

原文摘要

LLM-based formal provers can retrieve relevant lemmas and prior proofs, but relevance alone does not say whether a mathematical method can be used on the current theorem. A method has prerequisites, a target, an intended action, and obligations that its use leaves to prove. Methods that look equally related to a theorem may therefore differ substantially in whether they offer a plausible next step. We formulate this as an applicability-aware method-selection problem and introduce self-advertisement: before candidates are ranked, a model generates a problem-specific proposal for each one, stating what part of the goal it targets, what action it would take, and what conditions that action requires. We organize 82 reusable methods from Putnam 2000-2014 as Method Contracts, which pair applicability descriptions with Mathlib anchors, a checked example or scaffold, and expected proof obligations. A single batched call elicits proposals across the library; vague or unsupported proposals are demoted, yielding a ranked shortlist accompanied by inspectable claims about each candidate's use. We analyze when similarity-based representations cannot distinguish methods with different applicability, how errors in applicability estimates affect shortlist quality, and what a checked scaffold guarantees under its stated assumptions. Against lexical, embedding, and embedding-plus-LLM reranking baselines, self-advertisement achieves 95.0% hit@5 on Putnam 2015-2025, compared with 84.2% for the strongest reranker. On IMO ProofBench, it achieves 91.7% compared with 88.3%. These results indicate improved coverage of annotated methods in the retrieved shortlists, particularly on Putnam.

cs.AI

版本更新 · v2arXiv:2604.15901

Scalable Deterministic Task Offloading and Resource Allocation in the IoT-Edge-Cloud Continuum

Keyvan Aghababaiyan, Baldomero CollPerales, Javier Gozalvez

原文摘要

Future 6 G networks are envisioned as a network of networks (NoN) ecosystem, integrating communication and computing resources across multiple domains. At the deep edge, IoT and end-user devices will form subnetworks for local communication and distributed task processing. These subnetworks will seamlessly integrate into the NoN ecosystem, creating an IoT-edge-cloud continuum. The unified resources across this continuum facilitate dynamic and scalable task offloading, unlocking new possibilities to support emerging services, including critical vertical services with stringent reliability and deterministic service level requirements. In this context, this paper demonstrates that a deterministic approach to task offloading and resource (communication and computing) allocation in the IoT-edge-cloud continuum not only ensures deterministic service levels but also enhances scalability compared to existing task offloading and resource allocation methods. By flexibly managing task completion deadlines while maintaining deterministic (i.e. bounded latency) service levels, deterministic policies achieve a more balanced workload and resource distribution across the continuum, ultimately improving scalability.

cs.NI

版本更新 · v3arXiv:2601.16724

Mitigating Bias in Automated Essay Scoring for ESL Learners via Contrastive Learning

Kevin Fan, Eric Yun

原文摘要

Automated Essay Scoring systems disproportionately penalize high-proficiency English as a Second Language (ESL) learners. We propose Contrastive Learning with Matched Essay Pairs (CL-MEP), a bi-directional alignment strategy. CL-MEP reduces this scoring bias by 39.9% while improving overall accuracy, successfully disentangling valid syntactic complexity from surface-level grammatical errors.

cs.CL

版本更新 · v2arXiv:2606.16972

When Should a Robot Replan? Regret-Guided Update Scheduling in Time-Varying MDPs

Negin Musavi, Gokul Puthumanaillam, Ruben Hernandez, William Schafer, Melkior Ornik

原文摘要

Robots operating in non-stationary environments must continually adapt their policies as the dynamics drift, but onboard energy and compute budgets cap how often a full state estimation and re-planning step can be performed. This raises a question: \emph{when}, along a horizon, should a robot spend its limited budget? We formulate this problem in time-varying Markov decision processes (TVMDPs) with a known bound on the rate of transition drift. We model execution as a \emph{skip-update} scheme in which, at chosen update times, the agent estimates the transition kernel by maximum likelihood and computes a finite-horizon policy, and between updates reuses this policy under a propagated state estimate. We analyze the dynamic regret of this scheme and show how it grows during skip intervals in terms of the properties of the TVMDP and the skip lengths; the resulting bound answers the opening question via an online, regret-guided update rule that allocates the budget adaptively. We evaluate the rule in a simulated Mars-rover navigation task with time-varying slip dynamics and on a Crazyflie quadrotor in indoor obstacle fields. Adaptive allocation outperforms other budgeted baselines.

cs.RO · eess.SY

版本更新 · v3arXiv:2606.28449

Establishing the Minimal Clinically Important Difference (MCID) for Smartphone-Derived Gait Measures in Multiple Sclerosis

Mike D Rinderknecht, Bernhard Fehlmann, Dimitar Stanev, Cedric Simillion, Ernst Bos, Letizia Leocani, Agne Kazlauskaite, Gary Cutter 等 10 位作者

原文摘要

Background: Digital health technologies allow for frequent, remote gait monitoring in people with multiple sclerosis (MS). However, to differentiate daily variability from actual disease progression in longitudinal data, established minimal clinically important differences (MCID) are required. Currently, there is limited literature defining these thresholds for digital gait metrics. Objective: To establish MCIDs for digital gait measures reflecting progression in MS. Methods: Digital gait measures were captured via daily, remote, smartphone-based Two-Minute Walk Tests in CONSONANCE (NCT03523858), a phase 3b study of ocrelizumab in progressive MS. Using an anchor-based approach, median changes from baseline at Week 96 on digital gait measures were computed for patients showing clinically meaningful worsening on either Timed 25-Foot Walk, Ambulation Score, Expanded Disability Status Scale, or 12-item Multiple Sclerosis Walking Scale. These changes were subsequently triangulated to derive the MCID estimates. Results: 243 patients with progressive MS (female: n=125 (51%); mean [SD] age: 49.3 [9.3]; mean [SD] EDSS: 4.8 [1.4]) had digital gait data available at baseline and Week 96. Median changes were generally consistent across anchors. Triangulated MCIDs are: Step Velocity = -0.16 m/s, Step Velocity Scaled to Walking Time = -0.18 m/s, Step Duration = 0.06 s, Step Length = -0.07 m, Total Number of Steps = -28, and Total Distance Walked = -24 m. Conclusion: These MCIDs provide a framework for interpreting meaningful gait changes and integrating digital measures into MS outcome evaluation. Beyond facilitating novel clinical trial endpoints to evaluate treatment efficacy, they enable objective, real-world monitoring to advance personalized patient care.

q-bio.QM · cs.CV · physics.med-ph

版本更新 · v2arXiv:2610.21270

Auditing Escalation Reliability in Healthcare LLM Agents: A Perturbation-Controlled Benchmark of Workflow-State Failures

Zihao Zheng, Junyi Yao, Baichuan Li, Jiayu Long

原文摘要

Trustworthy biomedical AI requires reliable action selection when evidence is missing, stale, conflicting, or late, not only accurate answers on static inputs. We instantiate an episode-level evaluation protocol as 400 synthetic healthcare workflow episodes: 40 hand-authored semantic seeds across four task classes, two surface parameterizations, and five controlled variants, scored on ANSWER/ASK CLARIFICATION/ABSTAIN/ESCALATE under a pre-declared 5:1 missed-versus-unnecessary escalation cost. Reference actions are single-author study-policy labels, not clinician-adjudicated ground truth. Across five open-weight configurations (1.7B--9.7B), clean decision accuracy reaches 0.97, yet uncertainty-prompted models miss 32--97% of required escalations. The stronger 9.7B configuration narrows but does not remove the gap, falling from 0.97 clean accuracy to 0.78 under conflict. Verbalized confidence is inconsistent (ECE 0.10--0.54; failure AUROC 0.48--0.77), and a development-tuned confidence-only policy yields no utility gain. A transparent workflow-aware controller improves 5:1 utility for every model and reduces missed escalations to 0.12--0.24, at specificity 0.83--0.93. However, a 30-concept lexical stress test reduces each rule detector's recall from 1.00 on trigger phrases to 0.00 on unseen paraphrases, limiting the controller claim to this benchmark. Seed-clustered statistics, ablations, cross-task transfer, raw outputs, and manifests are packaged for audit. The results motivate explicit workflow-state evaluation while showing that apparently effective routing controls need their own generalization tests.

cs.AI · cs.CL

版本更新 · v2arXiv:2609.13235

Pose accuracy is not grasp reliability: residual pose posteriors improve simulated robotic grasp planning

Md Selim Sarowar, Sungho Kim

原文摘要

Model-based robotic grasping estimates an object's six-dimensional (6D) pose and plans on its mesh as if that pose were exact. We show that this assumption reduces simulated grasp success even when the pose passes the standard accuracy test. We built LM-Grasp, a benchmark of 15{,}800 real LINEMOD RGB-D images with grasp outcomes simulated on scanned meshes. FoundationPose meets the ADD(-S) criterion (mean model-point error below 10\% of the object diameter) on 0.997 of test scenes, yet planning on its estimate succeeds in 0.791 of scenes, compared with 0.856 using the annotated pose. Because the estimator reports no uncertainty, we build a pose posterior from its own errors on annotated training frames, resampled from frames with similar observable fit, and score each grasp by its mean success across sampled poses and four equally weighted physics scenarios. Without retraining the estimator, posterior planning yields 0.859 (difference from the annotated-pose result +0.003; 95\% scene-wise paired-bootstrap interval [$-$0.003, +0.009]). This interval is compatible with no difference and a small shortfall; we did not conduct an equivalence test. For pose errors of 5 to 10\% of the diameter, simulated success rises from 0.796 to 0.984. Among test scenes assigned singleton-success conformal prediction sets, observed held-out precision is 0.972, compared with 0.904 for the point-estimate planner; these are empirical precision estimates, not conditional guarantees. On occluded LM-O scenes never used for tuning, posterior planning closes 66\% of the gap to the annotated pose.

cs.RO · cs.CV

版本更新 · v2arXiv:2610.13249

CALQA: Conformal Screening of Forecast-Ensemble Configurations from One Mergeable State

Xiufeng Liu, Ruyu Liu, Yusen Liu, Huan Huo, Per Sieverts Nielsen

原文摘要

AutoML systems fit ensemble weights over model libraries; a search can score, per category, market or time pane, thousands of weightings of the quantile-averaged (Vincentized) ensemble for the narrowest conformally calibrated interval; exact calibration scores a group's rows per candidate. We present CALQA, a fixed-size integer aggregate per group and pane that stores histograms of normalised block scores at a net of weight vectors. One GROUP BY builds it; it merges by addition, retracts deletions by subtraction and scores any candidate without reading a row. We prove that its score never falls below the exact split-conformal shift and exceeds it by at most the net distance plus a grid gap; that coverage carries over to each fixed weight vector and, for i.i.d. blocks and up to a union-bound slack, to a searched weight vector deployed with the state's shift; and how small any such state can be. The state is thus a screen: it ranks all candidates, and exact recomputation re-checks the top 100. On five public panels (604 groups, 10,000 candidates each) this two-stage plan matches exact search on held-out blocks (99.95% of its Winkler score), 1.3-59 times faster. On two real panels of about $10^8$ rows (smart meters, retail sales) it is 44-54 times faster at 99.98-100.01% of that score and beats sample screens with the same re-check in regret at less total time. Picks deployed with their exact shift need a held-out coverage check. The state does not pay off for small or greedy searches, off-net weights at ample memory or full twelve-member support.

cs.DB

版本更新 · v2arXiv:2602.10030

Optimal PRGs for Low-Degree Polynomials over Polynomial-Size Fields

Gil Cohen, Noam Goldgraber

原文摘要

We construct the first pseudorandom generator (PRG) with optimal seed length for degree-$d$ polynomials over fields of size $q \approx d^4$, with no restriction on the characteristic. This improves on the construction of Dwivedi, Guo, and Volk (RANDOM 2024), which requires fields of size exponential in $d$ and sufficiently large characteristic, and on that of Derksen and Viola (FOCS 2022), which requires a field size that grows with the number of variables $n$. A recent breakthrough by Chattopadhyay, Hatami, Lee, Lovett, Tal, and Viola (ECCC 2026) gives a PRG over the binary field with seed length $\widetilde{O}(d^2\log^2 n)$, with subsequent work by Cohen (ECCC 2026) achieving seed length $O(d^4\log n)$. Both constructions use polarized random walks, and the current analyses incur at least a quadratic dependence on $d$. Our second result is a reduction that provides an alternative route to nearly optimal seed length over the binary field through improved constructions over larger fields. Specifically, we prove that, for any $δ\in (0,1)$, an optimal-seed PRG for degree-$d$ polynomials over fields of characteristic two and size $q \approx d^δ$ would yield a PRG over the binary field with seed length $O(d^{1/(1-δ)}\log n)$.

cs.CC

版本更新 · v2arXiv:2602.17111

Instructor-Aligned Knowledge Graphs for Personalized Learning

Abdulrahman AlRabah, Priyanka Kargupta, Jiawei Han, Abdussalam Alawini

原文摘要

Mastering educational concepts requires understanding both their prerequisites (e.g., recursion before merge sort) and sub-concepts (e.g., merge sort as part of sorting algorithms). Capturing these dependencies is critical for identifying students' knowledge gaps and enabling targeted intervention for personalized learning, especially in large-scale courses where instructors cannot feasibly diagnose individual misunderstanding. While knowledge graphs offer a natural representation for capturing these conceptual relationships at scale, existing approaches are either surface-level or disregard the rich pedagogical signals embedded in instructional materials. We propose InstructKG, a framework for automatically constructing instructor-aligned knowledge graphs that capture a course's intended learning progression. Given a course's lecture materials, InstructKG extracts significant concepts as nodes and infers learning dependencies as directed edges (e.g., "part-of" or "depends-on" relationships). The framework synergizes the rich temporal and semantic signals unique to educational materials (e.g., "recursion" is taught before "mergesort") with the generalizability of large language models. Through experiments on diverse lecture materials, human evaluation, and a prerequisite-learning benchmark, we demonstrate that InstructKG captures rich, instructor-aligned learning progressions.

cs.AI

版本更新 · v6arXiv:2505.00554

Protocols for Univariate Sumcheck

Malcom Mohamed

原文摘要

Two candidate approaches for univariate sumcheck over roots of unity are presented. The first takes the form of a multilinear evaluation protocol, which can be combined with the standard multivariate sumcheck protocol. The other consists of a direct reduction from univariate sumcheck to multilinear evaluation, which can be combined with Gemini (Bootle et al., Eurocrypt 2022). Optionally, natural round reductions from $m$ to $\log(m)$ are supported, while retaining linear prover time.

cs.CR

版本更新 · v2arXiv:2602.03550

Formal Evidence Generation for Assurance Cases for Robotic Software Models

Fang Yan, Simon Foster, Ana Cavalcanti, Ibrahim Habli, James Baxter

原文摘要

Robotics and Autonomous Systems are increasingly deployed in safety-critical domains, so that demonstrating their safety is essential. Assurance Cases (ACs) provide structured arguments supported by evidence, but generating and maintaining this evidence is labour-intensive, error-prone, and difficult to keep consistent as systems evolve. We present a model-based approach to systematically generating AC evidence by embedding formal verification into the assurance workflow. The approach addresses three challenges: systematically deriving formal assertions from natural language requirements using templates, orchestrating multiple formal verification tools to handle diverse property types, and integrating formal evidence production into the workflow. Leveraging RoboChart, a domain-specific modelling language with formal semantics, we combine model checking and theorem proving in our approach. Structured requirements are automatically transformed into formal assertions using predefined templates, and verification results are automatically integrated as evidence. Case studies demonstrate the effectiveness of our approach.

cs.SE · cs.FL · cs.LO · cs.RO

版本更新 · v2arXiv:2609.13136

From Review to Reuse: How Post-Task Workflow Can Support Human-AI Agent Interaction

Zekun Wu, Xinru Wang, Rock Yuren Pang, Chenglong Wang, Anna Maria Feit

原文摘要

AI agents can automate tasks by turning a single natural-language request into a multi-step process spanning tools, files, and applications. Users are often left to judge that process from fragmented execution information and the final output. To make the completed process easier to understand, validate, and reuse, we investigate post-task workflows: editable, graph-based representations of an agent's completed execution. We first analyzed 10,803 public workflow templates from n8n to characterize real-world automation practice, then developed Trace2Flow, a research probe that translates agent execution traces into interactive post-task workflows. In a study, participants (N = 20) reviewed agent executions with prompt or agent errors. We found that post-task workflows improved their understanding and error detection over a prompt-only condition, and that validation succeeded mainly when users cross-checked across multiple evidence sources. For follow-up tasks, adapting the workflow matched adapting the prior prompt in success, time, and difficulty, and was often preferred.

cs.HC

版本更新 · v2arXiv:2610.02534

TREMOR: Template Matching for Large Seismic Data Collections

Manos Chatzakis, Rodrigo Flores-Allende, Mikael Freire, Yoann Cano, Léonard Seydoux, Themis Palpanas

原文摘要

Seismic station networks continuously record the ground velocity at several locations on Earth in the form of waveform data series, which seismologists analyze to detect various kinds of geophysical events, including earthquakes. Then, template events are defined to search the seismic data collection for matching events. This is template matching, a fundamental task in seismology for various seismic analyses. However, template matching requires extensive processing time, especially for large seismic collections that exceed the memory capacity of a single machine. This poses a significant challenge in seismology, in particular with the increasing size of seismological datasets. In this paper, we introduce TREMOR, a distributed data series processing framework for template matching that efficiently handles large waveform collections. We apply TREMOR to two representative real-world seismic use cases. Through an extensive experimental evaluation, we demonstrate its efficiency, with TREMOR being up to 6.7x faster than the best competing method on each workload, and up to 18x faster than the fastest distributed version of MASS, an FFT-based method popular in seismology, while returning the same exact results.

cs.DB

版本更新 · v5arXiv:2504.20369

Perception-Augmented Databases for Effective Visual Analytics

Zafeiria Moumoulidou, Hamza Elhamdadi, Redwan Ahmed Rizvee, Ke Yang, Subrata Mitra, Cindy Xiong Bearfield, Alexandra Meliou

原文摘要

Analysts often use sampling in visual exploration to overcome the computational and perceptual bottlenecks of working with massive datasets. Yet, existing sampling methods optimize for statistical or geometric data properties, without explicit consideration for how humans perceive a visualization. We propose perception-augmented databases: a database framework that stores perceptual models of data as precomputed metadata and exposes a new query operator---perception-aware sampling---that selects subsets optimized for how humans visually perceive the result. We make the following contributions: (1) We introduce perception-augmented databases and design PAwS, a perception-aware sampling operator for scatterplot visualizations that leverages saliency maps---a computer vision tool for predicting areas of visual attention---combined with density and coverage objectives. (2) We design ApproPAwS: a fast approximate visualization method that works directly over a perception-aware compressed synopsis of the data, achieving up to 100x speed-ups with minimal loss in visual fidelity, and without accessing the underlying data at query time. (3) We contribute a perceptual similarity metric that evaluates the quality of a sample by comparing its saliency map to that of the original dataset, a novel evaluation methodology, applicable to any sampling method for scatterplots. (4) Our extensive experimental evaluation over datasets up to 3.5M points demonstrates that our methods consistently outperform five state-of-the-art sampling algorithms. A user study confirms that PAwS samples are preferred by humans, validating our quantitative findings.

cs.HC · cs.DB

版本更新 · v2arXiv:2608.02372

PredActBench: Benchmarking Tool-Augmented Dialogue under Controlled Tool Noise

Abdulrahman AlRabah, Xiaocheng Yang, Dilek Hakkani-Tür, Abdussalam Alawini

原文摘要

Large language model (LLM) agents are increasingly used to support decisions by calling external tools. Existing work on LLM tool-calling assumes these tools are perfectly reliable. However, in many applications, the tools are statistical predictors with non-trivial errors. We introduce PredActBench, a benchmark for evaluating dialogue agents that work with imperfect predictive tools, using education as a testbed. First, we build a benchmark in which LLMs work with noisy predictors to guide users' decisions. Second, we extend two prior metrics for trust calibration, Relative AI-Reliance and Relative Self-Reliance, to multi-turn dialogue. Third, we evaluate 13 LLMs on OULAD and our released PredAct-CS dataset of 60 courses with real final grades and synthetic weekly scores, alongside a human study involving 13 instructors and teaching assistants. We find that when tools are noisy, SOTA models rarely make predictor uncertainty visible to users, with our strongest baseline GPT-5.5 achieving an F1 of 57.2. As a result, users over-rely on incorrect predictions and unsupported claims, showing that task accuracy alone is not enough for AI decision support and agents must communicate when their tools may be wrong. We release PredActBench to support the development of LLM agents that help users calibrate their reliance.

cs.CL

版本更新 · v2arXiv:2609.38850

Beyond Outcome Rewards: Post-Rationale Distribution Optimization for Selective Prediction in Reasoning Models

Zhimin Gao, Meibo Hu, Jiamian Wang, Zhiqiang Tao, Pichao Wang

原文摘要

Reasoning models are trained to produce correct answers, yet selective deployment requires ranking which answers to accept or defer, and outcome-reward training does not directly optimize the post-rationale distribution used for that decision. We identify two mismatches: expected correctness is mode-seeking rather than distribution-eliciting, and scoring an average across rationales rewards disagreement unavailable to a single-rationale decision. We introduce Post-Rationale Distribution Optimization (PRDO), which applies a proper score to the answer distribution after each sampled rationale, without target rationales or separate confidence labels. Across four 0.6--3.8-billion-parameter models on MMLU-Pro, PRDO improves Brier score, error ranking and secondary accuracy relative to budget-matched, temperature-scaled GRPO. At 20\% realized error, oracle coverage rises by \npj{Q3a_vs_grpo.qwen3-0.6b.mp.oracle_cov@0.2.ppabs}--\npj{Q3a_vs_grpo.phi-4-mini.mp.oracle_cov@0.2.ppabs} percentage points, and ranking gains transfer to unseen tasks. Matched controls identify proper, per-rationale scoring as the active design choices, while verification tasks show the boundary: better selective ranking can coexist with lower full-coverage accuracy. Code is available at https://github.com/ZimmyGao/openjev-rlcd

cs.AI · cs.CL

版本更新 · v3arXiv:2606.05134

Activation-Based Active Learning for In-Context Learning: Challenges and Insights

Yaseen M. Osman, Geoff V. Merrett, Stuart E. Middleton

原文摘要

Deep active learning has previously been explored for LLM in-context sample selection, but not with methods that utilise recent advances in understanding of transformer activations. In this paper, we test the hypothesis that model activations could provide a fine-grained signal to optimise the selection of in-context examples. We present a comprehensive analysis of MLP activation-based deep active learning methods applied to in-context learning, including how different attention masking strategies impact active learning across diverse classification and generative datasets, using both Llama-3.2-3B and Qwen2.5-3B base models. However, we find a negative result: MLP and embedding layer outputs, viewed through the lenses of massive activations or the first four moments, do not correlate with example quality or task performance. Specifically, the absolute Spearman correlation coefficient is at most 0.33 for all tasks and models we tested, showing that such activation-based sampling should not be used for in-context learning. We hypothesise that this may be due to superposition, whereby models represent more features than they have dimensionality, suggesting that methods like Sparse Autoencoders (SAEs) may be a promising future direction.

cs.CL · cs.LG

版本更新 · v2arXiv:2609.27144

Learning Risk Scores Robust to Unobserved Confounders

Ryan Edmonds, Yingxiao Ye, Sina Aghaei, Andrés Gómez, Çağıl Koçyiğit, Phebe Vayanos

原文摘要

We consider the problem of learning risk scores to prioritize individuals for scarce resources or interventions, from historical observational data affected by unobserved confounding. Decisions about who receives scarce resources are often guided by risk scores based on recorded characteristics, such as responses to a survey. These risk scores are increasingly being learned directly from observational data: historical records of individuals' characteristics, allocation decisions, and outcomes. Standard methods such as inverse propensity weighting (IPW), which corrects for the bias introduced by the historical allocation policy, can be used to learn accurate risk scores if the historical decision process is fully explained by the recorded characteristics. In practice, however, historical decisions often depend on unrecorded information, causing learned risk scores to systematically under-prioritize exactly the individuals whose unrecorded circumstances drove past prioritization. We propose a method for learning risk scores that are robust to this kind of unobserved confounding, building on IPW. Since propensity weights cannot be reliably estimated under unobserved confounding, we instead treat them as belonging to an uncertainty set determined by the observable data and domain-informed estimates of the degree of confounding, combining sensitivity analysis from causal inference with Wasserstein distributionally robust optimization. The resulting robust risk score learning problem admits a sample-based approximation that we reformulate as an exponential cone program compatible with off-the-shelf solvers. We demonstrate the effectiveness of our approach on semi-synthetic data derived from datasets in the UCI Machine Learning Repository. Our method improves calibration by up to 29.2% over traditional benchmarks and up to 11.1% over the state of the art, without compromising other metrics.

cs.LG

版本更新 · v2arXiv:2602.02626

Learning Better Certified Models from Empirically-Robust Teachers

Alessandro De Palma

原文摘要

Adversarial training attains strong empirical robustness to specific adversarial attacks by training on concrete adversarial perturbations, but it produces neural networks that are not amenable to strong robustness certificates through neural network verification. On the other hand, earlier certified training schemes directly train on bounds from network relaxations to obtain models that are certifiably robust, but display sub-par standard performance. Recent work has shown that state-of-the-art trade-offs between certified robustness and standard performance can be obtained through a family of losses combining adversarial outputs and neural network bounds. Nevertheless, differently from empirical robustness, verifiability still comes at a significant cost in standard performance. In this work, we propose to leverage empirically-robust teachers to improve the performance of certifiably-robust models through knowledge distillation. Using versatile feature-space distillation objectives, we show that distillation from adversarially-trained teachers can significantly improve the performance of state-of-the-art certified training algorithms for ReLU networks on robust computer vision benchmarks.

cs.LG · stat.ML

版本更新 · v3arXiv:2511.17439

InTAct: Interval-based Task Activation Consolidation for Continual Learning

Patryk Krukowski, Jan Miksa, Piotr Helm, Jacek Tabor, Paweł Wawrzyński, Przemysław Spurek

原文摘要

Continual learning seeks to acquire new knowledge while preserving previously learned representations. Despite the success of prompt-based methods, they remain fragile in domain-incremental learning scenarios, where shifts in the input distribution cause representation drift in shared layers and lead to forgetting. We introduce InTAct, a method that preserves functional behavior in shared representations without freezing parameters or retaining past data. InTAct constrains updates within activation regions associated with prior domains, while allowing flexible adaptation elsewhere, thereby stabilizing neuron functionality rather than directly restricting parameter values. The approach is architecture-agnostic, integrates seamlessly with existing prompt-based frameworks, and matches or outperforms state-of-the-art methods on domain-incremental benchmarks.

cs.LG · cs.AI