Cover Image

Lower Bounds on the Size of Markov Equivalence Classes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jahn, Erik, Eberhardt, Frederick, Schulman, Leonard J.
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Causal Discovery under Latent Class Confounding
by: Mazaheri, Bijan, et al.
Published: (2023)

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

Markov Equivalence and Consistency in Differentiable Structure Learning
by: Deng, Chang, et al.
Published: (2024)

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

On the Natural Gradient of the Evidence Lower Bound
by: Ay, Nihat, et al.
Published: (2023)

Optimal Lower Bounds for Online Multicalibration
by: Collina, Natalie, et al.
Published: (2026)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
by: Agrawal, Shubhada, et al.
Published: (2025)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
by: Jia, Zeyu, et al.
Published: (2025)

General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions
by: Li, Yicheng
Published: (2026)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Causal Identification in Time Series Models
by: Jahn, Erik, et al.
Published: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound
by: Pham, Phu-Hoa, et al.
Published: (2026)

Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
by: Srinivasan, Rishikesh, et al.
Published: (2025)

Sharp Structure-Agnostic Lower Bounds for General Linear Functional Estimation
by: Jin, Jikai, et al.
Published: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
by: Diakonikolas, Ilias, et al.
Published: (2024)

An Equivalence between Bayesian Priors and Penalties in Variational Inference
by: Wolinski, Pierre, et al.
Published: (2020)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
by: Diakonikolas, Ilias, et al.
Published: (2025)

Exploring the Complexity of Deep Neural Networks through Functional Equivalence
by: Shen, Guohao
Published: (2023)

Policy Testing in Markov Decision Processes
by: Ariu, Kaito, et al.
Published: (2025)

Efficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams
by: van Ommen, Thijs
Published: (2024)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
by: Diakonikolas, Ilias, et al.
Published: (2024)

Review and Prospect of Algebraic Research in Equivalent Framework between Statistical Mechanics and Machine Learning Theory
by: Watanabe, Sumio
Published: (2024)

Query Lower Bounds for Diffusion Sampling
by: Xun, Zhiyang, et al.
Published: (2026)

Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning
by: Cai, T. Tony, et al.
Published: (2023)

Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes
by: Grünewälder, Steffen, et al.
Published: (2024)

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

Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity
by: Banerjee, Imon, et al.
Published: (2022)

Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups
by: Kostic, Vladimir R., et al.
Published: (2024)

High-dimensional Inference and FDR Control for Simulated Markov Random Fields
by: Wei, Haoyu, et al.
Published: (2022)

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
by: Wang, He, et al.
Published: (2024)

Adaptive Mean Estimation in the Hidden Markov sub-Gaussian Mixture Model
by: Karagulyan, Vahe, et al.
Published: (2024)

Improved Algorithm and Bounds for Successive Projection
by: Jin, Jiashun, et al.
Published: (2024)

Feature Incremental Clustering with Generalization Bounds
by: Zhang, Jing, et al.
Published: (2026)

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
by: Narayanan, Shyam
Published: (2023)

Structured Matrix Learning under Arbitrary Entrywise Dependence and Estimation of Markov Transition Kernel
by: Chai, Jinhang, et al.
Published: (2024)

Adversarial Surrogate Risk Bounds for Binary Classification
by: Frank, Natalie S.
Published: (2025)

Bounding Neyman-Pearson Region with $f$-Divergences
by: Mullhaupt, Andrew, et al.
Published: (2025)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)