A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper proposes a new method for MRF structure learning.
New method controls false discovery rate in learning Gaussian MRF structures.
Graphical models for structured domains are powerful tools, but the computational complexities of combinatorial prediction spaces can force restrictions on models, or require approximate inference in order to be tractable. Instead of working in a combinatorial space, we use hinge-loss Markov random fields (HL-MRFs), an…
AdVIL improves inference and learning for MRFs with minimal assumptions.
Method quantifies uncertainties in complex MRF models.
Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) …
A fundamental challenge in developing high-impact machine learning technologies is balancing the need to model rich, structured domains with the ability to scale to big data. Many important problem areas are both richly structured and large scale, from social and biological networks, to knowledge graphs and the Web, to…
Learning structured outputs with general structures is computationally challenging, except for tree-structured models. Thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. The idea is based on the realization that a graph is a superimposition of trees. Different from most existing work, our…
We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter exponential family and mixed graphical models, thereby greatly broadening the class o…
Proposes a new method for learning MRFs without sampling.
Markov random field (MRF) learning is intractable, and its approximation algorithms are computationally expensive. We target a small subset of MRF that is used frequently in computer vision. We characterize this subset with three concepts: Lattice, Homogeneity, and Inertia; and design a non-markov model as an alternati…
Deep learning reduces memory and computation for MRF recovery.
A neural network model minimizes region-based free energy for faster inference in MRFs.
The theory of learning under the uniform distribution is rich and deep, with connections to cryptography, computational complexity, and the analysis of boolean functions to name a few areas. This theory however is very limited due to the fact that the uniform distribution and the corresponding Fourier basis are rarely …
New method controls gradient error for sparse MRFs.
Efficiently infers time-varying sparse MRFs with strong statistical guarantees.
Enhances MMSB for complex graph structures with HL-MRF priors.
We introduce a class of dependence structures, that we call the Multiple Risk Factor (MRF) dependence structures. On the one hand, the new constructions extend the popular CreditRisk+ approach, and as such they formally describe default risk portfolios exposed to an arbitrary number of fatal risk factors with condition…
Optimizes ASL-MRF scan design for precise brain hemodynamics quantification.
In this paper we address the problem of finding the most probable state of a discrete Markov random field (MRF), also known as the MRF energy minimization problem. The task is known to be NP-hard in general and its practical importance motivates numerous approximate algorithms. We propose a submodular relaxation approa…
We learn higher-order Markov random fields from evolving data, bypassing computational barriers.
The paper uses MRFs to improve recommendation accuracy in collaborative filtering.
Efficiently solves MRF inference problems with semidefinite programming.
Proposes MRF for consistency and privacy in RF.
New method speeds up sampling of Markov random fields.
Develops ML tool for macroeconomic forecasting with clear interpretations.
Copulas have become an important tool in the modern best practice Enterprise Risk Management, often supplanting other approaches to modelling stochastic dependence. However, choosing the `right' copula is not an easy task, and the temptation to prefer a tractable rather than a meaningful candidate from the encompassing…
Markov random fields (MRFs) are difficult to evaluate as generative models because computing the test log-probabilities requires the intractable partition function. Annealed importance sampling (AIS) is widely used to estimate MRF partition functions, and often yields quite accurate results. However, AIS is prone to ov…
Almost all of the work in graphical models for game theory has mirrored previous work in probabilistic graphical models. Our work considers the opposite direction: Taking advantage of recent advances in equilibrium computation for probabilistic inference. We present formulations of inference problems in Markov random f…
In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this relaxation is tight, and a discrete stationary point of it can be easily reached by a simple block coordinate descent algorithm. In addition, we study the resolution …
New GAN design uses conditional independence graphs to improve model-based GANs.
Study recovers tree structure in noisy MRFs with support size 3 or more.
Bayesian Cox model identifies biomarkers from multi-omics data.
PS-VAE extracts multi-parameter MRI biomarkers with uncertainty quantification.
Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an incrementally grown active set of features. In this paper, we address key compu…
Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov rand…
Algorithm learns CNF formulas from random solutions under specific conditions.
Algorithm learns Sherrington-Kirkpatrick model parameters at low temperatures.
We adapt a Markov Random Field learning algorithm for continuous variables.
A novel method for estimating group-representative functional networks from multi-subject fMRI data.
We describe a new technique for computing lower-bounds on the minimum energy configuration of a planar Markov Random Field (MRF). Our method successively adds large numbers of constraints and enforces consistency over binary projections of the original problem state space. These constraints are represented in terms of …
Inference in general Markov random fields (MRFs) is NP-hard, though identifying the maximum a posteriori (MAP) configuration of pairwise MRFs with submodular cost functions is efficiently solvable using graph cuts. Marginal inference, however, even for this restricted class, is in #P. We prove new formulations of deriv…
We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministi…
Parameter estimation in Markov random fields (MRFs) is a difficult task, in which inference over the network is run in the inner loop of a gradient descent procedure. Replacing exact inference with approximate methods such as loopy belief propagation (LBP) can suffer from poor convergence. In this paper, we provide a d…
BWFlow improves graph generation by smoothly interpolating graph components.
Alternative optimizer outperforms gradient descent in weakly-supervised CNN segmentation.
Enhances random forest consistency and introduces DMRF for improved performance.
Integrates MRF into multimodal VAE for better complex intermodal interactions.