paper-with-me

Papers

Blossom Tree Graphical Models

2014-12-01 · NeurIPS 2014 12 · Zhe Liu, John Lafferty

We combine the ideas behind trees and Gaussian graphical models to form a new nonparametric family of graphical models. Our approach is to attach nonparanormal blossoms", with arbitrary graphs, to a collection of nonparametric trees. The tree edges are chosen to connect variables that most violate joint Gaussianity. The non-tree edges are partitioned into disjoint groups, and assigned to tree nodes using a nonparametric partial correlation statistic. A nonparanormal blossom is then "grown" for each group using established methods based on the graphical lasso. The result is a factorization with respect to the union of the tree branches and blossoms, defining a high-dimensional joint density that can be efficiently estimated and evaluated on test points. Theoretical properties and experiments with simulated and real data demonstrate the effectiveness of blossom trees."

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Predicting Blossom Date of Cherry Tree With Support Vector Machine and Recurrent Neural Network

2022-10-10 · Hongyi Zheng, Yanyu Chen, Zihan Zhang

Our project probes the relationship between temperatures and the blossom date of cherry trees. Through modeling, future flowering will become predictive, helping the public plan travels and avoid pollen season. To predic…

Minimum Weight Perfect Matching via Blossom Belief Propagation

2015-09-23 · NeurIPS 2015 12 · Sungsoo Ahn, Sejun Park, Michael Chertkov, Jinwoo Shin

Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment over a distribution represented by a Graphical Model (GM). It has been shown that BP can so…

Combinatorial Optimization

A Generic Complete Anytime Beam Search for Optimal Decision Tree

2025-08-08 · Harold Silvère Kiossou, Siegfried Nijssen, Pierre Schaus arxiv

Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimality, they often suffer from poor anytime…

BLOSSOM: Block-wise Federated Learning Over Shared and Sparse Observed Modalities

2026-03-29 · Pranav M R, Jayant Chandwani, Ahmed M. Abdelmoniem, Arnab K. Paul arxiv

Multimodal federated learning (FL) is essential for real-world applications such as autonomous systems and healthcare, where data is distributed across heterogeneous clients with varying and often missing modalities. How…

Federated Learning

CherryPicker: Semantic Skeletonization and Topological Reconstruction of Cherry Trees

2023-04-10 · Lukas Meyer, Andreas Gilson, Oliver Scholz, Marc Stamminger

In plant phenotyping, accurate trait extraction from 3D point clouds of trees is still an open problem. For automatic modeling and trait extraction of tree organs such as blossoms and fruits, the semantically segmented p…

Monocular ReconstructionPlant PhenotypingSemantic Segmentation