arXiv (All)
open access
Learning Latent Algebraic Structure from Ambiguous Set Observations
We study structural recovery from an exact but adversarially corrupted set observation over $\mathbb F_2^n$. A hidden nonempty set $A$ satisfies $|A+A|\leq K|A|$, while the algorithm receives deterministic membership access and independent exact uniform samples only from a set $B$ satisfying $|A\tri
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Devilray: A Systematic Adversarial Model Revealing Blind Spots in Fake Base Station Detection#204728
- Discovering Latent Groups for Robust Classification#973231
- Analyzing Training-Free Corruption Detection for Object Detection Datasets#271957
- Original dataset#420125
- The TELLER Dataset#422527
Record · ID 1117533
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive