skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, February 13 until 2:00 AM ET on Friday, February 14 due to maintenance. We apologize for the inconvenience.


Title: Non-reversible Parallel Tempering for Uncertainty Approximation in Deep Learning
Parallel tempering (PT), also known as replica exchange, is the go-to workhorse for simulations of multi-modal distributions. The key to the success of PT is to adopt efficient swap schemes. The popular deterministic even-odd (DEO) scheme exploits the non-reversibility property and has successfully reduced the communication cost from O(P 2) to O(P) given sufficient many P chains. However, such an innovation largely disappears in big data problems due to the limited chains and extremely few bias-corrected swaps. To handle this issue, we generalize the DEO scheme to promote the non-reversibility and obtain an appealing communication cost O(P log P) based on the optimal window size. In addition, we also analyze the bias when we adopt stochastic gradient descent (SGD) with large and constant learning rates as exploration kernels. Such a user-friendly nature enables us to conduct large-scale uncertainty approximation tasks without much tuning costs.  more » « less
Award ID(s):
2134209 2053746 1555072
PAR ID:
10419664
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
Thirty-seventh AAAI Conference on Artificial Intelligence
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Parallel tempering (PT), also known as replica exchange, is the go-to workhorse for simulations of multi-modal distributions. The key to the success of PT is to adopt efficient swap schemes. The popular deterministic even-odd (DEO) scheme exploits the non-reversibility property and has successfully reduced the communication cost from quadratic to linear given the sufficiently many chains. However, such an innovation largely disappears in big data due to the limited chains and few bias-corrected swaps. To handle this issue, we generalize the DEO scheme to promote non-reversibility and propose a few solutions to tackle the underlying bias caused by the geometric stopping time. Notably, in big data scenarios, we obtain a nearly linear communication cost based on the optimal window size. In addition, we also adopt stochastic gradient descent (SGD) with large and constant learning rates as exploration kernels. Such a user-friendly nature enables us to conduct approximation tasks for complex posteriors without much tuning costs.

     
    more » « less
  2. Nissim, K. ; Waters, B. (Ed.)
    Recent new constructions of rate-1 OT [Döttling, Garg, Ishai, Malavolta, Mour, and Ostrovsky, CRYPTO 2019] have brought this primitive under the spotlight and the techniques have led to new feasibility results for private-information retrieval, and homomorphic encryption for branching programs. The receiver communication of this construction consists of a quadratic (in the sender's input size) number of group elements for a single instance of rate-1 OT. Recently [Garg, Hajiabadi, Ostrovsky, TCC 2020] improved the receiver communication to a linear number of group elements for a single string-OT. However, most applications of rate-1 OT require executing it multiple times, resulting in large communication costs for the receiver. In this work, we introduce a new technique for amortizing the cost of multiple rate-1 OTs. Specifically, based on standard pairing assumptions, we obtain a two-message rate-1 OT protocol for which the amortized cost per string-OT is asymptotically reduced to only four group elements. Our results lead to significant communication improvements in PSI and PIR, special cases of SFE for branching programs. - PIR: We obtain a rate-1 PIR scheme with client communication cost of $O(\lambda\cdot\log N)$ group elements for security parameter $\lambda$ and database size $N$. Notably, after a one-time setup (or one PIR instance), any following PIR instance only requires communication cost $O(\log N)$ number of group elements. - PSI with unbalanced inputs: We apply our techniques to private set intersection with unbalanced set sizes (where the receiver has a smaller set) and achieve receiver communication of $O((m+\lambda) \log N)$ group elements where $m, N$ are the sizes of the receiver and sender sets, respectively. Similarly, after a one-time setup (or one PSI instance), any following PSI instance only requires communication cost $O(m \cdot \log N)$ number of group elements. All previous sublinear-communication non-FHE based PSI protocols for the above unbalanced setting were also based on rate-1 OT, but incurred at least $O(\lambda^2 m \log N)$ group elements. 
    more » « less
  3. This article proposes authentication and physical layer security schemes to improve secure communications between the electric vehicle (EV) and charging infrastructure in dynamic wireless power transfer (DWPT) systems. In particular, a double-encryption with the signature (DoES) scheme is proposed for session key exchange between EV and charging station which provides data authenticity and integrity. To enable low-latency authentication between EV and power transmitter (PT) in DWPT systems, a sign-encrypt-message (SEM) authentication code scheme is designed leveraging symmetric keys for dynamic charging, which ensures privacy and resistance to tampering attacks. The artificial noise-based physical layer security (AN-based PLS) scheme is also proposed at the physical layer to degrade the wiretapped signal quality of multiple eavesdroppers operating in non-colluding and colluding cases. Closed-form expressions for the secrecy outage probability (SOP) and intercept probability (IP) of the considered system with the non-colluding case are derived to show that the proposed AN-based PLS scheme provides lower SOP and IP than the conventional ones without AN. The distance between eavesdroppers and the PT also affects the system SOP and IP in both non-colluding and colluding cases. Moreover, the EV using the DoES scheme takes 52 ms for obtaining session keys from the charging station while it only spends 8.23 ms with the SEM scheme to authenticate with PT for the charging process. 
    more » « less
  4. Asynchronous verifiable secret sharing (AVSS) protocols protect a secret that is distributed among N parties. Dual-threshold AVSS protocols guarantee consensus in the presence of T Byzantine failures and privacy if fewer than P parties attempt to reconstruct the secret. In this work, we construct a dual-threshold AVSS protocol that is optimal along several dimensions. First, it is a high-threshold AVSS scheme, meaning that it is a dual-threshold AVSS with optimal parameters T < N/3 and P < N - T. Second, it has O(N^2) message complexity, and for large secrets it achieves the optimal O(N) communication overhead, without the need for a public key infrastructure or trusted setup. While these properties have been achieved individually before, to our knowledge this is the first protocol that is achieves all of the above simultaneously. The core component of our construction is a high-threshold AVSS scheme for small secrets based on polynomial commitments that achieves O(N^2 log(N)) communication overhead, as compared to prior schemes that require O(N^3) overhead with T more » « less
  5. null (Ed.)
    Single-atom catalysts (SACs) exhibit excellent performance for various catalytic reactions but it is still challenging to have adequate total activity for practical applications. Here we report the high-valence, square planar Pt 1 –O 4 as an active site that enables significantly to increase the total activity of the Pt 1 /Fe 2 O 3 SAC with a Pt loading of only ∼30 ppm, which is similar to that of a 1.0 wt% nano-Pt/Fe 2 O 3 , for CO oxidation at 350 °C. Density functional theory calculations reveal that Pt 1 –O 4 catalyzes CO oxidation through a non-classical Mars–van Krevelen mechanism. The adsorbed O 2 on Pt 1 atoms activates the coordination oxygen in the Pt 1 –O 4 configuration, and then a barrierless O 2 dissociation occurs on the Pt 1 –Fe 2 triangle to replenish the consumed coordination oxygen by the cooperative action of Pt 5d and Fe 3d electrons. This work provides a new fundamental understanding of oxidation catalysis on stable and active SACs, providing guidance for rationally designing future heterogeneous catalysts. 
    more » « less