跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

面向通用灵巧操作的异构触觉表征学习

Learning Heterogeneous Tactile Representation for General Dexterous Manipulation

Bing Han, Yichuan Peng, Haoyu Dong, Yuanmeng Hu, Yongyi Jia, Fangjing Wang, Kecheng Zheng, Yiming Zhang 等 19 位作者

AI 速读 基于摘要

提出触觉基础模型 LingBot-Touch,将压阻、磁性与视触觉等异构传感器数据统一表征,并以即插即用方式增强多种策略模型的灵巧操作能力。

cs.RO

查看原文摘要

Tactile sensing is an indispensable modality for contact-rich dexterous manipulation, a capability that hints at the ultimate frontiers of embodied intelligence. However, commercially available tactile sensors are still at a relatively early stage of development, with each type of sensor offering irreplaceable strengths alongside its own drawbacks. A key challenge is thus to free tactile understanding from sensor-specific physics, so that embodied models can effectively leverage heterogeneous tactile data. To this end, we develop LingBot-Touch, a tactile foundation model characterized by the following properties. (i) Our model yields a unified representation across different tactile sensors (i.e., piezoresistive, magnetic, and visuotactile sensors), and is easily extensible to new sensor types. (ii) The resulting tactile tokens are plug-and-play: they can be seamlessly integrated into policy models across paradigms, from diffusion policy to vision-language-action (VLA) models such as $π_{0.5}$ and LingBot-VLA, consistently enhancing manipulation dexterity. (iii) Extensive experiments, spanning simulation and real-robot deployments across multiple hardware platforms, demonstrate that our tactile representation substantially benefits complex manipulation tasks while maintaining strong computational efficiency. We believe the findings in this work demonstrate the potential of leveraging cross-sensor data to scale tactile learning, and offer encouraging insights for the design of future hardware and embodied models.

新论文 · v1arXiv:2611.12805

2D Gum-Net:基于对称相关与谱池化的无监督稠密弹性图像配准

2D Gum-Net: Unsupervised Dense Elastic Image Registration via Symmetric Correlation and Spectral Pooling

Aarya Bhave, Anushka Ajay Bhave

AI 速读 基于摘要

作者将原本用于冷冻电镜三维子断层对齐的 Gum-Net 迁移到二维,提出全无监督的稠密弹性配准架构,并在指纹数据上以零样本方式评估。

cs.CV · cs.AI

查看原文摘要

Dense non-rigid registration, the recovery of a pixel-wise deformation field that warps one image into geometric agreement with another, is fundamental across medical imaging, structural biology, and correspondence estimation, yet learning-based approaches face a severe bottleneck: ground-truth deformation fields are notoriously difficult to obtain for real data. We present 2D Gum-Net, an end-to-end architecture that predicts dense elastic deformation fields fully unsupervised. We transfer the Geometric Unsupervised Matching Network (Gum-Net), originally developed for 3D subtomogram alignment in cryo-electron tomography, to 2D elastic registration: all three modules are redesigned in 2D, and the rigid transformation head is replaced by a Dense Spatial Transformer that regresses a sparse control-point grid, lifted to a full-resolution field $Φ$ by bicubic interpolation. Downsampling uses DCT spectral pooling, implemented as frozen-basis matrix multiplications ($\approx 50\times$ GPU speedup), preserving the fine, quasi-periodic structure that max and average pooling destroy. We evaluate on contact-based fingerprints, a challenging testbed for this task: locally self-similar ridge patterns make correspondence maximally ambiguous, skin pressed against a sensor generates authentic large-displacement elastic distortion, and minutiae act as precise landmarks through which an independent matcher externally verifies the topological correctness of predicted fields. Trained purely on synthetic impressions and evaluated zero-shot on real benchmarks, our method improves structural correlation by up to 15.7% on FVC2004 and raises genuine match scores under an independent matcher while leaving imposter scores essentially unchanged. This suggests that the predicted deformations restore true structure without fabricating correspondences.

新论文 · v1arXiv:2611.12804

通过随机挑战对真实世界机器人操作进行基准测试

Benchmarking Real-World Robotic Manipulation through Stochastic Challenges

Elias Gläßer, Gülhan Şikaroğlu, Pavlo Kupyn, Marc Pollefeys, Zuria Bauer, Hermann Blum

AI 速读 基于摘要

论文提出“随机挑战”这一真实世界机器人操作基准测试新范式,并以移动操作任务为例,在不同实验室的两台机器人上进行比较。

cs.RO

查看原文摘要

A challenging bottleneck in manipulation research is reproducibility and comparability of methods in real-world environments. Since manipulation is an interactive task, it cannot be evaluated on a static dataset of observations. Benchmarking in simulation is a common remedy, but cannot cover the whole complexity of real-world tests. This paper proposes a new paradigm of stochastic challenges. Like the well-known YCB objects, it is based on reproducible real-world scenes and therefore allows system-level innovation and comparability between different platforms. Due to their stochastic nature, our challenges however, mimic the rigor and surprise of hidden test sets. To this end, we show how different robots in different labs can be compared based on their success rate over different random task samples, if these samples come from the same distribution. We propose stochastic challenges as a general paradigm for robot benchmarking and implement this paradigm in a novel benchmark for mobile manipulation, on which we compare two robots tested in two different labs.

新论文 · v1arXiv:2611.12799

Agentic-OPD:通过同策略蒸馏为智能体任务恢复被遗忘的智能体能力

Agentic-OPD: Recovering Forgotten Agent Capabilities via On-Policy Distillation for Agentic Tasks

Tingcheng Bian, Kangye Gong, Jinchang Luo, MingQuan Cheng, Feiran Liu, Ni Li, Xiaoling Xia, Haiwei Wang 等 9 位作者

AI 速读 基于摘要

作者提出 Agentic-OPD,把一次 GRPO 训练中保存的多个检查点当作冻结的教师池,用学生模型当前未解问题引导教师选择与监督过滤,以同策略蒸馏恢复最佳检查点丢失的能力覆盖。

cs.LG · cs.AI

查看原文摘要

