跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 7 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 04:38(北京时间)
版本更新 · v2arXiv:2604.15386

On Word Representations and Embeddings in Complex Matrices

Paul C. Bell, George Kenison, Reino Niskanen, Igor Potapov, Pavel Semukhin

原文摘要

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings. Certain finitely generated groups admit faithful representations in SL(2, C) and other similar matrix groups. On the other hand, it is known that the product of two free semigroups on two generators cannot be embedded into the 2x2 complex matrices. In this paper we study embeddings of word structures into low-dimensional matrix semigroups over the complex numbers and develop new techniques for constructing word representations of the Euclidean Bianchi groups. These representations provide a symbolic framework and a natural first step towards analysing fundamental decision problems in 2x2 matrix semigroups.

cs.FL · cs.DM · math.GR · math.RT

版本更新 · v5arXiv:2511.23152

Functional Compression as Occam's Razor: Algebraic Complexity from Sensitivity Minimization

Dongsung Huh, Lior Horesh, Halyun Jeong

原文摘要

Discovering discrete algebraic structures from data is a fundamental challenge in machine learning. We ask how continuous learning objectives can favor functional compression---representing data through shared algebraic composition rather than low-rank representations. We analyze the global optima of a canonical factorization model for algebraic completion (recovering finite binary operations) that demonstrated a preference for group operations. We measure algebraic complexity by the infimum of parameter sensitivity under exact reconstruction. We establish a universal complexity floor, whose attainment forces geometric alignment and unitarity of the latent representations. At the floor, input representations compose into the corresponding output representations; their reuse across the operation table propagates these local identities to enforce a globally shared algebraic structure. If the floor is not attained, a positive gap separates it from the feasible infimum. For cancellative operations, floor attainment forces the model's latent representation to be an injective homomorphism, equivalent to the target being isotopic to a group. In this case, every global minimizer is equivalent to the underlying group's unitary left-regular representation, up to isotopy and unitary gauge, resolving the central conjecture of Huh (2025). For non-cancellative operations, floor attainment forces exact structural redundancies (identical rows or columns) and is equivalent to a unitary factorization of the target's row- and column-reduced table with orthonormal output matrices, yielding the fewest distinct input matrices compatible with exact reconstruction. The resulting cancellative table then embeds in a group-isotope table. This analysis reveals a structural bias toward functional compression: at the sensitivity floor, algebraic composition of latent representations implements the target operation.

cs.LG · cond-mat.dis-nn · math.OC · math.RT · stat.ML

新论文 · v1arXiv:2611.17162

时间中的对称性:线性循环记忆的表示理论

Symmetry in Time: A Representation Theory of Linear Recurrent Memory

Anif N. Shikder, Ramit Dey, Jan Minac, Lyle E. Muller

AI 速读 基于摘要

作者用表示理论刻画线性循环状态空间模型的状态追踪能力,并提出引入四元数通道的 HyperSSM 以突破对角实/复 SSM 只能追踪交换群的限制。

cs.LG · cs.NE · math.RT

查看原文摘要

State space models (SSMs) are an emerging alternative to Transformers. SSMs offer linear-time inference and parallel training, but most implementations make the parallel scan efficient by making the recurrence diagonal: each channel of the hidden state is multiplied by an input-dependent real or complex number. These numbers commute, so the state records which inputs occurred but not their order. We formalize this with representation theory, which explains and fixes the state-tracking failures previously reported for SSMs. The state update defines a linear representation of the monoid of input sequences, and we show that an SSM tracks a group at every sequence length exactly when that group is a quotient of the group generated by its transition matrices. Two consequences follow. Diagonal real- and complex-valued SSMs can track only commutative groups, while the transition matrices of any SSM that can track a group must split into independent blocks over the real, complex, and quaternion numbers. We then introduce HyperSSM, which adds quaternion channels while keeping linear-time inference and parallel training. Trained only on final answers, HyperSSM solves the group tasks of recent state-tracking benchmarks exactly with at most five state numbers. This includes $S_5$ with 32 generators, where previous SSMs are at chance, and HyperSSM generalizes to sequences 25 times longer than those seen in training. Because the theory says what the transitions must encode, the learned weights of the linear recurrence can be interpreted directly. We demonstrate this by recovering the calibration of a real gyroscope, the rotations of imperfect qubit gates and the geometry of protein backbones.

