Skip to content

Monte-Carlo methods for some challenging parameter estimation problems: intractable normalizing constants and differential privacy

Oct 2026 · Purdue
Markov Chains and Monte Carlo Methods

Abstract

This dissertation studies two statistical problems: Bayesian inference for network models with intractable normalizing constants and differentially private learning with stochastic neural networks.The first project develops noisy Langevin Monte Carlo for exponential random graph models. Auxiliary network simulations estimate the posterior gradient without evaluating the likelihood normalizing constant. The analysis bounds posterior approximation error in second-order Wasserstein distance and the error of estimated posterior expectations. Under the stated curvature, moment, and step-size conditions, short inner Markov chains can suffice as network size increases when parameter dimension grows more slowly than the relevant posterior curvature scale. Simulations and real-network applications assess inferential accuracy and computational performance.The second project develops DP-StoNet, an output-perturbation method for private learning. A constrained latent-variable objective uses quadratic penalties centered at public parameters and feature maps. Parameters and latent variables are optimized without injected training noise; calibrated Gaussian noise is added to the final parameter update before projection. Under the specified assumptions, full-batch training admits Rényi and approximate differential-privacy guarantees, with sensitivity bounded uniformly over the number of iterations. Minibatch training admits approximate differential privacy with either a full-batch or minibatch final update. Nonasymptotic utility bounds account for optimization, sampling, and the single output perturbation. A Music Year experiment studies adaptation from a public model trained on corrupted inputs. In the reported run, DP-StoNet retains the reference model’s predictive accuracy with a small improvement and a lower final test error than the specified DP-SGD baseline under the same target privacy budget.

View source

Similar papers

#computer vision Conference Aug 2008

Scrum in a Multiproject Environment: An Ethnographically-Inspired Case Study on the Adoption Challenges

Agile methods continue to gain popularity. In particular, the Scrum method appears to be on the verge of becoming a de-facto standard in the industry, leading the so called Agile movement. While there are success stories and recommendations, there is little scientifically valid evidence of the challenges in the adoptio...

A. Marchenko, P. Abrahamsson · 59 citations · ⚡11
#computer vision Open access Sep 2012

Making the leap to a software platform strategy: Issues and challenges

A comprehensive taxonomy of the challenges faced when a medium-scale organization decided to adopt software platforms is provided, namely: business challenges, organizational challenges, technical challenges, and people challenges.

Yaser Ghanam, F. Maurer, P. Abrahamsson · 41 citations · ⚡3
#machine learning Open access Mar 2024

Integration of molecular coarse-grained model into geometric representation learning framework for protein-protein complex property prediction

MCGLPPI, a novel geometric representation learning framework that combines graph neural networks (GNNs) with the MARTINI molecular coarse-grained (CG) model to predict overall PPI properties accurately and efficiently, offers an effective and efficient solution for PPI overall property predictions.

Yang Yue, Shu Li, Yihua Cheng et al. · 15 citations

PepPCBench is a Comprehensive Benchmarking Framework for Protein-Peptide Complex Structure Prediction

PepPCBench enables a robust evaluation of PFNN-based methods and supports their continued development for peptide-protein structure prediction, and highlights the influence of peptide length, conformational flexibility, and training set similarity on prediction accuracy.

Si-Long Zhai, Huifeng Zhao, Ji-Ke Wang et al. · 13 citations · ⚡1
#data science Open access Oct 2026

Less can be more for predicting properties with large language models

Abstract Predicting properties from coordinate–category data—sets of vectors paired with categorical information—is fundamental to computational science, manifesting in materials science as predicting formation energies or elastic moduli from crystal structures. While large language models (LLMs) have increasingly been...

Nawaf Alampara, Santiago Miret, Kevin Maik Jablonka · 13 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.