The paper presents a method for analyzing shape graphs using specific features.
problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.
Neural networks' feature geometry evolves like discrete Ricci flow.
problem Understanding neural feature representations and their geometric transformations.
method Approximating input manifold with geometric graphs and analyzing their evolution during training.
result Neural feature geometry evolves like discrete Ricci flow, with nonlinear activations playing a crucial role.
A new GNN module learns geometric scattering features for better graph classification and feature exploration.
problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.
A new method for approximating softmax and Gaussian kernels with reduced error.
problem Approximating softmax and Gaussian kernels with low error.
method Simplex Random Features (SimRFs) and SimRFs+.
result SimRFs provide the smallest MSE among weight-independent geometrically-coupled PRF mechanisms.
New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
New geometric interpretation explains over-parameterized models and adversarial perturbations.
problem Geometric understanding of over-parameterized regression and adversarial perturbations.
method Alternative geometric interpretation of regression in feature space.
result Adversarial perturbations are a natural feature of biased models due to underlying geometry.
AEN-SAEs address feature starvation in sparse autoencoders by stabilizing the geometric alignment of sparse coding.
problem Feature starvation in sparse autoencoders, leading to unstable and misaligned representations.
method Adaptive Elastic Net SAEs (AEN-SAEs) combine ℓ2 and ℓ1 terms to stabilize the sparse coding map and control feature interactions. result AEN-SAEs mitigate feature starvation without heuristic resampling, maintaining competitive reconstruction abilities.
We explore the generalization of scattering transforms from traditional (e.g., image or audio) signals to graph data, analogous to the generalization of ConvNets in geometric deep learning, and the utility of extracted graph features in graph data analysis. In particular, we focus on the capacity of these features to r…
Unsupervised mesh disentanglement separates identity and pose.
problem Geometric disentanglement for 3D deformable models.
method CFAN-VAE architecture using conformal factor and normal features.
result CFAN-VAE achieves state-of-the-art performance on unsupervised geometric disentanglement.
We propose a method to learn object representations from 3D point clouds using bundles of geometrically interpretable hidden units, which we call geometric capsules. Each geometric capsule represents a visual entity, such as an object or a part, and consists of two components: a pose and a feature. The pose encodes whe…
Develops methods to analyze feature-outcome associations in subpopulations.
problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.
Support vector machines (SVMs) rely on the inherent geometry of a data set to classify training data. Because of this, we believe SVMs are an excellent candidate to guide the development of an analytic feature selection algorithm, as opposed to the more commonly used heuristic methods. We propose a filter-based feature…
This work proposes a geometric approach to equivariant message passing on Riemannian manifolds.
problem Efficiently processing data on Riemannian manifolds with equivariance.
method Geometric insight into equivariant message passing on Riemannian manifolds, using an equivariant embedding and diffusion process.
result A new class of equivariant GNNs on Riemannian manifolds.
Geometric models improve feature extraction and equivariance in image generation.
problem Improving feature extraction at multiscale levels and reducing network complexity.
method Proposes a geometric generative model based on morphological PDEs and GANs, incorporating equivariance for geometric interpretability.
result Preliminary results show GM-GAN outperforms classical GANs on MNIST data.
Online Streaming Feature Selection (OSFS) is a sequential learning problem where individual features across all samples are made available to algorithms in a streaming fashion. In this work, firstly, we assert that OSFS's main assumption of having data from all the samples available at runtime is unrealistic and introd…
Training shapes the geometry of neural network feature maps, revealing local area magnification.
problem Understanding how training affects the geometric structure of neural network feature maps.
method Analyzing the Riemannian geometry induced by neural network feature maps at infinite width and after training.
result Training breaks the symmetry of the geometry induced by random neural network feature maps, magnifying local areas along decision boundaries.
A theory of feature geometry using spectral analysis of weight matrices.
problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.
CDOT optimizes transport between domains preserving both feature and geometric structure.
problem Optimizing transport between heterogeneous domains with preserved feature and geometric structure.
method CDOT uses operator-based regularization to align distance structures, proving pseudometric properties.
result CDOT improves robustness to local geometric variations and is provably convex.
Graph matching with feature vectors is solved using a two-layer graph neural network.
problem Graph matching in the presence of sparse binary features.
method Two-layer graph neural network with graph structure.
result Graph neural network can recover correct mapping with high probability under certain conditions.
3D convolutional neural networks (3D-CNN) have been used for object recognition based on the voxelized shape of an object. In this paper, we present a 3D-CNN based method to learn distinct local geometric features of interest within an object. In this context, the voxelized representation may not be sufficient to captu…
Persistent homology reveals geometric features of metric spaces, especially geodesic circles.
problem Detecting geometric features in metric spaces using persistent homology.
method Analyzing algebraic elements (footprints) in persistent homology of metric spaces and subspace.
result Higher-dimensional persistent homology captures lower-dimensional geometric features.
GSAN learns adaptive node representations using geometric scattering and attention.
problem Oversmoothing in node representation learning.
method Attention-based architecture integrating geometric scattering and GCN channels.
result GSAN outperforms previous networks in semi-supervised node classification.
Topological parallax assesses AI models' geometric similarity to datasets for safety.
problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.
Steerable neural ODEs on homogeneous spaces for equivariant feature dynamics.
problem Learning continuous-time equivariant dynamics of vector-valued features on homogeneous spaces.
method Introduces steerable neural ordinary differential equations on homogeneous spaces, interpreting features as sections of associated vector bundles over M. result Steerable NODEs are G-equivariant when the flow and connection are G-invariant, and they incorporate existing models. Novel analysis of neural networks using geometric algebra and convex optimization.
problem Understanding the inner workings of deep neural networks.
method Geometric (Clifford) algebra and convex optimization.
result Optimal weights are given by the wedge product of training samples.
Geometrically interprets frequency in electric circuits.
problem Conventional frequency definition limitations.
method Introduces a multivector definition of frequency.
result Conventional frequency is a special case of the new framework.
3D Convolutional Neural Networks (3D-CNN) have been used for object recognition based on the voxelized shape of an object. However, interpreting the decision making process of these 3D-CNNs is still an infeasible task. In this paper, we present a unique 3D-CNN based Gradient-weighted Class Activation Mapping method (3D…
Deep neural networks favor symmetric structures, enabling multilevel symmetries.
problem Understanding and optimizing deep neural networks.
method Formulating DNN training as convex Lasso problems with geometric algebra.
result Deep networks inherently favor symmetric structures, enabling multilevel symmetries.
Study reveals LLM personas have two distinct components: frame-robust aggregated traits and frame-dependent geometric features.
problem Evaluation of LLM personas via psychometric questionnaires discards within-instance correlation structure.
method Constructed within-instance correlation matrices from IPIP-50 responses and analyzed geometry on SPD manifolds under manipulated question orderings.
result Persona expression comprises two dissociable components: aggregated features (Big Five scores) and geometric features (SPD manifold).
Geometric regularisation improves statistical models by avoiding degeneracy loci.
problem Non-identifiability, singular information, and moment indeterminacy in statistical models.
method Develops the geometric regularisation of distribution-kernel pairs (T,φ) using Whitney, Thom, and Mather theorems. result Finite-dimensional weak transversality theorem for generic kernels, avoiding degeneracy strata of high codimension.
We propose a differentiable nonparametric algorithm, the Delaunay triangulation learner (DTL), to solve the functional approximation problem on the basis of a p-dimensional feature space. By conducting the Delaunay triangulation algorithm on the data points, the DTL partitions the feature space into a series of p-d…
Proposes a new CNN for meshes that can handle orientation.
problem Isotropic kernels in graph convolutions are insensitive to mesh geometry.
method Introduces gauge equivariant kernels and geometric message passing.
result Significantly improved expressivity over conventional GCNs.
Introduces neural point-forms for learning geometric features from noisy point clouds.
problem Learning geometric features from noisy point clouds with missing tangency information.
method Uses Laplacian-based techniques to build comparison matrices for point clouds, proving consistency under various assumptions.
result Neural point-forms provide a competitive and interpretable representation, especially beneficial for dense or manifold-like structures.
FiberNet integrates geometry into machine learning for clearer classification.
problem Lack of interpretability in traditional deep learning.
method Reformulates classification as geometric optimization on fiber bundles, introducing learnable Riemannian metrics and variational prototype optimization.
result Clear geometric interpretability and efficiency in classification.
Neuroscientific studies of drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole. This work is about empirically supported mathematical ideas behind splitting and merging…
Newtonian, Lagrangian, and Hamiltonian dynamical systems are well formalized mathematically. They give rise to geometric structures describing motion of a point in smooth manifolds. Riemannian metric is a different geometric structure formalizing concepts of length and angle. The interplay of Riemannian metric and its …
Study shows 'Ordinal Neural Collapse' in deep OR tasks, revealing simple geometric relationships.
problem Understanding neural collapse in deep Ordinal Regression tasks.
method Combining cumulative link models and Unconstrained Feature Model to investigate neural collapse.
result Demonstrates 'Ordinal Neural Collapse' (ONC) with three key properties.
The visual systems of many mammals, including humans, is able to integrate the geometric information of visual stimuli and to perform cognitive tasks already at the first stages of the cortical processing. This is thought to be the result of a combination of mechanisms, which include feature extraction at single cell l…
We analyse second order (in Riemann curvature) geometric flows (un-normalised) on locally homogeneous three manifolds and look for specific features through the solutions (analytic whereever possible, otherwise numerical) of the evolution equations. Several novelties appear in the context of scale factor evolution, fix…
A new method monitors unstructured 3D shapes without registration.
problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.
Graphs from features improve classification accuracy in tasks.
problem Traditional classification tasks can be improved by incorporating relational information.
method Construct geometric graphs from features and use them in Graph Convolutional Networks.
result Graphs derived from features increase classification accuracy and improve class separation.
We develop a theory of parametrized geometric cobordism by introducing smooth Thom stacks. This requires identifying and constructing a smooth representative of the Thom functor acting on vector bundles equipped with extra geometric data, leading to a geometric refinement of the the Pontrjagin-Thom construction in stac…
We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of granularity to capture diverse types of local information for subsequent machine lea…
Unified geometric principles unify neural network architectures.
problem High-dimensional learning tasks with underlying low-dimensionality and structure.
method Unified geometric principles applied to neural network architectures.
result Unified mathematical framework for neural network architectures.
The closure conditions of the inexact exterior differential form and dual form (an equality to zero of differentials of these forms) can be treated as a definition of some differential-geometrical structure. Such a connection discloses the properties and specific features of the differential-geometrical structures. The…
This paper develops a geometric framework for SHM using feature bundles and gauge theories.
problem Defining feature spaces in population-based SHM.
method Introduces feature bundles as sections of vector bundles over structure spaces, and uses Graph Neural Networks for feature assignment.
result Develops a mathematical framework for SHM that incorporates feature spaces and gauge theories.
A deep learning model organizes RNA graphs to reveal folding patterns and properties.
problem Organizing and understanding the complex folding patterns of RNA secondary structures.
method Geometric scattering autoencoder (GSAE) network for learning graph embeddings.
result GSAE accurately reflects bistable RNA structures and can sample new folding trajectories.
New method for curve comparison using iterated integrals and moving frames.
problem Comparing curves robustly to noise and transformations.
method Moving frame method paired with log-signature transform.
result Algorithmic construction of invariants for curve equivalence under rigid motions.