Miracle-dz/UniFAR-FTUs huggingface dataset:
Tunable synaptic working memory with volatile memristive devices

Different real-world cognitive tasks evolve on different relevant timescales. Processing these tasks requires memory mechanisms able to match their specific time constants. In particular, the working memory (WM) utilizes mechanisms that span orders of magnitudes of timescales, from milliseconds to seconds or even minutes. This plentitude of timescales is an essential ingredient of WM tasks like visual or language processing. This degree of flexibility is challenging in analog computing hardware because it requires the integration of several reconfigurable capacitors of different size. Emerging volatile memristive devices present a compact and appealing solution to reproduce reconfigurable temporal dynamics in a neuromorphic network. We present a demonstration of WM using a silver-based memristive device whose key parameters, retention time and switching probability, can be electrically tuned and adapted to the task at hand. First, we demonstrate the principles of WM in a small scale hardware to execute an associative memory task. Then, we use the experimental data in two larger scale simulations, the first featuring WM in a biological environment, the second demonstrating associative symbolic WM.
Boosting Model Inversion Attacks with Adversarial Examples

Model inversion attacks involve reconstructing the training data of a target model, which raises serious privacy concerns for machine learning models. However, these attacks, especially learning-based methods, are likely to suffer from low attack accuracy, i.e., low classification accuracy of these reconstructed data by machine learning classifiers. Recent studies showed an alternative strategy of model inversion attacks, GAN-based optimization, can improve the attack accuracy effectively. However, these series of GAN-based attacks reconstruct only class-representative training data for a class, whereas learning-based attacks can reconstruct diverse data for different training data in each class. Hence, in this paper, we propose a new training paradigm for a learning-based model inversion attack that can achieve higher attack accuracy in a black-box setting. First, we regularize the training process of the attack model with an added semantic loss function and, second, we inject adversarial examples into the training data to increase the diversity of the class-related parts (i.e., the essential features for classification tasks) in training data. This scheme guides the attack model to pay more attention to the class-related parts of the original data during the data reconstruction process. The experimental results show that our method greatly boosts the performance of existing learning-based model inversion attacks. Even when no extra queries to the target model are allowed, the approach can still improve the attack accuracy of reconstructed data. This new attack shows that the severity of the threat from learning-based model inversion adversaries is underestimated and more robust defenses are required.
On Evaluating the Adversarial Robustness of Semantic Segmentation Models

Achieving robustness against adversarial input perturbation is an important and intriguing problem in machine learning. In the area of semantic image segmentation, a number of adversarial training approaches have been proposed as a defense against adversarial perturbation, but the methodology of evaluating the robustness of the models is still lacking, compared to image classification. Here, we demonstrate that, just like in image classification, it is important to evaluate the models over several different and hard attacks. We propose a set of gradient based iterative attacks and show that it is essential to perform a large number of iterations. We include attacks against the internal representations of the models as well. We apply two types of attacks: maximizing the error with a bounded perturbation, and minimizing the perturbation for a given level of error. Using this set of attacks, we show for the first time that a number of models in previous work that are claimed to be robust are in fact not robust at all. We then evaluate simple adversarial training algorithms that produce reasonably robust models even under our set of strong attacks. Our results indicate that a key design decision to achieve any robustness is to use only adversarial examples during training. However, this introduces a trade-off between robustness and accuracy.
Generalised f-Mean Aggregation for Graph Neural Networks

Graph Neural Network (GNN) architectures are defined by their implementations of update and aggregation modules. While many works focus on new ways to parametrise the update modules, the aggregation modules receive comparatively little attention. Because it is difficult to parametrise aggregation functions, currently most methods select a ``standard aggregator'' such as $\mathrm{mean}$, $\mathrm{sum}$, or $\mathrm{max}$. While this selection is often made without any reasoning, it has been shown that the choice in aggregator has a significant impact on performance, and the best choice in aggregator is problem-dependent. Since aggregation is a lossy operation, it is crucial to select the most appropriate aggregator in order to minimise information loss. In this paper, we present GenAgg, a generalised aggregation operator, which parametrises a function space that includes all standard aggregators. In our experiments, we show that GenAgg is able to represent the standard aggregators with much higher accuracy than baseline methods. We also show that using GenAgg as a drop-in replacement for an existing aggregator in a GNN often leads to a significant boost in performance across various tasks.
Action Q-Transformer: Visual Explanation in Deep Reinforcement Learning with Encoder-Decoder Model using Action Query

