English
Related papers

Related papers: Temporal Anchoring in Deepening Embedding Spaces: …

200 papers

We introduce the post-processing preorder and equivalence relations for general measurements on a possibly infinite-dimensional general probabilistic theory described by an order unit Banach space $E$ with a Banach predual. We define the…

Functional Analysis · Mathematics 2020-04-09 Yui Kuramochi

We prove that the existence of a $1$-Lipschitz retraction (a contraction) from a space $X$ onto its subspace $A$ implies the persistence diagram of $A$ embeds into the persistence diagram of $X$. As a tool we introduce tight injections of…

Algebraic Topology · Mathematics 2022-08-09 Žiga Virk

Randomized smoothing has become a leading approach for certifying adversarial robustness in machine learning models. However, a persistent gap remains between theoretical certified robustness and empirical robustness accuracy. This paper…

Machine Learning · Computer Science 2025-04-10 Blaise Delattre , Paul Caillon , Quentin Barthélemy , Erwan Fagnou , Alexandre Allauzen

In this paper, we propose a unified framework for sampling, clustering and embedding data points in semi-metric spaces. For a set of data points $\Omega=\{x_1, x_2, \ldots, x_n\}$ in a semi-metric space, we consider a complete graph with…

Social and Information Networks · Computer Science 2017-08-02 Chia-Tai Chang , Cheng-Shang Chang

The configuration of latent representations plays a critical role in determining the performance of deep neural network classifiers. In particular, the emergence of well-separated class embeddings in the latent space has been shown to…

Machine Learning · Computer Science 2025-02-11 Luigi Sbailò , Luca Ghiringhelli

Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…

Machine Learning · Computer Science 2023-11-30 Andrea Marinoni , Pietro Lio' , Alessandro Barp , Christian Jutten , Mark Girolami

Random embedding has been applied with empirical success to large-scale black-box optimization problems with low effective dimensions. This paper proposes the EmbeddedHunter algorithm, which incorporates the technique in a hierarchical…

Artificial Intelligence · Computer Science 2016-11-29 Abdullah Al-Dujaili , S. Suresh

Anchors is a popular local model-agnostic explanation technique whose applicability is limited by its computational inefficiency. To address this limitation, we propose a memorization-based framework that accelerates Anchors while…

Machine Learning · Computer Science 2026-01-29 Haonan Yu , Junhao Liu , Xin Zhang

We present a geometric framework for understanding Transformer-based language models, drawing an explicit analogy to General Relativity. Queries and keys induce an effective metric on representation space, and attention acts as a discrete…

Machine Learning · Computer Science 2025-11-06 Riccardo Di Sipio , Jairo Diaz-Rodriguez , Luis Serrano

End-to-end multi-modal planning has become a transformative paradigm in autonomous driving, effectively addressing behavioral multi-modality and the generalization challenge in long-tail scenarios. We propose AnchDrive, a framework for…

Robotics · Computer Science 2025-09-29 Jinhao Chai , Anqing Jiang , Hao Jiang , Shiyi Mu , Zichong Gu , Hao Sun , Shugong Xu

In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…

Optimization and Control · Mathematics 2021-05-21 Nikita Doikov , Yurii Nesterov

We study hierarchical clusterings of metric spaces that change over time. This is a natural geometric primitive for the analysis of dynamic data sets. Specifically, we introduce and study the problem of finding a temporally coherent…

Data Structures and Algorithms · Computer Science 2017-10-23 Tamal K. Dey , Alfred Rossi , Anastasios Sidiropoulos

We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…

Dynamical Systems · Mathematics 2024-07-11 Tamara Kucherenko , Martin Schmoll , Christian Wolf

We propose a general framework for visualizing any intermediate embedding representation used by any neural survival analysis model. Our framework is based on so-called anchor directions in an embedding space. We show how to estimate these…

Machine Learning · Statistics 2023-05-12 George H. Chen

The objective of this paper is twofold. In the first half of the paper, we investigate upper parts of the hyperspace convergences determined by uniform convergence of distance functionals on a bornology under different metrizations of a…

General Topology · Mathematics 2026-02-18 Yogesh Agarwal , Varun Jindal

Motion forecasting often requires trading interpretability for predictive accuracy. Standard anchor-based architectures rely on opaque latent queries that are highly prone to latent collapse, or naive trajectory sampling that limits…

Computer Vision and Pattern Recognition · Computer Science 2026-05-05 Abhishek Vivekanandan , Ahmed Abouelazm , J. Marius Zöllner

The data processing inequality is central to information theory and motivates the study of monotonic divergences. However, it is not clear operationally we need to consider all such divergences. We establish a simple method for Pinsker…

Information Theory · Computer Science 2025-04-02 Ian George , Alice Zheng , Akshay Bansal

We deal with some aspects of the theory of conformal embeddings of affine vertex algebras, providing a new proof of the Symmetric Space Theorem and a criterion for conformal embeddings of equal rank subalgebras. We finally study some…

Representation Theory · Mathematics 2019-12-05 Drazen Adamovic , Victor G. Kac , Pierluigi Moseneder Frajria , Paolo Papi , Ozren Perse

If $X$ is a subset of a Banach space with $X-X$ homogeneous, then $X$ can be embedded into some $\R^n$ (with $n$ sufficiently large) using a linear map $L$ whose inverse is Lipschitz to within logarithmic corrections. More precisely,…

Metric Geometry · Mathematics 2010-07-28 James C Robinson

Most semantic drift studies report multiple signals e.g., embedding displacement, neighbor changes, distributional divergence, and recursive trajectory instability, without a shared explanatory theory that relates them. This paper proposes…

Computation and Language · Computer Science 2026-02-24 Stephen Russell