Tanya Braun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tanya Braun has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Marcel Gehrke
University of Hamburg
20 shared publications - Ralf Möller
University of Hamburg
20 shared publications Ralf Möller
German Research Center for Artificial Intelligence (DFKI) University of Lübeck
7 shared publications- Malte Luttermann
German Research Center for Artificial Intelligence (DFKI)
4 shared publications - Magnus Bender
Aarhus University
3 shared publications - Nazlı Nur Karabulut
University of Munster
3 shared publications
Latest Publications
- 5 November 2026
- Published by Springer Nature
- p. 199-214
Lifted Model Construction Under Approximate Commutativity
- 5 November 2026
- Published by Springer Nature
- p. 199-214
Lifted Model Construction Under Approximate Commutativity
- 5 November 2026
- Published by Springer Nature
- p. 183-198
The Curious Case of Exploding DecPOMDPs: Containing the Fire Through Policy Counting
- 5 November 2026
- Published by Springer Nature
- p. 183-198
The Curious Case of Exploding DecPOMDPs: Containing the Fire Through Policy Counting
- 5 November 2026
- Published by Springer Nature
- p. 331-345
On Probabilistic Inference Through Parametric Tensor Decomposition in Base Tensor Networks
- 5 November 2026
- Published by Springer Nature
- p. 331-345
On Probabilistic Inference Through Parametric Tensor Decomposition in Base Tensor Networks
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 5051-5058
Compression Versus Accuracy: A Hierarchy of Lifted Models
Probabilistic graphical models that encode indistinguishable objects and relations among them use first-order logic constructs to compress a propositional factorised model for more efficient (lifted) inference. To obtain a lifted representation, the state-of-the-art algorithm Advanced Colour Passing (ACP) groups factors that represent matching distributions. In an approximate version using ε as a hyperparameter, factors are grouped that differ by a factor of at most (1 ± ε). However, finding a suitable ε is not obvious and may need a lot of exploration, possibly requiring many ACP runs with different ε values. Additionally, varying ε can yield wildly different models, leading to decreased interpretability. Therefore, this paper presents a hierarchical approach to lifted model construction that is hyperparameter-free. It efficiently computes a hierarchy of ε values that ensures a hierarchy of models, meaning that once factors are grouped together given some ε, these factors will be grouped together for larger ε as well. The hierarchy of ε values also leads to a hierarchy of error bounds. This allows for explicitly weighing compression versus accuracy when choosing specific ε values to run ACP with and enables interpretability between the different models.
- 21 October 2025
- Published by IOS Press
- p. 5051-5058
Open AccessCompression Versus Accuracy: A Hierarchy of Lifted Models
Probabilistic graphical models that encode indistinguishable objects and relations among them use first-order logic constructs to compress a propositional factorised model for more efficient (lifted) inference. To obtain a lifted representation, the state-of-the-art algorithm Advanced Colour Passing (ACP) groups factors that represent matching distributions. In an approximate version using ε as a hyperparameter, factors are grouped that differ by a factor of at most (1 ± ε). However, finding a suitable ε is not obvious and may need a lot of exploration, possibly requiring many ACP runs with different ε values. Additionally, varying ε can yield wildly different models, leading to decreased interpretability. Therefore, this paper presents a hierarchical approach to lifted model construction that is hyperparameter-free. It efficiently computes a hierarchy of ε values that ensures a hierarchy of models, meaning that once factors are grouped together given some ε, these factors will be grouped together for larger ε as well. The hierarchy of ε values also leads to a hierarchy of error bounds. This allows for explicitly weighing compression versus accuracy when choosing specific ε values to run ACP with and enables interpretability between the different models.
- 24 September 2025
- Published by Springer Nature
- p. 207-222
Counting Agents in Partially Observable Stochastic Games
- 24 September 2025
- Published by Springer Nature
- p. 207-222
Counting Agents in Partially Observable Stochastic Games
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 10, 9077-9085
Approximate Lifted Model Construction
Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for computations. To obtain a relational (i.e., lifted) representation, the Advanced Colour Passing (ACP) algorithm is the state of the art. The ACP algorithm, however, requires underlying distributions, encoded as potential-based factorisations, to exactly match to identify and exploit indistinguishabilities. Hence, ACP is unsuitable for practical applications where potentials learned from data inevitably deviate even if associated objects are indistinguishable. To mitigate this problem, we introduce the ε-Advanced Colour Passing (ε-ACP) algorithm, which allows for a deviation of potentials depending on a hyperparameter ε. ε-ACP efficiently uncovers and exploits indistinguishabilities that are not exact. We prove that the approximation error induced by ε-ACP is strictly bounded and our experiments show that the approximation error is close to zero in practice.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 10, 9077-9085
Open AccessApproximate Lifted Model Construction
Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for computations. To obtain a relational (i.e., lifted) representation, the Advanced Colour Passing (ACP) algorithm is the state of the art. The ACP algorithm, however, requires underlying distributions, encoded as potential-based factorisations, to exactly match to identify and exploit indistinguishabilities. Hence, ACP is unsuitable for practical applications where potentials learned from data inevitably deviate even if associated objects are indistinguishable. To mitigate this problem, we introduce the ε-Advanced Colour Passing (ε-ACP) algorithm, which allows for a deviation of potentials depending on a hyperparameter ε. ε-ACP efficiently uncovers and exploits indistinguishabilities that are not exact. We prove that the approximation error induced by ε-ACP is strictly bounded and our experiments show that the approximation error is close to zero in practice.
- 24 April 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Semantic Computing
- Vol. 19 (02) , 297-319
Enhancement of Subjective Content Descriptions by Using Human Feedback
An agent providing an information retrieval service may work with a corpus of text documents. The documents in the corpus may contain annotations such as Subjective Content Descriptions (SCDs) — additional data associated with different sentences of the documents. Each SCD is associated with multiple sentences of the corpus and has relations among each other. The agent uses the SCDs to create its answers in response to queries supplied by users. However, the SCD the agent uses might reflect the subjective perspective of another user. Hence, answers may be considered faulty by an agent’s user, because the SCDs may not exactly match the perceptions of an agent’s user. A naive and very costly approach would be to ask each user to completely create all the SCD themselves. To use the existing knowledge, this paper presents ReFrESH, an approach for Relation-preserving Feedback-reliant Enhancement of SCDs by Humans. An agent’s user can give feedback about faulty answers to the agent. This feedback is then used by ReFrESH to update the SCDs incrementally. However, human feedback is not always unambiguous. Therefore, this paper additionally presents an approach to decide how to incorporate the feedback and when to update the SCDs. Altogether, SCDs can be updated with human feedback, allowing users to create even more specific SCDs for their needs.
- 24 April 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Semantic Computing
- Vol. 19 (02) , 297-319
Enhancement of Subjective Content Descriptions by Using Human Feedback
An agent providing an information retrieval service may work with a corpus of text documents. The documents in the corpus may contain annotations such as Subjective Content Descriptions (SCDs) — additional data associated with different sentences of the documents. Each SCD is associated with multiple sentences of the corpus and has relations among each other. The agent uses the SCDs to create its answers in response to queries supplied by users. However, the SCD the agent uses might reflect the subjective perspective of another user. Hence, answers may be considered faulty by an agent’s user, because the SCDs may not exactly match the perceptions of an agent’s user. A naive and very costly approach would be to ask each user to completely create all the SCD themselves. To use the existing knowledge, this paper presents ReFrESH, an approach for Relation-preserving Feedback-reliant Enhancement of SCDs by Humans. An agent’s user can give feedback about faulty answers to the agent. This feedback is then used by ReFrESH to update the SCDs incrementally. However, human feedback is not always unambiguous. Therefore, this paper additionally presents an approach to decide how to incorporate the feedback and when to update the SCDs. Altogether, SCDs can be updated with human feedback, allowing users to create even more specific SCDs for their needs.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 273-287
DPM: Clustering Sensitive Data through Separation
Clustering is an important tool for data exploration where the goal is to subdivide a data set into disjoint clusters that fit well into the underlying data structure. When dealing with sensitive data, privacy-preserving algorithms aim to approximate the non-private baseline while minimising the leakage of sensitive information. State-of-the-art privacy-preserving clustering algorithms tend to output clusters that are good in terms of the standard metrics, inertia, silhouette score, and clustering accuracy, however, the clustering result strongly deviates from the non-private KMeans baseline. In this work, we present a privacy-preserving clustering algorithm called DPM that recursively separates a data set into clusters based on a geometrical clustering approach. In addition, DPM estimates most of the data-dependent hyper-parameters in a privacy-preserving way. We prove that DPM preserves Differential Privacy and analyse the utility guarantees of DPM. Finally, we conduct an extensive empirical evaluation for synthetic and real-life data sets. We show that DPM achieves state-of-the-art utility on the standard clustering metrics and yields a clustering result much closer to that of the popular non-private KMeans algorithm without requiring the number of classes.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 273-287
Open AccessDPM: Clustering Sensitive Data through Separation
Clustering is an important tool for data exploration where the goal is to subdivide a data set into disjoint clusters that fit well into the underlying data structure. When dealing with sensitive data, privacy-preserving algorithms aim to approximate the non-private baseline while minimising the leakage of sensitive information. State-of-the-art privacy-preserving clustering algorithms tend to output clusters that are good in terms of the standard metrics, inertia, silhouette score, and clustering accuracy, however, the clustering result strongly deviates from the non-private KMeans baseline. In this work, we present a privacy-preserving clustering algorithm called DPM that recursively separates a data set into clusters based on a geometrical clustering approach. In addition, DPM estimates most of the data-dependent hyper-parameters in a privacy-preserving way. We prove that DPM preserves Differential Privacy and analyse the utility guarantees of DPM. Finally, we conduct an extensive empirical evaluation for synthetic and real-life data sets. We show that DPM achieves state-of-the-art utility on the standard clustering metrics and yields a clustering result much closer to that of the popular non-private KMeans algorithm without requiring the number of classes.
- 12 November 2024
- Published by Springer Nature
- p. 265-280
Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
- 12 November 2024
- Published by Springer Nature
- p. 265-280
Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs