跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

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

Scaling Taxonomy-Free Image Labeling with Generative AI: A Multimodal

Zhenjie Zhang, Sainan Chen, Kshiteesh Hegde, Mengze, Li, Pouya Rezazadeh Kalehbasti, Munachim Ezema, Karina Sobhani

原文摘要

Providing real-time multimodal insights into images is challenging because it requires low latency, high description accuracy, and scalable solutions that are both cost-effective and efficient. For example, given a new image of an outfit, we would like to generate insights that the image depicts "earth tones" and "linen pants" and allow users to explore similar ideas along these themes. Traditional strategies to generate such insights would typically involve building taxonomies producing a golden set labeled by humans, training models on these datasets, and deploying these models for online inference services. Such workflows are constrained by fixed taxonomy, high labeling cost, limited labeling coverage in sample space, and human errors and expertise gaps in labelers. In addition, these methods are expensive and cumbersome to iterate over time. Recent trends have started exploring generative AI models for online insights, but this method suffers from long latency and prohibitive costs to support a high volume of requests or large amounts of offline labeling needs. We present Generative Labeling On Clusters (GLOC) as a solution to provide highly scalable, cost-effective, low latency, and high accuracy online image insight services. GLOC leverages highly optimized image embeddings to form image clusters that are semantically close to each other for the purpose of the type of insights, and summarizes the insights at the cluster level, which effectively generalizes to members in the cluster. At Pinterest, GLOC powers image descriptors and pivot query suggestions for Hybrid Search, which is a multimodal search service enabling users to search with both an image and a text query. Our offline and online A/B tests demonstrate that GLOC significantly outperforms previous methods, delivering improvements in quality and efficiency.

cs.LG · cs.IR

新论文 · v1arXiv:2611.12681

National-Scale Crop Type Mapping in Morocco Using Google AlphaEarth Foundations Embeddings and the Fields of the World Field Boundary Map

Walid Elbarz, Mohamed Bourriz, Vincent Simonneaux, Hamd Ait Abdelali, François Bourzeix

原文摘要

Recent geospatial foundation models have introduced a new paradigm for large-scale Earth observation by providing pretrained embedding representations that can be directly exploited for downstream tasks. In this work, we investigate the use of Google AlphaEarth Foundations embeddings for national-scale crop type mapping in Morocco. The proposed workflow operates directly on publicly available 64-dimensional pretrained embeddings using lightweight downstream classifiers, eliminating the need to process raw satellite imagery during model training and inference. The approach targets three crop categories, namely winter cereals, tree crops, and other crops. For nationwide inference, the Fields of the World global field boundary map is used to constrain predictions to agricultural parcels, enabling efficient large-scale mapping. Experimental evaluation on an independent test set over ten repeated runs achieved an average classification accuracy of (87.17 +/- 0.42%). Nationwide inference over Morocco was completed in approximately five hours, with the dominant computational cost arising from cloud-based retrieval of the embeddings rather than model execution. These results demonstrate the potential of pretrained embedding representations for computationally efficient national-scale crop type mapping.

cs.CV

新论文 · v1arXiv:2611.12604

Double Blind Evals: Resolving the Dual Confidentiality Dilemma in AI Safety Auditing

Andrew Trask, Sol Messing, Vai Pahwa, Pegah Maham, Rene Kolga, Austin Frantz, Andrew Tash, Kate Thomas 等 30 位作者

原文摘要

AI safety evaluations often involve sensitive prompts and proprietary models. Evaluators want to keep their evaluation prompts secret from model owners to prevent purposeful or incidental data leakage, ensuring longer usefulness of their benchmark. Model owners in turn wish to keep their proprietary model weights and inference code within their own secure infrastructure to protect their IP. We present a way forward for "double-blind evals", which provide cryptographic guarantees that an evaluator's prompts are not shared with the model owner, while simultaneously maintaining the confidentiality of the model weights and inference code. To accomplish this, we use secure enclaves that encrypt data in RAM at the hardware level. In a world-first pilot, we test this approach by evaluating a proprietary Google DeepMind model (Gemini 2.5 Flash Lite) against a selection of the private AILuminate benchmark corpus, using an NVIDIA H100 secure enclave on Google Cloud Platform, and using OpenMined's PySyft to maintain data and model privacy. We believe this effort marks the first use of this technology to provide mutual secrecy for one organization's frontier-class proprietary model weights and another organization's closed benchmark.

cs.CR · cs.AI · cs.LG

版本更新 · v2arXiv:2610.19730

Design and Analysis of Temporal Representations in Neural Networks

Alban Colas-Gattepaille, Alexandre Muzy

原文摘要

Neural networks, spiking or not, compute with amplitudes: activation values, spike counts, firing rates, never event times. No measure exists of how much a network uses time. We propose one, the degree of temporal representation: the fraction of a network's four functions (encoding, activation, decoding, learning) whose variables or parameters are temporal, and hypothesise that it predicts performance on temporal tasks. At fixed architecture, accuracy and energy efficiency increase with the degree: a delay network of maximal degree reaches 98.94\% on Google Speech Commands with 175k parameters, above transformers. To test whether networks of different degree really differ, we convert the delay network into artificial and spiking networks with the same inputs and outputs. From this common start, the artificial one learns differently and temporal gradients depend on event times. Hence we obtain a design rule: for temporal data, make event times variables of a network's functions. Spiking networks, converted after training, keep the delay network's accuracy, unreachable by spiking networks trained from scratch.