Reinforcement learning is now the mainstream paradigm for training LLMs on agentic tasks, yet standard practice keeps only the best-validation checkpoint and discards the rest. We show that this is lossy: in GRPO training of LLM agents, the best-validation checkpoint fails on problems that earlier checkpoints from the same run had already solved, and the union of problems solved across checkpoints far exceeds any single one. The discarded checkpoints thus form a teacher pool obtained at no additional training cost, which on-policy distillation (OPD) can mine to recover the lost coverage. Mining this pool raises two challenges: i) which checkpoint to distill from, as no checkpoint dominates the others and complementarity to the student is problem-specific; ii) where to trust it, as even a well-chosen teacher is only locally superior, so indiscriminate distillation overwrites behavior the student has already mastered. We propose Agentic-OPD, which treats the best-validation checkpoint as the student and all saved checkpoints as frozen teacher candidates, using the student's evolving capability gaps to guide both teacher selection and supervision filtering: the HCN policy (Highest Coverage Next) dynamically selects teachers by weighted coverage of the student's unsolved problems, while the LAD module (Locality-Aware Distillation) confines transfer to failed student rollouts on problems where the teacher performs better. Across five agentic task domains and 24 benchmarks and task subsets, Agentic-OPD improves over its initialization checkpoint by up to 7.4 points, with a 4B student surpassing the latest frontier models GPT-5.6 and DeepSeek-V4.1 on deep search. Agentic-OPD recasts a finished RL run as a reusable pool of policies and establishes post-RL capability recovery as a stage orthogonal to improvements in the RL algorithm itself.

版本更新 · v2arXiv:2609.18639

CoRe-MARL:未知动态下基于循环多智能体强化学习的合作再分配

CoRe-MARL: Cooperative Redistribution Under Unknown Dynamics Using Recurrent Multi-Agent Reinforcement Learning

Naimur Rahman Chowdhury, Shatabdi Sen Prapti, Md. Salehin Seyam, Limon Bin Hossain

AI 速读 基于摘要

该研究提出 CoRe-MARL 合作式多智能体强化学习框架,用于在供需动态未知的分散式本地中心网络中再分配物资,以改善最差区域服务并缩小区域间服务差距。

cs.LG · cs.AI

查看原文摘要

Emergency management assistance programs, such as relief distribution, are essential for delivering necessary supplies to affected communities. However, these programs operate in a decentralized network of local centers that face uncertain local demand and supply dynamics, resulting in inconsistent avail- ability of local services. Redistribution of supplies among these local centers reduces these imbalances, but the centers often make decisions independently, with limited information and disrupted transportation. This study develops CoRe-MARL, a cooperative multi-agent reinforcement learning (MARL) framework, by formulating a decentralized partially observable Markov decision process (Dec-POMDP). We treat each center as an agent that learns a redistribution policy to improve the service in the worst-case region and reduce the service gap across regions while protecting network-wide service. We incorporate a recurrent network that captures evolving supply and demand dynamics without direct observation, while multi-agent proximal policy optimization (MAPPO) enables centralized training and decentralized execution (CTDE). We evaluate the framework in a simulated environment with diverse trajectories, where exact dynamics are not observed by actors and the MAPPO critic. We compare the recurrent MAPPO with the recurrent independent PPO (IPPO) and a local only heuristic, and find that MAPPO reduces the service gap across local centers and enhances service for the worst-served center while maintaining competitive network-wide service. The recurrent MAPPO also shows consistent performance across diverse trajectory patterns, demonstrating its ability to adapt to evolving dynamics. The findings demonstrate the capability of cooperative learning for decentralized redistribution and improving equitable service under uncertain and evolving dynamics.

新论文 · v1arXiv:2611.12798

互补性驱动的双教师分层对齐用于零样本EEG到图像检索

Complementarity-Driven Dual-Teacher Hierarchical Alignment for Zero-Shot EEG-to-Image Retrieval

Lukun Wu, Jie Li, Ziqi Ren, Ruiyang Xia, Yan Gao, Xinbo Gao

AI 速读 基于摘要

作者提出DTHA框架,用CLIP与DINOv2两类视觉基础模型作为双教师,对共享EEG编码器进行分层对比对齐,以提升零样本EEG到图像检索。

cs.CV

查看原文摘要

Decoding visual information from EEG is central to brain--computer interfaces and brain-inspired intelligence, and contrastive alignment with pretrained vision foundation models (VFMs) has become the dominant paradigm. However, existing methods align EEG solely with CLIP-family VFMs, leaving hierarchical visual information in neural responses under-exploited. To address this gap, we formulate a mechanism-paradigm correspondence view linking hierarchical visual processing (from appearance to semantics) to the complementary biases of cross-paradigm VFMs, with image-only models (e.g., DINO) and image--text models (e.g., CLIP) capturing distinct facets of this hierarchy. Guided by this view, we propose the Dual-Teacher Hierarchical Alignment (DTHA) framework. Concretely, a shared EEG encoder is supervised by frozen multi-blur CLIP and shallow DINOv2 teachers via dual-branch contrastive alignment, so each branch fully supervises the visual cues it emphasizes. A fused-retrieval objective learns adaptive weights to combine their complementary visual representations for zero-shot EEG-to-image retrieval. For the shared EEG encoder, we introduce the Attentive Modulated Scalp-Pattern Bank Encoder (AMSPBE), combining temporo-spatial attention with a learnable scalp-pattern bank for accurate, interpretable visual feature extraction, while modeling regional temporal dynamics and filter-bank topographies. On THINGS-EEG zero-shot retrieval, DTHA achieves 92.4% Top-1 accuracy, exceeding prior state of the art by 12.4 percentage points. Spatial, spectral, and representational-similarity analyses, together with THINGS-MEG evaluation, validate DTHA's effectiveness, biological plausibility, and cross-modality generalization. This complementarity-driven perspective shows that supervision from cross-paradigm VFMs enables more complete extraction of hierarchical visual information from brain activity.

版本更新 · v2arXiv:2512.24078

高维遗憾最小化

High-dimensional Regret Minimization

Junyu Liao, Ashwin Lall, Mitsunori Ogihara, Raymond Wong

AI 速读 基于摘要

提出 FHDR 框架,利用稀疏线性偏好,通过轻量交互在高维数据上快速发现关键属性,从而降低交互式遗憾最小化的交互轮数与执行时间。

cs.DB · cs.CG · cs.IR

查看原文摘要

Multi-criteria decision making over large databases is fundamental to many real-world applications. Interactive regret minimization has emerged recently as a promising approach that combines the controllable output size of top-$k$ queries with the flexibility of skyline queries, without requiring users to explicitly specify a utility function. Instead, the system iteratively presents a small set of options, learns the user's implicit preferences from their selections, and progressively refines its recommendations. However, modern applications such as housing search and financial product selection often involve hundreds of attributes. Existing interactive methods either fail to scale to such high-dimensional data or require excessive user interaction, frequently exceeding $1000$ rounds. We address this limitation with FHDR (Fast High-Dimensional Reduction), a framework that exploits sparse linear preferences to discover key attributes through lightweight interactions. We also propose AttributeSubset, an efficient single-round algorithm that returns a compact recommendation set without further feedback. In our experiments on real datasets, FHDR completes in under $0.03$s and requires fewer than $30$ interaction rounds under the default setting. Extensive experiments on both synthetic and real-world datasets show that FHDR outperforms the best-known baselines by at least one order of magnitude in execution time and by up to several orders of magnitude in interaction cost. These results establish FHDR as a new state of the art for scalable interactive regret minimization.

