arXiv subjects

Zinaid Kapić

Publications and source records attributed to Zinaid Kapić.

5 recordsLinked to original sources

arXiv2026

Busemann energy-based attention for emotion analysis in Poincaré discs

We present EmBolic - a novel fully hyperbolic deep learning architecture for fine-grained emotion analysis from textual messages. The underlying idea is that hyperbolic geometry efficiently captures hierarchies between both words and emotions. In our context, these hierarchical relationships arise from semantic ambiguities. EmBolic aims to infer the curvature on the continuous space of emotions, rather than treating them as a categorical set without any metric structure. In the heart of our architecture is the attention mechanism in the hyperbolic disc. The model is trained to generate queries (points in the hyperbolic disc) from textual messages, while keys (points at the boundary) emerge automatically from the generated queries. Predictions are based on the Busemann energy between queries and keys, evaluating how well a certain textual message aligns with the class directions representing emotions. Our experiments demonstrate strong generalization properties and reasonably good prediction accuracy even for small dimensions of the representation space. Overall, this study supports our claim that affective computing is one of the application domains where hyperbolic representations are particularly advantageous.

cs.LG↗

arXiv2026

Synchronization-based clustering on the unit hypersphere

Clustering on the unit hypersphere is a fundamental problem in various fields, with applications ranging from gene expression analysis to text and image classification. Traditional clustering methods are not always suitable for unit sphere data, as they do not account for the geometric structure of the sphere. We introduce a novel algorithm for clustering data represented as points on the unit sphere $\mathbf{S}^{d-1}$. Our method is based on the $d$-dimensional generalized Kuramoto model. The effectiveness of the introduced method is demonstrated on synthetic and real-world datasets. Results are compared with some of the traditional clustering methods, showing that our method achieves similar or better results in terms of clustering accuracy.

cs.LG↗

arXiv2024

Reinforcement Learning in Hyperbolic Spaces: Models and Experiments

We examine five setups where an agent (or two agents) seeks to explore unknown environment without any prior information. Although seemingly very different, all of them can be formalized as Reinforcement Learning (RL) problems in hyperbolic spaces. More precisely, it is natural to endow the action spaces with the hyperbolic metric. We introduce statistical and dynamical models necessary for addressing problems of this kind and implement algorithms based on this framework. Throughout the paper we view RL through the lens of the black-box optimization.

cs.LG↗

arXiv2021

Interpolating Rotations with Non-abelian Kuramoto Model on the 3-Sphere

The paper presents a novel method for interpolating rotations based on the non-Abelian Kuramoto model on sphere S3. The algorithm, introduced in this paper, finds the shortest and most direct path between two rotations. We have discovered that it gives approximately the same results as a Spherical Linear Interpolation algorithm. Simulation results of our algorithm are visualized on S2 using Hopf fibration. In addition, in order to gain a better insight, we have provided one short video illustrating the rotation of an object between two positions.

cs.GR↗

arXiv2021

A new dynamical model for solving rotation averaging problem

The paper analyzes the rotation averaging problem as a minimization problem for a potential function of the corresponding gradient system. This dynamical system is one generalization of the famous Kuramoto model on special orthogonal group SO(3), which is known as the non-Abelian Kuramoto model. We have proposed a novel method for finding weighted and unweighted rotation average. In order to verify the correctness of our algorithms, we have compared the simulation results with geometric and projected average using real and random data sets. In particular, we have discovered that our method gives approximately the same results as geometric average.

cs.CV↗