Related papers: Path integral distance for data interpretation
Path integrals developed by Richard Feynman have been an important tool in Physics in studying quantum field theory. In mathematics, it has also been widely used in providing formal proofs in the study of Index theorem and asymptotic…
Distantly supervised relation extraction has been widely used to find novel relational facts from plain text. To predict the relation between a pair of two target entities, existing methods solely rely on those direct sentences containing…
The notion of task similarity is at the core of various machine learning paradigms, such as domain adaptation and meta-learning. Current methods to quantify it are often heuristic, make strong assumptions on the label sets across the tasks,…
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…
This paper reviews and generalizes Feynman's path integration methods which use time slicing with straight line segments and Fourier sine series. The generalizations are done from variational calculus considerations and in one dimension for…
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
Work statistics characterizes important features of a non-equilibrium thermodynamic process. But the calculation of the work statistics in an arbitrary non-equilibrium process is usually a cumbersome task. In this work, we study the work…
We design a particle interpretation of Feynman-Kac measures on path spaces based on a backward Markovian representation combined with a traditional mean field particle interpretation of the flow of their final time marginals. In contrast to…
Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex…
We propose a new class of metrics on sets, vectors, and functions that can be used in various stages of data mining, including exploratory data analysis, learning, and result interpretation. These new distance functions unify and generalize…
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann…
Quantum walks constitute important tools in different applications, especially in quantum algorithms. To a great extent their usefulness is due to unusual diffusive features, allowing much faster spreading than their classical counterparts.…
Topological data analysis is a rapidly developing area of data science where one tries to discover topological patterns in data sets to generate insight and knowledge discovery. In this project we use quantum walk algorithms to discover…
In the field of machine learning, data understanding is the practice of getting initial insights in unknown datasets. Such knowledge-intensive tasks require a lot of documentation, which is necessary for data scientists to grasp the meaning…
The Feynman path integral representation of quantum theory is used in a non--parametric Bayesian approach to determine quantum potentials from measurements on a canonical ensemble. This representation allows to study explicitly the…
We present a novel methodology to jointly perform multi-task learning and infer intrinsic relationship among tasks by an interpretable and sparse graph. Unlike existing multi-task learning methodologies, the graph structure is not assumed…
We frame the issue of pedestrian dynamics modeling in terms of path-integrals, a formalism originally introduced in quantum mechanics to account for the behavior of quantum particles, later extended to quantum field theories and to…
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics computed from the data sets. The initial definition of our distance…
Graphics play a crucial role in statistical analysis and data mining. This paper describes metrics developed to assist the use of lineups for making inferential statements. Lineups embed the plot of the data among a set of null plots, and…
Graphs are versatile tools for representing structured data. As a result, a variety of machine learning methods have been studied for graph data analysis. Although many such learning methods depend on the measurement of differences between…