版本更新 · v2arXiv:2611.03486

融合IQR与异常检测的可解释时间特征混合游客预测框架:以内布拉斯加州湖泊为例

A Hybrid Visitor Prediction Framework using Interpretable Temporal features, Integrating IQR and Anomaly Detection in Lakes in Nebraska

Israt Zarin, Christopher Chizinski

AI 速读 基于摘要

该研究利用空间、基础时间与可解释时间特征预测内布拉斯加州湖泊日游客量,并比较IQR与异常检测处理及滞后特征对混合模型性能的影响。

cs.LG

查看原文摘要

For effective resource management, infrastructure planning, and sustainable tourism, it is really important to predict accurate visitors. This paper estimates the daily visitation of Nebraska lakes using spatial, basic temporal, and interpretable temporal features. Moreover, we evaluate the base models with multiple metrics. Using the best three models, our method will ensemble hybrid models and choose the best hybrid technique. Further, we investigate the impact of lag features and how the models work with different outlier detection techniques such as Interquartile Range (IQR) and anomaly detection. The models are evaluated using regression metrics (MAE, MSE, RMSE, MAPE, and R2). Experiment results show that, after removing anomalies, MAE, MSE, RMSE, and MAPE are reduced. Adding lag features also shows some positive effects on the results. Moreover, anomaly detection techniques perform better than IQR in improving performance while preserving data. The reported anomaly-based cross-validation results favored the voting ensemble over the compared base models on the evaluated metrics. In anomaly-based cross-validation, VOTE improved prediction errors compared with MLP (256,128,64); improvements varied in the single-split comparison. Specifically, the hybrid model reduced MAE by 9.82%, MSE by 3.12%, RMSE by 1.76%, and MAPE by 6.77%. In the reported cross-validation comparison, the best anomaly-based hybrid model had lower MAE, MSE, RMSE, and MAPE than the best IQR-based hybrid model by 9.81%, 34.30%, 18.99%, and 0.66%, respectively.

新论文 · v1arXiv:2611.12797

激进化管道:在线厌女现象的特征刻画与预测

The Radicalization Pipeline: Characterizing and Predicting Online Misogyny

Anna Bertani, Nathan Ratkiewicz, Alessandro Flammini, Filippo Menczer

AI 速读 基于摘要

该研究对参与过 Reddit r/incels 社区的用户进行纵向分析,作者报告其参与前后毒性言论与仇恨言论上升、活动领域转移,并称可用机器学习在参与前识别未来用户。

cs.SI

查看原文摘要

Social media platforms are known to shape and polarize user opinions and, increasingly, facilitate pathways toward ideological extremism. Among these trends, online misogynistic communities associ- ated with the incel (involuntary celibate) ideology have received growing scholarly attention. Previous work has primarily focused on ideological narratives and linguistic content within incel communities them- selves. However, much less is known about how user behaviors evolve over time, particularly before and after their engagement with incel spaces, and whether early signals can anticipate such transitions. In this study, we conduct a longitudinal analysis of Reddit users who participated in the r/incels community on Reddit. Our results show that engagement with the incel community is associated with a substantial in- crease in toxicity in both posts and comments, while hate increases particularly in posts after engagement. These changes extend beyond explicitly ideological communities: users who engage with the r/incels sub- reddit display elevated toxicity and hate speech even in subreddits related to leisure, entertainment, and everyday interests. In parallel, user activity shifts away from recreational and support-oriented communi- ties toward subreddits focused on social issues, indicating a broader reorientation of online participation. Finally, we show that future incel users can be identified with high accuracy prior to engagement using supervised machine learning models trained on linguistic, contextual, and interaction-based features. These findings suggest that online misogynistic radicalization follows detectable behavioral trajectories and diffuses across the broader social media ecosystem.

新论文 · v1arXiv:2611.12796

智能手机深度感知透射成像用于鸡胸肉肌病检测

Smartphone-Enabled Depth-Aware Transillumination Imaging for Detection of Chicken Breast Fillet Myopathies in Chicken Fillets

Chaitanya Pallerla, Ramesh Bahadur Bist, Yihong Feng, Yang Tian, Shiva Paudel, Casey M. Owens, Cengiz Koparan, Jeyamkondan Subbiah 等 9 位作者

AI 速读 基于摘要

该研究提出一种基于智能手机透射成像与3D点云的非破坏性方法,用于对鸡胸肉木质胸(WB)严重程度进行分级。

cs.LG

查看原文摘要

Woody Breast (WB) myopathy is a major quality defect in broiler chickens characterized by fibrosis, increased tissue hardness, and altered structural properties that affect product quality. Conventional palpation is subjective and labor-intensive, while many non-destructive methods require specialized equipment or substantial computational resources. This study developed a smartphone-based transillumination and 3D point-cloud framework for non-destructive WB severity classification. A total of 267 chicken breast fillets, including normal breast (NB, n = 87), mild WB (MWB, n = 85), and severe WB (SWB, n = 95), were evaluated using RAW transillumination images and 3D point clouds acquired with an iPhone 16 Pro. A total of 91 features, comprising 14 image-derived, 76 geometric, and one physics-informed Beer-Lambert attenuation feature, were extracted. Partial correlation controlling for thickness revealed a significant association between image characteristics and WB severity (r = 0.413, p < 0.0001), indicating optical information independent of fillet geometry. SWB tissue exhibited approximately 26% greater light attenuation per unit thickness than NB. The 2D-only models achieved approximately 82% test accuracy, while the multimodal ensemble combining Fusion-DGCNN, XGBoost, and physics-guided logistic regression (PGLR) achieved approximately 90% accuracy. These findings demonstrate the complementary value of optical, geometric, and physics-informed features and establish the feasibility of smartphone-based, non-destructive WB severity assessment.

版本更新 · v3arXiv:2608.11211

Conway 99-图问题的强制结构约化与可验证界

A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph

Aalok Thakkar, Simone Severini

AI 速读 基于摘要

作者通过固定一个顶点把 srg(99,14,1,2) 的存在性问题约化为 84 个顶点上的受约束 12-正则图,并用 CP-SAT、循环图枚举和进化式程序搜索给出可验证的部分得分上界与构造。

