English
Related papers

Related papers: How Smoothing is N-simplicial Attention?

200 papers

Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…

Optimization and Control · Mathematics 2025-11-12 Jelena Diakonikolas

The significant advancements of Large Language Models (LLMs) in generative tasks have led to a growing body of work exploring LLM-based embedding models. While these models, employing different pooling and attention strategies, have…

Computation and Language · Computer Science 2024-09-06 Yixuan Tang , Yi Yang

Convolutional neural networks model the transformation of the input sensory data at the bottom of a network hierarchy to the semantic information at the top of the visual hierarchy. Feedforward processing is sufficient for some object…

Computer Vision and Pattern Recognition · Computer Science 2020-02-05 Mahdi Biparva , John Tsotsos

Simplifying line charts for responsive displays typically applies a single algorithm uniformly across devices, despite the availability of multiple techniques that preserve different signal characteristics (e.g., peaks, trends,…

Human-Computer Interaction · Computer Science 2026-05-19 Rifat Ara Proma , Paul Rosen

The attention mechanism is a core primitive in modern large language models (LLMs) and AI more broadly. Since attention by itself is permutation-invariant, position encoding is essential for modeling structured domains such as language.…

Computation and Language · Computer Science 2026-02-05 Songlin Yang , Yikang Shen , Kaiyue Wen , Shawn Tan , Mayank Mishra , Liliang Ren , Rameswar Panda , Yoon Kim

This paper studies the role of sinks and diagonal patterns as attention switch and anti-oversmoothing mechanisms. We analyze geometric conditions under which sinks can be represented, showing a necessary alignment between the embedding of…

Machine Learning · Computer Science 2026-05-12 Peter Súkeník , Cristina López Amado , Christoph H. Lampert , Marco Mondelli

Transformers have demonstrated great success in numerous domains including natural language processing and bioinformatics. This success stems from the use of the attention mechanism by these models in order to represent and propagate…

Machine Learning · Computer Science 2025-02-10 Nathaniel Tomczak , Sanmukh Kuppannagari

Attention is a core component of transformer architecture, whether encoder-only, decoder-only, or encoder-decoder model. However, the standard softmax attention often produces noisy probability distribution, which can impair effective…

Computation and Language · Computer Science 2025-11-11 Dhananjay Ram , Wei Xia , Stefano Soatto

Probabilistic smoothing is a standard tool for global optimization, but existing methods rely on Gaussian kernels and specific transforms, often resulting in strong hyperparameter sensitivity and limited robustness. We propose a general…

Machine Learning · Computer Science 2026-05-27 Kukyoung Jang , Taehyun Cho , Junrui Zhang , Ping Xu , Kyungjae Lee

In the Transformer model, "self-attention" combines information from attended embeddings into the representation of the focal embedding in the next layer. Thus, across layers of the Transformer, information originating from different tokens…

Machine Learning · Computer Science 2020-06-02 Samira Abnar , Willem Zuidema

Transformers are emerging as the new workhorse of NLP, showing great success across tasks. Unlike LSTMs, transformers process input sequences entirely through self-attention. Previous work has suggested that the computational capabilities…

Computation and Language · Computer Science 2021-06-28 Michael Hahn

In this tutorial, we provide a didactic treatment of the emerging topic of signal processing on higher-order networks. Drawing analogies from discrete and graph signal processing, we introduce the building blocks for processing data on…

Social and Information Networks · Computer Science 2022-02-22 Michael T. Schaub , Yu Zhu , Jean-Baptiste Seby , T. Mitchell Roddenberry , Santiago Segarra

For the composite multi-objective optimization problem composed of two nonsmooth terms, a smoothing method is used to overcome the nonsmoothness of the objective function, making the objective function contain at most one nonsmooth term.…

Optimization and Control · Mathematics 2025-03-18 Huang Chengzhi

Variants dropout methods have been designed for the fully-connected layer, convolutional layer and recurrent layer in neural networks, and shown to be effective to avoid overfitting. As an appealing alternative to recurrent and…

Computation and Language · Computer Science 2019-07-29 Lin Zehui , Pengfei Liu , Luyao Huang , Junkun Chen , Xipeng Qiu , Xuanjing Huang

Attention is fundamental to cognition, yet it remains a challenge to understand attention in tasks approaching real-world complexity. Here, we approached this problem by modeling gaze patterns of monkeys playing Pac-Man. We first show a…

Neurons and Cognition · Quantitative Biology 2025-08-12 Zhongqiao Lin , Yunwei Li , Tianming Yang

Explainability models are now prevalent within machine learning to address the black-box nature of neural networks. The question now is which explainability model is most effective. Probabilistic Lipschitzness has demonstrated that the…

Machine Learning · Computer Science 2024-03-11 Lachlan Simpson , Kyle Millar , Adriel Cheng , Cheng-Chew Lim , Hong Gunn Chew

The self-attention mechanism is central to the success of Transformer architectures. However, standard row-stochastic attention has been shown to suffer from significant signal degradation across layers. In particular, it can induce rank…

Machine Learning · Computer Science 2026-04-10 Michela Lapenna , Rita Fioresi , Bahman Gharesifard

Given the large volume of side information from different modalities, multimodal recommender systems have become increasingly vital, as they exploit richer semantic information beyond user-item interactions. Recent works highlight that…

Information Retrieval · Computer Science 2024-12-17 Junjie Huang , Jiarui Qin , Yong Yu , Weinan Zhang

We propose a new attention mechanism with linear complexity, ATP, that fixates \textbf{A}ttention on \textbf{T}op \textbf{P}rincipal keys, rather than on each individual token. Particularly, ATP is driven by an important observation that…

Machine Learning · Computer Science 2024-03-06 Yue Niu , Saurav Prakash , Salman Avestimehr

We propose Scalable Message Passing Neural Networks (SMPNNs) and demonstrate that, by integrating standard convolutional message passing into a Pre-Layer Normalization Transformer-style block instead of attention, we can produce…

Machine Learning · Computer Science 2026-03-11 Haitz Sáez de Ocáriz Borde , Artem Lukoianov , Anastasis Kratsios , Michael Bronstein , Xiaowen Dong