The excellent performance of Transformer in supervised learning has led to growing interest in its potential application to deep reinforcement learning (DRL) to achieve high performance on a wide variety of problems. However, the decision making of a DRL agent is a black box, which greatly hinders the application of the agent to real-world problems. To address this problem, we propose the Action Q-Transformer (AQT), which introduces a transformer encoder-decoder structure to Q-learning based DRL methods. In AQT, the encoder calculates the state value function and the decoder calculates the advantage function to promote the acquisition of different attentions indicating the agent's decision-making. The decoder in AQT utilizes action queries, which represent the information of each action, as queries. This enables us to obtain the attentions for the state value and for each action. By acquiring and visualizing these attentions that detail the agent's decision-making, we achieve a DRL model with high interpretability. In this paper, we show that visualization of attention in Atari 2600 games enables detailed analysis of agents' decision-making in various game tasks. Further, experimental results demonstrate that our method can achieve higher performance than the baseline in some games.
Top quark and vector meson production in heavy ion collisions at CMS

Heavy ion collisions are rich and complex systems that involve different aspects of QCD and electromagnetic phenomena. From head-on collisions to the case in which the nuclei miss each other, many of QCD and photo-induced probes are being actively investigated. In this contribution we briefly discuss both of these different topics and some of the CMS results on top quark production and vector meson photo-production, as well as the physics motivation to study these processes are presented.
Large Language Models as Sous Chefs: Revising Recipes with GPT-3

With their remarkably improved text generation and prompting capabilities, large language models can adapt existing written information into forms that are easier to use and understand. In our work, we focus on recipes as an example of complex, diverse, and widely used instructions. We develop a prompt grounded in the original recipe and ingredients list that breaks recipes down into simpler steps. We apply this prompt to recipes from various world cuisines, and experiment with several large language models (LLMs), finding best results with GPT-3.5. We also contribute an Amazon Mechanical Turk task that is carefully designed to reduce fatigue while collecting human judgment of the quality of recipe revisions. We find that annotators usually prefer the revision over the original, demonstrating a promising application of LLMs in serving as digital sous chefs for recipes and beyond. We release our prompt, code, and MTurk template for public use.
Cross-domain Recommender Systems via Multimodal Domain Adaptation

Collaborative Filtering (CF) has emerged as one of the most prominent implementation strategies for building recommender systems. The key idea is to exploit the usage patterns of individuals to generate personalized recommendations. CF techniques, especially for newly launched platforms, often face a critical issue known as the data sparsity problem, which greatly limits their performance. Several approaches in the literature have been proposed to tackle the problem of data sparsity, among which cross-domain collaborative filtering (CDCF) has gained significant attention in the recent past. In order to compensate for the scarcity of available feedback in a target domain, the CDCF approach utilizes information available in other auxiliary domains. Traditional CDCF approaches primarily focus on finding a common set of entities (users or items) across the domains, which then act as a conduit for knowledge transfer. Nevertheless, most real-world datasets are collected from different domains, so they often lack information about anchor points or reference information for entity alignment. This paper introduces a domain adaptation technique to align the embeddings of entities across the two domains. Our approach first exploits the available textual and visual information to independently learn a multi-view latent representation for each entity in the auxiliary and target domains. The different representations of the entity are then fused to generate the corresponding unified representation. A domain classifier is then trained to learn the embedding for the domain alignment by fixing the unified features as the anchor points. Experiments on two publicly benchmark datasets indicate the effectiveness of our proposed approach.
Internal waves in 2D domains with ergodic classical dynamics

We study a model of internal waves in an effectively 2D aquarium under periodic forcing. In the case when the underlying classical dynamics has sufficiently irrational rotation number, we prove that the energy of the internal waves remains bounded. This involves studying the spectrum of a related 0-th order pseudodifferential operator at spectral parameters corresponding to such dynamics. For the special cases of rectangular and elliptic domains, we give an explicit spectral description of that operator.
Computron: Serving Distributed Deep Learning Models with Model Parallel Swapping

Many of the most performant deep learning models today in fields like language and image understanding are fine-tuned models that contain billions of parameters. In anticipation of workloads that involve serving many of such large models to handle different tasks, we develop Computron, a system that uses memory swapping to serve multiple distributed models on a shared GPU cluster. Computron implements a model parallel swapping design that takes advantage of the aggregate CPU-GPU link bandwidth of a cluster to speed up model parameter transfers. This design makes swapping large models feasible and can improve resource utilization. We demonstrate that Computron successfully parallelizes model swapping on multiple GPUs, and we test it on randomized workloads to show how it can tolerate real world variability factors like burstiness and skewed request rates. Computron's source code is available at https://github.com/dlzou/computron.
Identification of resonant frequencies in LIGO-like suspension with finite-element modeling