cs.AI · cs.SC · math.CO

查看原文摘要

Conway's 99-graph problem asks whether a strongly regular graph with parameters srg(99,14,1,2) exists. We develop two complementary lines of attack. Fixing one vertex, the conditions lambda=1 and mu=2 force its neighbourhood to be a perfect matching and determine every edge between that neighbourhood and the remaining vertices. For (99,14,1,2), the unresolved part is therefore a constrained 12-regular graph on 84 vertices. We encode this reduction in CP-SAT and validate it by recovering the unique srg(9,4,1,2). We also prove by exhaustive enumeration that no circulant graph on Z/99 satisfies more than 68.0% of the CAISc constraints, and we give a validated orbit formulation for prescribed automorphisms. We then study the partial-score search problem. Fourteen human-designed search configurations reached at most 69.43%. Separately, we supplied the scoring function to an evolutionary program-search system. It produced a degree-preserving 4-vertex-switch tabu search whose best verified artifact scores 70.73%. The generated move differs from those used in our own searches and crosses a plateau that was stable under them. A tabu search restricted to graphs with a prescribed symmetry group, first Z/33 and then its subgroup of order 11, reaches a 14-regular graph scoring 76.67%. These results do not resolve the existence problem, but they reduce the exact search space and improve the best verified partial construction found in our experiments.

新论文 · v1arXiv:2611.12795

通过补全框架对Aaronson-Ambainis猜想的简短证明

A short proof of the Aaronson-Ambainis Conjecture via the completion framework

Thomas Huffstutler, David Miloschewsky, Supartha Podder

AI 速读 基于摘要

作者报告利用补全框架给出了Aaronson-Ambainis猜想的一个简短证明,并建立了基于经典对手测度的更一般界。

quant-ph · cs.CC

查看原文摘要

We give a short proof of the Aaronson-Ambainis conjecture. If a partial Boolean function $f$ is defined on a $δ$-fraction of all $n$-bit strings and have quantum query complexity $Q(f)$, then, for every $0<ε<1$, a deterministic algorithm computes $f$ correctly on at least a $1-ε$ fraction of its domain using $O( Q(f)^6 / (εδ)^2)$ queries. Our proof uses the completion framework and establishes a more general bound in terms of the classical adversary measure. The only result we use from Turturean's recent proof is a special case of his certificate inequality, for which we provide a self-contained proof. We also derive the stronger variant of the Aaronson-Ambainis Conjecture, the bounded-polynomial influence conjecture, from our main result in the appendix.

版本更新 · v2arXiv:2611.08738

抗单粒子翻转的多上下文自旋电子FPGA

SEU Hardened Multi-Context Spintronic FPGA

Abdolah Amirany, HamidReza Imani, Samuel Farid, Tarek El-Ghazawi

AI 速读 基于摘要

提出一种利用MTJ非易失性实现内部多配置存储并具备SEU加固能力的自旋电子FPGA架构。

cs.ET

查看原文摘要

Due to susceptibility to radiation-induced soft errors and resource constraints implementing large and complex designs on field programmable gate arrays (FPGAs) in harsh environments is challenging. Therefore, to mitigate these issues, this paper proposes an innovative approach through the introduction of a single event upset (SEU)-hardened spintronic FPGA architecture that incorporates multi-context capabilities. Leveraging the non-volatile properties of magnetic tunnel junction (MTJ), the proposed design can store two/four distinct configurations internally, eliminating the dependence on external non-volatile memory which significantly boosts the system performance. Additionally, through post-layout simulation, we demonstrate our design immunity to SEU, which enhances its reliability and operational stability in environments susceptible to radiation-induced soft errors. The efficiency of the proposed design was also evaluated using the ROSSETA benchmark, which serves as a representative model for real-world FPGA applications.

版本更新 · v2arXiv:2603.10244

Transposition 对独立同分布列表更新问题近乎最优

Transposition Is Nearly Optimal for IID List Update

Christian Coester

AI 速读 基于摘要

作者证明:在请求独立同分布(i.i.d.)的列表更新问题中,无记忆的 Transposition 规则的平稳期望访问成本不超过最优静态排序成本 OPT 加 1,从而在不可避免的加性常数意义下证实了 Rivest 猜想。

cs.DS

查看原文摘要

The list update problem is one of the oldest and simplest problems in online algorithms: A set of items must be maintained in a list while requests to these items arrive over time. Whenever an item is requested, the algorithm pays a cost equal to the position of the item in the list. In the i.i.d. model, where requests are drawn independently from a fixed distribution, the static ordering by decreasing access probabilities $p_1\ge p_2\ge \dots \ge p_n$ achieves the minimal expected access cost $\mathrm{OPT}=\sum_{i=1}^n ip_i$. However, $p$ is typically unknown, and approximating it by tracking access frequencies creates undesirable overheads. A 50-year old conjecture by Rivest states that the Transposition rule (swap the requested item with its predecessor) is optimal among memoryless algorithms. While known to be false in the strict sense, prior research provided asymptotic confirmation of Rivest's conjecture for restricted distributions. We show that for all distributions, Transposition has stationary expected access cost at most $\mathrm{OPT}+1$, confirming Rivest's conjecture up to an unavoidable additive constant, and showing near-optimality even among algorithms with memory. More abstractly, it yields a purely memoryless procedure to approximately sort probabilities via sampling.

版本更新 · v2arXiv:2605.27734

从自身潜在表示而非词元中学习:一种样本复杂度理论

Learn from your own latents and not from tokens: A sample-complexity theory

Daniel J. Korchinski, Alessandro Favero, Matthieu Wyart

AI 速读 基于摘要

作者在可解析的概率上下文无关文法数据上证明:预测自身潜在表示相比监督学习或词元级自监督学习可将样本复杂度从随深度 L 指数增长降为常数级(至多对数因子),并据此认为显式堆叠多尺度层级(如 H-JEPA)基本冗余。

cs.LG

查看原文摘要

