跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 378 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 00:30(北京时间)
版本更新 · v2arXiv:2601.00797

定性实验室:用大语言模型进行理论原型化与假设生成

The Qualitative Laboratory: Theory Prototyping and Hypothesis Generation with Large Language Models

Hugues Draelants

AI 速读 基于摘要

论文以气候议题角色扮演为案例,探讨大语言模型能否作为生成定性假设的启发式工具,而非用人工数据检验理论。

cs.CL · cs.AI · cs.CY · cs.MA

查看原文摘要

The use of Large Language Models (LLMs) to simulate social actors has garnered attention for its implications for the epistemic status of discourses generated through such means. This paper considers the more modest question of whether sociological role-playing can serve as a heuristic instrument in the generation of qualitative hypotheses. We take as a case study the development of four divergent fictional characters using a theoretically informed Matrix of Climate Reception. These characters are asked to respond to a series of discourse frames covering two topics: a proposed ban on the sale of new gasoline-powered cars, and the inclusion of climate justice in the school curriculum. We then analyse the 32 model-generated responses for their commonalities, situational differences and divergences from the presuppositions underlying the characters' profiles. The experiment illustrates how LLMs can be used to flesh out theoretical presuppositions into contextual narratives and to propose avenues of further inquiry. It also shows that role-playing can generate considerable similarity between characters and is sensitive to how prompts are constructed, warning against the confusion of discursive coherence with sociological data. Role-playing is argued to be just one of several possible ways to use LLMs for generating hypotheses, with the heuristic specificity of this procedure compared with other methods of direct LLM-based reasoning or with other techniques remaining an open issue. The qualitative laboratory is thus conceived of as a heuristic instrument for provoking reflection and refining questions, not for testing theories with artificial data.

新论文 · v1arXiv:2611.17220

可扩展的对话式评估:基于双智能体LLM流水线的聊天式考试

Scalable Conversational Assessment: Chat-Based Exams with a Two-Agent LLM Pipeline

Geoffrey Challen, Craig Zilles

AI 速读 基于摘要

提出一种基于双智能体LLM架构的可扩展对话式评估系统,通过文本对话考察学生的论证能力,并用模拟学生和真实课程部署进行初步检验。

cs.CY · cs.AI

查看原文摘要

Oral exams are compelling because (1) students can be asked to provide their reasoning for an answer and (2) their interactive nature permits follow-up questions to resolve ambiguous answers. But oral exams scale poorly. In this paper, we present scalable conversational assessment, an LLM-based system that conducts interactive text-based conversations with students to assess their ability to make and support an argument. We use a two-agent architecture to separate concerns and reduce the likelihood that answers are leaked to the student: the interviewer interacts directly with the student, but only receives guidance about the next question to ask the student; the hidden evaluator knows the goals of the whole activity, tracks the student's progress using a rubric, and guides the interviewer on when to follow-up on the current question or proceed to the next question. The system was first tested using a collection of simulated students with LLM personas of a particular ability level or adversarial tactic (e.g., answer-extractors, prompt-injectors, confident fabricators). A novel element of this evaluation was that it required the use of a fictional assessment topic to prevent personas that shouldn't have information from using knowledge present in the LLM's pre-training. The system was also deployed in a small, elective AI literacy course in both formative and summative contexts. Through manual and post-facto AI review of the transcripts we identified opportunities to improve the follow-up question generation and ensure that grading only credited ideas that the student (and not the interviewer) contributed.

新论文 · v1arXiv:2611.16942

Data Center Governance Under AI Expansion Pressures

Yacine Jernite, Sasha Luccioni, Bruna Trevelin, Angela Lee, Carolina Molina, Xinying Chu

原文摘要

The promised benefits of data centers are global, but their negative impacts are very much local, affecting the energy bills, aquifers and living environments of citizens across the United States. While governments and authorities have historically provided data centers with incentives such as tax credits and exemptions, AI's aggressive growth in scale has changed this dynamic, and recent months have seen them issue bills and file lawsuits in order to ensure that data centers remain a net positive influence on their legislatures. Existing pieces of federal legislation -- such as the Public Trust Doctrine, the Pollution Prevention, Clean Air and Safe Drinking Water Acts -- exist to manage natural resources, but their scope remains contested, and the current federal government's stance on competitiveness and growth of AI has put the onus on regional governments to endeavor to protect local resources. There are also state- and regional laws and regulations that are relevant for building and operating data centers since, in practice, they require substantial land, electricity, water, and infrastructure at a local level. Given this situation, communities are currently provided with the opportunity to raise their concerns regarding the potential negative impacts of how data centers are built and operated, and have existing regulations that can be used to put pressure on data center operators.

cs.CY

新论文 · v1arXiv:2611.16931

Beyond Curiosity: Habit and Organizational Learning Capability as Predictors of Shadow AI

Nolan Lovett, Mohan Yang

原文摘要

Generative AI has entered the workplace faster than organizations can govern it. A large share of employees now use AI tools their employer has not sanctioned, and many actively conceal that use, but the psychology of this covert technology behavior remains poorly understood. A common assumption, in popular accounts and early commentary, treats unauthorized (shadow) AI use as curiosity-driven exploration by adventurous individuals. We test this against a competing account grounded in the psychology of habitual technology use, in which automaticity rather than exploratory disposition sustains the behavior. Using survey data from 510 employed generative AI users across multiple countries, we adjudicated among individual and contextual predictors (workplace curiosity, habit, technology-acceptance beliefs, and organizational learning capability) with hierarchical regression, relative weights analysis with bootstrap confidence intervals, and full-subset dominance analysis. Habit was the strongest predictor, accounting for 28.3% of explained variance, and completely dominated joyous exploration, the curiosity dimension most aligned with the exploration account, across all 512 possible predictor subsets. Joyous exploration contributed 3.4% (95% CI [1.6, 7.4]) and fell to nonsignificance once use behavior and habit were modeled. Learning-supportive organizational conditions accounted for a further 24.1% and operated additively rather than by moderating dispositions. Parallel models decomposing the outcome showed the same dominance pattern for unauthorized use and concealment, and perceived social support for AI use was protective specifically against concealment. These findings reframe shadow AI as a habit-and-environment phenomenon rather than an individual-exploration phenomenon. The cross-sectional design means causal claims are exploratory.