Following the upgrades to Advanced LIGO (aLIGO), measurements were made of the detector suspensions' frequency response characteristics. While most resonant frequencies could be identified with simple mechanical models, such as the fiber vibration modes, some were unexplained. Using a finite element model of the quadruple pendulum suspension, we search for and identify lines from unknown sources. The present work focuses on two resonant lines observed in the Upper Intermediate Mass as examples of this technique. Our simulations suggest a common source for these lines, which could be accounted for in a redesign. By modeling these response frequencies, we can examine the motion of individual components, and suggest methods to reduce their amplitude, alter their frequency, or eliminate them in future gravitational wave detector designs.
Towards Sustainable Ultrawide Bandgap Van der

The sustainable development of next-generation device technology is paramount in the face of climate change and the looming energy crisis. Tremendous efforts have been made in the discovery and design of nanomaterials that achieve device-level sustainability, where high performance and low operational energy cost are prioritized. However, many of such materials are composed of elements that are under threat of depletion and pose elevated risks to the environment. The role of materials-level sustainability in computational screening efforts remains an open question thus far. Here we develop a general van der Waals materials screening framework imbued with sustainability-motivated search criteria. Using ultrawide bandgap (UWBG) materials as a backdrop – an emerging materials class with great prospects in dielectric, power electronics, and ultraviolet device applications, we demonstrate how this screening framework results in 25 sustainable UWBG layered materials comprising only of low-risks elements. Our ﬁndings constitute a critical ﬁrst-step towards reinventing a more sustainable electronics landscape beyond silicon, with the framework established in this work serving as a harbinger of sustainable 2D materials discovery.
HODOR: Shrinking Attack Surface on Node.js via System Call Limitation

Node.js applications are becoming more and more widely adopted on the server side, partly due to the convenience of building these applications on top of the runtime provided by popular Node.js engines and the large number of third-party packages provided by the Node Package Management (npm) registry. Node.js provides Node.js applications with system interaction capabilities using system calls. However, such convenience comes with a price, i.e., the attack surface of JavaScript arbitrary code execution (ACE) vulnerabilities is expanded to the system call level. There lies a noticeable gap between existing protection techniques in the JavaScript code level (either by code debloating or read-write-execute permission restriction) and a targeted defense for emerging critical system call level exploitation. To fill the gap, we design and implement HODOR, a lightweight runtime protection system based on enforcing precise system call restrictions when running a Node.js application. HODOR achieved this by addressing several nontrivial technical challenges. First, HODOR requires to construct high-quality call graphs for both the Node.js application (in JavaScript) and its underlying Node.js framework (in JavaScript and C/C++). Specifically, HODOR incorporates several important optimizations in both the JavaScript and C/C++ levels to improve the state-of-the-art tools for building more precise call graphs. Then, HODOR creates the main-thread whitelist and the thread-pool whitelist respectively containing the identified necessary system calls based on the call graphs mappings. Finally, with the whitelists, HODOR implements lightweight system call restriction using the Linux kernel feature Secure Computing Mode (seccomp) to shrink the attack surface. We utilize HODOR to protect 168 real-world Node.js applications compromised by arbitrary code/command execution attacks. HODOR could reduce the attack surface to 19.42% on average with negligible runtime overhead (i.e., <3%).
Heat increases experienced racial segregation in the United States

Segregation on the basis of ethnic groups stands as a pervasive and persistent social challenge in many cities across the globe. Public spaces provide opportunities for diverse encounters but recent research suggests individuals adjust their time spent in such places to cope with extreme temperatures. We evaluate to what extent such adaptation affects racial segregation and thus shed light on a yet unexplored channel through which global warming might affect social welfare. We use large-scale foot traffic data for millions of places in 315 US cities between 2018 and 2020 to estimate an index of experienced isolation in daily visits between whites and other ethnic groups. We find that heat increases segregation. Results from panel regressions imply that a week with temperatures above 33{\deg}C in a city like Los Angeles induces an upward shift of visit isolation by 0.7 percentage points, which equals about 14% of the difference in the isolation index of Los Angeles to the more segregated city of Atlanta. The segregation-increasing effect is particularly strong for individuals living in lower-income areas and at places associated with leisure activities. Combining our estimates with climate model projections, we find that stringent mitigation policy can have significant co-benefits in terms of cushioning increases in racial segregation in the future.
Azimuthal asymmetries in 
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>D</mml:mi></mml:math>
-meson and jet production at the EIC

