<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://spliew.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://spliew.github.io/" rel="alternate" type="text/html" /><updated>2026-05-04T04:03:38+02:00</updated><id>https://spliew.github.io/feed.xml</id><title type="html">Seng Pei Liew</title><subtitle>machine learning, physics</subtitle><author><name>Seng Pei Liew</name></author><entry><title type="html">ICLR 2025 ML papers</title><link href="https://spliew.github.io/posts/2025/02/iclr2025/" rel="alternate" type="text/html" title="ICLR 2025 ML papers" /><published>2025-02-18T00:00:00+01:00</published><updated>2025-02-18T00:00:00+01:00</updated><id>https://spliew.github.io/posts/2025/02/blog-post-11</id><content type="html" xml:base="https://spliew.github.io/posts/2025/02/iclr2025/"><![CDATA[<p>I am curating (mainly) ICLR ‘25 submitted papers related to hyperparameter tuning of large-scale training.</p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://openreview.net/forum?id=WYL4eFLcxG">Scaling Optimal LR Across Token Horizons</a></td>
      <td>${\rm LR} \propto N^{-0.23}T^{-0.32}$ (fixed batch size)</td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=JCiF03qnmi">How Does Critical Batch Size Scale in Pre-training?</a></td>
      <td>${\rm crit. BS} \propto T$ (fixed LR)</td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=MLhquJb1qN">Time Transfer: On Optimal Learning Rate and Batch Size In The Infinite Data Limit</a></td>
      <td>Relations of BS, LR, and $T$ are complicated</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2405.13698">How to set AdamW’s weight decay as you scale model and dataset size</a></td>
      <td>the “timescale” 1/(LR * WD) should be constant</td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Machine Learning" /><category term="Large Language Models" /><summary type="html"><![CDATA[I am curating (mainly) ICLR ‘25 submitted papers related to hyperparameter tuning of large-scale training.]]></summary></entry><entry><title type="html">ICLR 2023 privacy/FL papers</title><link href="https://spliew.github.io/posts/2023/04/iclr2023/" rel="alternate" type="text/html" title="ICLR 2023 privacy/FL papers" /><published>2023-04-07T00:00:00+02:00</published><updated>2023-04-07T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2023/04/blog-post-10</id><content type="html" xml:base="https://spliew.github.io/posts/2023/04/iclr2023/"><![CDATA[<p>I have curated and am beginning to read ICLR ‘23 papers related to privacy and federated learning.  The list will be constantly updated with the paper summaries. Stay tuned!</p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://openreview.net/forum?id=oJpVVGXu9i">Share Your Representation Only: Guaranteed Improvement of the Privacy-Utility Tradeoff in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Xo2E217_M4n">FLIP: A Provable Defense Framework for Backdoor Mitigation in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=fWWFv--P0xP">On the Importance and Applicability of Pre-Training for Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=29V3AWjVAFi">The Best of Both Worlds: Accurate Global and Personalized Models through Federated Learning with Data-Free Hyper-Knowledge Distillation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=V7CYzdruWdm">Bias Propagation in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=38m4h8HcNRL">Federated Neural Bandits</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=r0BrY4BiEXO">Decepticons: Corrupted Transformers Breach Privacy in Federated Learning for Language Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=A9WQaxYsfx">Panning for Gold in Federated Learning: Targeted Text Extraction under Arbitrarily Large-Scale Aggregation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=IPrzNbddXV">FedExP: Speeding Up Federated Averaging via Extrapolation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=FUiDMCr_W4o">A Statistical Framework for Personalized Federated Learning and Estimation: Theory, Algorithms, and Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=hDDV1lsRV8">Federated Learning from Small Datasets</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=QsCSLPP55Ku">Effective passive membership inference attacks in federated learning against overparameterized models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=nAgdXgfmqj">Hyperparameter Optimization through Neural Network Partitioning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=ytZIYmztET">EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Kf7Yyf4O0u">CANIFE: Crafting Canaries for Empirical Privacy Measurement in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=dZrQR7OR11">Federated Learning as Variational Inference: A Scalable Expectation Propagation Approach</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=VzwfoFyYDga">Machine Unlearning of Federated Clusters</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=R1U5G2spbLd">Federated Nearest Neighbor Machine Translation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=ElC6LYO4MfD">Faster federated optimization under second-order similarity</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=hxEIgUXLFF">PerFedMask: Personalized Federated Learning with Optimized Masking Vectors</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Mpa3tRJFBb">Where to Begin? On the Impact of Pre-Training and Initialization in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=U9yFP90jU0">FedFA:  Federated Feature Augmentation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=2L9gzS80tA4">Does Learning from Decentralized Non-IID Unlabeled Data Benefit from Self Supervision?</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=-EHqoysUYLx">Generalization Bounds for Federated Learning: Fast Rates, Unparticipating Clients and Unbounded Losses</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=mMNimwRb7Gr">Turning the Curse of Heterogeneity in Federated Learning into a Blessing for Out-of-Distribution Detection</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=cRxYWKiTan">Better Generative Replay for Continual Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=jh1nCir1R3d">SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=SXZr8aDKia">Personalized Federated Learning with Feature Alignment and Classifier Collaboration</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=6P9Y25Pljl6">FedDAR: Federated Domain-Aware Representation Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=EXnIyMVTL8s">Towards Understanding and Mitigating Dimensional Collapse in Heterogeneous Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=bZjxxYURKT">FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=FIrQfNSOoTr">Instance-wise Batch Label Restoration via Gradients in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=pf8RIZTMU58">DepthFL : Depthwise Federated Learning for Heterogeneous Clients</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Hnk1WRMAYqg">Multimodal Federated Learning via Contrastive Representation Ensemble</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=9aokcgBVIj1">FiT: Parameter Efficient Few-shot Transfer Learning for Personalized and Federated Image Classification</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=TVY6GoURrw">Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=k1FHgri5y3-">Sparse Random Networks for Communication-Efficient Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=_hb4vM3jspB">Data-Free One-Shot Federated Learning Under Very High Statistical Heterogeneity</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=3RhuF8foyPW">Single-shot General Hyper-parameter Optimization for Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=3aBuJEza5sq">Test-Time Robust Personalization for Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=rzrqh85f4Sc">Towards Addressing Label Skews in One-Shot Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=2QGJXyMNoPz">MocoSFL: enabling cross-client collaborative self-supervised learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=JmC_Tld3v-f">Individual Privacy Accounting with Gaussian Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=h9O0wsmL-cT">Regression with Label Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Q120_4COf-K">Synthetic Data Generation of Many-to-Many Datasets via Random Graph Generation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=j1zQGmQQOX1">Differentially Private Adaptive Optimization with Delayed Preconditioners</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=oze0clVGPeX">Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=hxUwnEGxW87">Statistical Theory of Differentially Private Marginal-based Data Synthesis Algorithms</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=cw8FeirkIfU">Distributed Differential Privacy in Multi-Armed Bandits</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=3UHoYrglYkG">Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=fhcu4FBLciL">Efficient Model Updates for Approximate Unlearning of Graph-Structured Data</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=BGF9IeDfmlH">Learning to Linearize Deep Neural Networks  for Secure and Efficient Private Inference</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=CWmvjOEhgH-">MPCFORMER: FAST, PERFORMANT AND PRIVATE TRANSFORMER INFERENCE WITH MPC</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=qLOaeRvteqbx">Disparate Impact in Differential Privacy from Gradient Misalignment</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=rSUCajhLsQ">Easy Differentially Private Linear Regression</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=3nM5uhPlfv6">Stochastic Differentially Private and Fair Learning</a></td>
      <td> </td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><category term="Federated Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read ICLR ‘23 papers related to privacy and federated learning. The list will be constantly updated with the paper summaries. Stay tuned!]]></summary></entry><entry><title type="html">ICML 2022 privacy papers</title><link href="https://spliew.github.io/posts/2022/07/icml2022/" rel="alternate" type="text/html" title="ICML 2022 privacy papers" /><published>2022-07-26T00:00:00+02:00</published><updated>2022-07-26T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2022/07/blog-post-9</id><content type="html" xml:base="https://spliew.github.io/posts/2022/07/icml2022/"><![CDATA[<p>I have curated and am beginning to read ICML ‘22 papers related to privacy and federated learning.  The list will be constantly updated with the paper summaries. Stay tuned!</p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://arxiv.org/abs/2206.08829">FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2110.05429">Differentially Private Approximate Quantiles</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2201.12333">A Joint Exponential Mechanism For Differentially Private Top-k</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://proceedings.mlr.press/v162/kohen22a/kohen22a.pdf">Transfer Learning In Differential Privacy’s Hybrid-Model</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2201.12383">Bounding Training Data Reconstruction in Private (Deep) Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://proceedings.mlr.press/v162/tsfadia22a/tsfadia22a.pdf">FriendlyCore: Practical Differentially Private Aggregation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://proceedings.mlr.press/v162/amid22a/amid22a.pdf">Public Data-Assisted Mirror Descent for Private Model Training</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2109.11429">Robin Hood and Matthew Effects: Differential Privacy Has Disparate Impact on Synthetic Data</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2202.02340">Selective Network Linearization for Efficient Private Inference</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/pdf?id=P0AeY-efPEx">Shuffle Private Linear Contextual Bandits</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://arxiv.org/abs/2205.02466">Optimal Algorithms for Mean Estimation under Local Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://icml.cc/media/icml-2022/Slides/16590_uyf9q9u.pdf">Task-aware Privacy Preservation for Multi-dimensional Data</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://arxiv.org/abs/2110.11688">Differentially Private Coordinate Descent for Composite Empirical Risk Minimization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2206.08111">Private Streaming SCO in l_p geometry with Applications in High Dimensional Online Decision Making</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://icml.cc/media/icml-2022/Slides/17982_7yhQyrM.pdf">Private optimization in the interpolation regime: faster rates and hardness results</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2202.05963">Private Adaptive Optimization with Side information</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2203.03761">The Fundamental Price of Secure Aggregation in Differentially Private Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://proceedings.mlr.press/v162/ghazi22a/ghazi22a.pdf">Faster Privacy Accounting via Evolving Discretization</a></td>
      <td>Improved <a href="https://arxiv.org/abs/2106.02848">numerical accountant</a></td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2207.09916">The Poisson Binomial Mechanism for Unbiased Federated Learning with Secure Aggregation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2203.00194">Private frequency estimation via projective geometry</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2202.06539">Deduplicating Training Data Mitigates Privacy Risks in Language Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2106.05042">Hermite Polynomial Features for Private Data Generation</a></td>
      <td>use hermite poly feature instead of random fourier feature for mmd-like generative modeling</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2106.13673">Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://icml.cc/media/icml-2022/Slides/16779.pdf">Differentially Private Community Detection for Stochastic Block Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2202.01292">Improved Regret for Differentially Private Exploration in Linear MDP</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2206.10685">Differentially Private Maximal Information Coefficients</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2206.00240?context=cs.LG">Privacy for Free: How does Dataset Condensation Help Privacy?</a></td>
      <td>see <a href="https://twitter.com/vitalyFM/status/1549599469695512576?cxt=HHwWgMCt9b2gpIErAAAA">this thread</a></td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2106.01336">Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2110.11876">Tight and Robust Private Mean Estimation with Few Users</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://aisecure-workshop.github.io/aml-iclr2021/papers/21.pdf">Personalization Improves Privacy-Accuracy Tradeoffs in Federated Learning</a></td>
      <td> </td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><category term="Federated Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read ICML ‘22 papers related to privacy and federated learning. The list will be constantly updated with the paper summaries. Stay tuned!]]></summary></entry><entry><title type="html">Awesome list of DP resources</title><link href="https://spliew.github.io/posts/2021/12/awesome/" rel="alternate" type="text/html" title="Awesome list of DP resources" /><published>2021-12-18T00:00:00+01:00</published><updated>2021-12-18T00:00:00+01:00</updated><id>https://spliew.github.io/posts/2021/12/blog-post-8</id><content type="html" xml:base="https://spliew.github.io/posts/2021/12/awesome/"><![CDATA[<p>I am curating a list of resources for learning subjects related to differential privacy, federated learning and machine learning (subject to my preferences).</p>