cs.NE

版本更新 · v2arXiv:2610.19732

Controlling the latency in temporal coded spiking models for neuromorphic datasets

Alban Gattepaille, Alexandre Muzy

原文摘要

Spiking neural networks (SNNs) promise energy-efficient, event-driven computation on neuromorphic hardware, where response time, or latency, matters as much as energy for real-time applications. Time-to-first-spike (TTFS) coding with learnable synaptic delays is a natural way to exploit the timing of events. However, in state-of-the-art spiking neuron models, spike times emerge from nonlinear membrane dynamics and thresholds: no closed-form expression links network parameters to spike times, so latency can only be measured empirically, not specified or guaranteed at design time. Moreover, TTFS models are mostly evaluated on static datasets, which hides their latency on truly temporal data. Our hypothesis is that, if spike times are computed directly as closed-form functions of presynaptic spike times and synaptic delays, bypassing membrane potential and thresholding, latency becomes an explicit function of the learnable parameters that can be bounded, and therefore controlled, analytically. We build on this hypothesis with the Delay Neural Network (DeNN) in real time, which turns event streams into successive single-spike images, computes each spike time from standardised inter-spike intervals and synaptic delays, and links successive images through a long-term memory. We prove lower and upper bounds on the latency of every neuron of a layer, and show that bounding the synaptic parameters after training with a single hyperparameter places the latency anywhere between these bounds, without retraining. On a ten-class subset of the Google Speech Commands dataset, this post-training control exposes the accuracy--latency trade-off: a three-hidden-layer network reaches 94.25\% accuracy while deciding, on average, 477~ms after the end of the one-second input, and about 250~ms with confidence-based early decisions. Learning is also shown to concentrate the long-term memory on a few neurons. Latency thus becomes a design parameter of spiking models rather than a quantity measured after the fact, a step towards neuromorphic systems with real-time guarantees.

cs.NE

新论文 · v1arXiv:2611.12088

Zero-Search Reinforcement Learning for Slay the Spire 2 with Failure-Driven Restarts

Xiangqin Chen, Zhengxuan Xie

原文摘要

Slay the Spire 2 (STS2) is a deck-building roguelike in which a winning run at the highest difficulty takes several hundred decisions, and most losses happen in late boss fights that a learner seldom reaches. We train agents that choose every action with one forward pass of a 6.6M-parameter entity transformer, without lookahead. Training and evaluation run the game's own compiled assembly (v0.107.1) in a headless .NET host. The host replays a run exactly from its seed and actions, so training episodes can restart from states the learner has visited, and a failure-driven curriculum allocates these restarts in proportion to where complete runs are lost. On 12,800 held-out games at Ascension 10 (A10), the released policies win 8.05% averaged over the five characters (Ironclad 15.6%, Regent 12.5%), and AlphaSpire's released networks used without search win 0.55% on a common panel. Longer A10 training raised Ironclad from 12.4% to 15.6% and Defect from 3.0% to 8.1% on these games. At Ascension 0 the released policies win 80.2%, level with the 80.3% that the tree-search agent Spire Mentor reports, while Mentor leads by 5 to 8 points from A4 upward. Run in our host on the same 2,000 A10 games, Mentor's search wins 8.8% against 8.2% for our policies, which need 21-27 ms per decision on one CPU core. GPT-6 Astra at maximum reasoning won none of 11 A10 games through our text interface. In a controlled study of 18 training runs from six random initializations, failure-driven allocation exceeds uniform restart allocation on each of three Regent initializations, by 3.6 percentage points on average, while the Silent effect is small and changes sign. Code, trained policies, an in-game mod and the records behind every table are at https://github.com/HalfVulpes/sts2ai.

cs.LG · cs.AI

版本更新 · v2arXiv:2610.37364HF 社区推荐

EmbeddingGemma 2: Unified and Efficient Multimodal Representations

Henrique Schechter Vera, Sahil Dua, Jovan Andonov, Sara Smoot, Sebastian Russo, Ivan Llanos, Max Matveev, Jae Hyeon Yoo 等 77 位作者

原文摘要

We present EmbeddingGemma 2, an open multimodal embedding model which natively represents text, images, audio, video, and combinations thereof in a unified space. Our approach introduces improvements such as simplified per-layer embeddings and a multi-stage curriculum with modality and objective progression which ensure strong quality across unimodal, cross-modal, and mixed-modal evaluations. Notably, in comprehensive embedding benchmarks across all modalities, EmbeddingGemma 2 establishes a new Pareto frontier, outperforming both specialist models and models two to twelve times larger. Furthermore, our design offers flexibility for resource-constrained environments, supporting selective modality encoder loading, adjustable vision token budgets, truncatable embedding dimensions, and quantized weights. We present ablations analyzing key decisions and release EmbeddingGemma 2 to promote further research.

cs.LG · cs.CL · cs.CV · cs.SD

版本更新 · v3arXiv:2410.03756

The Smart Buildings Control Suite: A Diverse Open Source Benchmark to Evaluate and Scale HVAC Control Policies for Sustainability

Judah Goldfeder, Victoria Dean, Zixin Jiang, Xuezheng Wang, Bing dong, Hod Lipson, John Sipple

原文摘要

