ai-startup-skills
创业公司做 AI 产品的 7 步 Agent Skill 合集:验证 → BP → 政策 → 路演 → 获客 → 定价 → 注册。
Translation pending
Code for "Privacy-Utility Trade-offs for Parameter Estimation in Degree-Heterogeneous Higher-Order Networks" — local & central differentially private estimation in the r-uniform hypergraph β-model, wi
Translation pending
OtherJupyter Notebook · PythonGitHub @Sagnik-NandyOnlineOwner unconfirmed
Have you tried it? One tap is enough. No sign-in needed.
No updates detected yet. GitHub releases will appear here.
Owners of public repositories under a personal GitHub account can sign in to verify ownership and manage the introduction themselves. No administrator approval is needed.
Sign in, generate a verification file, and commit it to this repository’s default branch within 30 minutes. Files on other branches or forks do not count. Then check the file below to manage the project without administrator approval. Keep the file to retain your access.
If needed, you will go to sign-in. After signing in, return here and press your chosen verification button again.
Run /nomorevibe verify in your project folder to verify ownership and manage the introduction yourself.
Verify in one minuteAsk about other verification options
Code for "Privacy-Utility Trade-offs for Parameter Estimation in Degree-Heterogeneous Higher-Order Networks" — local & central differentially private estimation in the r-uniform hypergraph β-model, with synthetic experiments and a real-data (Enron) link-prediction study.
Translation pending
Taken from the repository README
Loading the full README. The saved excerpt is shown below.
Implementation and experiments for Mandal & Nandy, "Privacy-Utility Trade-offs for Parameter Estimation in Degree-Heterogeneous Higher-Order Networks": finite-sample minimax rates for differentially private parameter estimation in the r-uniform hypergraph β-model, under both local and central edge differential privacy.Read the full README ↗
Implementation and experiments for
Mandal & Nandy, "Privacy-Utility Trade-offs for Parameter Estimation in
Degree-Heterogeneous Higher-Order Networks":
finite-sample minimax rates for differentially private parameter estimation
in the r-uniform hypergraph β-model, under both local and central edge
differential privacy. A local-DP estimator (discrete Laplace noise on the
degree sequence) and a central-DP estimator (noisy gradient descent) are each
compared against non-private (MLE and ridge) baselines, on synthetic data
(Numerical experiments/) and a real communication network — the Enron email
hypergraph (Data analysis/) — matching the paper's own experiments.
| Folder | Contents |
|---|---|
Numerical experiments/ | Synthetic-data experiments: Slurm-launched parameter-recovery and link-prediction trials, aggregated into the paper's plots. |
Data analysis/ | The same estimators applied to the real Enron email hypergraph for link prediction. |
Each folder's README has the detailed layout, run order, and per-file breakdown.
pip install -r requirements.txt
| Package | Used for |
|---|---|
numpy, scipy | Core linear algebra; hypergraph log-likelihood/gradient computations, discrete Laplace and Gaussian noise mechanisms |
pandas | Loading/aggregating per-task result CSVs |
scikit-learn | Link-prediction metrics (ROC-AUC, F1, average precision, Brier score) |
matplotlib | Result plots |
jupyter | Running the aggregation and analysis notebooks |
tqdm, joblib | Progress bars and parallel replicate sweeps in the prototype notebook (Numerical experiments/vary_eps.ipynb) |
numba | Accelerates the 4-uniform hypergraph likelihood in Data analysis/codes/link_prediction_order4.ipynb |