<p>This list will be updated constantly.
Stay tuned!</p>

<h2 id="blogs-articles">Blogs, articles</h2>
<ul>
  <li><a href="https://differentialprivacy.org/">Differential Privacy Org</a>: Blogs on conference digests are helpful at getting some taste of recent research trends.</li>
  <li><a href="https://ypei.me/posts/2019-03-13-a-tail-of-two-densities.html">A Tail of Two Densities</a>: Covers differential privacy in a concise, mathematical and clean way. Part 2 is <a href="https://ypei.me/posts/2019-03-14-great-but-manageable-expectations.html">here</a>.</li>
  <li><a href="https://desfontain.es/privacy/index.html">Ted is writing things</a></li>
  <li><a href="https://cstheory-feed.org/">Theory of Computing Blog Aggregator</a></li>
</ul>

<h2 id="videos">Videos</h2>
<ul>
  <li><a href="https://www.youtube.com/channel/UCpAXM9I-v76xEPtevcCuA5g">Flow seminar on youtube</a></li>
  <li><a href="https://www.youtube.com/watch?v=XsESo6XTkrA&amp;list=PLSIUOFhnxEiDoTNvhZWIm1PNBAFJWUxU8">DP for ML on youtube by google techtalks</a></li>
  <li><a href="https://www.youtube.com/channel/UCApm3MYvm6OWSsmKhAymiWA">Boston-area Data Privacy Seminars</a></li>