Commercial buildings account for 17\% of U.S. carbon emissions, with roughly half of that from Heating, Ventilation, and Air Conditioning (HVAC). HVAC devices form a complex thermodynamic system, and while model predictive control and reinforcement learning have been used to optimize control policies, scaling to thousands of buildings remains a significant unsolved challenge. Most current approaches are over-optimized for specific buildings and rely on proprietary data or hard-to-configure simulators. We present the Smart Buildings Control Suite, the first open source interactive HVAC control benchmark with a focus on solutions that generalize across building. It has 3 components: real-world data from 11 buildings over 6 years, a lightweight data-driven simulator, and a modular Physically Informed Neural Network (PINN) building model. The buildings span multiple climates, management systems, and sizes, and both the simulator and PINN easily transfer to new buildings, ensuring solutions using this benchmark are robust to these factors and only reliant on fully scalable building models. This represents a major step towards scaling HVAC optimization from the lab to buildings everywhere. To facilitate use, our benchmark is compatible with the Gym standard, and our data is available at our webpage. Code at https://github.com/google/sbsim

cs.AI · cs.CY · cs.DC · cs.LG · eess.SY

版本更新 · v2arXiv:2610.33932

FastSAR: Open-Source SAR Image Formation on CPUs, GPUs, and TPUs, and a Matched Comparison of Algorithms, Precisions, and Processors

Paul Singerman, Tom Braun

原文摘要

The number of spaceborne synthetic aperture radar (SAR) collectors is growing exponentially, each returning raw collections that must be formed into images. Exact backprojection needs 1.6 trillion interpolated reads and 90 trillion floating-point operations for a 108-megapixel Umbra image. How long it takes to form an image, and at what price, depends on the algorithm, the arithmetic, and the hardware. Open-source implementations have never been compared on matched hardware against a common reference, and none run on Google tensor processing units (TPUs). This paper presents FastSAR, an open-source SAR image formation library for central processing units (CPUs), NVIDIA graphics processing units (GPUs), and TPUs. With it, we compare three SAR image formation algorithms, four floating-point formats, and six cloud devices in every supported combination, with cost per image at on-demand cloud prices as the fair common measure. FastSAR is 1.06 to 22,000 times faster than the tested open-source implementations at equal or better accuracy, and the full suite of hardware, algorithm, and floating-point combinations lets a user choose the Pareto-optimal configuration for their balance of accuracy, speed, and cost. The L4 GPU forms images the cheapest overall. Larger GPUs are faster but cost more per image because their price rises faster than their speed. The TPUs come close to the GPUs in cost, but only for the factorized algorithm, and the CPU is far less efficient in both speed and cost. Lower precision formats buy less of a speedup than expected, and each step down in precision costs accuracy.

cs.PF · eess.SP

新论文 · v1arXiv:2611.11346

IntentLens: Grounding Underspecified Multimodal Queries for Recommendation via Tool-Augmented Reasoning

Xiao Chen, Dong Fang, Haitao Li, Qing Li

原文摘要

As intelligent personal assistants are increasingly deployed in real-world scenarios, recommendation paradigms are shifting from passive preference matching to inferring user intent from underspecified multimodal inputs. In practical interactions, users typically issue a reference image paired with a vague natural language query, keeping key visual attributes, personalized preferences, and item-side constraints implicit. Existing recommendation methods either leverage historical user interactions augmented with multimodal item features or assume fully articulated textual queries; both paradigms struggle to resolve underspecified multimodal queries for accurate item matching. To address this limitation, we propose IntentLens, a tool-augmented recommendation framework that grounds ambiguous multimodal queries into query-relevant evidence prior to user-item matching. IntentLens follows a ground-then-rank pipeline: a shared multimodal LLM leverages visual tools, user memory modules, and item attribute retrieval tools to (i) infer latent user intent from image-text inputs and (ii) augment each candidate item with fine-grained, query-conditioned evidence. Subsequently, a lightweight ranker scores candidates based on the grounded representations. To facilitate research in this novel setting, we construct two benchmarks with underspecified multimodal queries, namely \textsc{GoogleReview-MMTool} and \textsc{Yelp-MMTool}. Extensive experiments on these benchmarks demonstrate that IntentLens outperforms competitive MLLM and retrieval baselines, and exhibits strong generalization to unseen categories and datasets.

cs.IR

版本更新 · v2arXiv:2609.09108

Distributed Linear Programming on GPU Clusters at Extreme Scale

Arnaud Deza, Santanu S. Dey, Pascal Van Hentenryck

原文摘要

Large linear programs can exceed the memory of a single compute node. Although first-order methods replace sparse factorizations with GPU-suited matrix-vector products, other solver phases can reintroduce a single-node memory limit. We present SHARDLP, a distributed GPU LP solver that keeps the matrix and primal-dual state partitioned from sharded input through solution output. On the Google PDLP benchmark, SHARDLP solves ten of eleven instances, compared with eight in the published CPU PDLP study. On the largest benchmark, eight H200 GPUs solve a 1.185-billion-variable, 6.338-billion-nonzero LP in 9.9 minutes; the published CPU experiment reports 21.06 hours on different hardware. Beyond this benchmark, separately checked multi-node solves reach up to 13.604 billion variables and 40.807 billion nonzeros, while validated executions span up to 76 GPUs across 29 compute nodes. For column-partitioned solves, support-aware communication skips GPUs that store no coefficients for a row; on an LP with 2.76 billion nonzeros, it cuts modelled communication by 92.97% and improves solver time by 1.27x-1.52x. The code for SHARDLP is available at https://github.com/ArnaudDeza/ShardLP.

math.OC · cs.DC

版本更新 · v2arXiv:2611.05877