Generative models, from diffusion models to large language models, achieve remarkable performance but at a cost in training data orders of magnitude larger than what biological learners require. An alternative paradigm has emerged in which networks are trained to predict their own latent representations of related views or masked regions, as in data2vec and JEPA -- an idea related to predictive-coding accounts of the cortex. Despite strong empirical results, the theoretical understanding of these methods remains limited. Central questions include: by how much does latent prediction actually improve data efficiency? Is there a benefit to stacking such methods into multi-scale hierarchies? We answer both using as data a tractable probabilistic context-free grammar that captures the compositional structure of natural language and images. Such a grammar generates strings of visible tokens by recursively applying production rules along a tree of hidden symbols of depth $L$. For such data, supervised or token-level SSL require a number of samples exponential in $L$ to recover the latent tree; we prove that latent prediction achieves this with a number of samples constant in $L$, up to logarithmic factors. We confirm this bound with (i) a hierarchical clustering algorithm, (ii) an end-to-end neural network whose predictor-clusterer modules predict their own latents at each level via gradient descent, and (iii) the first sample-complexity analysis of data2vec, which we show implicitly performs hierarchical latent prediction. This suggests that explicit stacking such as H-JEPA is largely redundant.

版本更新 · v2arXiv:2610.00518

通过训练动力学动作的一步生成建模

One-Step Generative Modeling via Training Dynamics Action

Zhangyong Liang, Ying Huang, Haibin Ling

AI 速读 基于摘要

提出 TDAction,依据共享参数实现代价选择传输目标,在保持分布进展的同时构建一步生成器,并在 ImageNet 256×256 上报告 FID 低于 1.1(无需蒸馏)。

cs.LG

查看原文摘要

One-step generative models construct a static generator through iterative training-time transport. Existing transport objectives primarily assess distributional motion, although a neural generator needs to realize the requested sample displacements jointly through shared parameter updates. The training-time construction raises the question: \emph{once training becomes the iterative process that constructs the final one-step map, what to optimize: the next distributional move, or the route by which the finite generator learns the final map?} To address the question, we introduce \textbf{T}raining \textbf{D}ynamics \textbf{A}ction (\textbf{TDAction}), which selects transport targets according to local shared-parameter realization cost while retaining a prescribed level of distributional progress. We formulate the cost as a soft-terminal control problem and derive a closed-form Batch Tangent Action-to-Go value that accounts for parameter effort and terminal mismatch. The criterion captures cross-sample interactions omitted by independent pairwise costs; under isotropic mobility, the criterion agrees with quadratic Euclidean assignment for deterministic balanced couplings. Randomized tangent probes provide a low-rank implementation that constructs shared detached targets without adding an inference-time trajectory. Controlled studies examine the relationship between generator geometry, transport selection, and realized local action. On ImageNet $256\times256$, TDAction attains an FID below $1.1$ without distillation.

新论文 · v1arXiv:2611.12791

大语言模型作为开放世界自动化机器学习的通用搜索器

Large Language Models as a Universal Searcher for Open-World Automated Machine Learning

Yuxuan Hu, Jihao Liu, Weikang Shi, Xijie Huang, Linda Wei, Mingjie Zhan, Aojun Zhou, Rui Liu 等 9 位作者

AI 速读 基于摘要

作者提出基于大语言模型的通用AutoML框架,用统一数值编码NCode将架构、超参数与数据配比联合优化重构为排序任务,并在多任务上报告了跨域泛化与可扩展性结果。

cs.CL

查看原文摘要

Developing effective machine learning models requires complex manual tuning, while current Automated Machine Learning (AutoML) frameworks remain domain-specific and isolate model architecture, training hyperparameter, and data ratio optimization. Here, we bridge this gap by proposing a universal, large language model (LLM)-based AutoML framework that jointly optimizes these configurations for the first time without the need for task-specific fine-tuning. We propose NCode, a unified numerical encoding scheme that translates diverse AutoML design choices into universal discrete sequences and effectively reframes the optimization process as a unified ranking task. Trained solely on optimization trajectories derived from a limited, single-domain vision task, the proposed LLM-based searcher demonstrates impressive cross-task, cross-modality and joint search-space optimization generalizability, achieving state-of-the-art performance across image classification, image segmentation, speaker verification and text-to-image benchmarks. Crucially, it exhibits superior scalability in the large-scale training and joint optimization of a billion-parameter Diffusion Transformer, requiring 896 GPU-days and attaining a state-of-the-art GenEval score of 0.91. By leveraging reinforcement learning to instill Chain-of-Thought reasoning, we provide a systematic way to interpret the LLM-based searcher's internal decision-making mechanisms, revealing its optimization strategy shifted from the early-stage diversity-driven exploration to the late-stage anchor exploitation. Our proposed framework provides a scalable, generalizable, and interpretable pathway toward general-purpose open-world machine learning optimization.

版本更新 · v2arXiv:2611.08715

高效自旋电子随机传感内计算模块

Efficient Spintronic Stochastic In-Sensor Computing Modules

Abdolah Amirany, HamidReza Imani, Samuel Farid, Tarek El-Ghazawi

AI 速读 基于摘要

作者提出利用磁隧道结亚临界翻转区随机特性的自旋电子随机计算模块,用于资源受限的传感内处理系统。

cs.ET

查看原文摘要

In-sensor processing (ISP) is used in various fields, including autonomous driving automotive systems, wearable healthcare devices, environmental monitoring, wireless sensor networks, smart cities, and industrial control systems. One of the main features of most of these applications is energy and hardware restriction. This restriction amplifies the importance of using high-performance and low-energy consumption computing systems and methods. This paper proposes efficient spintronic stochastic computing modules for in-sensor computing systems to address this challenge. The proposed design utilized the stochastic behavior of the magnetic tunnel junction in the subcritical switching regime to generate a probability-adjustable random stream. Probability-adjustable random stream generation is the most important step in any stochastic system because it determines the quality of the final output. The simulation results indicate that the proposed design offers almost the same peak signal-to-noise ratio and structural similarity while occupying at least 62\% lower area and consuming 60\% lower energy. These advantages made the proposed design a good choice for ISP applications with limited energy.

版本更新 · v2arXiv:2604.23442

资源受限边缘设备上基于无人机的杂草检测用于特定地点管理

Resource-Constrained UAV-Based Weed Detection for Site-Specific Management on Edge Devices

Linyuan Wang, Haibo Yao, Te-Ming Tseng, Kelvin Betitame, Xin Sun, Yanbo Huang, Dong Chen

AI 速读 基于摘要

该研究提出面向部署的无人机实时杂草检测框架,在三种Jetson边缘设备上系统评估YOLO与RT-DETR系列模型的精度—延迟权衡。

cs.CV

查看原文摘要

