More Like this

1. Adaptive Private-K-Selection with Adaptive K and Application to Multi-label PATE

   Zhu, Yuqing (April 2022, Proceedings of Machine Learning Research)

   We provide an end-to-end Renyi DP based-framework for differentially private top-𝑘 selection. Unlike previous approaches, which require a data-independent choice on 𝑘, we propose to privately release a data-dependent choice of 𝑘 such that the gap between 𝑘-th and the (𝑘+1)st “quality” is large. This is achieved by an extension of the Report-Noisy-Max algorithm with a more concentrated Gaussian noise. Not only does this eliminates one hyperparameter, the adaptive choice of 𝑘 also certifies the stability of the top-𝑘 indices in the unordered set so we can release them using a combination of the propose-test-release (PTR) framework and the Distance-to-Stability mechanism. We show that our construction improves the privacy-utility trade-offs compared to the previous top-𝑘 selection algorithms theoretically and empirically. Additionally, we apply our algorithm to “Private Aggregation of Teacher Ensembles (PATE)” in multi-label classification tasks with a large number of labels and show that it leads to significant performance gains. 

   more » « less
2. Signal Integrity Simulations of 4JL Gate Pulses From 4 K to 50 K

   https://doi.org/10.1109/TASC.2024.3510518  

   Krause, Keith; Mustafa, Yerzhan; Shah, Archit; Köse, Selçuk; Hamilton, Michael C (August 2025, IEEE Transactions on Applied Superconductivity)
3. K-theoretic obstructions to bounded t-structures

   https://doi.org/10.1007/s00222-018-00847-0  

   Antieau, Benjamin; Gepner, David; Heller, Jeremiah (April 2019, Inventiones mathematicae)
4. Geometric Pattern Matching Reduces to k -SUM

   https://doi.org/10.1007/s00454-021-00324-1  

   Aronov, Boris; Cardinal, Jean (January 2021, Discrete & Computational Geometry)

   We prove that some exact geometric pattern matching problems reduce in linear time to 𝑘-SUM when the pattern has a fixed size 𝑘. This holds in the real RAM model for searching for a similar copy of a set of 𝑘≥3 points within a set of n points in the plane, and for searching for an affine image of a set of 𝑘≥𝑑+2 points within a set of n points in d-space. As corollaries, we obtain improved real RAM algorithms and decision trees for the two problems. In particular, they can be solved by algebraic decision trees of near-linear height. 

   more » « less
5. The branching fraction of $$ {B}_s^0\to {K}^0{\overline{K}}^0 $$: three puzzles

   https://doi.org/10.1007/JHEP02(2023)113  

   Amhis, Yasmine; Grossman, Yuval; Nir, Yosef (February 2023, Journal of High Energy Physics)

   A bstract The branching fraction of the $$ {B}_s\to {K}^0{\overline{K}}^0 $$ B s → K 0 K ¯ 0 decay has been recently measured by the LHCb and Belle experiments. We study the consistency of the measured value with three relations to other decay rates and CP asymmetries which follow from the Standard Model, and from the approximate flavor SU(3) symmetry of the strong interactions. We find that each of these relations is violated at a level of above 3 σ . We argue that various subleading effects — rescattering, electroweak penguins and SU(3) breaking — if larger than theoretically expected, can account for some of these puzzles, but not for all of them simultaneously. 

   more » « less