Research map / Learning theory and algorithms / Sample complexity
Relational Marginal Problems: Theory and Estimation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use direct estimation instead of expansion when the marginal vector meets the stated interior condition | Relational marginal estimation, Model A · Relational marginal estimation | expected absolute error upper bound: 1-\left(\frac{m-k+1}{m}\right)^{k-1} + \sqrt{\frac{1+2\log 2}{4\lfloor m/k \rfloor}} -> \sqrt{(1+2\log 2)/(4\lfloor m/k | Helped |
| Use direct estimation instead of expansion when the marginal vector meets the stated interior condition | Relational marginal estimation, Model B · Relational marginal estimation | expected absolute error upper bound: 1-\left(\frac{m-k+1}{m}\right)^{k-1} + \sqrt{\frac{1+2\log 2}{4\lfloor m/k \rfloor}} -> \sqrt{(1+2\log 2)/(4\lfloor m/k | Helped |
Closest papers by meaning
- Fast and Flexible Inference of Joint Distributions from their Marginals (ICML 2019 · similarity 0.85)
- On Learning Causal Models from Relational Data (AAAI 2016 · similarity 0.85)
- Generative Marginalization Models (ICML 2024 · similarity 0.85)
- Relational Learning with Variational Bayes (ICLR 2022 · similarity 0.85)
- Incorporating Information into Shapley Values: Reweighting via a Maximum Entropy Approach (ICML 2024 · similarity 0.84)
- Relational Learning in Pre-Trained Models: A Theory from Hypergraph Recovery Perspective (ICML 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.