跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-15 17:30 — 2026-11-16 17:30(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

The Alignment Illusion in Multimodal Large Language Models

Hong-Han Wang, Yuntao Wang, Hu Ding

原文摘要

Layer-wise visual-text similarity in Multimodal Large Language Models (MLLMs) is widely interpreted as evidence that the language model progressively integrates visual content into a shared representation space. This reading rests on the assumption that scalar alignment scores reflect content-level cross-modal interaction. To test this assumption, we apply controlled interventions to the visual stream. Across 13 MLLMs from five families spanning 0.5B to 72B parameters, replacing projector-output visual tokens with Gaussian noise sharply reduces task accuracy, yet four standard scalar measures (CKA, SVCCA, MIR, and the leading principal-angle cosine) fail to consistently separate the corrupted stream from the original. We call this failure the alignment illusion and trace it to the shared language-model pathway: anisotropic MLP down-projections pull visual and text tokens toward common output directions, producing weight-induced alignment. We introduce the principal-angle gap (PA gap), defined as the difference between the top two principal-angle cosines, to distinguish leading-direction dominance from the broader overlap observed with structured visual content. Under graded visual corruption, the PA gap tracks task accuracy more consistently than the scalar scores we consider; under a structured but irrelevant image, it further exposes regimes in which internal geometry and task accuracy come apart. Internal visual-text alignment in MLLMs is therefore best read as a geometric diagnostic of the visual stream inside the language model rather than a direct proxy for content-level cross-modal interaction, and is most informative when calibrated by controlled task evidence.

cs.CV · cs.LG

版本更新 · v6arXiv:2609.07979

The Stretch Factor of Planar Delaunay Triangulations Is Nearly Determined

Guanlin Mo, Kangke Cheng, Hu Ding

原文摘要

The Delaunay triangulation is a classical geometric structure on a finite set of points in the plane. Its stretch factor is the largest ratio of the shortest-path distance along its edges to the Euclidean distance between the same two points. Determining the worst-case stretch factor of planar Delaunay triangulations is a long-standing open problem. We prove a uniform upper bound of 1.5949, improving the previous bound of 1.998 and narrowing the gap to the best known lower bound of 1.5932 from 0.4048 to less than 0.0017, nearly pinpointing the worst-case stretch factor. A central difficulty is that the line segment between two points may cross arbitrarily many triangles. Our progress accounting framework addresses this by converting the global bound into a family of local inequalities, each involving only a fixed number of real parameters regardless of the number of triangles crossed. Two further geometric lemmas make computer-assisted verification tractable: the pencil lemma decomposes each local transition into two geometrically independent stages, reducing verification over infinitely many possible next disks to a single differential condition; and the corner lemmas handle degenerate boundary cases where direct verification would fail. With these reductions, the proof ends with a finite verification of an explicit potential in exact rational arithmetic and outward-rounded interval arithmetic. Numerous geometric network constructions use the Delaunay stretch factor as a black box, so the tighter bound directly improves stretch-factor guarantees for a range of downstream applications, including bounded-degree plane spanners and low-weight spanners.

cs.CG

版本更新 · v3arXiv:2609.07974

A $(3+ε)$-Approximation for Fair $k$-Means and a Matching Lower Bound

Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding

原文摘要

Fair clustering aims to prevent algorithmic bias against protected groups. We study Euclidean fair $k$-means, in which the proportion of each protected group in every cluster lies between prescribed lower and upper bounds. Because these constraints violate the nearest-center assignment property, center selection is coupled with point assignment. We introduce the drift-regularized relaxation, a new convex relaxation solved by a modified Frank-Wolfe method with linear-programming iterations, whose optimality condition controls the cost of converting its solution into $k$ fair clusters. Combined with any $ρ$-approximation algorithm for weighted $k$-means, the relaxation yields an exactly fair fractional solution of cost at most $2ρ+1+ε$ times the fractional optimum, improving the previous ratio $1+4ρ+ε$. In fixed dimension, this improves the best known ratio from $5+O(ε)$ to $3+O(ε)$. The fractional solution can be rounded to an integral one without changing the centers or increasing the cost, at a bounded additive violation of the fairness bounds. We also show that a $(3-δ)$-approximation is NP-hard for every fixed $δ>0$, even on the line with fractional assignments, so $3$ is the exact approximation threshold for fractional fair $k$-means in fixed dimension. The same guarantees hold for $k$-sparse Wasserstein barycenters, a special case of fractional fair $k$-means. More generally, they hold whenever every cluster must satisfy given homogeneous linear inequalities in the fractions of its points, such as a bound on the ratio between two groups or on the average of a numerical attribute in every cluster.

cs.CG · cs.LG

版本更新 · v3arXiv:2610.40625

Constant-Factor Approximation for Capacitated Clustering in Low Dimension with $(1+ε)k$ Centers

Kangke Cheng, Guanlin Mo, Hu Ding

原文摘要

In many applications of $k$-median and $k$-means, including load balancing and redistricting, each center can serve only a bounded number of clients. This leads to capacitated clustering, in which a client may be forced to use a distant center because all nearby ones are full. This loss of locality defeats the techniques behind approximation schemes, and no constant-factor approximation is known in general metrics even for capacitated $k$-median. A long line of work therefore opens $K=k+\lfloorεk\rfloor$ centers for a fixed $ε\in(0,1]$, while respecting the capacities exactly. We give a deterministic polynomial-time algorithm for uniform soft capacities in low dimension, that is, when the clients or the center locations have bounded doubling dimension. With $K$ centers, its ratio is $3-2ε$ for $k$-median and $9-8ε$ for $k$-means, or $5-4ε$ in $\mathbb{R}^d$. Apart from $k$-median in the plane, these are the first polynomial-time ratios bounded by a constant independent of $ε$; previously, the best ratio was $O(ε^{-2}\log(1/ε))$, even for $k$-median. We also obtain ratios that stay bounded as $ε\to0$ for non-uniform and hard capacities in low dimension, and ratios polylogarithmic in $1/ε$ in general metrics. Our approach starts from a simple structural observation: a near-optimal uncapacitated solution can be split into fewer than $2k$ capacity-respecting blocks, so $2k$ centers already suffice, one per block. Our main tool, the rescue lemma, shows that once every block that sends clients to a center of the optimal solution is rescued (given a private center), that center can be closed, so each extra center effectively rescues about two blocks. This lets $\lfloorεk\rfloor$ extra centers rescue nearly an $ε$-fraction of the blocks, yielding the linear dependence on $ε$ in our ratios.

cs.CG · cs.DS

版本更新 · v3arXiv:2511.09394

EyeAgent: An Agentic AI System for Multimodal Clinical Decision Support in Ophthalmology

Danli Shi, Xiaolan Chen, Bingjie Yan, Weiyi Zhang, Jiancheng Yang, Ruoyu Chen, Xinyuan Wu, Siyu Huang 等 26 位作者

原文摘要

Current medical artificial intelligence (AI) systems are often task-specific, poorly integrated, and difficult to interpret, limiting support for multimodal clinical workflows. We developed and evaluated EyeAgent for ophthalmic decision support. EyeAgent comprises three layers including 54 task-specific EyeTools, 32 clinical skills, and a modular large language model reasoning core with interchangeable backbones. A multi-level evaluation distinguished this scope from empirical system-level validation. Component-level evaluation assessed newly developed models on held-out splits of datasets totaling 871,862 samples. System-level evaluation included illustrative cases of workflow breadth, a 200-case expert-rating study of output quality, and an exploratory multicenter reader study comparing unassisted and EyeAgent-assisted performance among 27 ophthalmologists from 11 centers. Skill-level and backbone ablations further assessed orchestration and robustness. In illustrative cases, EyeAgent showed task-specific advantages over GPT-5.5 in lesion quantitation, cross-modality synthesis, and uncertainty-aware reporting. In the expert-rating study, EyeAgent achieved an F1 score of 0.84 for skill selection, with 82.7%-92.0% of outputs rated acceptable or better across six clinical dimensions. In the exploratory multicenter reader study, diagnostic accuracy increased from 72.8% unassisted to 91.9% assisted (difference, 19.1 percentage points (pp); 95% CI, 13.6-24.7; Holm-adjusted P<0.001). Report completeness increased from 55.8% to 75.6% (difference, 19.8 pp; 95% CI, 14.8-24.7; Holm-adjusted P<0.001). Across the evaluated settings, EyeAgent supported interpretable, evidence-guided reasoning and showed potential for human-AI collaboration. Broader real-world effectiveness and generalizability require prospective and cross-population validation.

cs.HC