Weeds compete with crops for light, water, and nutrients, reducing yield and crop quality. Efficient weed detection is essential for site-specific weed management (SSWM). Although deep learning models have been deployed on UAV-based edge systems, a systematic understanding of how different model architectures perform under real-world resource constraints is still lacking. To address this gap, this study proposes a deployment-oriented framework for real-time UAV-based weed detection on resource-constrained edge platforms. The framework integrates UAV data acquisition, model development, and on-device inference, with a focus on balancing detection accuracy and computational efficiency. A diverse set of state-of-the-art object detection models is evaluated, including convolution-based YOLO models (v8-v12) and transformer-based RT-DETR models (v1-v2). Experiments on three edge devices (Jetson Orin Nano, Jetson AGX Xavier, and Jetson AGX Orin) demonstrate clear trade-offs between accuracy and inference latency across models and hardware configurations. Results show that high-capacity models achieve up to 86.9% mAP50 but suffer from high latency, limiting real-time deployment. In contrast, lightweight models achieve 66%-71% mAP50 with significantly lower latency, enabling real-time performance. Among all models, RT-DETRv2-R50-M achieves competitive accuracy (79% mAP50) with improved efficiency, while YOLOv10n provides the fastest inference speed. YOLOv11s and RT-DETRv2-R50-M offer the best balance between accuracy and speed, making them strong candidates for real-time UAV deployment.

版本更新 · v2arXiv:2609.38962

用免训练的不确定性引导转向缓解推理任务中的幻觉

Alleviating Hallucination in Reasoning Tasks with Training-Free Uncertainty-Guided Steering

Litian Liu, Qiqi Hou, Yubing Jian, Reza Pourreza, Mohammad Ghavamzadeh, Roland Memisevic, Yao Qin, Hong Cai

AI 速读 基于摘要

提出免训练的 USteer,在推理时利用置信度对激活的梯度调整逐层激活,把不确定性信号从检测用途转为直接改善答案正确性。

cs.AI

查看原文摘要

Recent work on hallucination detection in large language models has shown that, for a fixed pre-trained model and reasoning task, it is possible to estimate the model's confidence in the correctness of its outputs. Such uncertainty estimates have primarily been used to improve truthfulness by detecting or filtering confabulations. In this work, we ask whether these signals can instead be used more proactively to directly improve the accuracy of model-generated answers. We propose USteer, a simple, training-free steering mechanism that adjusts a model's layer-wise activations during inference using the gradient of a confidence measure with respect to the activations. This procedure nudges generation toward outputs with lower uncertainty at inference time, without modifying model parameters or requiring additional supervision. We show that this approach consistently reduces hallucination across a range of reasoning tasks, demonstrating that confidence signals can be leveraged not only for detection, but also for effective inference-time control of model behavior.

版本更新 · v2arXiv:2605.20105

最优表示维度:预训练与线性探测的高维分析

Optimal Representation Size: High-Dimensional Analysis of Pretraining and Linear Probing

Valentina Njaradi, Clémentine Dominé, Rachel Swanson, Marco Mondelli, Andrew Saxe

AI 速读 基于摘要

该文在高维极限下建立预训练(PCA结构提取)加线性探测(线性回归)的解析模型,刻画下游泛化误差如何随表示维度、无标签/有标签样本量与任务对齐度变化,并给出最优表示维度的条件。

cs.LG

查看原文摘要

Learning to generalise from limited data is a fundamental challenge for both artificial and biological systems. A common strategy is to extract reusable structure from abundant unlabelled data, enabling efficient adaptation to new tasks from limited labelled data. This two-stage paradigm is now standard in modern training pipelines, where pretraining is followed by fine-tuning or linear probing. We provide an analytical model of this process: structure extraction is formalized as principal component analysis on unlabelled data, and downstream learning as linear regression on a separate labelled dataset. In the high-dimensional regime, we derive exact expressions for training and generalisation error showcasing their dependence on representation dimensionality, unlabelled and labelled sample sizes, and task alignment. Our results show that pretrained representations strongly influence downstream generalisation, and we characterize the optimal representation size as a function of task parameters: with abundant pretraining data but scarce downstream data, maximally compressed representations are optimal, whereas with limited pretraining data, higher-dimensional representations generalise better. Furthermore, we establish an exact trade-off between pretraining and supervision, quantifying how much unlabelled data is required to replace a single labelled sample. Beyond our idealised model, we observe similar phenomenology in autoencoders and pretrained LLMs. Altogether, we highlight that optimising representation size is critical, giving conditions for when compression during pretraining improves generalisation.

新论文 · v1arXiv:2611.12777

锚定行为而非参数:基于单一共享提示的无回放持续学习

Anchor Behavior, Not Parameters: Rehearsal-Free Continual Learning with a Single Shared Prompt

Duy-Cuong Bui, Trung-Anh Dang, Vincent Nguyen, Duc V. Le, Ngoc-Son Vu

AI 速读 基于摘要

提出 TEA-Prompt,用单一共享提示做无回放持续学习,通过锚定注意力行为而非冻结参数来兼顾可塑性与旧知识保持。

cs.LG · cs.CV

查看原文摘要

Prompt-based continual learning adapts a frozen pre-trained vision transformer by tuning a small set of prompt tokens. Recently, one-prompt methods which share one single prompt across all tasks make this paradigm maximally parameter efficient. The open question is how a shared prompt can keep the knowledge of old classes while being updated for new ones. Existing methods protect old knowledge in parameter space, where they freeze task-specific prompts, expand new components, or sparsely gate which tokens receive gradients. However, this method sacrifices plasticity, yet the drift it still permits in shared tokens can corrupt the prompt's function on past classes. What must be preserved is the prompt's behavior. We propose TEA-Prompt, which couples (i) a token evaluation module that assigns each prompt token a continuous, input-conditional relevance score injected into the attention logits, softly specializing tokens across tasks without discarding any of them, and (ii) an attention-behavior anchoring loss that constrains each token's attention output around class-specific query regions using only compact Gaussian query statistics without stored old images, weighted by the token's past relevance. Anchoring the attention value allows the parameters to continue updating freely, as long as their interaction remains unchanged. TEA-Prompt achieves state-of-the-art accuracy with markedly lower forgetting on CIFAR-100, ImageNet-R, and CUB-200 with only 0.38M parameters. Code is publicy available at https://github.com/cuonga1cvp/TEA-Prompt.git

新论文 · v1arXiv:2611.13062

Elicitation of the parameters of a multi-criteria sorting model

Eda Ersek Uyanik

原文摘要

Multiple-criteria decision aiding (MCDA) proposes models and methods for different types of decision problems such as choice, ranking or sorting. Such models involve various parameters that must be elicited. In the elicitation process, all necessary information has to be taken from the decision-maker. For this, several direct and indirect elicitation methods are suggested in the literature. In this work, we concentrate on direct elicitation: we aim at providing a rigorous elicitation procedure for the parameters of the Non-Compensatory Sorting model (NCS), which has been characterized by an axiomatic analysis. A basic version of the NCS model is considered, i.e., a model with two categories and no vetoes. The parameters are the set of sufficient coalitions of criteria and the profile separating the two categories. Regarding the sufficient coalitions, we propose several questioning algorithms that engraft questions on classical graph exploration algorithms such as depth-first search. Such algorithms are implemented and evaluated by simulation. For eliciting the limit profile, we design a questioning algorithm using dichotomy. Questioning algorithms can be optimal in the worst case or on average. An optimal algorithm in the worst case has been proposed by Hansel in the framework of monotone Boolean functions. We implement and evaluate this algorithm as a variant of the depth-first search approaches. Regarding optimal questioning strategies on average, we evaluate decision trees for up to four criteria. On the other hand, we assess how more general is NCS as compared to MR-Sort, a particular case of the NCS model in which sufficient coalitions can be represented by additive weights.

cs.AI · cs.GT

版本更新 · v2arXiv:2606.15004

衡量部署,而非仅衡量模型:重新思考微控制器的硬件感知模型选择

Measure the Deployment, Not Just the Model: Rethinking Hardware-Aware Model Selection for Microcontrollers

Joseph Q. Zales, Pragya Sharma, Mani Srivastava

AI 速读 基于摘要

提出开源硬件在环实验系统 CREST,在指定发布调度下评估模型与硬件配置,并通过三个案例说明仅测推理能耗会误导微控制器上的模型与时钟选择。

eess.SY · cs.LG

查看原文摘要

Selecting an energy-efficient model for periodic sensing requires accounting for time between inferences. Hardware-aware model search typically measures inference alone, even when the application cares about energy per release. We present CREST (Cross-platform Runtime Evaluation and Search Tool), an open-source hardware-in-the-loop experimentation system that evaluates model and hardware configurations under a specified release schedule. Researchers can vary the objective, schedule, target and candidate proposer while reusing evaluation and replay. Records preserve comparison conditions and separate valid measurements from deployable candidates. Three case studies demonstrate the system. First, searches and controlled replay on STM32 N657 show how waiting changes model and clock selection. For one architecture, continuous inference favors 800 MHz over 300 MHz at 8.0 versus 17.1 mJ per inference, but additional waiting offsets 97% of this saving in a fitted decomposition. With STOP between releases, 300 MHz uses about 0.3-0.4% less board energy per release at 100 and 500 ms. At a fixed clock, the preferred architecture changes between release periods, which a model with shared waiting parameters cannot produce. Latency predicts continuous energy within a median 1.7% on held-out observations, yet most release-energy error remains in scheduled terms. In paired replay, one of six randomly selected near-latency pairs reverses its continuous-energy order by 5.8 mJ per release. Second, replay on three Arduino targets shows proxy-selected inertial-odometry candidates can fail to fit or use more energy than measured selections, with only 9 of 16 FLOPs-selected candidates fitting the most memory-constrained board. Third, an audio classification study reuses the evaluator with LLM-based candidate proposers, and cross-target replay moves a selected configuration from third to last in energy rank.

新论文 · v1arXiv:2611.12775

LogCDM:基于行为图漂移与自适应信号融合的可解释日志异常检测

LogCDM: Interpretable Log Anomaly Detection via Behavioral Graph Drift and Adaptive Signal Fusion

Suryansh Talukdar, Taha Sarwat, Jin Soung Yoo

AI 速读 基于摘要

LogCDM 是一种紧凑的日志异常检测器,通过融合小因果 Transformer 的下一事件惊讶度、图注意力嵌入距离和转移漂移统计量三个信号,在 CPU 上实现可解释且接近大模型性能的检测。

cs.AI

查看原文摘要

Log-based anomaly detection is increasingly dominated by large pretrained models, from BERT-scale encoders to 8B-parameter language models, which require GPUs at inference time and are difficult to deploy on the monitoring nodes where logs are produced. We present LogCDM, a compact detector that scores each log session using three complementary signals: the next-event surprise of a small causal Transformer, the distance between a graph-attention embedding of the session's own transition graph and that of a normal reference graph, and a transition-drift statistic that we show is exactly a frequency-weighted chi-squared divergence between transition kernels. The divergence view yields an asymptotic null distribution, a length-standardized score, and a per-edge decomposition that explains each alarm. A sigmoid gate fuses the three signals; under a shared-covariance Gaussian model, this gate is the Bayes posterior, and its learned weights indicate which signal each dataset relies on. With 8.1-8.8M parameters and no GPU required at inference, LogCDM reaches F1 scores of 0.984 on HDFS, 0.870 on chronologically split BGL, and 0.850 on Thunderbird, within 0.013-0.12 of an 8.1B-parameter LLM detector evaluated under the same protocol and above all compact baselines on BGL. It scores a session in 5.5-10.5 ms on a CPU. Ablations show that the structural signals add 0.025-0.030 F1 on BGL and Thunderbird but almost nothing on HDFS, consistent with the learned fusion weights.

新论文 · v1arXiv:2611.13061

The Left Ripple of Byte-Pair Encoding: Certified Lookbehind for Every Dictionary

Nicklas Nidhögg

原文摘要

Berglund and van der Merwe formalized byte-pair encoding and bounded how far an appended string can change a tokenization, leaving the converse open: how far can a string prepended on the left change it, which dictionaries make that ripple infinite, and can it be computed efficiently when finite? We answer all three for every dictionary. The origin radius, how far a prepend can change covering spans, is decided with radius certificates by a product of two runs of the automaton that guesses the final tokens, in time polynomial in the dictionary written out, and it is infinite exactly when one periodic word has two canonical tilings with no common boundary. Under their ordering condition it is infinite exactly when some rule (t, t) finds its two copies adjacent at its own stage, and such a rule makes any dictionary infinite. A finite radius makes every window of a width read off the radii have a cut, and the radius is finite exactly when such cuts are dense. The token machine completes for every dictionary, and the tokenization is subsequential, extending what Berglund, Martens and van der Merwe proved for proper ones under one pass per rule. A streaming tokenizer emits after every symbol exactly the tokens that no continuation changes, in polynomial time, answering a question of Dalirrooyfard and Ye. Boundedness of the label measure, the edit distance of the token sequences, is decided for every dictionary in polynomial time as well, and under the ordering condition the largest distance one edit causes over dictionaries of m rules lies asymptotically between m^2/10 and m^2/2. GPT-2's merge table carries 244 effective self-pairs, so its origin radius is infinite from the forty-second merge on, and that of cl100k, o200k and Llama 3 from their first. Every measured number is its program's output, and what is not executed is named.

cs.FL · cs.CL · cs.DS · cs.PL

版本更新 · v3arXiv:2604.06098

JUÁ——巴西法律文本集合信息检索基准

JUÁ -- A Benchmark for Information Retrieval in Brazilian Legal Text Collections

Jayr Pereira, Leandro Fernandes, Erick de Brito, Roberto Lotufo, Luiz Bonifacio

AI 速读 基于摘要

作者提出 JUÁ,一个面向巴西葡萄牙语法律文本的公开检索基准与持续评估基础设施,并在其上比较词法、稠密与 BM25 重排流程。

cs.IR · cs.CL

查看原文摘要

Legal information retrieval in Portuguese remains difficult to evaluate systematically because available datasets differ widely in document type, query style, and relevance definition. We present JUÁ, a public benchmark for Brazilian legal retrieval designed to support more reproducible and comparable evaluation across heterogeneous legal collections. More broadly, JUÁ is intended not only as a benchmark, but as a continuous evaluation infrastructure for Brazilian legal IR, combining shared protocols, common ranking metrics, fixed splits when applicable, and a public leaderboard. The benchmark covers jurisprudence retrieval as well as broader legislative, regulatory, and question-driven legal search. We evaluate lexical, dense, and BM25-based reranking pipelines, including a domain-adapted Qwen embedding model fine-tuned on JUÁ-aligned supervision. Results show that the benchmark is sufficiently heterogeneous to distinguish retrieval paradigms and reveal substantial cross-dataset trade-offs. Domain adaptation yields its clearest gains on the supervision-aligned JUÁ-Juris subset, while BM25 remains highly competitive on other collections, especially in settings with strong lexical and institutional phrasing cues. Overall, JUÁ provides a practical evaluation framework for studying legal retrieval across multiple Brazilian legal domains under a common benchmark design.

版本更新 · v3arXiv:2604.01925

ImplicitBBQ:通过特征线索评测大语言模型中的隐性偏见

ImplicitBBQ: Benchmarking Implicit Bias in Large Language Models through Characteristic Based Cues

Bhaskara Hanuma Vedula, Darshan Anghan, Ishita Goyal, Ponnurangam Kumaraguru, Abhijnan Chakraborty

AI 速读 基于摘要

作者提出基于特征线索的问答基准 ImplicitBBQ,用于评测大语言模型在年龄、性别、地域、宗教、种姓和社会经济地位等维度上的隐性偏见。

cs.CL · cs.AI

查看原文摘要

Large Language Models increasingly suppress biased outputs when demographic identity is stated explicitly, yet may still exhibit implicit biases when identity is conveyed indirectly. Existing benchmarks use name based proxies to detect implicit biases, which carry weak associations with many social demographics and cannot extend to dimensions like age or socioeconomic status. We introduce ImplicitBBQ, a QA benchmark that evaluates implicit bias through characteristic based cues, demographically associated attributes that signal implicitly, across age, gender, region, religion, caste, and socioeconomic status. Evaluating 11 models, we find that implicit bias in ambiguous contexts is over six times higher than explicit bias in open weight models. Notably, this bias is distributed unevenly across demographics: caste emerges as the most severe while gender is the least affected. Safety prompting and chain-of-thought reasoning fail to substantially close this gap; even few-shot prompting, which reduces implicit bias by 79%, leaves caste bias at four times the level of any other dimension. These findings indicate that current alignment and prompting strategies address the surface of bias evaluation while leaving demographically associated stereotypic associations largely unresolved. We publicly release our code and dataset for model providers and researchers to benchmark potential mitigation techniques.

新论文 · v1arXiv:2611.12770

超越虚假信息 2026:虚假信息与错误信息监管的全球趋势

Beyond Falsehoods 2026: Global Trends in the Regulation of Misinformation and Disinformation

Fakhar Abbas, Simon Chesterman, Eka Nugraha Putra

AI 速读 基于摘要

该报告基于1995—2025年409条编码监管与政策条目,梳理全球针对错误信息、虚假信息与恶意信息的立法与监管趋势。

cs.CY

查看原文摘要

This report examines global legislative and regulatory responses to misinformation, disinformation, and mal-information (MDM) between 1995 and 2025. Drawing on an expanded and updated dataset of 409 coded regulatory and policy entries, including hard and soft law, policy measures, and proposed or draft instruments, it analyses their growth, geographic distribution, substantive focuses, and regulatory designs, which represent the various approaches taken against MDM, as well as early evidence of their implementation. The central finding is sustained and accelerating regulatory growth. Annual activity increased from 11 instruments in 2016 to 46 in 2023, 67 in 2024, and 71 in 2025. The number of instruments currently in force has reached 282, despite 34 measures having been repealed, withdrawn, or judicially invalidated. This growth has also been accompanied by a shift in regulatory focus. Earlier measures relied heavily on broad prohibitions of "false information," whereas more recent measures increasingly target specific harms, including deepfakes, election interference, non-consensual intimate imagery, and child safety. Regulatory responsibility is also increasingly being placed on platforms rather than solely on individual creators and users.

新论文 · v1arXiv:2611.12769

学习率衰减可指数级加速SGD实现非凸函数全局优化

Learning Rate Decay Can Exponentially Accelerate SGD for Global Optimization of Nonconvex Functions

Guneykan Ozgul, Dylan Herman, Junhyung Lyle Kim, Shree Hari Sureshbabu, Shouvanik Chakrabarti

AI 速读 基于摘要

作者证明在一类自然非凸函数上,带学习率衰减的SGD在小步长情形下实现全局优化所需的梯度查询次数比任何固定学习率SGD指数级更少。

math.OC · cs.DS · cs.LG

查看原文摘要

Stochastic Gradient Descent (SGD) is a workhorse algorithm for continuous optimization. It is a folk belief among deep learning practitioners that learning rate decay in SGD substantially improves performance. However, it has remained unclear whether learning rate decay offers an asymptotic advantage for global nonconvex optimization. We answer this question in the affirmative by demonstrating a natural class of nonconvex functions for which, we prove that SGD with learning rate decay requires exponentially fewer gradient queries for global optimization than SGD with any fixed learning rate in the small-step size regime. To the best of our knowledge, this is the first exponential advantage that has been demonstrated for learning rate decay. The class of functions we consider includes many popular benchmark nonconvex functions. Our results provide a robust explanatory theory for the empirically observed benefits of learning rate decay for global optimization. We show that annealing performs the non-logconcave sampling task associated to the optimization problem in polynomial time, via a novel application of weak Poincaré inequalities.