COMPLEX is a closed‑form, training‑free embedding for multiparameter persistence modules that provides both an upper and a lower Lipschitz bound, enabling faithful feature representations. By slicing modules along a near‑diagonal net and embedding each slice with the certified PLACE/PALACE landmark map, the method guarantees that separated modules remain separated in the embedding. On Orbit benchmarks and molecular graph tasks, COMPLEX achieves state‑of‑the‑art accuracy, outperforming existing landmark, transformer, and graph‑based approaches.
By Sushovan Majhi, Atish Mitra, \v{Z}iga Virk, Pramita Bagchi
arXiv:2609.22337v1 Announce Type: cross
Abstract: Linear probing is the standard instrument for detecting social biases in the hidden representations of large language models. Yet reported probe accu...
By Mo Hai, Haifeng Li
arXiv:2606. 13092v3 Announce Type: replace Abstract: Scale buys interpolation; structure buys certifiable transfer.
By Hongbo Wang
arXiv:2606. 24946v1 Announce Type: new Abstract: Learned world models are useful only over horizons on which their rollout error remains controlled.
By Hongbo Wang
arXiv:2606. 01443v1 Announce Type: cross Abstract: A central difficulty in training Joint-Embedding Predictive Architectures (JEPAs) is preventing representation collapse.
By Triet M. Le
arXiv:2607. 24662v1 Announce Type: new Abstract: Generative models of temporal graphs are trained on one stretch of an evolving network and deployed on the next, and they degrade badly in the gap.
By Tianpeng Li, Xuan Guo, Wenjun Wang, Wang Zhang, Pengfei Jiao
arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.
By Ibne Farabi Shihab, Joyanta Jyoti Mondal
arXiv:2608. 08826v1 Announce Type: new Abstract: Adaptive procedures must work without nuisance information an oracle may use, such as a gradient scale or smoothness index, and robust procedures may have to answer queries whose coordinate and inspection time are chosen only after the data are seen.
By Ibne Farabi Shihab, Adria Binte Habib
arXiv:2509. 11208v3 Announce Type: replace-cross Abstract: Transformers used for evidence-grounded binary adjudication (e.
By Leon Chlon, Ahmed Karim, Maggie Chlon, MarcAntonio Awada
arXiv:2607. 02104v2 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used as cheap, scalable judges that compare candidate outputs pairwise.
By Jian Xu, Delu Zeng, John Paisley, Qibin Zhao
arXiv:2608.28150v2 Announce Type: replace
Abstract: How much matrix rank is required to preserve every bounded value output of normalized softmax attention? We study the unrestricted maximum-row-\(\e...
By Yuhe Sui, Jianing Zhang, Yingzhi Tang
ServeGuard is a supply‑chain primitive that allows a publisher to ship a proof‑carrying adapter for an open‑weight language model, proving in zero‑knowledge that the adapter contains no hidden backdoor channel in the monitor’s blind subspace. The proof is inexpensive because it relies on a deterministic function of the public base model, and the served residual is the model’s own public floor. The system lets consumers or regulators verify the absence of this class of hidden channels without revealing the certified read factor or trusting the publisher.
By Dominik Dahlem, Rui Vieira