Copertina

Lifted Causal Inference in Relational Domains

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Luttermann, Malte, Hartwig, Mattis, Braun, Tanya, Möller, Ralf, Gehrke, Marcel
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Artificial Intelligence Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximate Lifted Model Construction
di: Luttermann, Malte, et al.
Pubblicazione: (2025)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
di: Luttermann, Malte, et al.
Pubblicazione: (2026)

Efficient Detection of Exchangeable Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Efficient Detection of Commutative Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Towards Privacy-Preserving Relational Data Synthesis via Probabilistic Relational Models
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Lifting Factor Graphs with Some Unknown Factors
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Lifting Factor Graphs with Some Unknown Factors for New Individuals
di: Luttermann, Malte, et al.
Pubblicazione: (2025)

Compression versus Accuracy: A Hierarchy of Lifted Models
di: Speller, Jan, et al.
Pubblicazione: (2025)

Lifted Model Construction without Normalisation: A Vectorised Approach to Exploit Symmetries in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
di: Wienöbst, Marcel, et al.
Pubblicazione: (2025)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
di: Gupta, Aaryan, et al.
Pubblicazione: (2023)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
di: Shimoda, Takumi, et al.
Pubblicazione: (2024)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
di: Wienöbst, Marcel, et al.
Pubblicazione: (2022)

Masked Matrix Multiplication for Emergent Sparsity
di: Wheatman, Brian, et al.
Pubblicazione: (2024)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
di: Chaudhary, Juhi, et al.
Pubblicazione: (2024)

Stochastic Multi-round Submodular Optimization with Budget
di: Auletta, Vincenzo, et al.
Pubblicazione: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
di: la Tour, Max Dupré, et al.
Pubblicazione: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
di: Luo, Chunyu, et al.
Pubblicazione: (2024)

An Invertible State Space for Process Trees
di: Kolhof, Gero, et al.
Pubblicazione: (2024)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
di: Pham, Canh V.
Pubblicazione: (2024)

Approximating Optimal Labelings for Temporal Connectivity
di: Carnevale, Daniele, et al.
Pubblicazione: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
di: Almansoori, Mahmood K. M., et al.
Pubblicazione: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
di: Ganian, Robert, et al.
Pubblicazione: (2025)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
di: Liu, Ruipeng, et al.
Pubblicazione: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
di: Wang, Long, et al.
Pubblicazione: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
di: Mitzenmacher, Michael, et al.
Pubblicazione: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
di: Han, Yue, et al.
Pubblicazione: (2025)

Adaptive Multi-Round Allocation with Stochastic Arrivals
di: Pan, Yuqi, et al.
Pubblicazione: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
di: Dey, Palash, et al.
Pubblicazione: (2023)

Online Allocation with Unknown Shared Supply
di: Neoh, Tzeh Yuan, et al.
Pubblicazione: (2026)

A Survey on the Densest Subgraph Problem and Its Variants
di: Lanciano, Tommaso, et al.
Pubblicazione: (2023)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
di: Panda, Atasi, et al.
Pubblicazione: (2022)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
di: Ganian, Robert, et al.
Pubblicazione: (2026)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
di: Nakamura, Kengo, et al.
Pubblicazione: (2026)

Nearly Optimal Attention Coresets
di: Liberty, Edo, et al.
Pubblicazione: (2026)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Instance Dependent Testing of Samplers using Interval Conditioning
di: Bhattacharyya, Rishiraj, et al.
Pubblicazione: (2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
di: Ihalainen, Hannes, et al.
Pubblicazione: (2025)