arXiv (All)
open access
BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height
Finding heavy nodes in a tree---those whose counts exceed a given threshold---is a building block for analysis and learning over structured data. Achieving record-level differential privacy (DP) without sacrificing accuracy is challenging because each record contributes to counts along an entire roo
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
- BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height#1227248
- Local Node Differential Privacy#1186420
- Differentially-Private Decision Trees and Provable Robustness to Data Poisoning#1105885
- FairLint-DL: An IDE-Native Tool for Fairness Debugging of Deep Learning Software#1110686
- FairLint-DL: An IDE-Native Tool for Fairness Debugging of Deep Learning Software#919474
Record · ID 1234442
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