This week, David Plotz, Emily Bazelon, and John Dickerson discuss Raphael Warnock beating Herschel Walker, and oral arguments at the Supreme Court in the anti-gay marriage website designer case and the "independent state legislature" election case. Here are some notes and references from this week's show: Fr. James Martin, S.J. for Outreach: "When Is Religious Liberty A Fig Leaf For Homophobia?" Here are this week's chatters: David: Tour Fort DeRussy with David; City Cast Portland has launched; Caitlin Doughty for The New York Times: "If You Want to Give Something Back to Nature, Give Your Body" For this week's Slate Plus bonus segment Emily, David, and John discuss ChatGPT.

We propose a supervised deep learning (DL) approach to perform adaptive zoning on time dependent partial differential equations that model the propagation of 1D shock waves in a compressible medium. We train a neural network on a dataset composed of different static shock profiles associated with the corresponding adapted meshes computed with standard adaptive zoning techniques. We show that the trained DL model learns how to capture the presence of shocks in the domain and generates at each time step an adapted non-uniform mesh that relocates the grid nodes to improve the accuracy of Lax-Wendroff and fifth order weighted essentially non-oscillatory (WENO5) space discretization schemes. We also show that the surrogate DL model reduces the computational time to perform adaptive zoning by at least a 2x factor with respect to standard techniques without compromising the accuracy of the reconstruction of the physical quantities of interest.

The Election Commission of India has introduced Voter Verified Paper Audit Trail since 2019. This mechanism has increased voter confidence at the time of casting the votes. However, physical verification of the VVPATs against the party level counts from the EVMs is done only in 5 (randomly selected) machines per constituency. The time required to conduct physical verification becomes a bottleneck in scaling this activity for 100% of machines in all constituencies. We proposed an automated counter powered by image processing and machine learning algorithms to speed up the process and address this issue.

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

Recurrent neural networks are a widely used class of neural architectures. They have, however, two shortcomings. First, they are often treated as black-box models and as such it is difficult to understand what exactly they learn as well as how they arrive at a particular prediction. Second, they tend to work poorly on sequences requiring long-term memorization, despite having this capacity in principle. We aim to address both shortcomings with a class of recurrent networks that use a stochastic state transition mechanism between cell applications. This mechanism, which we term state-regularization, makes RNNs transition between a finite set of learnable states. We evaluate state-regularized RNNs on (1) regular languages for the purpose of automata extraction; (2) non-regular languages such as balanced parentheses and palindromes where external memory is required; and (3) real-word sequence learning tasks for sentiment analysis, visual object recognition and text categorisation. We show that state-regularization (a) simplifies the extraction of finite state automata that display an RNN's state transition dynamic; (b) forces RNNs to operate more like automata with external memory and less like finite state machines, which potentiality leads to a more structural memory; (c) leads to better interpretability and explainability of RNNs by leveraging the probabilistic finite state transition mechanism over time steps.

Restless multi-armed bandits are often used to model budget-constrained resource allocation tasks where receipt of the resource is associated with an increased probability of a favorable state transition. Prior work assumes that individual arms only benefit if they receive the resource directly. However, many allocation tasks occur within communities and can be characterized by positive externalities that allow arms to derive partial benefit when their neighbor(s) receive the resource. We thus introduce networked restless bandits, a novel multi-armed bandit setting in which arms are both restless and embedded within a directed graph. We then present Greta, a graph-aware, Whittle index-based heuristic algorithm that can be used to efficiently construct a constrained reward-maximizing action vector at each timestep. Our empirical results demonstrate that Greta outperforms comparison policies across a range of hyperparameter values and graph topologies.

The proliferation of radical online communities and their violent offshoots has sparked great societal concern. However, the current practice of banning such communities from mainstream platforms has unintended consequences: (I) the further radicalization of their members in fringe platforms where they migrate; and (ii) the spillover of harmful content from fringe back onto mainstream platforms. Here, in a large observational study on two banned subreddits, r/The\_Donald and r/fatpeoplehate, we examine how factors associated with the RECRO radicalization framework relate to users' migration decisions. Specifically, we quantify how these factors affect users' decisions to post on fringe platforms and, for those who do, whether they continue posting on the mainstream platform. Our results show that individual-level factors, those relating to the behavior of users, are associated with the decision to post on the fringe platform. Whereas social-level factors, users' connection with the radical community, only affect the propensity to be coactive on both platforms. Overall, our findings pave the way for evidence-based moderation policies, as the decisions to migrate and remain coactive amplify unintended consequences of community bans.

The most useful data mining primitives are distance measures. With an effective distance measure, it is possible to perform classification, clustering, anomaly detection, segmentation, etc. For single-event time series Euclidean Distance and Dynamic Time Warping distance are known to be extremely effective. However, for time series containing cyclical behaviors, the semantic meaningfulness of such comparisons is less clear. For example, on two separate days the telemetry from an athlete workout routine might be very similar. The second day may change the order in of performing push-ups and squats, adding repetitions of pull-ups, or completely omitting dumbbell curls. Any of these minor changes would defeat existing time series distance measures. Some bag-of-features methods have been proposed to address this problem, but we argue that in many cases, similarity is intimately tied to the shapes of subsequences within these longer time series. In such cases, summative features will lack discrimination ability. In this work we introduce PRCIS, which stands for Pattern Representation Comparison in Series. PRCIS is a distance measure for long time series, which exploits recent progress in our ability to summarize time series with dictionaries. We will demonstrate the utility of our ideas on diverse tasks and datasets.

U.S. House Representatives Earl Francis Blumenauer and Adam Schiff want further U.S. Department of Agriculture (USDA) scrutiny of Elon Musk's Neuralink following a Reuters report that outlined mistakes in the brain chip company's animal testing program, their offices said on Thursday. Reuters reported on Monday that the USDA's inspector general is investigating Neuralink for potential animal-welfare violations amid internal staff complaints that its animal testing is being rushed, causing needless suffering and deaths. Blumenauer and Schiff, two Democrats who are members of the Congressional Animal Protection Caucus, wrote in a draft letter they will send to the USDA that "the treatment of the animals described in these complaints seems to indicate a distressing lack of oversight." "We are very concerned that this may be another example of high-profile cases of animal cruelty involving USDA-inspected facilities, referenced in previous letters to your agency, where there has not been adequate action from USDA," the lawmakers said in a letter addressed to USDA secretary Thomas Vilsack and Kevin Shea, who oversees the agency's inspection service. Neuralink executives did not immediately respond to requests for comment.

The news sent shock waves through the video game industry. The assumption since the deal was announced in January was that the deal -- like Microsoft's 2021 acquisition of video game publisher ZeniMax -- would go through. But the FTC's new lawsuit is an enormous, unexpected barrier to the deal's completion.