We study the azimuthal asymmetries in back-to-back leptoproduction of $D$-meson and jet to probe the gluon TMDs in an unpolarized and transversely polarized electron-proton collision at the kinematics of EIC. We give predictions for unpolarized cross-sections within the TMD factorization framework. In $D$-meson and jet formation, the only leading order contribution comes from the photon gluon fusion process. We give numerical estimates of the upper bound on the azimuthal asymmetries with the saturation of positivity bounds; also, we present the asymmetries using a Gaussian parameterization of TMDs. We obtain sizable asymmetries in the kinematics that will be accessible at EIC.
TCEIP: Text Condition Embedded Regression Network for Dental Implant Position Prediction

When deep neural network has been proposed to assist the dentist in designing the location of dental implant, most of them are targeting simple cases where only one missing tooth is available. As a result, literature works do not work well when there are multiple missing teeth and easily generate false predictions when the teeth are sparsely distributed. In this paper, we are trying to integrate a weak supervision text, the target region, to the implant position regression network, to address above issues. We propose a text condition embedded implant position regression network (TCEIP), to embed the text condition into the encoder-decoder framework for improvement of the regression performance. A cross-modal interaction that consists of cross-modal attention (CMA) and knowledge alignment module (KAM) is proposed to facilitate the interaction between features of images and texts. The CMA module performs a cross-attention between the image feature and the text condition, and the KAM mitigates the knowledge gap between the image feature and the image encoder of the CLIP. Extensive experiments on a dental implant dataset through five-fold cross-validation demonstrated that the proposed TCEIP achieves superior performance than existing methods.
Local time of transient random walk on the lattice of positive half line

In this paper, we study spatially inhomogeneous random walks on the lattice of positive half line. Fix a positive integer $a. $ Let $C$ be the collection of points at which the local times of the random walk are exactly $a. $ We give a criterion to tell whether $C$ is a finite set or not. Our result answer an open problem proposed by E. Cs\'aki, A. F\"oldes, P. R\'ev\'esz [J. Theoret. Probab. 23 (2) (2010) 624-638. ]. When $a=1,$ $C$ is just the set of strong cutpoints studied in the above mentioned paper. By a moment method, when the local drift of the walk at $i\ge 1$ is $1/i,$ we show that $2|C\cap [0,n]|/\log n\overset{\mathcal D}{\rightarrow} S$ as $n\rightarrow\infty,$ where $S$ is an exponentially distributed random variable with $P(S>t)=e^{-t},\ t>0. $
One-Shot Traffic Assignment with Forward-Looking Penalization

Traffic assignment (TA) is crucial in optimizing transportation systems and consists in efficiently assigning routes to a collection of trips. Existing TA algorithms often do not adequately consider realtime traffic conditions, resulting in inefficient route assignments. This paper introduces Metis, a coordinated, one-shot TA algorithm that combines alternative routing with edge penalization and informed route scoring. We conduct experiments in several cities to evaluate the performance of Metis against state-of-the-art one-shot methods. Compared to the best baseline, Metis significantly reduces CO2 emissions by 18% in Milan, 28% in Florence, and 46% in Rome, improving trip distribution considerably while still having low computational time. Our study proposes Metis as a promising solution for optimizing TA and urban transportation systems.
TaylorPDENet: Learning PDEs from non-grid Data

Modeling data obtained from dynamical systems has gained attention in recent years as a challenging task for machine learning models. Previous approaches assume the measurements to be distributed on a grid. However, for real-world applications like weather prediction, the observations are taken from arbitrary locations within the spatial domain. In this paper, we propose TaylorPDENet - a novel machine learning method that is designed to overcome this challenge. Our algorithm uses the multidimensional Taylor expansion of a dynamical system at each observation point to estimate the spatial derivatives to perform predictions. TaylorPDENet is able to accomplish two objectives simultaneously: accurately forecast the evolution of a complex dynamical system and explicitly reconstruct the underlying differential equation describing the system. We evaluate our model on a variety of advection-diffusion equations with different parameters and show that it performs similarly to equivalent approaches on grid-structured data while being able to process unstructured data as well.
Co-operational bivariant theory

For a covariant functor W. Fulton and R. MacPherson defined \emph{an operational bivariant theory} associated to this covariant functor. In this paper we will show that given a contravariant functor one can similarly construct a ``dual"version of an operational bivariant theory, which we call a \emph{co-operational} bivariant theory. If a given contravariant functor is the usual cohomology theory, then our co-operational bivariant group for the identity map consists of what are usually called ``cohomology operations". In this sense, our co-operational bivariant theory consists of \emph{``generalized"} cohomology operations.