When Does Better Confidence Improve a Knowledge-Graph Audit?

Zehao Lin, Kai Chen, Xixuan Hao, Erenkai Zhu, Chunyu Li, Helan Hu, Feiyu Xiong

原文摘要

Confidence estimates guide human review in LLM-built knowledge graphs, but an erroneous shared entity need not be the only reason an incident fact is wrong. We study how this distinction affects budgeted audits, alongside selection headroom and label validity. Modelling non-adaptive auditing as budgeted covering, we characterise the minimal decision-relevant error statistics and bound the regret of scalar-preserving first-order planning by a structural mass $Δ^{\mathrm{cl}}$. We simulate ideal repair against benchmark-aligned labels for five extraction configurations and two cross-document graphs on Re-DocRED, followed by frozen confirmation on test and replication on 500 hash-selected training documents. An error-rate $\times$ fan-out baseline leaves 3.98-4.74 percentage points more errors than joint planning with the same actions. Independent-block planning also avoids this disadvantage: its held-out point estimates improve on a fact-only scalar baseline by 1.22-1.79 points and are slightly better than the joint model, although the frozen equivalence criterion remains inconclusive. On 300 DWIE training documents, independent and joint plans also outperform fan-out in point estimates, with extractor-dependent gains over fact-only review. For verification, a generic support check improves three of four model-budget configurations on each held-out set. These comparisons motivate evaluating complete-repair probabilities and retaining both fact-only and factorised baselines when choosing an audit model.

cs.CL

版本更新 · v3arXiv:2606.07642

Do VLMs See What Sensors Feel? A Scalable Expert-Guided Design for Wheelchair Accessibility Assessment from Street View

Dongdong Wang, Alina Hagen, Isabelle Gatmaitan, Hao Zhou, Yiwen Dong, Shabboo Valipoor, Vivian W. H. Wong, Lingyao Li

原文摘要

Assessing built-environment interaction, such as wheelchair accessibility, is challenging because real-world mobility is shaped by context-dependent and temporary barriers that are difficult to capture at scale. This paper examines whether vision-language models (VLMs) can identify potential accessibility barriers from Google Street View (GSV) imagery. We propose an expert-guided retrieval-augmented framework that combines GSV imagery, ADA-informed guidance, and expert-derived rubrics to evaluate multiple accessibility dimensions. We collect a campus-scale dataset at the University of Florida, linking 407 unique GSV locations with GPS-derived wheelchair dwell behavior as a proxy for potential mobility friction. Results show that VLM ratings are negatively correlated with dwell time and exhibit distributional similarity, with the expert-guided configuration strengthening the correlation from $r=-0.40$ to $r=-0.54$ for the strongest model. Visual cue analysis further shows that features such as curb ramps and crosswalks are associated with higher VLM accessibility scores, while correspondence remains limited for subtle surface conditions, transient obstructions, and viewpoint-dependent barriers. Overall, our findings demonstrate the potential of expert-guided VLMs for scalable preliminary accessibility screening and prioritizing locations for further investigation.

cs.CV · cs.CY

版本更新 · v3arXiv:2602.13415

The Rise of AI Search: Implications for Information Markets and Human Judgement at Scale

Sinan Aral, Haiwen Li, Rui Zuo

原文摘要

We analyzed global, longitudinal AI and traditional search data to spark a conversation about the growth and impact of AI search, and discuss its policy implications for platforms, regulators, scientists and citizens. We executed 24,000 search queries in 243 countries, generating 2.8 million AI and traditional search results in 2024 and 2025. We found a rapid global expansion of AI search and key trends that reflect important, previously hidden, policy decisions by AI companies that impact human exposure to AI search worldwide. From 2024 to 2025, overall exposure to Google AI Overviews (AIO) expanded from 7 to 229 countries, with surprising exclusions like France, Turkey, China and Cuba, which did not receive AI search results. While only 1% of Covid search queries were answered by AI in 2024, over 66% of Covid queries were answered by AI in 2025---a 5600% increase signaling a policy shift on this critical health topic. Our results also show AI search surfaces significantly fewer long tail information sources, lower response variety, and significantly more low credibility and right- and center-leaning information sources, compared to traditional search, impacting the economic incentives to produce new information, market concentration in information production, and human judgment and decision-making at scale. The social and economic implications of these rapid changes in our information ecosystem necessitate a global debate about corporate and governmental policy related to AI search. We hope this discussion and the dataset released with this paper elevate the global dialogue on AI search and its impact.

cs.CY

新论文 · v1arXiv:2611.10674

Regularity in Cryptocurrency Market Cycles: A Halving-to-Halving Analysis Using Data from Google Trends and Wikipedia

Marek Zatwarnicki, Piotr Stolarski, Włodzimierz Lewoniewski

原文摘要

Bitcoin halvings provide a natural temporal structure for studying long-term dynamics of cryptocurrency markets. This paper presents a methodological framework for analyzing the regularity of Bitcoin and aggregate cryptocurrency market cycles by normalizing historical periods between consecutive halving events and projecting them onto a common relative-time scale expressed as the percentage of cycle completion. The proposed framework integrates market variables, namely Bitcoin price and aggregate cryptocurrency market capitalization, with measures of public attention derived from Google Trends search volume and Wikipedia pageviews. To obtain long-horizon daily attention indices, Google Trends data are reconstructed from overlapping 90-day windows linked by median scale ratios, following established approaches to combining high-frequency Google Trends samples. Rather than attempting to forecast future prices, the study aims to compare historical cycles, identify recurring temporal patterns, and evaluate the relationship between market dynamics and retail investor interest across different cycle-relative stages. Exploratory results point to a possible recurring structure. The maxima of the aggregate market capitalization in the two most recent completed cycles occurred at 39.0% and 37.9% of cycle completion, and the highest value of the ongoing cycle observed to date at 38.1% (534-547 days after the respective halvings), although the corresponding multiple of the halving-day value fell from 66 to 1.8. Public attention shows a similar compression of peak multiples, but not a similar timing. The paper also discusses current data limitations and outlines future research directions, including formal lead-lag analyses and expanded multi-asset investigations.