</ul>

<h2 id="conferences-with-videos">Conferences (with videos)</h2>
<ul>
  <li><a href="https://aaai-ppai22.github.io/">The Third AAAI Workshop on Privacy-Preserving Artificial Intelligence (PPAI-22)</a></li>
  <li><a href="https://www.youtube.com/playlist?list=PLSIUOFhnxEiD9uihG5t9ABdPhSVqQ3HWA">2021 Google Federated Learning and Analytics Workshop</a></li>
</ul>

<h2 id="lectures-tutorials">Lectures, tutorials</h2>
<ul>
  <li><a href="http://www.gautamkamath.com/CS860-fa2020.html">Algorithms for Private Data Analysis</a>: by Gautam Kamath. Covers various topics and video lectures can be found on Youtube.</li>
  <li><a href="https://dpcourse.github.io/index.html"> Privacy in Statistics and Machine Learning</a>: by Adam Smith and  Jonathan Ullman.</li>
</ul>

<h2 id="other-awesome-lists">Other awesome lists</h2>
<ul>
  <li><a href="https://trustworthy-machine-learning.github.io/">A School for all Seasons on Trustworthy Machine Learning</a>: a more comprehensive list than this one covering many aspects of trustworthy ML</li>
  <li><a href="https://github.com/chaoyanghe/Awesome-Federated-Learning">Awesome-Federated-Learning</a></li>
  <li><a href="https://github.com/jjbrophy47/machine_unlearning">Machine Unlearning Papers</a></li>
