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…
On-device research index
arXiv research
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “Hinge-Loss Markov Random Fields”
A variety of approaches have been proposed to automatically infer the profiles of users from their digital footprint in social media. Most of the proposed approaches focus on mining a single type of information, while ignoring other sources of available user-generated content (UGC). In this paper, we propose a mechanis…
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…
Enhances MMSB for complex graph structures with HL-MRF priors.
problem Limited modeling of correlated graph structures in MMSB.
method HL-MRF as structured prior for mixed membership distributions.
result Improves log-likelihood by 15% on average across datasets.
New tree-structured Markov fields with Poisson marginals for counting variables.
problem Counting variables with complex dependencies.
method Tree-structured Markov random fields with Poisson marginals.
result Straightforward sampling and joint probability calculations.
New method speeds up sampling of Markov random fields.
problem Efficient sampling of Markov random fields is computationally expensive.
method Introduced a new class of Markov random fields linked to Gaussian Markov Random fields for faster sampling.
result At least 35x faster and 37x less energy consumption compared to Gibbs sampling.
Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, calle…
Recent studies have suggested that the cognitive process of the human brain is realized as probabilistic inference and can be further modeled by probabilistic graphical models like Markov random fields. Nevertheless, it remains unclear how probabilistic inference can be implemented by a network of spiking neurons in th…
Paper calculates KL divergence for isotropic Gaussian-Markov fields.
problem Measuring divergence between isotropic Gaussian-Markov fields.
method Derives closed-form KL divergence expressions.
result Develops new similarity measures in image processing.
This is a technical report which explores the estimation methodologies on hyper-parameters in Markov Random Field and Gaussian Hidden Markov Random Field. In first section, we briefly investigate a theoretical framework on Metropolis-Hastings algorithm. Next, by using MH algorithm, we simulate the data from Ising model…
Bayesian method selects interacting regions in Markov models.
problem Estimating interacting regions in Markov Random Fields.
method Reversible Jump Monte Carlo Markov Chain algorithm with pseudoposteriors.
result Proposed method accurately selects interacting regions in simulations and real data.
The paper develops methods for high-dimensional inference in Markov random fields.
problem Statistical inference for high-dimensional Markov random fields.
method Markov Chain Monte Carlo Maximum Likelihood Estimation (MCMC-MLE) with Elastic-net regularization.
result The proposed methods achieve -consistency and false discovery rate control.
Study a risk model with tree-structured Poisson-Markov random field for rainfall events.
problem Dependence between rainfall frequencies in insurance portfolios.
method Tree-structured Markov random field with Poisson marginals.
result Asymptotic results for portfolio risk and risk allocation.
New methods reduce computational cost for Gaussian Markov Random Fields with sparse constraints.
problem Inference and simulation of GMRFs are computationally prohibitive with many constraints.
method Proposes a basis transformation into blocks of constrained and non-constrained subspaces.
result Significantly outperforms existing alternatives in computational cost.
We adapt a Markov Random Field learning algorithm for continuous variables.
problem Learning sparse pairwise Markov Random Fields with continuous variables.
method Adapted Vuffray et al. (2019) algorithm for continuous variables and provided analysis.
result Sample complexity scales logarithmically with the number of variables.
The paper analyzes the dynamics of a simple neural network using a mean-field approach.
problem Understanding the training dynamics of neural networks, especially in classification tasks.
method Developed an analytic theory using a mean-field limit for a simple neural network.
result Explicitly solved the dynamics of a linearly separable dataset with a linear hinge loss.
CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.
problem Limited expressiveness of PGMs for topological data.
method Introducing Colored Markov Random Fields (CMRFs) that model Gaussian edge variables on topological spaces.
result CMRFs improve distributed estimation over physical networks compared to baselines.
Estimates binary labels from dependent data using Markov Random Fields.
problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.
Privacy constraints affect learning Markov Random Fields differently.
problem Learning Markov Random Fields under differential privacy constraints.
method Algorithms for structure and parameter learning under pure, concentrated, and approximate differential privacy.
result Privacy constraints impose a strong separation between structure and parameter learning in high-dimensional data.
Hidden Markov Chains and Linear-chain CRFs are equivalent.
problem Comparing Hidden Markov Chains and Conditional Random Fields.
method Constructing an HMC with the same posterior distribution as a CRF.
result HMCs and linear-chain CRFs are equivalent models.
We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike…
Deep GMRFs improve spatial data modeling and prediction.
problem Modeling spatial dependencies in data.
method Established connection between GMRFs and CNNs, allowing for multi-layer architectures.
result Deep GMRFs outperform state-of-the-art models in satellite temperature prediction.
We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. The novel maximization …
Integrates MRF into multimodal VAE for better complex intermodal interactions.
problem Lack of effective modeling of complex intermodal interactions in multimodal VAEs.
method Incorporates Markov Random Field into prior and posterior distributions of multimodal VAE.
result Demonstrates superior performance in managing complex intermodal dependencies.
Study on using random subspaces for ERM with various loss functions.
problem Improving learning accuracy with computational savings from random subspaces.
method Random subspaces of a hypothesis space, considering data-dependent subspaces.
result Unified analysis showing computational efficiency can be improved without performance loss.
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-comp…
LC-CRFs are equivalent to HMMs, and MPM/MAP classifiers can be reformulated as CRFs.
problem Comparing and reformulating HMMs and CRFs.
method Demonstrating equivalence and reformulation of classifiers.
result LC-CRFs are equivalent to HMMs, and MPM/MAP classifiers can be reformulated as CRFs.
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov processes. It is parameterised in a discriminative framework and has polynomial time algorit…
We consider the traffic data reconstruction problem. Suppose we have the traffic data of an entire city that are incomplete because some road data are unobserved. The problem is to reconstruct the unobserved parts of the data. In this paper, we propose a new method to reconstruct incomplete traffic data collected from …
Develops a Markov Random Field model for hypergraphs to improve machine learning tasks.
problem Modeling data generation processes on hypergraphs for better machine learning.
method Hypergraph Markov Random Field model using multivariate Gaussian distribution.
result Proposed model enhances algorithm design and outperforms existing methods in structure inference and node classification.
Method quantifies uncertainties in complex MRF models.
problem Uncertainties in MRF predictions due to data, modeling, and approximations.
method Information-based uncertainty quantification using MRF graphical structure.
result Tight bounds on predictions for quantities of interest in MRFs.
We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-comp…
Markov chain Monte Carlo (MCMC) algorithms are simple and extremely powerful techniques to sample from almost arbitrary distributions. The flaw in practice is that it can take a large and/or unknown amount of time to converge to the stationary distribution. This paper gives sufficient conditions to guarantee that univa…
A scalable deep GMRF model for general graphs improves predictions and uncertainty estimates.
problem Handling generally structured data on graphs efficiently.
method A new multi-layer structure of Deep GMRFs designed for general graphs, enabling efficient training and close-to-exact Bayesian inference.
result Close-to-exact Bayesian inference for latent field predictions with uncertainty estimates.
Gaptron algorithm reduces mistakes in online multiclass classification.
problem Online multiclass classification with limited information.
method Randomized first-order algorithm exploiting the gap between zero-one loss and surrogate losses.
result First linear time algorithm with expected regret.
MLDL preserves manifold geometry in vector transformations.
problem Geometric deterioration in neural network transformations.
method Locally isometric smoothness (LIS) and Markov random field (MRF) encoding.
result Enhanced vector transformations into well-behaved metric homeomorphisms.
In this paper, we consider Bayesian image denoising based on a Gaussian Markov random field (GMRF) model, for which we propose an new algorithm. Our method can solve Bayesian image denoising problems, including hyperparameter estimation, in -time, where is the number of pixels in a given image. From the persp…
We build on the work in Fackler and King 1990, and propose a more general calibration model for implied risk neutral densities. Our model allows for the joint calibration of a set of densities at different maturities and dates through a Bayesian dynamic Beta Markov Random Field. Our approach allows for possible time de…
New algorithms accelerate MAP inference in Markov fields with faster convergence.
problem Finding the most likely configuration in discrete-valued Markov random fields.
method Entropy-regularized linear programming with accelerated gradient methods.
result Accelerated algorithms find optimal solutions faster, especially when the LP is tight.
Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…
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…
Study recovers tree structure in noisy MRFs with support size 3 or more.
problem Learning tree-structured MRFs with symmetric noise.
method Characterized recoverability based on joint PMF, provided algorithm for recovery.
result Structure of leaf clusters can be partially or fully identifiable.
We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to sports such as soccer or hockey, in which contest outcomes take value in a limi…
The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework o…
This work proposes an efficient autoregressive model for text generation.
problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.
Software estimates inequality in random systems with changing communities.
problem Measuring inequality in systems with dynamic interactions and random attributes.
method Piecewise homogeneous Markov chain for changing points, copula function for multivariate distribution, Monte Carlo algorithm for entropy estimation.
result Estimates Random Theil's Entropy to measure inequality in random systems.
Consider a random vector with finite second moments. If its precision matrix is an M-matrix, then all partial correlations are non-negative. If that random vector is additionally Gaussian, the corresponding Markov random field (GMRF) is called attractive. We study estimation of M-matrices taking the role of inverse sec…
Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guaranteescs.LG
Efficiently infers time-varying sparse MRFs with strong statistical guarantees.
problem Inference of time-varying sparse MRFs with strong statistical guarantees.
method Constrained optimization with exact regularization, near-linear time and memory complexity.
result Sharp statistical guarantees for sparsely-changing Gaussian MRFs with as few as one sample per time.