stat.AP · cs.CE · cs.SI

版本更新 · v2arXiv:2606.00813

Non-Monotonic Safety Alignment Across Gemma Generations: A Quality-Diversity Red-Teaming Study

Subhadip Mitra

原文摘要

Note on v2 (Nov 2026): attack success now requires a response judged non-refusing and harmful (v1 counted every non-refusal), so all rates are lower; v1's figures are reported as the non-refusal rate, and with 3 seeds no significance claims are made. Safety alignment in LLMs need not improve monotonically across model generations. Studying four generations of Google's Gemma family (7B-31B) with quality-diversity evolution (MAP-Elites) as an automated red-teaming probe, we find that Gemma 3 (12B) has the highest attack success rate (ASR; response judged non-refusing and harmful): 33.7% +/- 1.3% (mean +/- std, 3 seeds), against 19.0% +/- 10.6% for Gemma 2 and 12.3% +/- 4.2% for Gemma 4. Every Gemma 3 seed exceeds every Gemma 2 and Gemma 4 seed, which we report as directional evidence. Harmful successes rarely transfer between generations (1.4-7.9% ASR when archives are replayed on other generations), lowest on Gemma 4 (1.4-2.8%). Cybercrime is the most exploited category in Gemma 1-3 (47-83%) but falls to 2% in Gemma 4, while misinformation rises from 17% (Gemma 2) to 80% (Gemma 3) and is still 53% in Gemma 4. A second-judge audit (Llama-3.1-70B) confirms 74% of the 8B judge's harmful labels. The non-refusal rate shows the same ordering at 2-3x higher levels and overstates harmful transfer by 6-16x. Code and artifacts: https://github.com/bassrehab/red-queen

cs.CR · cs.CL · cs.ET · cs.LG · cs.NE

版本更新 · v3arXiv:2603.00326

Vectorized Dynamic Histograms for Sparse Oblique Forests

Ariel Lubonja, Jungsang Yoon, Haoyin Xu, Yue Wan, Yilin Xu, Richard Stotz, Mathieu Guillame-Bert, Joshua T. Vogelstein 等 9 位作者

原文摘要

Sparse oblique (SPO), part of the top-ranked configuration of Google's Yggdrasil Decision Forests (YDF), improve the accuracy while maintaining interpretability of Random Forests (RF) and Gradient Boosted Trees (GBT) by scanning a sparse linear combination of features instead of a single feature. Because projections are sampled at runtime, training is significantly slower, as pre-run optimizations such as presorting cannot be used. We overhaul SPO training in YDF, first by fixing inefficiencies in the released version, achieving 2-5x speedup, then by devising two novel methods, one aimed at GBTs and the other at RFs: (1) Hierarchical AVX2 and AVX-512-vectorized histogram filling speeds up typical GBT-depth trees by up to 1.6x in SPO-GBT and 2x for SPO-RF, and (2) runtime-dynamic histograms between vectorized histograms and exact splits, speeds up deeper, RF depth-typical trees (depths 16 to purity) by up to 1.6x with no detectable effect on accuracy. Our optimizations bring SPO-RF training time on par with YDF's axis-aligned RF. We extensively evaluate on 8 natural and 11 synthetic datasets of up to 10.5 million rows and 1.6 million features, from depth 6 to purity, and open-source the implementation.

cs.LG · cs.DC · cs.PF

新论文 · v1arXiv:2611.09552

Towards Sustainable Federated Learning via Carbon-Aware Client Selection

Wentao Gao, Omid Tavallaie, Albert Y. Zomaya

原文摘要

The Information/Communication Technology (ICT) industry is severely challenging the global environment due to the sharply rising carbon emissions generated by machine learning (ML) workloads. Federated Learning (FL) is one of the prominent distributed ML systems used in applications with billions of client devices, such as Google Gboard and Apple Siri. Nearly half of the total carbon footprint in FL originates from client-side computation during local training. However, existing client selection strategies in FL primarily focus on minimizing energy consumption rather than carbon emissions, despite the fact that carbon impact depends not only on computational load but also on the underlying carbon intensity of the energy source. In this paper, we address this gap by proposing a carbon-aware fair client selection strategy (CA-FCS) designed to minimize the carbon emissions associated with model training on client devices. In contrast to existing approaches for reducing carbon emissions in FL, we incorporate hourly carbon intensity and a realistic energy consumption model developed using empirical measurements from Google Pixel smartphones to estimate client-side carbon emissions in FL. Since repeatedly selecting low-carbon clients may reduce data diversity and degrade global model performance, particularly under non-independent and identically distributed (non-IID) data settings, CA-FCS incorporates fairness into client selection to mitigate this issue. We conduct extensive experiments under realistic FL settings for mobile devices, where client participation is constrained by device availability conditions, such as charging status and Wi-Fi connectivity. The results demonstrate that our method reduces client-side carbon emissions by up to 46% while maintaining competitive model accuracy.