</ul>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><category term="Federated Learning" /><summary type="html"><![CDATA[I am curating a list of resources for learning subjects related to differential privacy, federated learning and machine learning (subject to my preferences).]]></summary></entry><entry><title type="html">Privacy papers in ICML 2021</title><link href="https://spliew.github.io/posts/2021/06/privacy-icml21/" rel="alternate" type="text/html" title="Privacy papers in ICML 2021" /><published>2021-06-06T00:00:00+02:00</published><updated>2021-06-06T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2021/06/blog-post-7</id><content type="html" xml:base="https://spliew.github.io/posts/2021/06/privacy-icml21/"><![CDATA[<p>I have curated and am beginning to read ICML ‘21 papers related to privacy and federated learning.  The list will be constantly updated with the paper summaries. Stay tuned!<br />
<em>Note that I wrote a simple script to scrape the links to the paper and the links may not be accurate.</em></p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.08244">Differentially Private Quantiles</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2003.14053">Gradient Disaggregation: Breaking Privacy in Federated Learning by Reconstructing the User Participant Matrix</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2106.09352">Large Scale Private Learning via Low-rank Reparametrization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2105.13287">Differentially Private Densest Subgraph Detection</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2002.12321">PAPRIKA: Private Online False Discovery Rate Control</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2105.05001">FL-NTK: A Neural Tangent Kernel-based Framework for Federated Learning Analysis </a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.04628">Personalized Federated Learning using Hypernetworks</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2011.08474">Federated Composite Optimization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.07078">Exploiting Shared Representations for Personalized Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2105.08233">Oneshot Differentially Private Top-k Selection</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://arxiv.org/abs/2105.10056">Data-Free Knowledge Distillation for Heterogeneous Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.03513">Privacy-Preserving Video Classification with Convolutional Neural Networks</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2003.03196">Federated Continual Learning with Weighted Inter-client Transfer</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.04635">Federated  Deep AUC Maximization for Hetergeneous Data with a Constant Communication Complexity</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.03198">Bias-Variance Reduced Local SGD for Less Heterogeneous Federated  Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.06641">Differentially Private Query Release Through Adaptive Projection</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2009.02668">A Framework for Private Matrix Analysis in Sliding Window Model</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2104.08776">Federated Learning of User Verification Models Without Sharing Embeddings</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2001.03618">Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2104.09734">Locally Private k-Means in One Round</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>[Differentially-Private Clustering of Easy Instances]</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Sliced Wasserstein Distance</td>
      <td>privatize sliced W. distance by utilizing random projection techniques plus gaussian noises. Applied to domain adaptation and gen. models. Showed that generating faces is feasible</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2105.05883">Clustered Sampling: Low-Variance and Improved Representativity for Clients Selection in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2012.04221">Ditto: Fair and Robust Federated Learning Through Personalization</a></td>
      <td>simple regularization between the global and local terms</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.08885">Differentially Private Correlation Clustering</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2106.00038">HEMET: A Homomorphic-Encryption-Friendly Privacy-Preserving Mobile Neural Network Architecture</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2105.00233">Private Alternating Least Squares: (Nearly) Optimal Privacy/Utility Trade-off for Matrix Completion</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.12099">Lossless Compression of Efficient Private Local Randomizers</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2011.00467">Differentially Private Bayesian Inference for  Generalized Linear Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.00697">Heterogeneity for the Win: One-Shot Federated Clustering</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.01516">Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.00039">Practical and Private (Deep) Learning without Sampling or Shuffling</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.01396">DeepReDuce:  ReLU Reduction for Fast Private Inference</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.03517">Privacy-Preserving Feature Selection with Secure Multiparty Computation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.06387">The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://ppml-workshop.github.io/ppml20/pdfs/Nori_et_al.pdf">Accuracy, Interpretability, and Differential Privacy via Explainable Boosting</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/1909.12488">Debiasing Model Updates for Improving Personalized Federated Training</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.08598">Leveraging Public Data for Practical Private Query Release</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2103.03228">One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2102.11976">Learner-Private Online Convex Optimization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2007.03767">CRFL: Certifiably Robust Federated Learning against Backdoor Attacks</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/1912.04977">Federated Learning under Arbitrary Communication Patterns</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2106.13756">Private Adaptive Gradient Methods for Convex Optimization</a></td>
      <td> </td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><category term="Federated Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read ICML ‘21 papers related to privacy and federated learning. The list will be constantly updated with the paper summaries. Stay tuned! Note that I wrote a simple script to scrape the links to the paper and the links may not be accurate.]]></summary></entry><entry><title type="html">Privacy papers in ICLR 2021</title><link href="https://spliew.github.io/posts/2021/05/privacy-iclr21/" rel="alternate" type="text/html" title="Privacy papers in ICLR 2021" /><published>2021-05-07T00:00:00+02:00</published><updated>2021-05-07T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2021/05/blog-post-6</id><content type="html" xml:base="https://spliew.github.io/posts/2021/05/privacy-iclr21/"><![CDATA[<p>I have curated and am beginning to read ICLR ‘21 papers related to privacy and federated learning.  The list will be constantly updated with the paper summaries. Stay tuned!<br />
<em>Note that I wrote a simple script to scrape the links to the paper and the links may not be accurate.</em></p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://openreview.net/forum?id=GFsU8a0sGB">Federated Learning via Posterior Averaging: A New Perspective and Practical Algorithms</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=LkFG3lB13U5">Adaptive Federated Optimization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=dyaIRud1zXg">Information Laundering for Model Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=jDdzh5ul-d">Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=B7v4QMR6Z9w">Federated Learning Based on Dynamic Regularization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=h2EbJ4_wMVq">CaPC Learning: Confidential and Private Collaborative Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=ce6CFXBh30h">Federated Semi-Supervised Learning with Inter-Client Consistency &amp; Disjoint Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=7aogOj_VYO0">Do not Let Privacy Overbill Utility:  Gradient Embedding Perturbation for Private Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=6YEQUn0QICG">FedBN: Federated Learning on Non-IID Features via Local Batch Normalization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=y06VOYLcQXa">Private Image Reconstruction from System Side Channels Using Generative Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=dgtpE6gKjHn">FedBE: Making Bayesian Model Ensemble Applicable to Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=YTWGvpFOQD-">Differentially Private Learning Needs Better Features (or Much More Data)</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=Ogga20D2HO-">FedMix: Approximation of Mixup under Mean Augmented Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=TNkPBBYFkXg">HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=RSU17UoKfJF">R-GAP: Recursive Gradient Attack on Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=6isfR3JCbi">Private Post-GAN Boosting</a></td>
      <td>Re-weight using MWEM the sequence of learned generators and discriminators to increase performance after training.</td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=7dpmlkBuJFC">Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identification</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://openreview.net/forum?id=ehJqJQk9cw">Personalized Federated Learning with First Order Model Optimization</a></td>
      <td>no global model. personalize via interaction with other clients.</td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><category term="Federated Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read ICLR ‘21 papers related to privacy and federated learning. The list will be constantly updated with the paper summaries. Stay tuned! Note that I wrote a simple script to scrape the links to the paper and the links may not be accurate.]]></summary></entry><entry><title type="html">Privacy papers in AISTATS 2021</title><link href="https://spliew.github.io/posts/2021/04/privacy-aistats21/" rel="alternate" type="text/html" title="Privacy papers in AISTATS 2021" /><published>2021-04-03T00:00:00+02:00</published><updated>2021-04-03T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2021/04/blog-post-5</id><content type="html" xml:base="https://spliew.github.io/posts/2021/04/privacy-aistats21/"><![CDATA[<p>I have curated and am beginning to read AISTATS ‘21 <a href="http://aistats.org/aistats2021/accepted.html">papers</a> related to privacy.  The list will be constantly updated with the paper summaries. Stay tuned!<br />
<em>Note that I wrote a simple script to scrape the ArXiv links to the paper and the links may not be accurate.</em></p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://arxiv.org/abs/2011.03186">Revisiting Model-Agnostic Private Learning: Faster Rates and Active Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2010.08688">Differentially Private Analysis on Graph Streams</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2010.12816">Differentially Private Online Submodular Maximization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://proceedings.mlr.press/v130/lin21b/lin21b.pdf">On the Privacy Properties of GAN-generated Samples</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2011.14580">Robust and Private Learning of Halfspaces</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2002.11603">DP-MERF: Differentially Private Mean Embeddings with RandomFeatures for Practical Privacy-preserving Data Generation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://proceedings.mlr.press/v130/yang21c/yang21c.pdf">Stability and Differential Privacy of Stochastic Gradient Descent for Pairwise Learning with Non-Smooth Loss</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://web.mit.edu/dubeya/www/files/dp_gp_20.pdf">No-Regret Algorithms for Private Gaussian Process Bandit Optimization</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://arxiv.org/abs/2102.11158">Federated f-Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/1905.12774">Quantifying the Privacy Risks of Learning High-Dimensional Graphical Models</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/1909.09836">Optimal query complexity for private sequential learning against eavesdropping</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2010.13048">Differentially Private Weighted Sampling</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2008.07180">Shuffled Model of Differential Privacy in Federated Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2007.01181">Private optimization without constraint violations</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.06783">Evading the Curse of Dimensionality in Unconstrained Private GLMs</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/1912.04228">Location Trace Privacy Under Conditional Priors</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://proceedings.mlr.press/v130/sadeghi21a/sadeghi21a.pdf">Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.07134">Tight Differential Privacy for Discrete-Valued Mechanisms and for the Subsampled Gaussian Mechanism Using FFT</a></td>
      <td> </td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read AISTATS ‘21 papers related to privacy. The list will be constantly updated with the paper summaries. Stay tuned! Note that I wrote a simple script to scrape the ArXiv links to the paper and the links may not be accurate.]]></summary></entry><entry><title type="html">Privacy papers in NeurIPS 2020</title><link href="https://spliew.github.io/posts/2020/10/privacy-neurips20/" rel="alternate" type="text/html" title="Privacy papers in NeurIPS 2020" /><published>2020-10-12T00:00:00+02:00</published><updated>2020-10-12T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2020/10/blog-post-4</id><content type="html" xml:base="https://spliew.github.io/posts/2020/10/privacy-neurips20/"><![CDATA[<p>I have curated and am beginning to read NeurIPS ‘20 <a href="https://nips.cc/Conferences/2020/AcceptedPapersInitial">papers</a> related to privacy.  The list will be constantly updated with the paper summaries. Stay tuned!<br />
<em>Note that I wrote a simple script to scrape the ArXiv links to the paper and the links may not be accurate.</em></p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.06618">A Simple and Practical Algorithm for Private Multivariate Mean and Covariance Estimation</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2004.00010">The Discrete Gaussian for Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/1905.11947">Private Identity Testing for High-Dimensional Distributions</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://web.mit.edu/dubeya/www/files/dp_linucb_20.pdf">Differentially-Private Federated Contextual Bandits</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>Permute-and-Flip: A new mechanism for differentially-private selection</td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.07709">Auditing Differentially Private Machine Learning: How Private is Private SGD?</a></td>
      <td>Introduce a method to measure the emperically achievable value of epsilon. Also introduce an algorithm of poisoning that is effective against SGD clipping</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.04219">AutoPrivacy: Automated Layer-wise Parameter Selection for Secure Neural Network Inference</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2004.05975">Adversarially Robust Streaming Algorithms via Differential Privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.00701">Locally Differentially Private (Contextual) Bandits Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2005.12601">Locally private non-asymptotic testing of discrete distributions is faster using interactive mechanisms</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.01980">On the Equivalence between Online and Private Learnability beyond Binary Classification</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>A Scalable Approach for Privacy-Preserving Collaborative Machine Learning</td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2004.07839">Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/1902.03468.pdf">Synthetic Data Generators – Sequential and Private</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>Smoothly Bounding User Contributions in Differential Privacy</td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2008.00331">Learning from Mixtures of Private and Public Populations</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.10129">Smoothed Analysis of Online and Differentially Private Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2007.06605">Privacy Amplification via Random Check-Ins</a></td>
      <td>Try to solve the problem of determining the population size when using central DP in FL</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/1508.06110">The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.15429">Understanding Gradient Clipping in Private SGD: A Geometric Perspective</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2008.08007">Differentially Private Clustering: Tight Approximation Ratios</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="http://arxiv.org/abs/2007.05665">A Computational Separation between Private Learning and Online Learning</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2005.10630">Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>Improving Sparse Vector Technique with Renyi Differential Privacy</td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2007.11707">Breaking the Communication-Privacy-Accuracy Trilemma</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2003.14053">Inverting Gradients - How easy is it to break privacy in federated learning?</a></td>
      <td>Show that FL without DP is vulnerable to reconstruction attack, at least in Computer Vision</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.08265">GS-WGAN: A Gradient-Sanitized Approach for Learning Differentially Private Generators</a></td>
      <td>sanitize selectively (only the generator) and bounding sensitivity with wasserstein distance instead of clipping.</td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/pdf/2002.08774">Optimal Private Median Estimation under Minimal Distributional Assumptions</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.08598">Towards practical differentially private causal graph discovery</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2007.13660">Learning discrete distributions: user vs item-level privacy</a></td>
      <td> </td>
    </tr>
    <tr>
      <td>Faster Differentially Private Samplers via Rényi Divergence Analysis of Discretized Langevin MCMC</td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2006.08733">CryptoNAS: Private Inference on a ReLU Budget</a></td>
      <td> </td>
    </tr>
    <tr>
      <td><a href="https://arxiv.org/abs/2012.12803">A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling</a></td>
      <td> </td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read NeurIPS ‘20 papers related to privacy. The list will be constantly updated with the paper summaries. Stay tuned! Note that I wrote a simple script to scrape the ArXiv links to the paper and the links may not be accurate.]]></summary></entry><entry><title type="html">Privacy papers in NeurIPS 2019</title><link href="https://spliew.github.io/posts/2020/09/privacy-neurips19/" rel="alternate" type="text/html" title="Privacy papers in NeurIPS 2019" /><published>2020-09-22T00:00:00+02:00</published><updated>2020-09-22T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2020/09/blog-post-2</id><content type="html" xml:base="https://spliew.github.io/posts/2020/09/privacy-neurips19/"><![CDATA[<p>I have curated and am beginning to read NeurIPS ‘19 <a href="https://papers.nips.cc/book/advances-in-neural-information-processing-systems-32-2019">papers</a> related to privacy.  The list will be constantly updated with the paper summaries. Stay tuned!</p>

<table>
  <thead>
    <tr>
      <th><em>Title</em></th>
      <th><em>Summary</em></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td>Private Hypothesis Selection</td>
      <td>Given samples from an unknown probability distribution, select a distribution from some fixed set of candidates which is “close” to the unknown distribution in some appropriate distance measure.</td>
    </tr>
    <tr>
      <td>Differentially Private Algorithms for Learning Mixtures of Separated Gaussians</td>
      <td>Learning the parameters of Gaussian mixture models. sample complexity is small and no a priori bounds on the parameters of the mixture components.</td>
    </tr>
    <tr>
      <td>Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation</td>
      <td> </td>
    </tr>
    <tr>
      <td>Generalization in Generative Adversarial Networks: A Novel Perspective from Privacy Protection</td>
      <td>Show that DP implies generalization. but their concrete examples (lipschitz constraint etc.) did not show how DP is achieved (?).</td>
    </tr>
    <tr>
      <td>Differentially Private Bayesian Linear Regression</td>
      <td> </td>
    </tr>
    <tr>
      <td>Minimax Optimal Estimation of Approximate Differential Privacy on Neighboring Databases</td>
      <td> </td>
    </tr>
    <tr>
      <td>Locally Private Gaussian Estimation</td>
      <td>Each of n users draws a single i.i.d. sample from an unknown Gaussian distribution, and the goal is to estimate the mean of this Gaussian distribution while satisfying local differential privacy for each user.</td>
    </tr>
    <tr>
      <td>Capacity Bounded Differential Privacy</td>
      <td>Limit the capability of adversary, i.e., adversary is capable of performing only linear classification.</td>
    </tr>
    <tr>
      <td>Practical Differentially Private Top-k Selection with Pay-what-you-get Composition</td>
      <td> </td>
    </tr>
    <tr>
      <td>Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation</td>
      <td> </td>
    </tr>
    <tr>
      <td>Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Markov Chain Monte Carlo</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Bagging: Improved utility and cheaper privacy than subsample-and-aggregate</td>
      <td> </td>
    </tr>
    <tr>
      <td>Oblivious Sampling Algorithms for Private Data Analysis</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Anonymized Histograms</td>
      <td> </td>
    </tr>
    <tr>
      <td>Facility Location Problem in Differential Privacy Model Revisited</td>
      <td> </td>
    </tr>
    <tr>
      <td>Private Learning Implies Online Learning: An Efficient Reduction</td>
      <td> </td>
    </tr>
    <tr>
      <td>Online Learning via the Differential Privacy Lens</td>
      <td> </td>
    </tr>
    <tr>
      <td>Elliptical Perturbations for Differential Privacy</td>
      <td> </td>
    </tr>
    <tr>
      <td>Limits of Private Learning with Access to Public Data</td>
      <td> </td>
    </tr>
    <tr>
      <td>Private Testing of Distributions via Sample Permutations</td>
      <td> </td>
    </tr>
    <tr>
      <td>Private Stochastic Convex Optimization with Optimal Rates</td>
      <td> </td>
    </tr>
    <tr>
      <td>Privacy-Preserving Q-Learning with Functional Noise in Continuous Spaces</td>
      <td> </td>
    </tr>
    <tr>
      <td>Privacy Amplification by Mixing and Diffusion Mechanisms</td>
      <td> </td>
    </tr>
    <tr>
      <td>On Differentially Private Graph Sparsification and Applications</td>
      <td> </td>
    </tr>
    <tr>
      <td>An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors</td>
      <td> </td>
    </tr>
    <tr>
      <td>User-Specified Local Differential Privacy in Unconstrained Adaptive Online Learning</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Covariance Estimation</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differentially Private Distributed Data Summarization under Covariate Shift</td>
      <td> </td>
    </tr>
    <tr>
      <td>Locally Private Learning without Interaction Requires Separation</td>
      <td> </td>
    </tr>
    <tr>
      <td>Differential Privacy Has Disparate Impact on Model Accuracy</td>
      <td>If the original model is unfair, the unfairness becomes worse once DP is applied.</td>
    </tr>
  </tbody>
</table>]]></content><author><name>Seng Pei Liew</name></author><category term="Privacy" /><category term="Machine Learning" /><summary type="html"><![CDATA[I have curated and am beginning to read NeurIPS ‘19 papers related to privacy. The list will be constantly updated with the paper summaries. Stay tuned!]]></summary></entry><entry><title type="html">Some old blog posts</title><link href="https://spliew.github.io/posts/2020/09/blog-post-physics/" rel="alternate" type="text/html" title="Some old blog posts" /><published>2020-09-21T00:00:00+02:00</published><updated>2020-09-21T00:00:00+02:00</updated><id>https://spliew.github.io/posts/2020/09/blog-post-1</id><content type="html" xml:base="https://spliew.github.io/posts/2020/09/blog-post-physics/"><![CDATA[<p>You can find some of my old posts about particle physics <a href="https://amva4newphysics.wordpress.com/author/sengpei/">here</a>.</p>]]></content><author><name>Seng Pei Liew</name></author><category term="Physics" /><summary type="html"><![CDATA[You can find some of my old posts about particle physics here.]]></summary></entry></feed>