Quantum method generates unbiased samples from discrete graphical models.
problem Sampling from discrete graphical models is challenging and intractable in high dimensions.
method Embedding graphical models into unitary operators and using quantum circuits.
result Provably generates unbiased and independent samples from general discrete factor models.
Quantum models use complex Hilbert spaces for uncertainty.
problem Modeling dynamics in continuous-valued features.
method Quantum Graphical Models (QGMs) and Hilbert Space Embedding (HSE).
result HSE-HQMMs are competitive with state-of-the-art models.
Paper tackles learning quantum graphical models, improving speed and scalability.
problem Learning quantum graphical models from data.
method Solves a constrained optimization problem on the Stiefel manifold using gradient descent.
result Demonstrates faster and better solutions on various datasets, scaling to larger models.
A graphical calculus for microformal morphisms simplifies complex operations in classical and quantum physics.
problem Simplifying operations in classical and quantum microformal morphisms.
method Developed a graphical calculus inspired by Cattaneo-Dherin-Felder's work on formal symplectic groupoids, extended to quantum thick morphisms.
result Infinite series can be written as sums over bipartite trees for both classical and quantum thick morphisms.
Quantum-assisted GAN learns MNIST and LSUN datasets.
problem Learning latent variable generative models with adversarial networks.
method Generative adversarial learning with quantum annealing.
result Quantum-assisted GAN successfully learns MNIST and LSUN datasets.
The paper develops methods to assess and correct model uncertainties in graphical models.
problem Model uncertainty in probabilistic graphical models.
method Information-theoretic and non-parametric stress tests.
result Ranking and correcting impactful sources of uncertainty in graphical models.
Hybrid framework combines PGMs and TNs for complex probabilistic modeling.
problem Combining quantum-like correlations into PGM models.
method Introducing decoherence to convert probabilistic TN models into PGMs.
result Hybrid models can represent and combine strengths of both PGMs and TNs.
This paper contains a summary of mathematical researches of stochastic properties of the long time behavior of a continuously observed (and interactively controlled) quantum--field top. Applications to interactively controlled stochastic computer-graphic dynamical systems are also discussed.
Hidden Quantum Markov Models (HQMMs) can be thought of as quantum probabilistic graphical models that can model sequential data. We extend previous work on HQMMs with three contributions: (1) we show how classical hidden Markov models (HMMs) can be simulated on a quantum circuit, (2) we reformulate HQMMs by relaxing th…
New proof and formula linking fusion trees to quantum knot invariants.
problem Quantum knot invariants encoding in non-semisimple TQC.
method Connection between fusion trees and Lawrence representations, using graphical calculus.
result Explicit encoding of quantum knot invariants via fusion trees.
Tensor networks have found a wide use in a variety of applications in physics and computer science, recently leading to both theoretical insights as well as practical algorithms in machine learning. In this work we explore the connection between tensor networks and probabilistic graphical models, and show that it motiv…
Quantum annealer speeds up RBM training for image classification.
problem Training RBM with contrastive divergence (CD) is slow and computationally expensive.
method Used D-Wave 2000Q quantum annealer to calculate model expectation of gradient learning for RBM.
result Quantum training yields similar classification performance to CD but faster.
We introduce two quantum algorithms for solving structured prediction problems. We first show that a stochastic gradient descent that uses the quantum minimum finding algorithm and takes its probabilistic failure into account solves the structured prediction problem with a runtime that scales with the square root of th…
New quantum invariant for framed 3-manifolds using ideal triangulations.
problem Quantum invariants of framed 3-manifolds with vanishing first Betti number.
method Based on ideal triangulations and Hopf algebras, using the pentagon equation and graphical representations.
result Construction of a new quantum invariant for closed framed 3-manifolds.
Tensor-networks enhance probabilistic modeling in physics and machine learning.
problem Understanding the expressive power of different tensor-network factorizations.
method Rigorous analysis of various tensor-network factorizations of discrete multivariate probability distributions.
result There are unbounded separations between the resource requirements of some tensor-network factorizations.
Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. For many classes of problems, QA is known to offer computat…
Extends string-net theory to 3D TQFT via surface graphs and surgery.
problem Formulate 3D TQFT using string-net theory.
method Extend string-net construction to 3D TQFT using surface graphs and surgery.
result Alternative description of Turaev-Viro model using string-nets.
Bayesian tensor network reduces conditional probability calculation to polynomial time.
problem Exponential cost of calculating conditional probabilities for multiple events.
method Bayesian tensor network (BTN) with polynomial complexity.
result Competitive performance in image recognition with simple tree structures.
Quantum annealer improves classification of handwritten digits.
problem Classical MCMC struggles with missing labels in RBM models.
method Embedding RBM into D-Wave quantum annealer for classification.
result D-Wave QA reduces classification error by more than two times.
Many widely studied graphical models with latent variables lead to nontrivial constraints on the distribution of the observed variables. Inspired by the Bell inequalities in quantum mechanics, we refer to any linear inequality whose violation rules out some latent variable model as a "hidden variable test" for that mod…
Graphical lasso may fail to fit models when data points are insufficient.
problem When does graphical lasso fail to select and fit a graphical model?
method Computational experiments with graphical lasso.
result Graphical lasso may fail when the number of data points is less than the maximum likelihood threshold.
We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In this paper, we propose the graphical nonconvex optimization for optimal estimat…
Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…
Skein theory classifies UFCs with specific fusion rules.
problem Classifying unitary fusion categories with specific fusion rules.
method Graphical calculus and rotation operator action on a canonical basis.
result Explicit formulae for Fqqqq when k=2 and C is ribbon. Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss…
Paper introduces a nonparametric functional graphical model for random functions.
problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.
Probabilistic graphical models combine the graph theory and probability theory to give a multivariate statistical modeling. They provide a unified description of uncertainty using probability and complexity using the graphical model. Especially, graphical models provide the following several useful properties: - Graphi…
Graphical models improve portfolio optimization for financial time series.
problem Optimizing portfolios with time-varying covariance patterns.
method Various graphical models (PCA-KMeans, autoencoders, dynamic clustering, structural learning) to capture covariance matrix patterns.
result Graphical models outperform baseline methods in generating steady returns with low risk.
Paper estimates non-causal graphical models using covariance extension and transportation distance.
problem Estimating non-causal graphical models with smoothing relations.
method Proposes a covariance extension problem and uses transportation distance to minimize error with white noise.
result Solution is a double-sided autoregressive non-causal graphical model.
Nonparametric undirected graphical model selection using diffusion models
problem Undirected graphical model selection
method Diffusion models
result Model selection consistency
rags2ridges simplifies graphical modeling of high-dimensional data.
problem Graphical modeling of high-dimensional precision matrices.
method Modular framework for extraction, visualization, and analysis of Gaussian graphical models.
result Provides a one-stop-shop for graphical modeling of high-dimensional precision matrices.
Bayesian method for estimating functional graphical models from neuroimaging data.
problem Estimating dependence structures from functional data in neuroscience.
method Fully Bayesian regularization scheme, including direct Bayesian analog of functional graphical lasso and graphical horseshoe.
result Insight into brain compensation after traumatic brain injury.
AGM uses adversarial approach for robust prediction in structured prediction problems.
problem Structured prediction problems with complex relationships between variables.
method Adversarial Graphical Models (AGM) for distributionally robust prediction.
result AGM achieves Fisher consistency and flexibility in loss metrics.
Method solves Gaussian graphical models on ladder graphs efficiently.
problem Solving Gaussian graphical models on ladder graphs efficiently.
method Proposes a method that depends on the position of zeros in local covariance matrices.
result Efficiently solves Gaussian graphical models on ladder graphs under certain conditions.
New framework models complex spatial data with basis functions and graphical vectors.
problem Modeling highly-multivariate spatial processes with varying resolutions.
method Extends graphical lasso to multivariate Gaussian processes with independent graphical vectors at different resolutions, using an orthogonal basis and fusion penalty.
result Linear complexity and parsimonious conditional independence structure in multilevel graphical model.
Estimating tree structured Gaussian Graphical Model from noisy data.
problem Recover the original independence structure from noisy observations.
method Address the unidentifiability of tree structured graphical models and provide an algorithm to find the equivalence class of trees.
result An O(n^3) algorithm to find the equivalence class of trees.
A new graphical model for discrete data without parametric restrictions.
problem Discrete data modeling with restrictions.
method Additive conditional independence and penalized estimation of precision operator.
result Consistency of the estimator in ultrahigh-dimensional settings.
Novel model selection method outperforms current state-of-the-art in high-dimensional graphical models.
problem Accurate model selection in high-dimensional graphical models.
method Graphical Neighbour Information (GNI) criterion.
result Demonstrates oracle performance in high-dimensional model selection, outperforming current methods.
This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both alg…
A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit computationally convenient factorization properties and have long been a valuable tool for t…
We propose a general modeling and inference framework that composes probabilistic graphical models with deep learning methods and combines their respective strengths. Our model family augments graphical structure in latent variables with neural network observation models. For inference, we extend variational autoencode…
New method aggregates nodes in sparse graphical models.
problem Estimating edge-sparse graphical models.
method Tree-aggregated graphical lasso (tag-lasso) method.
result Aggregates nodes in a data-driven fashion using a tree.
New method for estimating functional Gaussian graphical models for multivariate data.
problem Challenges in extending Gaussian graphical models to multivariate functional data due to compact covariance operators.
method Introducing partial separability for multivariate functional data, leading to a novel Karhunen-Loève expansion and efficient estimation through the joint graphical lasso.
result A well-defined functional Gaussian graphical model that can be identified with a sequence of finite-dimensional graphical models, each of identical fixed dimension.
New graphical criteria for efficient covariate adjustment in non-parametric causal models.
problem Estimating population average treatment effects in observational studies using non-parametric causal graphical models.
method Developed new graphical criteria to determine efficient covariate adjustment sets for estimating treatment effects in non-parametric causal graphical models.
result Graphical criteria for efficient covariate adjustment can be applied in both linear and non-parametric causal models.
We consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approach for this task. We begin by introducing a surprising connection between the graphical lasso and hi…
Develops a nonparametric graphical model for conditional independence.
problem Evaluation of conditional independence without distributional assumptions.
method Nonlinear sufficient dimension reduction techniques applied to a nonparametric graphical model.
result Method outperforms existing methods in non-Gaussian settings and high-dimensional data.
Pen-and-paper exercises cover various machine learning topics.
problem None explicitly stated, focuses on learning through exercises.
method Pen-and-paper exercises on machine learning topics.
result Comprehensive coverage of machine learning concepts through exercises.
We propose Graphical Generative Adversarial Networks (Graphical-GAN) to model structured data. Graphical-GAN conjoins the power of Bayesian networks on compactly representing the dependency structures among random variables and that of generative adversarial networks on learning expressive dependency functions. We intr…