Cover Image

Identification for Tree-shaped Structural Causal Models in Polynomial Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gupta, Aaryan, Bläser, Markus
Format:	Preprint
Published:	2023
Subjects:	Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Lifted Causal Inference in Relational Domains
by: Luttermann, Malte, et al.
Published: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
by: Ehimwenma, Kennedy E., et al.
Published: (2025)

Learning Linear Attention in Polynomial Time
by: Yau, Morris, et al.
Published: (2024)

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

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

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

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

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

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

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

The Model Counting Competitions 2021-2023
by: Fichte, Johannes K., et al.
Published: (2025)

The Model Counting Competition 2020
by: Fichte, Johannes K., et al.
Published: (2020)

Anytime-Constrained Equilibria in Polynomial Time
by: McMahan, Jeremy
Published: (2024)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
by: Abeywickrama, Tenindra, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Nearly Optimal Attention Coresets
by: Liberty, Edo, et al.
Published: (2026)

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

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

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

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

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