More Like this

1. AI for Security and Security for AI

   https://doi.org/10.1145/3422337.3450357  

   Bertino, Elisa ; Kantarcioglu, Murat ; Akcora, Cuneyt Gurcan ; Samtani, Sagar ; Mittal, Sudip ; Gupta, Maanak ( April 2021 , ACM Conference on Datta and Application Security and Privacy (CODASPY) 2021)

   null (Ed.)
2. Learning and Management for Internet of Things: Accounting for Adaptivity and Scalability

   https://doi.org/10.1109/JPROC.2019.2896243  

   Chen, Tianyi ; Barbarossa, Sergio ; Wang, Xin ; Giannakis, Georgios B. ; Zhang, Zhi-Li ( April 2019 , Proceedings of the IEEE)
3. Allais, Ellsberg, and preferences for hedging: Allais, Ellsberg, and preferences for hedging

   https://doi.org/10.3982/TE1960  

   Dean, Mark ; Ortoleva, Pietro ( January 2017 , Theoretical Economics)
4. Wiles Defect for Modules and Criteria for Freeness

   https://doi.org/10.1093/imrn/rnac052  

   Brochard, Sylvain ; Iyengar, Srikanth B ; Khare, Chandrashekhar B ( March 2022 , International Mathematics Research Notices)

   Abstract Diamond proved a numerical criterion for modules over local rings to be free modules over complete intersection rings. We formulate a refinement of these results using the notion of Wiles defect. A key step in the proof is a formula that expresses the Wiles defect of a module in terms of the Wiles defect of the underlying ring. 

   more » « less
5. Log-rank and lifting for AND-functions

   https://doi.org/10.1145/3406325.3450999  

   Knop, Alexander ; Lovett, Shachar ; McGuire, Sam ; Yuan, Weiqiang ( June 2021 , Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)

   Let f: {0, 1}n → {0, 1} be a boolean function, and let f∧(x, y) = f(x ∧ y) denote the AND-function of f, where x ∧ y denotes bit-wise AND. We study the deterministic communication complexity of f∧ and show that, up to a logn factor, it is bounded by a polynomial in the logarithm of the real rank of the communication matrix of f∧. This comes within a logn factor of establishing the log-rank conjecture for AND-functions with no assumptions on f. Our result stands in contrast with previous results on special cases of the log-rank conjecture, which needed significant restrictions on f such as monotonicity or low F2-degree. Our techniques can also be used to prove (within a logn factor) a lifting theorem for AND-functions, stating that the deterministic communication complexity of f∧ is polynomially related to the AND-decision tree complexity of f. The results rely on a new structural result regarding boolean functions f: {0, 1}n → {0, 1} with a sparse polynomial representation, which may be of independent interest. We show that if the polynomial computing f has few monomials then the set system of the monomials has a small hitting set, of size poly-logarithmic in its sparsity. We also establish extensions of this result to multi-linear polynomials f: {0, 1}n → with a larger range. 

   more » « less