新论文 · v1arXiv:2611.10936

Can small transformers learn the language of Coxeter groups?

J. Elisenda Grigsby, Yiyao Huang, Arushi Katyal, Ryan Lin, Pranav Ramakrishnan, Weiya Wang

原文摘要

The field of mechanistic interpretability is well-suited to collaborative projects between mathematicians and AI researchers. This work describes one such project. We trained a small transformer to learn the language of the Coxeter group affine A2, best known as the symmetries of the tiling of the Euclidean plane by equilateral triangles. We then formulated and proved a word-theoretic conjecture about affine A2 after observing the attention patterns of the trained model.

cs.CL · cs.LG · math.GR · math.RT

版本更新 · v2arXiv:2605.11178

Oversmoothing as Representation Degeneracy in Neural Sheaf Diffusion

Arif Dönmez, Axel Mosig, Ellen Fritsche, Katharina Koch

原文摘要

Neural Sheaf Diffusion (NSD) learns a task-adapted sheaf geometry for node classification. We connect the study of these learned geometries with Geometric Invariant Theory (GIT) to analyse their representation-theoretic structure and develop mechanisms for geometric control during training. Identifying cellular sheaves with representations of the incidence quiver connects direct-sum decompositions to the harmonic space and motivates the study of trivial or low-complexity summands as potential degeneration modes. We make this perspective concrete by focusing on the trivial representation: on an embedded copy, the sheaf Dirichlet energy reduces to weighted scalar graph energy. The GIT stability framework provides a criterion for excluding such copies within the semistable class. Using its moment-map characterisation of polystability, we construct differentiable surrogates that encourage the corresponding balance conditions. We identify an equal-stalk obstruction to assigning a destabilising weight to the trivial representation and show how nonuniform stalk dimensions remove it. Controlled energy-minimisation experiments reproduce trivial-component formation, while native feature-conditioned NSD experiments on heterophilic graphs show how moment-map regularisation changes the balance and Dirichlet-energy trajectories of learned geometries during training, alongside their classification behaviour.

cs.LG · cs.AI · math.RT

版本更新 · v3arXiv:2601.03910

An Algebraic Representation Theorem for Linear GENEOs in Machine Learning

Francesco Conti, Patrizio Frosini, Nicola Quercioli

原文摘要

Geometric and Topological Deep Learning enhance machine learning by exploiting geometric and topological structures in data. In this context, Group Equivariant Non-Expansive Operators (GENEOs) provide a principled framework for encoding symmetries and designing efficient, interpretable neural architectures. Originally introduced in Topological Data Analysis and later adopted in Deep Learning, GENEOs unify geometric and topological approaches and include, as a special case, the operator computing persistence diagrams. Their theoretical foundations rely on group actions, equivariance, and compactness properties of operator spaces. GENEOs are defined between data spaces endowed with transformation groups, referred to as perception pairs. While previous representation results characterized linear GENEOs acting on identical perception pairs, many applications require operators between heterogeneous ones. In this work, we introduce and prove a new algebraic representation theorem for linear GENEOs acting between different perception pairs. Under mild assumptions on data domains and group actions, this result provides a complete characterization of such operators and implicitly yields a computational method to generate all linear GENEOs between two perception pairs. The proof combines tools from the theory of stochastic matrices, group actions, and invariant measures. In our paper, we also show that the space of linear GENEOs is compact and convex, making easier their use for learning and optimization. Our new theorem enlarges the applicability of GENEOs, and allows for their composition with a broader class of current architectures. We show this with an application in image reconstruction.

math.RT · cs.AI · cs.LG

新论文 · v1arXiv:2611.09716

Tensor value and the 9/4 bound for matrix multiplication

Mahmut Levent Doğan, Vladimir Lysikov, Keiya Sakabe, Michael Walter

原文摘要

We give an exposition of OpenAI's recent result that the exponent of matrix multiplication is at most 9/4 valid over every field. Our main tool is a fractional symmetrized variant of the tensor value introduced by Coppersmith and Winograd, used in place of spectral points (tensor characters) in the original proof. We prove a superadditivity inequality for a power of this value on partially direct sums, whose summands share one tensor factor and occupy independent subspaces in the other two. Together with the degenerations of polynomial multiplication tensors from the OpenAI proof, this inequality yields the bound.

cs.CC · math.RT