cs.DC

版本更新 · v2arXiv:2610.22457

Erase the Mark, Preserve the Motion: Temporally Consistent Removal of Video Watermarks

Yifan Liao, Zhen Sun, Zhicong Huang, Jiaming He, Zongmin Zhang, Xi Ai, Cheng Hong, Xinhu Zheng 等 9 位作者

原文摘要

Recent advances in video generation have increased the demand for reliable watermarking for copyright protection, yet the robustness of video watermarks against removal attacks remains underexplored. Most watermark-removal methods originate from the image domain: signal optimization injects imperceptible pixel-domain perturbations, whereas generative resynthesis produces a visually similar instance through diffusion synthesis. When extended to videos, the former introduces temporally varying noise that causes visible flickering, while the latter regenerates fine-grained structures inconsistently across frames, leading to structural motion inconsistency. To evaluate video watermark robustness, we propose PoseRegen, a pose-consistent reconstruction framework that removes watermarks while preserving the original content and motion. PoseRegen first applies a temporally shared viewpoint transformation to disrupt watermark-bearing spatial patterns and then jointly reconstructs the transformed sequence with a pose-conditioned video model. A frozen video DiT processes the complete sequence with its reference-video latent, and full-sequence Flow Matching supervision keeps identity and background consistent across frames. To further preserve motion structure, we introduce a lightweight Pose-Conditioned Motion Consistency Adapter that adapts the frozen backbone to temporally ordered pose guidance and constrains body-part trajectories throughout reconstruction. Experiments on eleven video watermarking schemes show that PoseRegen reduces the average bit accuracy to 0.505, near random guessing, while outperforming the strongest baseline by 9.34% on motion-related VBench metrics. These results reveal a practical vulnerability of current video watermarks and highlight the need to evaluate robustness jointly with temporal and motion quality.

cs.CR · cs.CV

新论文 · v1arXiv:2611.08840

What Matters for LLM Persona Simulation: Signal Form in Cold-Start E-Commerce Advertising

Jiwoo Choi, In Ik Lee, Woo Sung Seo, Minho Lee, Yun Young Choi

原文摘要

Estimating advertising performance in cold-start settings is challenging because historical logs are unavailable before launch. Large language models (LLMs) offer a potential alternative by simulating persona-conditioned user responses, but it remains unclear which design choices actually drive LLM-based persona simulation. Using real Google Ads e-commerce campaign data across five demographic segments, we identify three signal-form dimensions that affect simulation quality: (i) a demographic anchor without noisy rich attributes, (ii) a relative qualitative banner-blindness signal rather than quantitative anchors, and (iii) prompt phrasing. On this campaign, our method attains an MAE of 24.9 and a MAPE of 26.1%, a 51.3% lower MAE than the best tested non-LLM baseline and 77.3% lower than an LLM configuration using explicit CTR anchors. Systematic ablations show that minimal demographic descriptions achieve lower mean error than richer persona configurations, while relative qualitative cues substantially outperform the tested quantitative anchors. We additionally compare these configurations with direct-prior and rule-based baselines and with alternative LLM configurations.

cs.LG · cs.AI

版本更新 · v3arXiv:2607.00642

Coachable Agents for Interactive Gameplay

Roberto Capobianco, Harm van Seijen, Nolan D. Bard, Neil Burch, Fatima Davelouis, Josh Davidson, Alisa Devlic, Yunshu Du 等 41 位作者

原文摘要

Reinforcement learning has proven to be a valuable tool in the creation of advanced AI and robotic systems, contributing to everything from game playing (Silver et al., 2016; 2017; Wurman et al., 2022) to robotics (Levine et al., 2016; Andrychowicz et al., 2020; Luo et al., 2025; Dürr et al., 2026) to foundation models (Ouyang et al., 2022; Noukhovitch et al., 2024; Sun et al., 2024; Guo et al., 2025). Through trial and error, these AI systems typically learn a single, near-optimal behavior to solve their tasks. However, there are many use cases in which one would like to assert some level of control, after training is completed, over how the task is solved. We refer to these modifications of a core task as styles. We combine universal value function approximators (UVFAs) with carefully selected training scenarios, learning algorithms, and data augmentation to create a framework for coaching agents that exhibit styles in complex domains. We demonstrate the framework's application in the AAA video games Horizon Forbidden West and Gran Turismo, and in an open-source humanoid test domain. Despite the different nature of the domains--car racing, stylized game combat, and humanoid walking--each agent shows strong coherence to the style requests while still satisfying the main task in its domain. Importantly, the techniques outlined in this paper allow an end user to choose the final behavior at run time, giving them flexible control over the final executed performance.

cs.AI · cs.LG

版本更新 · v2arXiv:2608.13410

Who Speaks Matters: Authority-Aware Multi-View RAG over Italian Parliamentary Proceedings

Mirko Tritella, Riccardo Pozzi, Matteo Palmonari

原文摘要