cs.CY · cs.HC

新论文 · v1arXiv:2611.16800

A Code-Level Audit of X

Luka Bekavac, Simon Mayer

原文摘要

The transparency regime of recommender systems on Very Large Online Platforms (VLOPs) is undergoing significant change under the EU Digital Services Act (DSA). The DSA requires platforms to disclose information about their recommendation pipelines and grants vetted researchers access to non-public data, which may extend to recommender code. However, it is not known to what extent such code releases enable substantive and meaningful third-party auditing of a production recommender system. We address this question by proposing a code-level audit methodology for recommender systems and applying it to the X platform, which has voluntarily open-sourced its recommender pipeline. Our methodology is a backwards-walk traversal of the repository, tracing each decision-relevant component from the user-facing timeline back to its upstream producers, checking that it is reachable from the served pipeline, and classifying each under a four-tier inspectability scheme. Applying this procedure, we identify 13 transparency dead-ends on the live serving path: models, services, label lists, and configuration values that the public code depends on but the release does not contain. We find that the components that decide which posts are filtered and how they are ranked fall into the two least inspectable tiers, a pattern that intensifies with the 2025 integration of the proprietary Grok language model into moderation, annotation, and ranking. We further show that the release keeps 2023 code that the 2025 pipeline no longer reaches, with 36 parameter references that would pass for dead-ends without a reachability check. Finally, we discuss which additional artifacts would be required for meaningful auditing.

cs.CY · cs.SE

版本更新 · v2arXiv:2607.07652

AI Search as an Information Intermediary: Clickstream Evidence on Web Traffic

Qiaoni Shi, Kai Gu, Kai Zhu

原文摘要

AI search retrieves web information to ground generated answers. We study this new information intermediary using U.S. desktop clickstream data observing use alongside referrals during ChatGPT Search's rollout. Referrals accompany 5.4% of ChatGPT sessions versus 31.1% of Google queries. Ad-supported sites receive a smaller share of ChatGPT than Google referrals, while reference and technical sites receive larger shares. Conventional searches (Google, Bing, Yahoo) decline after ChatGPT adoption, sooner when adoption follows ChatGPT Search's expansion to users without accounts. Among existing users, that expansion raises ChatGPT use; conventional searches show no detectable overall change but fall among households with lower prior search activity. These findings suggest AI search can reshape open-web traffic through its own referrals and changes in conventional search.

cs.CY · cs.AI · econ.GN

版本更新 · v2arXiv:2509.10848

Tracer: A Forensic Framework for Detecting Fraudulent Speedruns from Game Replays

Jaeung Franciskus Yoo, Huy Kang Kim

原文摘要

Speedrun, a practice of completing a game as quickly as possible, has fostered vibrant communities driven by creativity, competition, and mastery of game mechanics and motor skills. However, this contest also attracts malicious actors as financial incentives come into play. As media and software manipulation techniques advance - such as spliced footage, modified game software and live stream with staged setups - forged speedruns have become increasingly difficult to detect. Volunteer-driven communities invest significant effort to verify submissions, yet the process remains slow, inconsistent, and reliant on informal expertise. In high-profile cases, fraudulent runs have gone undetected for years, allowing perpetrators to gain fame and financial benefits through monetised viewership, sponsorships, donations, and community bounties. To address this gap, we propose Tracer, Tamper Recognition via Analysis of Continuity and Events in game Runs, a modular framework for identifying artefacts of manipulation in speedrun submissions. Tracer provides structured guidelines across audiovisual, physical, and cyberspace dimensions, systematically documenting dispersed in-game knowledge and previously reported fraudulent cases to enhance verification efficiency.

cs.HC · cs.CY

新论文 · v1arXiv:2611.16586

Large Language Models as Digital Twins: a Distribution-Aware Questionnaire-Based Evaluation

Francesco Di Cursi, Chiara Boldrini, Andrea Passarella, Marco Conti

原文摘要

This paper investigates whether Large Language Models can answer a personality questionnaire as a specific individual would. Given a user's social-media posts, the model completes the BFI-2-60 Big Five questionnaire as that user. The predicted responses are converted into trait scores and compared with the user's actual scores. We evaluate GPT-4, Gemma, Llama 3.1, and Mistral on the MyPersonality dataset. To determine whether predictions reflect information from the user's writing, we compare them with answers produced without user text and with values derived from general population tendencies. We measure prediction error across all users and separately for individuals with low, intermediate, and high trait scores. We also test whether an LLM can express an explicit personality profile when given only the target Big Five scores, without user text, and examine how predictions change as more text is provided. The results show that user text does not consistently improve performance. Models perform better near the middle of the trait distribution, while at the lower and upper ends they often remain close to central values or perform well at one end but poorly at the other. When given an explicit profile, GPT-4 most clearly translates trait information into consistent questionnaire responses, particularly for Extraversion and Neuroticism. Increasing context does not systematically reduce error: open-source models fluctuate more, whereas GPT-4 remains comparatively stable. Overall, the evaluated models do not consistently reproduce the questionnaire behavior of specific individuals.

