activity
20132023
most citedUtility Elicitation as a Classification Problem

69 citations · 238 across the 13 of their papers we have counts for

collaborators

13 papers

cs.LG2023

Federated Learning with Neural Graphical Models

Urszula Chajewska, Harsh Shrivastava

Federated Learning (FL) addresses the need to create models based on proprietary data in such a way that multiple clients retain exclusive control over their data, while all benefi…

cs.AI2023★ 1 cited

Knowledge Propagation over Conditional Independence Graphs

Urszula Chajewska, Harsh Shrivastava

Conditional Independence (CI) graph is a special type of a Probabilistic Graphical Model (PGM) where the feature connections are modeled using an undirected graph and the edge weig…

cs.LG2023★ 5 cited

Missing Values and Imputation in Healthcare Data: Can Interpretable Machine Learning Help?

Zhi Chen, Sarah Tan, Urszula Chajewska +2

Missing values are a fundamental problem in data science. Many datasets have missing values that must be properly handled because the way missing values are treated can have large…

cs.LG2023★ 1 cited

Neural Graph Revealers

Harsh Shrivastava, Urszula Chajewska

Sparse graph recovery methods work well where the data follows their assumptions but often they are not designed for doing downstream probabilistic queries. This limits their adopt…

cs.LG2022★ 2 cited

Methods for Recovering Conditional Independence Graphs: A Survey

Harsh Shrivastava, Urszula Chajewska

Conditional Independence (CI) graphs are a type of probabilistic graphical models that are primarily used to gain insights about feature relationships. Each edge represents the par…

cs.LG2022★ 1 cited

Neural Graphical Models

Harsh Shrivastava, Urszula Chajewska

Probabilistic Graphical Models are often used to understand dynamics of a system. They can model relationships between features (nodes) and the underlying distribution. Theoretical…