Parliamentary proceedings are a primary record of democratic deliberation, yet their volume and fragmentation make multi-perspective access difficult for citizens, journalists, and researchers. Applying Retrieval-Augmented Generation (RAG) to parliamentary transcripts introduces three specific risks: dominance of the most frequent speakers, inability to weight speakers according to topical expertise, and citation misattribution in politically sensitive text. We present ParliamentRAG, a RAG system for the Italian Chamber of Deputies that addresses these risks jointly. Its core contribution is a topic-dependent authority model that estimates each speaker's authority as a function of the current query, combining interpretable components such as profession, education, and previous interventions. Given a user query, the system retrieves relevant speech chunks, identifies topic-relevant experts across parliamentary groups, and generates a summary synthesizing their perspectives, accompanied by supporting quotations. ParliamentRAG is evaluated against Google NotebookLM on 15 policy topics via a two-level protocol combining automated metrics and blind A/B human evaluation by six domain experts. The system achieves higher coverage across political groups (0.97 vs. 0.95), perfect quotation faithfulness (1.00 vs. 0.95), and stronger expert preferences on source-related dimensions, while NotebookLM remains stronger on prose-oriented dimensions.

cs.AI

新论文 · v1arXiv:2611.08749

How are viral trends different from educational and commercial uses of LLM image generation and editing? A privacy-preserving descriptive analysis

Will Tucker-Ray, Marika Swanberg, Alexander Knop, Marvin Chow, Eric Culbertson, Julian Jacobs, Pritish Kamath, Ravi Kumar 等 12 位作者

原文摘要

Gemini's Nano Banana models, first introduced in late 2025, led to a shift in the capabilities and use of image generation and editing. We utilize Urania, a Google-developed framework for generating insights about LLM chatbot interactions with rigorous differential privacy (DP) guarantees, to analyze use cases and intents, techniques and ways of prompting, without ever looking at a single image or individual prompt. We select a subsample of 2.1M conversations in early 2026 which utilized Nano Banana models, into roughly 800 clusters in five categories: (1) Social & Viral Sharing, (2) Brand & Marketing Collateral, (3) Educational & Technical Information Media, (4) Product Visualizations & E-commerce, and (5) Architectural & Spatial Designs. We then compare these clusters on 21 features of use, measuring aspects of prompts' (a) editing techniques, (b) artistic style requests, (c) composition, and (d) chatbot interactions. This allows us to describe a baseline of how people are using image generation and editing tools for different use cases---(including growing and emergent use cases which were not possible before Nano Banana)---in a privacy-preserving manner.

cs.CY · cs.AI

版本更新 · v7arXiv:1202.4961

Strongly universal string hashing is fast

Daniel Lemire, Owen Kaser

原文摘要

We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees. Moreover, conventional wisdom is that hash functions with fewer multiplications are faster. Yet we find that they may fail to be faster due to operation pipelining. We present experimental results on several processors including low-powered processors. Our tests include hash functions designed for processors with the Carry-Less Multiplication (CLMUL) instruction set. We also prove, using accessible proofs, the strong universality of our families.

cs.DB · cs.DS

新论文 · v1arXiv:2611.08472

XStack:机器学习仓库迁移基准

XStack: A Benchmark for ML Repo Migration

Linrong Cai, Taiming Lu, Haozhe Chen, Zhuang Liu

AI 速读 基于摘要

作者提出 XStack 基准,用于评估智能体在 PyTorch/NVIDIA GPU 与 JAX/Google TPU 两大生态之间迁移完整机器学习仓库的能力。

cs.LG · cs.AI

查看原文摘要

ML code should run where researchers choose, not where it was first written. Today, machine learning code mainly lives in two ecosystems, PyTorch on NVIDIA GPUs and JAX on Google TPUs. Migrating repositories between them means building and testing across frameworks and hardware. This migration is (1) a practical need, since it unlocks different hardware for researchers, and (2) a natural benchmark: it involves different frameworks and hardware, covers whole repositories, and is long-horizon and challenging. We introduce XStack, a benchmark that evaluates agents on migrating ML repositories between these two ecosystems. Each agent receives a PyTorch repository and a clean TPU machine and must deliver a JAX repository. Its output passes if it meets our grading criteria, based on the source repository's published result, authenticated and calibrated by us. Migration by agents remains unreliable: Claude Opus 5 passes 75%, GPT-5.6-sol 45%, and every other agent at most 40%. XStack is a step toward freeing ML code from its ecosystem. We release XStack to make progress toward reliable migration across frameworks and hardware measurable.

新论文 · v1arXiv:2611.08306

GINGER:为基于图的向量搜索增添风味

GINGER: Spicing Up Graph-Based Vector Search

Daniel Salwasser, Lars Gottesbüren, Laxman Dhulipala, Jakub Łącki, Guy Blelloch, Rajesh Jayaram, Tobias Rubel, Kshiteej Sheth 等 10 位作者

AI 速读 基于摘要

GINGER 是 Google 开发的开源 C++ 图近似最近邻搜索库,结合 PiPNN 图构建、Nested TurboQuant 量化与 AdaptiveGap 图压缩,作者报告在 95% 召回率下显著提升查询吞吐与索引速度。

cs.IR · cs.DC

查看原文摘要

We present \textsc{Ginger}, a state-of-the-art open-source C++ library for graph-based approximate nearest neighbor search (ANNS). We developed \textsc{Ginger} at Google to push the speed and memory efficiency of graph search on large and high-dimensional embedding datasets. \textsc{Ginger} surpasses existing ANNS libraries with regards to query throughput and indexing time while matching the memory footprint of the most space-efficient competitors. \textsc{Ginger} builds upon recent advances in proximity graph construction (PiPNN) and vector quantization (TurboQuant). We introduce Nested TurboQuant (NTQ), a two-level quantizer which supports low precision graph navigation and high precision reranking in a single code. This representation achieves near floating point precision with $2.6\times$ less memory. We also compress the size of our proximity graphs by up to $2.5\times$ without impacting query throughput. We combine graph reordering with a new lossless compression codec called AdaptiveGap, which builds upon StreamVByte. At $95\%$ recall, \textsc{Ginger} speeds up query throughput by an average of $1.8\times$ over each dataset's fastest competitor and by at least $2.3\times$ over any single library. This lead grows to $2.9\times$ over compact libraries on high-dimensional embeddings.

