相关论文: Generalized Sobolev IPM for Graph-Based Measures

Previous research has sought to enhance the graph reasoning capabilities of LLMs by supervised fine-tuning on synthetic graph data. While these led to specialized LLMs better at solving graph algorithm problems, we don't need LLMs for…

The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is…

The Gromov-Wasserstein (GW) distances define a family of metrics, based on ideas from optimal transport, which enable comparisons between probability measures defined on distinct metric spaces. They are particularly useful in areas such as…

We present a new general framework for metrization of Gromov-Hausdorff-type topologies on non-compact metric spaces. We also give easy-to-check conditions for separability and completeness and hence the measure theoretic requirements are…

This paper addresses problems in functional metric geometry that arise in the study of data such as signals recorded on geometric domains or on the nodes of weighted networks. Datasets comprising such objects arise in many domains of…

We propose the Sobolev Independence Criterion (SIC), an interpretable dependency measure between a high dimensional random variable X and a response variable Y . SIC decomposes to the sum of feature importance scores and hence can be used…

We prove uniform boundedness of certain boundary representations on appropriate fractional Sobolev spaces $W^{s,p}$ with $p>1$ for arbitrary Gromov hyperbolic groups. These are closed subspaces of $L^p$ and in particular Hilbert spaces in…

Pose-Graph optimization is a crucial component of many modern SLAM systems. Most prominent state of the art systems address this problem by iterative non-linear least squares. Both number of iterations and convergence basin of these…

Group-invariant probability distributions appear in many data-generative models in machine learning, such as graphs, point clouds, and images. In practice, one often needs to estimate divergences between such distributions. In this work, we…

A wide range of graph learning tasks, such as structure discovery, temporal graph analysis, and combinatorial optimization, focus on inferring graph structures from data, rather than making predictions on given graphs. However, the…

This paper aims to extend the concept of stochastic $\Sigma$-convergence to the framework of Orlicz-Sobolev spaces in order to deals with coupled stochastic and deterministic homogenization problems in this type of spaces. Thus, this…

Graph machine learning (GML) has been successfully applied across a wide range of tasks. Nonetheless, GML faces significant challenges in generalizing over out-of-distribution (OOD) data, which raises concerns about its wider applicability.…

We introduce Graph Normalization (GN), a principled dynamical system on graphs that serves as a differentiable approximation engine for the NP-hard Maximum Weight Independent Set (MWIS) problem. MWIS encompasses many combinatorial…

Classical global convergence results for first-order methods rely on uniform smoothness and the \L{}ojasiewicz inequality. Motivated by properties of objective functions that arise in machine learning, we propose a non-uniform refinement of…

We develop and analyze the Generalized Multiplicative Gradient (GMG) method for solving a class of convex optimization problems over symmetric cones, where the objective function does not have Lipschitz gradient over the feasible region.…

Given a probability measure $\mu$ supported on a convex subset $\Omega$ of Euclidean space $(\mathbb{R}^d,g_0)$, we are interested in obtaining Poincar\'e and log-Sobolev type inequalities on $(\Omega,g_0,\mu)$. To this end, we change the…

This paper analyzes the integration of artificial intelligence (AI) with mixed integer linear programming (MILP) to address complex optimization challenges in air transportation with explainability. The study aims to validate the use of…

We show that by employing the standard projected curvature as a measure of spatial curvature, we can make a certain generalization of optical geometry (Abramowicz and Lasota 1997, Class. Quantum Grav. 14 (1997) A23). This generalization…

In this article, we give probabilistic versions of Sobolev embeddings on any Riemannian manifold $(M,g)$. More precisely, we prove that for natural probability measures on $L^2(M)$, almost every function belong to all spaces $L^p(M)$,…

We develop a novel theoretical framework for understating OT schemes respecting a class structure. For this purpose, we propose a convex OT program with a sum-of-norms regularization term, which provably recovers the underlying class…