New method for tuning Graphical Lasso hyperparameters.
problem Tuning hyperparameters of Graphical Lasso.
method Bilevel optimization with first-order method.
result Derivation of Graphical Lasso Jacobian.
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,657 papers · 148 categories
Trend · papers per month
48 results for “graphical methods”
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.
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…
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.
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.
Nonparametric undirected graphical model selection using diffusion models
problem Undirected graphical model selection
method Diffusion models
result Model selection consistency
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.
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.
This paper addresses the problem of scalable optimization for L1-regularized conditional Gaussian graphical models. Conditional Gaussian graphical models generalize the well-known Gaussian graphical models to conditional distributions to model the output network influenced by conditioning input variables. While highly …
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.
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.
In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditio…
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…
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.
We develop a new method called Discriminated Hub Graphical Lasso (DHGL) based on Hub Graphical Lasso (HGL) by providing prior information of hubs. We apply this new method in two situations: with known hubs and without known hubs. Then we compare DHGL with HGL using several measures of performance. When some hubs are k…
We present some nonparametric methods for graphical modeling. In the discrete case, where the data are binary or drawn from a finite alphabet, Markov random fields are already essentially nonparametric, since the cliques can take only a finite number of values. Continuous data are different. The Gaussian graphical mode…
In this paper, we study the problem of learning the set of pure strategy Nash equilibria and the exact structure of a continuous-action graphical game with quadratic payoffs by observing a small set of perturbed equilibria. A continuous-action graphical game can possibly have an uncountable set of Nash euqilibria. We p…
Paper compares two methods for inferring network structures in presence of latent confounders.
problem Inferring network structures in presence of latent confounders.
method Gaussian graphical models with latent variables (LVGGM) and PCA-based removal of confounding (PCA+GGM).
result Proposes a new method combining strengths of LVGGM and PCA+GGM, proving consistency and convergence rate.
Graphical models for covariance matrices improve structure learning.
problem Learning structure in graphical models for covariance matrices.
method Structural learning via -penalized loss minimization.
result Method outperforms alternatives in simulations and real-world applications.
The covariance structure of multivariate functional data can be highly complex, especially if the multivariate dimension is large, making extensions of statistical methods for standard multivariate data to the functional data setting challenging. For example, Gaussian graphical models have recently been extended to the…
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.
Bayesian method estimates Kronecker graphical models from autoregressive processes.
problem Estimating Kronecker graphical models from autoregressive Gaussian processes.
method Bayesian approach to estimate Kronecker graphical models.
result Effectiveness demonstrated through numerical experiments and real-world data application.
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.
Efficient algorithms solve joint graphical lasso problems.
problem Learning graphical models from sparse data.
method Proximal gradient procedures with ADMM backtracking option.
result Proposed algorithms achieve high accuracy and precision.
Accurate model selection is a fundamental requirement for statistical analysis. In many real-world applications of graphical modelling, correct model structure identification is the ultimate objective. Standard model validation procedures such as information theoretic scores and cross validation have demonstrated poor …
Paper proposes a natural hedging framework with graphical assessment for longevity risk management.
problem Lack of a unified framework for natural hedging and graphical risk assessment.
method Structured natural hedging framework integrated with a graphical risk metric.
result Demonstrates flexibility, interpretability, and practical value for longevity risk management.
This paper considers the problem of estimating multiple related Gaussian graphical models from a -dimensional dataset consisting of different classes. Our work is based upon the formulation of this problem as group graphical lasso. This paper proposes a novel hybrid covariance thresholding algorithm that can effecti…
A new method for fast, non-iterative graphical model estimation.
problem Scalability issues in iterative proportional fitting for high-dimensional data.
method Non-iterative approach for positive definite graphical model estimation.
result The proposed method outperforms state-of-the-art methods in high-dimensional settings.
Method estimates M-matrices in graphical models with improved accuracy.
problem Estimating M-matrices as precision matrices in Gaussian graphical models.
method Adaptive multiple-stage estimation method solving weighted ℓ1-regularized problems.
result Method outperforms state-of-the-art methods in precision matrix estimation and graph edge identification.
Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithmmath.OC
Efficiently estimates hub graphical models with structured sparsity.
problem Computational difficulty in fitting graphical models with hub nodes, especially in high-dimensional data.
method Two-phase algorithm: ADMM for initial point generation and SSN-ALM for accurate solution.
result Significantly improves estimation accuracy and efficiency compared to existing methods.
Paper introduces MGLasso for multiscale graph inference in clustering and network analysis.
problem Graphical models in high-dimensional data analysis need to handle clustering and sparsity simultaneously.
method MGLasso combines clustering and graph inference through a convex relaxation of k-means and hierarchical clustering. It uses CONESTA for regularization.
result MGLasso improves network interpretability by estimating graphs at multiple scales.
Composing graphical models with neural networks for structured representations and fast inferencestat.ML
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…
Modeling massive highly-multivariate nonstationary spatial data with the basis graphical lassostat.ME
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.
Communication-efficient Distributed Estimation and Inference for Transelliptical Graphical Modelsstat.ML
We propose communication-efficient distributed estimation and inference methods for the transelliptical graphical model, a semiparametric extension of the elliptical distribution in the high dimensional regime. In detail, the proposed method distributes the -dimensional data of size generated from a transellipti…
New method controls false edge detections in Gaussian graphical models.
problem High false edge detections in well-established estimators.
method Nodewise variable selection approach to control false discovery rate.
result Significant gain in performance compared to competing methods.
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.
Bayesian graphical models have been shown to be a powerful tool for discovering uncertainty and causal structure from real-world data in many application fields. Current inference methods primarily follow different kinds of trade-offs between computational complexity and predictive accuracy. At one end of the spectrum,…
New method learns graphical models with latent variables for extreme events.
problem Learning graphical models with latent variables for multivariate extremes.
method Tractable convex program exttt{eglatent} for Hüsler-Reiss models.
result Consistently recovers conditional graph and latent variables.
The task of matching co-referent records is known among other names as rocord linkage. For large record-linkage problems, often there is little or no labeled data available, but unlabeled data shows a reasonable clear structure. For such problems, unsupervised or semi-supervised methods are preferable to supervised met…
Covariate-dependent Graphical Model Estimation via Neural Networks with Statistical Guaranteesstat.ML
Neural network method estimates covariate-dependent graphical models with statistical guarantees.
problem Estimating graph structure from covariate-dependent data.
method Neural network approach that allows flexible functional dependency on covariates.
result Theoretical PAC guarantees for the method's performance.
Theory of graphical models has matured over more than three decades to provide the backbone for several classes of models that are used in a myriad of applications such as genetic mapping of diseases, credit risk evaluation, reliability and computer security, etc. Despite of their generic applicability and wide adoptan…
New method for fitting graphical models with latent variables using regularized conditional likelihood.
problem Graphical modeling with latent variables and confounding dependencies.
method Regularized conditional likelihood for exponential family graphical models.
result Framework applicable to broader settings without knowing latent variables' distribution.
Proposes a method to estimate sparse Gaussian graphical models with hidden clustering structure.
problem Modeling statistical relationships between variables with sparsity and clustering.
method Two-phase algorithm using sGS-ADMM for initial point and pALM for solution.
result Demonstrates good performance and efficiency of the proposed model and algorithm on synthetic and real data.
Paper proposes a method to detect fair communities in graphs considering demographic attributes.
problem Inconsistent community detection violates fairness constraints for nodes with demographic attributes.
method Develops an -regularized pseudo-likelihood approach for fair graphical model selection.
result The method ensures demographic groups are fairly represented within detected communities.
Automates hair color digitization using imaging and deep learning.
problem Challenges in capturing and rendering realistic hair colors.
method Combines imaging, path-tracing, and self-supervised machine learning.
result Accurately captures and renders hair color with synthetic images.
Simultaneous Identification of Sparse Structures and Communities in Heterogeneous Graphical Modelsstat.ML
Paper identifies sparse structures and communities in heterogeneous graphical models.
problem Detecting community structures in graphical models.
method Novel decomposition into sparse and low-rank parts, three-stage estimation procedure.
result Consistent model selection for adaptive penalized estimator.
Gaussian Graphical Models (GGMs) are popular tools for studying network structures. However, many modern applications such as gene network discovery and social interactions analysis often involve high-dimensional noisy data with outliers or heavier tails than the Gaussian distribution. In this paper, we propose the Tri…
Clusterpath estimator simplifies graphical model interpretation for large datasets.
problem Difficulty in interpreting graphical models with many variables.
method Clusterpath estimator that groups variables for block-structured precision matrix.
result CGGM outperforms other methods in variable clustering and practical applications.