Geometrically, Legendrian surfaces related by surgery have related skein-valued cluster spaces.
problem Understanding the skein-valued cluster transformation in Legendrian surfaces.
method Geometric considerations of moduli of holomorphic curves.
result Skein-valued cluster transformation of Legendrian surfaces related by surgery.
Worldsheet skein D-module for Hopf link conormal uniquely determines partition functions.
problem Understanding HOMFLYPT polynomials and their geometric origins.
method Defining worldsheet skein module and D-module, considering skein valued open curve counts.
result Worldsheet skein D-module for Hopf link conormal is generated by three operator polynomials.
Solves a recursion for Gromov-Witten invariants of the unknot.
problem Determining Gromov-Witten invariants for a specific Lagrangian brane.
method Uses a skein-theoretic recursion and geometric solutions.
result Solves the recursion to find the expected hook-content formula.
New identities lift q-dilogarithm to a more complex algebra.
problem Extending q-dilogarithm identities to a more complex algebra.
method Showed lift to HOMFLYPT-skein algebra of a genus n handlebody.
result New identities associated to unidirectional A_n-quiver.
A map from 3-manifold skein to Lagrangian skein via holomorphic curve counting.
problem Counting holomorphic curves in cotangent bundles for 3-manifold skein.
method Skein-valued counting of holomorphic curves in branched covers.
result Wall-crossing formula for skein traces in branched covers.
Transform learning improves K-means clustering for document analysis.
problem Improving K-means clustering for document analysis.
method Embedding K-means clustering loss into transform learning framework and solving jointly using ADMM.
result Improves over state-of-the-art in document clustering.
Transforms data into separable subspaces for clustering.
problem Data is not always separable into subspaces.
method Embeds subspace clustering techniques into transform learning.
result Improves upon state-of-the-art clustering techniques.
The paper calculates a formula for knot complements using holomorphic curves.
problem Calculating the partition function of knot complements.
method Skein valued holomorphic curve counting techniques.
result The partition function localizes on specific holomorphic annuli for torus knots.
New approach learns image transformations directly for clustering.
problem Learning better deep representations for image clustering.
method Directly learns transformations and clusters in image space without abstract features.
result Jointly learns prototypes and transformations using deep learning modules.
This work studies clustering in transformer models, proving exponential convergence to a single token state.
problem Understanding the long-term behavior of tokens in transformer models.
method Investigates mean-field transformer models under specific conditions to prove exponential convergence to a single state.
result Transformer models synchronize exponentially fast to a single token state with explicit rates.
New insights into how data transformations affect self-supervised clustering.
problem Impact of data transformations on self-supervised clustering convergence.
method Theoretical and empirical analysis of various data transformations.
result Certain transformations help in faster convergence of self-supervised clustering.
Clustered attention improves transformer efficiency for large sequences.
problem Quadratic complexity of transformer attention matrix for large sequences.
method Group queries into clusters, compute attention only for centroids, and use centroids to approximate key/query dot products.
result Linear complexity with respect to sequence length for a fixed number of clusters.
Transformers cluster meaningless words around leaders for sentiment analysis.
problem Capturing context in sentiment analysis using transformers.
method Characterized transformers with hardmax self-attention and normalization, showing asymptotic convergence to clustered equilibrium.
result Transformers can effectively capture context by clustering meaningless words around leader words.
The problem of inhomogeneous cluster densities has been a long-standing issue for distance-based and density-based algorithms in clustering and anomaly detection. These algorithms implicitly assume that all clusters have approximately the same density. As a result, they often exhibit a bias towards dense clusters in th…
Wavelet transform clusters climate data into biomes.
problem Understanding climate biomes through complex data.
method Discrete wavelet transform for coarse-graining, ensemble classification, information theory.
result Efficient consensus clustering identifies climate biomes.
Transformers learn to cluster Gaussian mixtures as well as the EM algorithm.
problem Learning guarantees of Transformers in multi-class clustering of Gaussian mixtures.
method Developed a theory connecting Transformer's Softmax Attention layers to the EM algorithm's workflow.
result Transformers achieve minimax optimal rate for clustering Gaussian mixtures with sufficient training samples and initialization.
Image clustering is an important but challenging task in machine learning. As in most image processing areas, the latest improvements came from models based on the deep learning approach. However, classical deep learning methods have problems to deal with spatial image transformations like scale and rotation. In this p…
A low-rank transformation learning framework for subspace clustering and classification is here proposed. Many high-dimensional data, such as face images and motion sequences, approximately lie in a union of low-dimensional subspaces. The corresponding subspace clustering problem has been extensively studied in the lit…
For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the Jacobian matrix of the cluster transformation. Furthermore, we show that this rela…
Computes colored HOMFLYPT invariants using holomorphic curves.
problem Counting holomorphic curves in Calabi-Yau 3-folds.
method Computes contributions of multiple covers of holomorphic annuli.
result Agrees with topological string theory predictions and proves Ooguri-Vafa formula.
PatchGT uses non-trainable graph patches to improve graph representation learning.
problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.
Paper proposes a novel approach to improve temporal clustering of time series data.
problem Challenges in clustering temporal data with varying sampling rates and high dimensionality.
method Transform time series into Euclidean space using similarity measures, then use CNN-GRU autoencoder for latent representation.
result Approach outperforms existing methods by up to 32% on various time series datasets.
Particles representing tokens cluster in Transformers, influenced by initial tokens and matrix spectrum.
problem Understanding the geometry of learned representations in Transformers.
method Viewing Transformers as particle systems, applying dynamical systems and partial differential equations.
result Particles cluster towards limiting objects, confirming context-awareness and the emergence of leaders.
Mixtures of Gaussians, factor analyzers (probabilistic PCA) and hidden Markov models are staples of static and dynamic data modeling and image and video modeling in particular. We show how topographic transformations in the input, such as translation and shearing in images, can be accounted for in these models by inclu…
New insights show stochastic initialization prevents token clustering in deep Transformers.
problem Understanding token dynamics in deep stochastic Transformers.
method Analysis of deep Transformers with random initialization noise, proving convergence to an interacting-particle system on the sphere.
result Initialization noise prevents token clustering, leading to antipodal formations.
Characterizes pseudo-Anosov mapping classes using cluster algebra techniques.
problem Characterize pseudo-Anosov mapping classes purely in terms of shear coordinates.
method Uses cluster algebraic generalization and tropical cluster transformations.
result Algebraic entropies of cluster transformations match topological entropy.
A novel approach ODAR detects outliers for clustering.
problem Outliers interfere with clustering algorithms, leading to unreliable results.
method Feature transformation to separate outliers and normal objects into distinct clusters.
result ODAR improves clustering accuracy on 7 out of 10 datasets.
Transformers can cluster data from Gaussian mixtures without supervision.
problem Clustering data from Gaussian mixtures without labeled data.
method Theoretical analysis of attention-based layers, focusing on a simplified two-head attention layer and an identity matrix attention layer.
result Attention-based layers can align with true mixture centroids and adapt to input-specific distributions.
Paper proposes a method to efficiently cluster stretched mixtures.
problem Clustering stretched elliptical mixtures using standard methods like PCA and k-means fails.
method Proposes a non-convex program to transform data into a one-dimensional point cloud.
result Efficient first-order algorithm achieves near-optimal statistical precision.
We propose a simple and efficient time-series clustering framework particularly suited for low Signal-to-Noise Ratio (SNR), by simultaneous smoothing and dimensionality reduction aimed at preserving clustering information. We extend the sparse K-means algorithm by incorporating structured sparsity, and use it to exploi…
Introduces BWMD, a new distance measure for DNA and malware clustering.
problem Shortcomings of previous compression-based distance metrics.
method Embeds sequences into a fixed-length feature vector.
result Significantly improved clustering performance on larger malware corpora.
This paper provides a new unimodality test with application in hierarchical clustering methods. The proposed method denoted by signature test (Sigtest), transforms the data based on its statistics. The transformed data has much smaller variation compared to the original data and can be evaluated in a simple proposed un…
New solutions to 3D integrability equations using quantum cluster algebras.
problem Constructing solutions to the tetrahedron and 3D reflection equations.
method Extending quantum cluster algebra approach to Fock-Goncharov quivers and investigating cluster transformations.
result Explicit formulas for matrix elements of solutions derived for typical representations.
CTEF fits ellipsoids to noisy data in any dimension.
problem Fitting ellipsoids to noisy data in arbitrary dimensions.
method Uses the Cayley transform to fit ellipsoids.
result CTEF outperforms other methods, especially when data are not uniformly distributed.
This paper presents a novel clustering concept that is based on jointly learned nonlinear transforms (NTs) with priors on the information loss and the discrimination. We introduce a clustering principle that is based on evaluation of a parametric min-max measure for the discriminative prior. The decomposition of the pr…
The paper connects Legendrian links to cluster algebras via microlocal methods.
problem Understanding the relationship between Legendrian links and cluster algebras.
method Microlocal parallel transport of sheaf quantizations of Lagrangian fillings.
result Existence of quasi-cluster A-structures and cluster Poisson structures. We introduce a property of mutation loops, called the sign stability, with a focus on an asymptotic behavior of the iteration of the tropical X-transformation. A sign-stable mutation loop has a numerical invariant which we call the cluster stretch factor, in analogy with that of a pseudo-Anosov mapping clas…
We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed by applying the Fourier transform and a Gaussian filter. The determination of th…
Joint alignment of a collection of functions is the process of independently transforming the functions so that they appear more similar to each other. Typically, such unsupervised alignment algorithms fail when presented with complex data sets arising from multiple modalities or make restrictive assumptions about the …
In this paper, we propose a novel unsupervised clustering approach exploiting the hidden information that is indirectly introduced through a pseudo classification objective. Specifically, we randomly assign a pseudo parent-class label to each observation which is then modified by applying the domain specific transforma…
Identifying customer segments in retail banking portfolios with different risk profiles can improve the accuracy of credit scoring. The Variational Autoencoder (VAE) has shown promising results in different research domains, and it has been documented the powerful information embedded in the latent space of the VAE. We…
The K-means algorithm is extended to allow for partitioning of skewed groups. Our algorithm is called TiK-Means and contributes a K-means type algorithm that assigns observations to groups while estimating their skewness-transformation parameters. The resulting groups and transformation reveal general-structured cl…
Exploiting low-rank structure of the user-item rating matrix has been the crux of many recommendation engines. However, existing recommendation engines force raters with heterogeneous behavior profiles to map their intrinsic rating scales to a common rating scale (e.g. 1-5). This non-linear transformation of the rating…
A new clustering method handles uncertain covariates efficiently.
problem Clustering with uncertain covariates in datasets.
method Greedy and optimistic clustering algorithm using non-linear transformation and empirical uncertainty sets.
result Improved performance in finding sibling stars.
New method preserves spectral clustering performance under aggressive sparsification and quantization.
problem Maintaining spectral clustering performance with sparse and quantized data.
method Random matrix theory applied to eigenspectrum changes under sparsification and quantization.
result Spectral clustering performance is preserved even with aggressive sparsification and quantization.
CDL index improves clustering validation for non-convex data.
problem Selecting clustering algorithms and hyperparameters without labeled data.
method CDL uses compactness, centers, and covariances to compute a probabilistic description length bound.
result CDL outperforms conventional CVIs on synthetic and image benchmarks.
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
Transformers can learn spectral methods and perform unsupervised learning.
problem Learning spectral methods using unsupervised learning.
method Using multi-layered Transformers, pre-trained on a large set of instances, to learn and perform statistical estimation tasks.
result Proven that pre-trained Transformers can learn spectral methods and perform tasks like PCA and clustering.