Cover Image

Causal Discovery under Latent Class Confounding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mazaheri, Bijan, Gordon, Spencer, Rabani, Yuval, Schulman, Leonard
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Computational Complexity Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Learning and Planning in Separated Latent MDPs
by: Chen, Fan, et al.
Published: (2024)

Lower Bounds on the Size of Markov Equivalence Classes
by: Jahn, Erik, et al.
Published: (2025)

On Computationally Efficient Multi-Class Calibration
by: Gopalan, Parikshit, et al.
Published: (2024)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
by: Buhai, Rares-Darius, et al.
Published: (2024)

Learning High-dimensional Gaussians from Censored Data
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
by: Wein, Alexander S.
Published: (2025)

Improved Hardness Results for Learning Intersections of Halfspaces
by: Tiegel, Stefan
Published: (2024)

On the Hardness of Learning One Hidden Layer Neural Networks
by: Li, Shuchen, et al.
Published: (2024)

Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps
by: Kelner, Jonathan, et al.
Published: (2024)

The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
by: Tsirkas, Konstantinos, et al.
Published: (2026)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
by: Chen, Siyu, et al.
Published: (2025)

Low degree conjecture implies sharp computational thresholds in stochastic block model
by: Ding, Jingqiu, et al.
Published: (2025)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
by: Lou, Mengqi, et al.
Published: (2025)

Cryptographic Hardness of Score Estimation
by: Song, Min Jae
Published: (2024)

Efficient Pauli channel estimation with logarithmic quantum memory
by: Chen, Sitan, et al.
Published: (2023)

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
by: Luo, Yuetian, et al.
Published: (2023)

Derandomizing Multi-Distribution Learning
by: Larsen, Kasper Green, et al.
Published: (2024)

On Approximability of $\ell_2^2$ Min-Sum Clustering
by: S., Karthik C., et al.
Published: (2024)

Discovering Causal Relationships using Proxy Variables under Unmeasured Confounding
by: Wu, Yong, et al.
Published: (2025)

Detection of local geometry in random graphs: information-theoretic and computational limits
by: Bok, Jinho, et al.
Published: (2026)

Information-Theoretic Bounds and Task-Centric Learning Complexity for Real-World Dynamic Nonlinear Systems
by: Bulusu, Sri Satish Krishna Chaitanya, et al.
Published: (2025)

Tensor cumulants for statistical inference on invariant distributions
by: Kunisky, Dmitriy, et al.
Published: (2024)

Learning to erase quantum states: thermodynamic implications of quantum learning theory
by: Zhao, Haimeng, et al.
Published: (2025)

Masking Causality and Conditional Dependence
by: Yang, Zou, et al.
Published: (2026)

Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
by: Chakrabarty, Deeparnab, et al.
Published: (2025)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
by: Cohen, Gil, et al.
Published: (2025)

Diversity in Evolutionary Dynamics
by: Rabani, Yuval, et al.
Published: (2024)

Dependent Latent Class Models
by: Bowers, Jesse, et al.
Published: (2022)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
by: Tang, Runshi, et al.
Published: (2026)

Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors
by: Tang, Runshi, et al.
Published: (2026)

Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation
by: Bresler, Guy, et al.
Published: (2025)

Learning and Generating Mixed States Prepared by Shallow Channel Circuits
by: Hu, Fangjun, et al.
Published: (2026)

Approximate Computation via Le Cam Simulability
by: Akdemir, Deniz
Published: (2025)

Equivalence Set Restricted Latent Class Models (ESRLCM)
by: Bowers, Jesse, et al.
Published: (2024)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)

Computational lower bounds for multi-frequency group synchronization
by: Kireeva, Anastasia, et al.
Published: (2024)

Estimating Aleatoric Uncertainty in the Causal Treatment Effect
by: Xu, Liyuan, et al.
Published: (2026)

Local Learning for Covariate Selection in Nonparametric Causal Effect Estimation with Latent Variables
by: Li, Zheng, et al.
Published: (2024)

Meta-Dependence in Conditional Independence Testing
by: Mazaheri, Bijan, et al.
Published: (2025)

Learning from Equivalence Queries, Revisited
by: Braverman, Mark, et al.
Published: (2026)