新论文 · v1arXiv:2611.10028

Beyond Hash Matching: AI-Based Detection of Previously Unidentified CSAM and its Legal Implications in the EU

Emmanouela Kokolaki, Georgios Samaritakis, Paraskevi Fragopoulou

原文摘要

The detection of previously unidentified Child Sexual Abuse Material (CSAM) remains a significant challenge for law enforcement authorities, online service providers, and child protection organizations, as traditional hash-matching technologies are primarily designed to identify previously verified material. This paper reviews and classifies existing AI-based technologies that could complement hash-based approaches and support the detection, analysis, and prioritization of potentially harmful content. The reviewed approaches are organized into three categories: real-time image and video analysis, image and video classification and tagging, and AI-based behavioral monitoring. A comparative analysis examines the capabilities, limitations, and potential integration of general-purpose computer vision platforms, content moderation services, and specialized CSAM detection tools within existing detection workflows. An experimental evaluation was conducted using Google Cloud Vision AI and Sightengine to investigate sexual-content classification and child-adult age estimation. The results highlight differences in classification taxonomies and outputs across providers, as well as significant limitations in age classification, particularly for adolescents. These findings highlight the importance of using AI-based assessments as complementary tools for analysis and prioritization, rather than as definitive determination of CSAM. Finally, the paper examines the relevant European Union regulatory framework, with particular attention to the EU AI Act, the General Data Protection Regulation (GDPR), fundamental rights, transparency, accountability, and human oversight. The legal analysis highlights how regulatory obligations and safeguards may differ depending on the deployment context, potentially creating inconsistencies across interconnected detection and reporting workflows.

cs.CV · cs.AI

版本更新 · v2arXiv:2606.25272

Characterizing Robustness in Semantic Code Clone Detection

Zhiwei Xu, Weixian Deng, Xuyang Liu, Xiaolin Peng, Jiabao Gao, Tian Qiu, Hai Wan, Xibin Zhao

原文摘要

Semantic code clone detection seeks to recognize shared functionality across different implementations, making robustness to behavior-preserving changes central to its effectiveness. Prior studies have exposed failures under such changes, motivating a systematic examination of how sensitivity varies with the rewrites used for evaluation. We present Systematic Code Transformation (SCT), a framework organizing 51 operators by code level, target, and edit category, and evaluate 14 token, tree, graph, and prompt-based detectors on BigCloneBench, Google Code Jam, and OJClone. By comparing transformation groups, repeated application, and alternative constructions, we connect overall performance changes with specific rewriting conditions. Of 25 token, tree, and graph detector and dataset combinations starting above 90% F1, 21 lose at least 10 percentage points under the composition of all operators. These losses vary with transformation type and application intensity, but are not determined by edit counts or code growth alone. Even at matched locations and edit counts, alternative constructions can expose different errors despite similar aggregate losses. Further analysis distinguishes reduced score separability from changed fixed-threshold decisions with retained ranking ability, revealing different scope for threshold recovery. Overall, these findings show why benchmark effectiveness needs to extend to stable discrimination across equivalent implementations and how systematic transformation testing can assess that capability.

cs.SE

版本更新 · v4arXiv:2508.19008

Computational Phenomenology of Borderline Personality Disorder: A Comparative Evaluation of LLM-Simulated Expert Personas and Human Clinical Experts

Marcin Moskalewicz, Anna Sterna, Karolina Drożdż, Kacper Dudzic, Marek Pokropski, Paula Flores

原文摘要

Building on a human-led thematic analysis of clinical life-story interviews (> 150,000 words) with inpatients with Borderline Personality Disorder, this study examines the capacity of large language models (OpenAI's GPT, Google's Gemini, and Anthropic's Claude) to support qualitative clinical analysis. The models' interpretative potential was evaluated using a mixed-methods approach. Study A involved blinded and non-blinded judges in phenomenology and clinical psychology. The experts assessed the validity of AI-generated content using semantic congruence, Jaccard coefficients, and multidimensional validity ratings, including credibility, coherence, the substantiveness of results, and grounding in qualitative data. In Study B, neural methods were used to embed human- and model-generated theme descriptions in a multidimensional vector space. This approach provided an objectified computational measure of the difference between human and model semantics and linguistic style. In Study C, complementary non-expert evaluations were conducted (N=115) to examine the influence of thematic verbosity on the perception of human authorship and content validity. Overall, the results of AI analysis showed a highly variable overlap (0-58%) with the human interpretation, while all models identified themes originally omitted by human researchers, proving their capacity to mitigate human bias. At the thematic level, external evaluators were unable to reliably distinguish human-authored themes from those generated by AI. In terms of content validity assessed against raw data by high-level experts in the blinded mode, the performance of Gemini 2.5 Pro was indistinguishable from that of humans. The comparison of semantic vector embeddings showed that its style was also the closest to humans.

cs.AI · cs.CL

版本更新 · v2arXiv:2605.10402

Every finite group admits a just finite presentation

Marc Lackenby

原文摘要

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR · cs.AI