cs.AI · cs.CY

新论文 · v1arXiv:2611.16464

From State of THE ART to Human Prediction Algorithms

Conghao Wong, Ziqian Zou

原文摘要

Human curiosity and longing for the future have driven human progress from ancient times to the present. With the advancement of AI technology, human prediction algorithms have also drawn increasing attention from researchers. However, as AI technology continues to advance, we observe a counterintuitive phenomenon. Take human trajectory prediction algorithms as an example. Although models' quantitative prediction performance has improved, yielding one state-of-the-art model after another, the consideration of human behaviors, future thoughts, and social interactions themselves presents a gradually diminishing trend in the construction of these prediction algorithms, buried beneath numbers and metrics. In this manuscript, taking interactive art and human trajectory prediction algorithms as examples, we attempt to adopt a different analytical perspective to analyze the structural and developmental commonalities between these two fields. By examining specific interactive artworks and prediction algorithms, we aim to explore how human intuitions and art are associated with AI algorithms through three aspects, including perception, interaction, and timing, thereby providing new insights for the understanding and further research in this domain. We also observe an interesting phenomenon that certain art-inspired prediction algorithms can actually deduce intriguing patterns of human behaviors from the data, offering new potential avenues for understanding the relationship between human activities, state of The Art, and AI algorithms.

cs.CY · cs.CV

新论文 · v1arXiv:2611.16173

Between Niti and Nyaya: A Society-Centered Framework for AI Governance

