Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs

DOI10.1007/S10994-022-06130-XMaRDI QIDQ2163223zbMATH OpenOpenAlexFDO

Authors H. Falciani, E. A. Sánchez-Pérez

Publication date 10 August 2022

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-022-06130-x

zbMATH Keywords

bifurcation metricgraph distanceLipschitz functionquasi-pseudo-metricreinforcement learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• A graph distance metric based on the maximal common subgraph
• A survey of graph edit distance
• Algebraic distance on graphs
• An introduction to machine learning
• Causal graphs and structurally restricted planning
• Discrete dynamical systems on graphs and Boolean functions
• Distance in graphs
• Distance in graphs
• Distance matrix of a graph and its realizability
• Distance-based classification with Lipschitz functions
• Efficient Classification for Metric Data
• Encyclopedia of Distances
• From word to sense embeddings: a survey on vector representations of meaning
• Graph kernels and Gaussian processes for relational reinforcement learning
• Graph theory with applications
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 1864563 (Why is no real title available?)
• scientific article; zbMATH DE number 5018471 (Why is no real title available?)
• Learning similarity with cosine similarity ensemble
• Lipschitz functions
• Network analysis. Methodological foundations.
• On a routing problem
• On the distance matrix of a directed graph
• Reinforcement learning. An introduction
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Semi-Lipschitz functions and best approximation in quasi-metric spaces

Cited in

(5)

• Extension procedures for lattice Lipschitz operators on Euclidean spaces
• Extension of semi-Lipschitz maps on non-subadditive quasi-metric spaces: new tools for Artificial Intelligence
• Order-preserving extensions of Lipschitz maps
• Lattice Lipschitz superposition operators on Banach function spaces
• Extensions of lattice Lipschitz operators on Riesz spaces

This page was built for publication: Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163223)