In this paper we extend some well-known rigidity results for conformal changes of Einstein metrics to the class of generalized quasi-Einstein (GQE) metrics, which includes gradient Ricci solitons. In order to do so, we introduce the notions of conformal diffeomorphisms and vector fields that preserve a GQE structure. W…
We present a numerical approach for approximating unknown Hamiltonian systems using observation data. A distinct feature of the proposed method is that it is structure-preserving, in the sense that it enforces conservation of the reconstructed Hamiltonian. This is achieved by directly approximating the underlying unkno…
We prove an existence result for local and global G-structure preserving affine immersions between affine manifolds. Several examples are discussed in the context of Riemannian and semi-Riemannian geometry, including the case of isometric immersions into Lie groups endowed with a left-invariant metric, and the case of …
A new method learns Hamiltonian functions from noisy data.
problem Learning Hamiltonian functions from noisy observations.
method Structure-preserving kernel ridge regression method.
result The method yields excellent numerical performances.
Structure-preserving GANs learn distributions with group symmetry efficiently.
problem Learning distributions with group symmetry efficiently.
method Developed structure-preserving GANs by reducing the discriminator space and designing structured generators.
result Significantly improved sample fidelity and diversity in small data regimes.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
New method preserves MHD equations on sphere without costly matrix exponentials.
problem Discretizing MHD equations on sphere for numerical simulations.
method Lie-Poisson discretization, geometric quantization, semi-direct product Lie algebras.
result Preserves Lie-Poisson structure and Casimir functions.
A new measure of causal influence quantifies intrinsic contributions in DAGs.
problem Quantifying intrinsic causal contributions in Directed Acyclic Graphs (DAGs).
method Recursive decomposition of node contributions, structure-preserving interventions, Shapley symmetrization.
result A measure of intrinsic causal contribution that is invariant to node relabeling.
Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.
problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.
New integrators for mechanical systems on Lie groups simplify based on group properties.
problem Designing numerical integrators for mechanical systems on Lie groups.
method Leverage retraction maps and Lie group properties to design structure-preserving integrators.
result Simplified design of integrators for Euler-Poincare and Lie-Poisson equations.
Survey explores cohomology's roles in applied math and sciences.
problem Understanding cohomology's role in solving differential equations.
method Examining differential complexes and structure-preserving discretizations.
result Various fundamental concepts in mechanics are formulated using differential complexes.
Paper proposes G-CRD to improve GNNs by preserving global graph topology.
problem Improving lightweight GNNs for robust performance on large-scale real-world graphs.
method Introduces Graph Contrastive Representation Distillation (G-CRD) using contrastive learning.
result G-CRD consistently boosts GNN performance and robustness, outperforming existing methods.
Develops integrators for nonholonomic systems on Lie groups.
problem Nonholonomic constraints on Lie groups.
method Using retraction maps and Hamel formulation.
result Structure-preserving numerical integrators for nonholonomic systems.
An increasing amount of collected data are high-dimensional multi-way arrays (tensors), and it is crucial for efficient learning algorithms to exploit this tensorial structure as much as possible. The ever-present curse of dimensionality for high dimensional data and the loss of structure when vectorizing the data moti…
We develop a method to describe laws of random surfaces using surface holonomy.
problem Describing laws of random surfaces with structure.
method Introduce surface holonomy and develop expected surface developments.
result Expected surface development provides a structured description of random surface laws.
We classify nilmanifolds with an invariant symplectic half-flat structure. We solve the half-flat evolution equations in one example, writing down the resulting Ricci-flat metric. We study the geometry of the orbit space of 6-manifolds with an SU(3)-structure preserved by a U(1) action, giving characterizations in the …
New Wasserstein divergence improves generative model robustness and structure preservation.
problem Improving generative model robustness and structure preservation.
method Introduces a novel Wasserstein-1 path-space divergence and a WUP theorem.
result Derives robustness and generalization bounds for flow-based models.
Paper tackles imbalanced time series classification with a novel oversampling method.
problem Imbalanced time series classification challenges due to high dimensionality and correlation.
method Density-ratio based clustering followed by shrinkage technique for covariance estimation, then generating synthetic samples.
result OHIT outperforms state-of-the-art methods in F1, G-mean, and AUC metrics.
Develops neural networks that follow thermodynamics principles.
problem Learning physical systems from data while respecting thermodynamics.
method Uses feedforward neural networks and the GENERIC formalism to enforce metriplectic structure.
result Predictions comply with first and second principles of thermodynamics.
A quantum state generation method that respects physical constraints.
problem Generating quantum states with complex-valued Hermitian, positive semi-definite, and trace one properties.
method Mirror diffusion model with von Neumann entropy to enforce structural constraints.
result Demonstrated effective generation of quantum states with conditional guidance.
Algorithm learns latent variables for thermodynamically-consistent deep neural networks.
problem Predicting time evolution of large-scale physical systems with thermodynamic consistency.
method Sparse autoencoders and structure-preserving neural networks.
result Method conserves total energy and entropy inequality for both conservative and dissipative systems.
Derives stochastic and dissipative dynamics preserving Gibbs measure.
problem Understanding and deriving structure-preserving stochastic systems.
method Extension of Hamilton-Pontryagin principle, symmetry reduction, and inclusion of dissipation.
result New derivation of double-bracket dissipation.
Eigen-GNN enhances GNNs by preserving graph structures.
problem Existing shallow GNNs fail to effectively preserve graph structures.
method Integrates eigenspace of graph structures into GNNs as a dimensionality reduction module.
result Eigen-GNN boosts GNNs' ability to preserve graph structures without increasing depth.
Develops integrators for Hamiltonian systems in Jacobi manifolds.
problem Modeling conservative systems with dissipative and thermodynamic phenomena.
method Constructs structure-preserving integrators for Hamiltonian systems in Jacobi manifolds.
result Proposes a numerical integration technique compatible with Jacobi dynamics.
CDSPP learns domain-specific projections for heterogeneous domain adaptation.
problem Heterogeneous domain adaptation problems where source and target domains have different modalities or feature dimensions.
method Cross-Domain Structure Preserving Projection (CDSPP) algorithm that learns domain-specific projections to map features into a common subspace.
result CDSPP achieves superior performance in both supervised and semi-supervised HDA compared to state-of-the-art methods.
We establish a connection between recent developments in the study of vortices in the abelian Higgs models, and in the theory of structure-preserving discrete conformal maps. We explain how both are related via conformal mapping problems involving prescribed linear combinations of the curvature and volume form, and sho…
GCML preserves geometric structure in manifold clustering for diverse data types.
problem Loss functions in manifold clustering can corrupt latent space structure.
method GCML framework with isometric and ranking losses for geometric structure preservation.
result GCML outperforms other methods in latent space structure preservation and performance metrics.
This method infers models from data with physical insights, minimizing model order.
problem Learning models from data while preserving physical insights.
method Structure preservation and rank minimization via Sylvester equations.
result Models of low order are obtained with fewer degrees of freedom.
We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of smooth parametrization. As a consequence, and to underline the consistency and vali…
A new ML method predicts long-time-step molecular dynamics, preserving symplectic and time-reversible properties.
problem Limited computational efficiency in long-time-step molecular dynamics simulations.
method Learning data-driven structure-preserving maps to generate long time-step classical dynamics.
result The method eliminates artifacts like lack of energy conservation and loss of equipartition.
PASCO speeds up graph clustering for large graphs.
problem Efficiently clustering large graphs with many communities.
method Overlay method combining coarsening and parallel clustering.
result PASCO accelerates clustering with improved efficiency and quality.
New method preserves convergence rates in gradient-based optimization.
problem How to discretize gradient-based optimization systems while preserving stability and convergence rates.
method Geometric framework for dissipative symplectic integration.
result Dissipative symplectic integrators preserve rates of convergence up to a controlled error.
Adversarial examples are perturbed inputs designed to fool machine learning models. Most recent works on adversarial examples for image classification focus on directly modifying pixels with minor perturbations. A common requirement in all these works is that the malicious perturbations should be small enough (measured…
Deep learning methods are reviewed for preserving structure in neural networks.
problem Challenges in applying deep learning, especially in preserving structure.
method Review of existing deep learning methods and new algorithmic frameworks.
result Mathematical understanding and systematic design of deep learning methods to preserve structure.
New DR algorithm preserves both local and global structure.
problem Trade-off between preserving local and global structure in DR methods.
method Analysis of existing DR methods and design principles for loss functions.
result Design of PaCMAP algorithm that preserves both local and global structure.
This paper is the first work to propose a network to predict a structured uncertainty distribution for a synthesized image. Previous approaches have been mostly limited to predicting diagonal covariance matrices. Our novel model learns to predict a full Gaussian covariance matrix for each reconstruction, which permits …
Geometric framework for SPD matrices preserving subspace structures.
problem Processing SPD-valued data with preserved subspace structures.
method Thompson geometry of the semidefinite cone, extreme generalized eigenvalues, geodesic space structure.
result Novel inductive mean of SPD matrices based on Thompson geometry.
Tensoring p-weak differentiable structures preserves their properties.
problem Tensorization of p-weak differentiable structures. method Proving the product of p-weak charts is a p-weak chart, and showing isometric embeddings. result Tensorization of p-weak differentiable structures is possible under certain conditions. GraphSAIL updates GNN-based recommender models incrementally to reduce computation time and improve frequent updates.
problem Incremental updates in GNN-based recommender systems are computationally expensive and prone to forgetting.
method GraphSAIL uses a graph structure preservation strategy to update GNN models incrementally, preserving long-term preferences and properties.
result GraphSAIL reduces computation time and improves frequent updates compared to other incremental learning techniques.
Bayesian method improves forecasting of nonseparable Hamiltonian systems with noise.
problem Forecasting nonseparable Hamiltonian systems with multiplicative noise.
method Bayesian approach using deep learning and reduced-order modeling.
result Bayesian method yields up to 724 times improvement in forecasting accuracy.
EAGLE-Net enhances foundation models by integrating patch-level features for better tissue understanding.
problem Foundation models lack mechanisms for global tissue structure and local context in computational pathology.
method EAGLE-Net combines multi-scale spatial encoding, attention-guided loss functions, and background suppression to aggregate patch-level features into slide-level predictions.
result EAGLE-Net improves classification accuracy and concordance indices across multiple cancer types, producing biologically coherent attention maps.
New integrators preserve geometric structure in Hamiltonian systems.
problem Preserving geometric structure in Hamiltonian systems on Jacobi manifolds.
method Combining Poissonization and symplectic bi-realizations to construct structure-preserving integrators.
result Explicit construction and application of Jacobi Hamiltonian integrators.
We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter rectangles. For discrete planar quadrilateral nets, circular nets, Q∗-nets and conical…
This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is equivalent to a finite quasi-ultrametric space and study admissibility with respect…
New approach uses isotropic geometry to solve Euclidean problems.
problem Solving systems of constraints in Euclidean geometry.
method Start with analogous problems in isotropic geometry to initialize optimization algorithms.
result Solutions in isotropic geometry provide insight and initialize Euclidean problem solutions.
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate mappings of subgraphs by …
Reproduces IVFS for high-dimensional data structure preservation.
problem Preserving high-dimensional data structure in unsupervised feature selection.
method Inspired by random subset method, IVFS maintains data similarity through topological structure.
result IVFS outperforms SPEC and MCFS on most datasets.
Multi-task learning (MTL) improves prediction performance in different contexts by learning models jointly on multiple different, but related tasks. Network data, which are a priori data with a rich relational structure, provide an important context for applying MTL. In particular, the explicit relational structure imp…