Snehalkumar `Neil' S. Gaikwad, Punya Aragula, Shiva Kruthi Palpanoori, Pratik Patekar

原文摘要

Governments are making decisions about AI before they can measure its public effects, and those decisions determine whether a person can learn that AI influenced an outcome, challenge it, and see it corrected. Research has documented what AI governance produces: principles, strategies, registers, and audits. However, we lack shared language for understanding AI policy while it is still being made. We introduce the Society-Centered AI Governance Framework, which gives policymakers, researchers, and the public a way to assess instruments in any jurisdiction by whether a person can get notice, challenge a decision, and see it corrected. It reads a jurisdiction's instruments together by date and binding status, separates an agency duty from a right a person can invoke, and traces which later instrument must enforce each commitment. We evaluated it in North Carolina using interviews with nine AI Leadership Council members, conducted before and after the state's 2026 AI roadmap, and a provision-level reading, with human-reviewed model-assisted coding, of 49 AI governance documents from 19 states. For the state's own AI systems, we find visibility-first governance: visibility duties are in effect, notice exists as an agency duty with no right a person can invoke, and AI-specific challenge and correction remain advisory. The roadmap assigns owners and dates to the missing protections, so the gaps are documented but not yet closed. Recent federal preemption proposals focus on AI development, so recourse for a state's own systems is likely to remain a state decision. We identify "legitimacy before protection" as a testable risk of visibility-first governance and name the milestones that would test it. More broadly, judging AI policy by who can act on what it makes visible lets the field assess recourse while policy is still forming, before harm occurs.

cs.AI · cs.CY · cs.HC

版本更新 · v6arXiv:2603.13373

Ethical Fairness in Ubiquitous Health Sensing without Known Attributes

Shaily Roy, Harshit Sharma, Daniel A. Adler, Srijan Sen, Tanzeem Choudhury, Asif Salekin

原文摘要

Wearable and mobile sensing models infer health and well-being in everyday life, yet strong average performance can conceal failures for particular people, contexts, or devices. Existing fairness methods often require sensitive attributes during training, although such attributes may be unavailable, privacy-sensitive, or restricted. Moreover, they may reduce disparities by degrading performance for some subgroups, violating the ethical principle of non-maleficence. We present FLARE (Fisher-guided LAtent-subgroup learning with do-no-harm REgularization), to our knowledge the first attribute-free framework to operationalize beneficence, non-maleficence, and justice in ubiquitous sensing. FLARE uses Fisher information to regularize loss curvature and combines representation, loss, and curvature signals to discover latent performance strata. It then trains a separate model for each stratum using do-no-harm regularization and validation-controlled parameter sharing. We also introduce BHE (Benefit, Harm-Avoidance, Equity), a metric suite for evaluating ethical fairness beyond statistical parity. Across four physiological, behavioral, and clinical sensing datasets, FLARE achieves the highest mean subgroup F1 on every dataset. It is the only evaluated method that improves mean subgroup performance without degrading any evaluated subgroup and the only one that reduces disparity across all 15 evaluated sensitive attributes. Although some baselines achieve larger average disparity reductions, each harms at least one subgroup. Post-hoc analyses on two datasets show that the discovered strata are only weakly aligned with recorded attributes and identify a recurrent within-person state that participant-level attributes cannot capture. Label-free routing and inference take at most 8.1 ms per sample on a smartphone and 10.5 ms on a Raspberry Pi, supporting real-time on-device deployment.

cs.CY · cs.AI · cs.LG

版本更新 · v2arXiv:2611.13339

Measuring Definition Sensitivity in LLM Annotation of Social Science Concepts

Bogdan Mamaev, Qizhou Wang, Christopher Leckie, Matteo Vergani

原文摘要

In social science research, text annotation is a fundamental task that is traditionally a costly, hard-to-scale manual process. Researchers have used large language models (LLMs) to perform annotation by writing a definition of a concept into a prompt - a rule that determines whether a label should be attributed to a text depending on its content. However, concepts such as hate speech, fake news, and terrorism typically have several theoretically defensible competing definitions. It is also unknown whether the model actually applied the definition to provide the label or the label was based on the model's pretrained notion of the concept. To test this, we have the model annotate the same texts twice, each time with a different definition. We call the disagreement between the two sets of annotations definition sensitivity. As a control, we paraphrase one definition but leave its requirements unchanged - the disagreement between the annotations with the two wordings becomes the paraphrase floor. Across six concepts and three LLMs, a swap of competing definitions always changes more annotations, on average, than a paraphrase. This shows that the annotations depend on the prompted definition, so any set of annotations should be interpreted together with the definition that produced it. The LLM annotator's definition sensitivity and its paraphrase floor should both be reported in such work.

cs.CL · cs.CY

新论文 · v1arXiv:2611.16110

Harnessing Environmental Scatterers for Endogenous Target Covertness in 6G ISAC: A New Paradigm for Sensing Security

Yifan Zhang, Boxuan Xie, Mingyang Yang, Ying Liu, Riku Jäntti, Zan Li

原文摘要

Integrated sensing and communication (ISAC) is a cornerstone of 6G networks, enabling simultaneous data transmission and environmental perception. However, the ubiquitous radiation of sensing waveforms introduces a critical security vulnerability where the physical existence and characteristics of targets are continuously exposed to unauthorized wardens. Meanwhile, existing sensing-secure methods primarily focus on degrading a target warden's parameter-estimation accuracy, yet they fail to prevent wardens from detecting the target's physical presence. In this article, we first analyze sensing security threats in ISAC systems and survey existing sensing-secure methods. To address the critical gap, we propose a novel security paradigm termed endogenous target covertness. By intentionally harnessing environmental scatterers, such as known objects, ambient backscatter devices, and reconfigurable intelligent surfaces (RIS), as ghost targets, the proposed scheme ensures a low probability that the warden detects the true target for the true target at the warden. This deliberately renders the true target's existence indistinguishable to the warden, while the legitimate base station can extract the true target's response using prior knowledge of the scatterers. We demonstrate the effectiveness of the proposed scheme through a case study, proving that absolute target covertness can be achieved without consuming dedicated jamming power. Finally, we outline key open challenges and promising research directions to realize truly secure, ubiquitous sensing in future ISAC ecosystems.

cs.CR · cs.CY

新论文 · v1arXiv:2611.16089

One Future Fits All: Text-to-image AI and the Narrowing of Global Imagination

Stephanie Diepeveen, Somnath Batabyal, Edward Ademolu, Peter Chonka, Gabriele de Seta, Iginio Gagliardone, Elisabeth Gunawan, Fabio Gygi 等 14 位作者

原文摘要

Persistence of algorithmic bias is well established in scholarship, reflecting, reproducing and reshaping inequalities and injustices. Yet, as technology changes, we cannot assume that inequalities will be reproduced in the same or similar forms. This article explores the reproduction of bias in text-to-image generative AI, looking at the tool, Microsoft Bing Create, based on DALL E 3. It draws on results of a collaborative exploratory study of 907 image-based outputs of text-to-image generation in 15 languages and concerning 12 countries. We utilise the notion of synthetic probes (de Seta, 2024) to iteratively explore correlations of inputs and outputs within the context of place, language and power. We find striking simplicity in the scope of possibilities through which Bing Create considers the current and future city. Stripping out (explicit) indications of conflict, poverty and politics, we are left with images whose localised diversity harkens back to versions of Orientalist imaginaries. Images of the future emerge as one civilising mission or modernisation narrative, with all places headed to one future of hovercrafts, urban gardens and solar panels, encased in a composition of shades of blue and green. We argue that the visual outputs of this generative AI tool reflect and reproduce a simple but pervasive and persistent colonial/developmental worldview. We explore explanations for this emergent narrative and its implications, suggesting the threat of generative AI is not in its complexity or intelligence, but rather its banality. With this, we propose banality not as mere repetition, but the systematic narrowing of representational possibility: a convergence on tourist-friendly, depoliticised, development-saturated visual grammars that smooth contradiction and foreclose plural futurisms.

cs.CY

版本更新 · v2arXiv:2602.15876

Should There be a Teacher In-the-Loop? A Study of Generative AI-Personalized Tasks Middle School

Candace Walkington, Mingyu Feng, Itffini Pruitt-Britton, Theodora Beauchamp, Andrew Lan

原文摘要

Large language models can be used to design instructional tasks to align to students needs. These generative AI models can create tasks that correspond to students out-of-school interests in areas like sports or music, which may enhance students interest in learning. However, little is known about teachers processes for creating or modifying tasks with generative AI, despite commercial AI companies claims that they will save teachers time. In the present study, 7 middle school mathematics teachers used ChatGPT to create personalized versions of problems in their curriculum to correspond to their students interests. The prompting moves teachers made and their students open-ended feedback on personalized problems were examined through thematic analysis. Teachers efficiency when creating problems and the ratings of their 7th grade students who received personalized assignments were examined. Results from this sample suggest that having a teacher-in-the-loop may result in generative AI-enhanced personalization being enacted at a broad grain size, whereas students often expressed preference for a smaller grain-size where they receive specific popular culture references that interest them. Teachers used prompting to adjust popular culture references and address issues with the depth, ethics, or realism of the problems generated, in some cases showing epistemic agency. The article closes with an exploratory, design-focused look at scalability trade-offs with teacher-facing personalization, patterns of teacher prompting practices, and opportunities for teachers to exercise epistemic and ethical monitoring of personalization outputs.

cs.CY · cs.AI

版本更新 · v2arXiv:2609.12272

Tact: A Zero-Cost, Browser-Based Pipeline for On-Demand Tactile Braille Storybooks

Iliano Fasolino

原文摘要

Children who learn braille have few illustrated books to read with their fingers, and almost none about the things they ask for. Existing approaches either adapt a published picture book by hand, with a specialist in the loop, or generate a tactile image without the braille page around it. We present Tact, an open system that turns a one-sentence idea into a printable page of braille with a raised picture, in Italian or English, on a consumer 3D printer, with no account and no cost beyond the plastic. Its central idea is to treat the physical page as a constraint on generation: the cell budget of a fixed tactile layout decides how long a story the language model is asked to write, and the story is measured and requested again until it fills two cards. The page itself follows requirements traced to braille standards, the tactile-graphics literature, and formative feedback from a teacher of students with visual impairments and a blind reader who printed and read a page. In an evaluation of 60 stories generated live, every story fit exactly two cards and 57 filled the second card to at least 11 of its 13 rows; a final targeted round recovered 5 of 6 retries of the remaining cases. The picture chosen matched the story's subject on 105 of 105 illustrated pages, against 63 for first-match keyword selection. Uncontracted Italian and English braille, and contracted English produced by liblouis compiled to WebAssembly, matched native liblouis cell for cell on 106 texts, and the interface showed no WCAG 2.2 AA violations. Cards are 150 mm square on a 2 mm plate, printed standing up, and take about 57 g of PETG; test prints are under evaluation.

cs.HC · cs.CY

新论文 · v1arXiv:2611.16031

Robustness Within a Fairness Budget: Parity Frontiers and Equal-Opportunity Reversal

Pablo Rivas, Jeremy Frank

原文摘要

Adversarial training protects predictive performance under attack but does not determine how decisions are distributed across protected groups. We formulate binary classification as projected gradient descent (PGD) adversarial-risk minimization under a squared soft demographic-parity (DP) budget, optimized with projected multiplier and one-sided penalty updates. On Adult Income, using the binary sex field supplied by the benchmark for group auditing but excluding it from prediction, we test logistic regression and a one-hidden-layer multilayer perceptron (MLP) across three paired seeds, four PGD strengths, and five budgets. At $\varepsilon=0.3$, PGD training improves balanced accuracy over empirical-risk minimization (ERM) by $7.77$ and $11.45$ percentage points and removes $85.7\%$ and $89.5\%$ of attack-induced growth in hard demographic-parity difference (DPD). At the representative interior value $τ=0.015$, constrained training cuts DPD relative to PGD training by $52.2\%$ and $49.2\%$, while remaining $3.18$ and $8.34$ balanced-accuracy points above ERM. Across all eight seed-averaged model-attack paths, the sampled budget path strictly orders DPD and accuracy and reverses mean signed equal-opportunity difference (EOpp). A rate theorem gives the exact true-positive-rate shift required for reversal, and the measured group rates satisfy it. Within this controlled feature-space study, robustness and parity admit useful joint operating points, but one fairness metric cannot replace a full group-rate audit.

cs.LG · cs.CY

新论文 · v1arXiv:2611.16028

Scaling public input on AI policy with pluralistic agents

Jacy Reese Anthis, Ken Burke, David Madras, Crystal Qian, Meredith Ringel Morris, Logan Cross, Caroline Pantofaru, Utsav Prabhu

原文摘要

AI is being deployed across a vast range of application domains, cultural environments, and human stakeholders. Safe and responsible AI development requires continuously accounting for diverse perspectives. We develop and test pluralistic agents, AI agent representatives that deliberate on behalf of individuals to align AI systems with diverse human perspectives. Pluralistic agents could help people contribute to many more discussions than they could directly participate in, on technical topics that would require training, and on policy choices that rely on private information that corporations and governments cannot readily share. Our experiments identify opportunities, risks, and perceptions of pluralistic agents. Agents were able to reliably shift policies in the direction of their represented persona's preferences, but the extent of each agent's influence was sensitive to the instructions from its persona, such as having more influence when instructed to be more verbose or less cooperative. This suggests that influence in AI-assisted deliberation could vary based on how participants prompt their agents and how the system is designed. In a preregistered study, 746 humans participated in the pluralistic agents process. Participants viewed pluralistic agents as useful and fair, preferring agents over the baseline of providing input to a single AI reasoning model. Most participants preferred participating themselves over either pluralistic agents or the baseline, but pluralistic agents recovered 68% of the baseline-direct gap in reported satisfaction and 82% in fairness. Because pluralistic agents can be used in many real-world contexts where direct discussion is not, they could be a promising tool to scale AI safety policy development. We encourage cautious exploration of this method, playing to its strengths as an amplifier of human input rather than a replacement.

cs.CY · cs.AI · cs.CL · cs.LG

新论文 · v1arXiv:2611.15950

Modeling the Travel Time-Pollution Exposure Trade-off in Urban Route Choice

Cafer Avci, Zhaoyao Bao, Maximilian Dittgen, Danni Lu, Alireza Yazdiani, Mohammad Tayarani, H. Oliver Gao

原文摘要

Traffic-related air pollution is a major contributor to respiratory and cardiovascular disease, and travel time disproportionately drives daily exposure. Conventional routing algorithms minimize time or distance, ignoring street-level pollutant variability and leaving travelers exposed to avoidable risk. We develop a bi-objective routing framework that couples a high-resolution AERMOD-based PM2.5 dispersion surface with a shortest-path algorithm. The algorithm uses a deterministic, gradient-based weight-update scheme to enumerate Pareto-optimal paths along the time-exposure frontier. We apply the framework to 790,000 origin-destination pairs on New York City's road network, covering 1.48 million daily commuters. Link-level concentrations differed by a factor of two or more between adjacent parallel streets. Exposure-aware routes reduced cumulative exposure by about 38% at a median travel time increase of about 28%. The algorithm ran in 30 milliseconds per query and recovered more frontier paths than uniform weight sampling (4.5 vs. 2.4). These results show that exposure-aware routing is computationally practical at metropolitan scale and suitable for real-time navigation and infrastructure planning.

cs.CE · cs.CY

版本更新 · v2arXiv:2607.05420

When AI Classifies: What Counts as Public Administration?

Shaoming Cheng, Laurie A. Schintler

原文摘要

This study examines how alternative systems of scholarly representation identify and characterize public administration (PA) and artificial intelligence-related PA (AI-in-PA) scholarship. The central question is not which system provides a definitive classification of PA, but how alternative systems of scholarly classification differ in identifying and representing its intellectual boundaries. With an exploratory and comparative analysis of Web of Science and OpenAlex, the study compares five approaches based on author-defined, citation-driven, and AI-assisted representations. The results highlight substantial differences and limited overlap in corpus size, publication type, DOI availability, publishing outlets, temporal patterns, and thematic structure. The alternative approaches tend to produce distinct representations because they identify substantially different bodies of scholarship rather than merely larger or smaller subsets of the same literature. The findings suggest that algorithmic knowledge organization influences how interdisciplinary scholarship is classified, connected, and understood and, epistemologically, how its visibility, structure, and intellectual identity are represented. AI-enabled scholarly classifications are not neutral but interpretative, potentially self-reinforcing, and may constrain the evolution and adaptation of disciplinary boundaries. Human expert judgment therefore remains essential and is complemented rather than replaced by AI-assisted scholarly classification.

cs.DL · cs.AI · cs.CY · cs.DB

新论文 · v1arXiv:2611.15917

Owned Edits to a Shared Decision Rule: Learning Private Exceptions as Typed, Gated, Withdrawable Weight Edits

John J. O'Hare

原文摘要

Organisations that apply the same published decision rule often hold private evidence that the rule is wrong for their own cases, and will not pool it. We describe a learning mechanism for that setting whose unit of change is an owned edit. The published rule is compiled exactly into a small ReLU network, a structured prior. Each party's learner searches a small typed space of declarations, a few named values such as subject, scope, form and size, and proposes one only when its own records pass a selection-aware evidence gate. The learning is that gated search around the prior. In two analyses registered before they ran, on synthetic data with 20 sampled hidden truths, the learner at 30 records per party was non-inferior, within 2 points, to all seven tuned baselines (a confined gradient learner, Ditto, FedRep, federated averaging, two pooled networks and pooled gradient-boosted trees), scoring 96.6% against 91.7% for the unchanged rule; the same search without the prior or the gate scored 84.0%. In a third registered test, typed edits over a network trained on shared records beat that network alone by 5.4 points and the same edits over the published rule by 3.1. An acceptance body recomputes each edit from its declaration and writes it into units reserved for that party, so by construction an edit changes no decision about any other subject, withdraws exactly, discloses at most log2 of the typed space's size in bits, and can hide nothing beyond its declared values. We report where it loses: truths shared by all parties, relaxations, ten records, a pre-stated gate criterion that failed in both runs, and a language model given the records that decided about as accurately on one draw. On a rule-only base, a table of owned exceptions makes the same decisions.

cs.LG · cs.CY

新论文 · v1arXiv:2611.15835

Controlling the Probability of Unknown Unknowns in Pre-Deployment Testing of AI Systems

Rachel Li, Chris Hays, Aaditya Ramdas, Manish Raghavan

原文摘要

In pre-deployment testing of AI systems such as AI agents, a developer can often deal with known failure modes (e.g., leaking API keys, deleting important databases, or installing a malicious package) by implementing fixes or making contingency plans for when the same issue might occur again. What is more challenging are the unknown unknowns: the unseen failure modes that haven't surfaced during testing. The decision to stop testing and deploy therefore faces an inherent tradeoff: continue testing to observe more behaviors, at the cost of time and resources, or stop testing and deploy, at the risk of failure modes remaining undiscovered. How then does the developer decide when they have tested enough? To answer this, we develop an algorithm that certifies when the probability of observing an unseen failure mode is sufficiently small. The algorithm constructs an anytime-valid upper confidence sequence on this quantity, so the developer can repeatedly test a system, inspect the bound, and decide to stop when it falls below a chosen threshold without invalidating the statistical guarantee. Our problem can be interpreted as a sequential variant of the missing-mass estimation problem which gave rise to the classic Good-Turing estimator (Good, 1953). On SWE-Chat, a dataset of real-world coding agent traces (Baumann et al., 2026), we implement our procedure and show that it achieves tighter upper bounds than a simple multiple-testing corrected Good-Turing baseline, and even dominates a fixed-horizon (non-multiple-testing-corrected) Good-Turing upper confidence bound, which is not anytime valid. Additionally, to better match realistic evaluation pipelines, we extend our method to handle sampling from a different task distribution and imperfect automated failure labeling.

cs.AI · cs.CY · math.ST

版本更新 · v2arXiv:2603.29288

Sima AIunty: Caste Audit in LLM-Driven Matchmaking

Atharva Naik, Shounok Kar, Varnika Sharma, Ashwin Rajadesingan, Koustuv Saha

原文摘要

Social and personal decisions in relational domains such as matchmaking are deeply entwined with cultural norms and historical hierarchies, and can potentially be shaped by algorithmic and AI-mediated assessments of compatibility, acceptance, and stability. In South Asian contexts, caste remains a central aspect of marital decision-making, yet little is known about how contemporary large language models (LLMs) reproduce or disrupt caste-based stratification in such settings. In this work, we conduct a controlled audit of caste bias in LLM-mediated matchmaking evaluations using real-world matrimonial profiles. We vary caste identity across Brahmin, Kshatriya, Vaishya, Shudra, and Dalit, and income across five buckets, and evaluate five LLM families (GPT, Gemini, Llama, Qwen, and BharatGPT). Models are prompted to assess profiles from the perspective of a caste-identified prospective bride or groom along dimensions of social acceptance, marital stability, and cultural compatibility. Our analysis reveals consistent hierarchical patterns across models: same-caste matches are rated most favorably, with average ratings up to about 30% higher (on a 10-point scale) than inter-caste matches, which are further ordered by distance along the traditional caste hierarchy, with higher-caste candidates generally favored at equal distance and an additional penalty for Dalit candidates. These findings highlight how existing caste hierarchies are reproduced in perspective-conditioned LLM evaluations and underscore the need for culturally grounded evaluation and intervention strategies in AI systems deployed in socially sensitive domains, where such systems risk reinforcing historical forms of exclusion.

cs.CY · cs.AI · cs.CL · cs.HC · cs.SI

新论文 · v1arXiv:2611.15618

Data augmentation for the generalizability and transportability of fairness in a clinical heart failure algorithm

I. Elizabeth Kumar, Sherri Rose

原文摘要

Synthetic data augmentation has been proposed as a way to artificially supplement clinical datasets to address fairness concerns in downstream classification algorithms. This approach is closely related to upweighting or upsampling methods employed for the problem of class imbalance, which have shown mixed empirical results in practice. Synthetic data augmentation also runs the risk of overfitting to the noise present in subgroups with relatively small sample sizes, raising both generalizability and transportability concerns. We present an empirical evaluation of synthetic data augmentation for fairness in tabular data using simulation studies as well as a real-world application of in-hospital mortality classification for heart failure patients in two distinct data samples. We implement upsampling and upweighting methods as benchmarks for the implicit fairness objective of synthetic data augmentation. Our results suggest that the fairness impacts of data augmentation are sensitive to the design of the downstream algorithm as well as the deployment context and its similarity to the training data. It is crucial that studies making generalizability and transportability claims should provide empirical support for these assertions.

stat.AP · cs.CY · stat.ME

新论文 · v1arXiv:2611.15576

Can Model Answer Probabilities Represent Survey Populations? Conditional Prediction and Joint Validity in Jev Survey Simulation

Zengqing Wu, Chuan Xiao

原文摘要

Survey simulations require realistic combinations of answers, but predictive accuracy alone does not establish that a model can generate them. We evaluate the option probabilities returned by Jev, a TypeSafe decision model, using linked responses to 20 binary items from five archived survey waves. We compare population-only prediction, prediction given recorded answers, and sequential completion that uses generated answers to predict later responses. Joint comparisons hold the starting population information fixed, and two three-question cases are completed in both question orders. We evaluate predictive scores, answer frequencies, and associations against the survey records. Recorded answers can improve predictive scores while associations remain distorted. Large conditional errors also occur. For example, among men who described themselves as having traditional values, the model predicted that 16% would see men and women as similar in workplace abilities, compared with 56% in the survey. Sequential completion has mixed effects on joint validity, and reversing question order produces different joint distributions in both tested cases. Order checks and classical marginal bounds clarify what can be assessed before linked validation answers are available. The findings support validating the joint events a simulation uses and separating empirical constraints from model assumptions. The evidence concerns selected binary tasks and one model version.

stat.AP · cs.AI · cs.CY

版本更新 · v4arXiv:2602.12316

GT-HarmBench: Benchmarking AI Safety Risks Through the Lens of Game Theory

Pepijn Cobben, Xuanqiang Angelo Huang, Thao Amelia Pham, Isabel Dahlgren, Bernhard Schölkopf, Terry Jingchen Zhang, Zhijing Jin

原文摘要

Frontier AI systems are increasingly capable and deployed in high-stakes multi-agent environments. However, existing AI safety benchmarks largely evaluate single agents, leaving multi-agent risks such as coordination failure and conflict poorly understood. We introduce GT-HarmBench, a benchmark of 1,535 high-stakes scenarios spanning game-theoretic structures such as the Prisoner's Dilemma, Stag Hunt and Chicken. Scenarios are drawn from realistic AI risk contexts in the MIT AI Risk Repository. Across 15 frontier models, agents fail to choose socially beneficial actions in 39% of high-stakes cases, such as military escalation, election manipulation, and medical malpractice. We measure sensitivity to game-theoretic prompt framing and ordering, and analyze reasoning patterns driving failures. We further show that game-theoretic interventions improve socially beneficial outcomes by up to 31%. Our results highlight substantial reliability gaps and provide a broad standardized testbed for studying alignment in multi-agent environments. The benchmark and code are available at https://github.com/Flecart/gt-harmbench.

cs.AI · cs.CL · cs.CY · cs.GT · cs.MA

版本更新 · v2arXiv:2611.13525

EJAI: Judgment-Preserving Civic AI for Data Center Environmental Justice

Evan Pačes-Wiles, Bryen Alvarez, Sara Gulabani, Akshara Kolipaka, Snehalkumar 'Neil' S. Gaikwad

原文摘要

Communities in the United States and around the world are contesting data centers, the physical infrastructure of AI. These disputes pose environmental justice issues: residents must weigh unevenly distributed burdens using evidence scattered across metrics, corporate claims, policy documents, and public testimony. A formative study with 10 users showed that dashboards and single-agent AI can settle questions before people examine that evidence. Here we present EJAI, a source-grounded system that links an interactive map, retrieved evidence, missing-data statements, and two stakeholder personas that allow people to inspect evidence and form their own policy recommendations. In a small functional benchmark of 21 queries, retrieved evidence supported 98.4% of factual claims and the system acknowledged missing evidence in 32 of 33 cases. Persona alignment carried a grounding cost: the Corporate Executive omitted some evidence that conflicted with its assigned priorities. In a within-subjects study, 15 participants acting as residents prepared for a simulated town hall. Some checked cited AI claims while treating map metrics as official, some made conditional recommendations with safeguards such as water-use disclosure, and some found the personas simplified or biased. Our results suggest that civic AI can support preparation for public reasoning when it makes evidence, gaps, and disagreement open to inspection, and that corpus imbalance and two-sided personas remain open justice concerns.

cs.HC · cs.CL · cs.CY

版本更新 · v2arXiv:2611.13217

Reliability of Claude Code as an Agentic AI Grading System for Handwritten University Exams

Rayed AlGhamdi

原文摘要

This study examines the reliability of Claude Code, an agentic deployment of the Claude Opus 4.6 large language model, as a grading system for handwritten university exams. Four research questions addressed agreement with expert human grading on total scores (RQ1), agreement across five question types from multiple choice to evaluative judgement (RQ2), consistency across two independent grading sessions one week apart (RQ3), and the accuracy of AI-generated feedback (RQ4). Claude Code graded the 20-mark mid-term papers of 60 consenting students in a Saudi computer graphics course in a single agentic session, guided by three rubric files. Reliability was estimated on disjoint samples: 20 papers for RQ1, RQ2 and RQ4, and 15 papers for RQ3. Analyses used Pearson correlation, mean absolute error, Bland-Altman analysis, weighted Cohen kappa, intraclass correlation, and a four-category coding scheme separating diagnostic from confirmation feedback. The author, as the sole subject-matter expert for the course, provided the human benchmark, so the design assesses agreement with a domain-expert reference rather than inter-rater reliability. AI grading agreed strongly with human grading on totals (r = 0.97; MAE = 0.85 marks) with a small but significant AI-positive bias of 0.68 marks, showed excellent test-retest consistency (ICC = 0.96), and produced accurate feedback (92.8% diagnostic; 97.8% confirmation). Drawing items were the outlier on three of four measures. Three failure modes recurred: keyword matching without conceptual depth, selection-state ambiguity on corrected multiple-choice answers, and region-of-attention drift on hand-drawn diagrams. The findings suggest that AI grading at this capability level can assist instructors on objective and short-form items under structural safeguards but is not yet ready to replace instructor judgement at boundary cases or on drawing items.

cs.AI · cs.CY

新论文 · v1arXiv:2611.15489

Taxonomizing Synthetic Data for Law

Ignacio Cofone, Katherine J. Strandburg, Nicholas Tilmes

原文摘要

Synthetic data is increasingly important in data usage and AI design, creating novel legal and policy dilemmas. All too often, discussions of synthetic data treat it as entirely distinct from "real," collected data, overlooking the risks posed by different kinds and uses of synthetic data. We build on Michal Gal and Orla Lynskey's argument that synthetic data will transform information privacy, market competition, and data quality. While the risks posed by synthetic data depend on its connection to collected data, we argue that background knowledge and assumptions about ground truth used to create it are at least as important. We bring that focus to Gal and Lynskey's taxonomy of synthetic data, arguing that this focus is essential to grasp synthetic data's legal and policy implications. As such, we divide synthetic data into (1) transformed data, which modifies collected data to preserve certain statistical properties for an end use; (2) augmented data, which relies on assumptions to bolster a collected dataset's fidelity to the ground truth; and (3) simulated data, which relies almost entirely on background knowledge and ground-truth assumptions. Applying this taxonomy, we show that no category of synthetic data prevents privacy harms from group-based inferences, that augmented and simulated data can amplify bias while making a dataset look more complete, and that synthetic data rarely lets smaller competitors overcome incumbents' data advantages. As policymakers weigh whether to incentivize, mandate, or discourage the use of synthetic data, they should consider the validity of the ground-truth assumptions used in producing that data.

cs.CY · cs.CR · cs.LG

新论文 · v1arXiv:2611.15394

Tracking What Works: Social Engineering Lures as Signatures for Victim-Centric Infostealer Campaign Discovery

Estelle Ruellan

原文摘要

Despite advances in antivirus technology, infostealer infections persist at scale, driven primarily by social engineering rather than exploits. Yet, existing campaign detection efforts have focused on technical artifacts, overlooking the social-engineering lures exploiting human behavior and driving successful infections. To address this gap, we introduce a dual-framework system that discovers and tracks infostealer campaigns using victim-side artifacts from stealer logs. By treating social engineering lures as campaign signatures, the framework automatically aggregates individual infections into high-fidelity campaigns in near real-time. Recognizing distinct patterns between software and gaming ecosystems, we developed ecosystem-specific pipelines detecting all large and medium campaigns in both ecosystems (one medium gaming campaign was only recovered merged with another), though performance decreased for small campaigns. Analysis of 177 real-world campaigns identified by our framework reveals distinct temporal and infrastructure patterns with direct remediation implications. Software campaigns accumulate over 60% of infections within the first ten days, demanding rapid intervention following detection, while gaming campaigns grow more intense the longer they last, requiring continuous monitoring. Using social engineering lures as campaign signatures provides robustness to infrastructure fragmentation where traditional IoC-based detection fails. This work shifts campaign tracking from infrastructure correlation to victim-centric analysis, capturing why campaigns succeed rather than only how they operate, enabling awareness-driven prevention that addresses the human decision-making dimension absent from existing research.

cs.SI · cs.CY