Miracle-dz/UniFAR-FTUs huggingface dataset:
Older and younger adults are influenced differently by dark pattern designs

Considering that prior research has found older users undergo a different privacy decision-making process compared to younger adults, more research is needed to inform the behavioral privacy disclosure effects of these strategies for different age groups. To address this gap, we used an existing dataset of an experiment with a photo-tagging Facebook application. This experiment had a 2x2x5 between-subjects design where the manipulations were common dark pattern design strategies: framing (positive vs. negative), privacy defaults (opt-in vs. opt-out), and justification messages (positive normative, negative normative, positive rationale, negative rationale, none). We compared older (above 65 years old, N=44) and young adults (18 to 25 years old, N=162) privacy concerns and disclosure behaviors (i.e., accepting or refusing automated photo tagging) in the scope of dark pattern design. Overall, we find support for the effectiveness of dark pattern designs in the sense that positive framing and opt-out privacy defaults significantly increased disclosure behavior, while negative justification messages significantly decreased privacy concerns. Regarding older adults, our results show that certain dark patterns do lead to more disclosure than for younger adults, but also to increased privacy concerns for older adults than for younger.
A Comprehensive Evaluation of Large Language Models on Benchmark Biomedical Text Processing Tasks

Recently, Large Language Models (LLMs) have demonstrated impressive capability to solve a wide range of tasks. However, despite their success across various tasks, no prior work has investigated their capability in the biomedical domain yet. To this end, this paper aims to evaluate the performance of LLMs on benchmark biomedical tasks. For this purpose, a comprehensive evaluation of 4 popular LLMs in 6 diverse biomedical tasks across 26 datasets has been conducted. To the best of our knowledge, this is the first work that conducts an extensive evaluation and comparison of various LLMs in the biomedical domain. Interestingly, we find based on our evaluation that in biomedical datasets that have smaller training sets, zero-shot LLMs even outperform the current state-of-the-art models when they were fine-tuned only on the training set of these datasets. This suggests that pre-training on large text corpora makes LLMs quite specialized even in the biomedical domain. We also find that not a single LLM can outperform other LLMs in all tasks, with the performance of different LLMs may vary depending on the task. While their performance is still quite poor in comparison to the biomedical models that were fine-tuned on large training sets, our findings demonstrate that LLMs have the potential to be a valuable tool for various biomedical tasks that lack large annotated data.
Indirect Meltdown: Building Novel Side-Channel Attacks from Transient-Execution Attacks

The transient-execution attack Meltdown leaks sensitive information by transiently accessing inaccessible data during out-of-order execution. Although Meltdown is fixed in hardware for recent CPU generations, most currently-deployed CPUs have to rely on software mitigations, such as KPTI. Still, Meltdown is considered non-exploitable on current systems. In this paper, we show that adding another layer of indirection to Meltdown transforms a transient-execution attack into a side-channel attack, leaking metadata instead of data. We show that despite software mitigations, attackers can still leak metadata from other security domains by observing the success rate of Meltdown on non-secret data. With LeakIDT, we present the first cache-line granular monitoring of kernel addresses. LeakIDT allows an attacker to obtain cycle-accurate timestamps for attacker-chosen interrupts. We use our attack to get accurate inter-keystroke timings and fingerprint visited websites. While we propose a low-overhead software mitigation to prevent the exploitation of LeakIDT, we emphasize that the side-channel aspect of transient-execution attacks should not be underestimated.
Soil as a natural rain gauge: Estimating global rainfall from satellite soil moisture data

Measuring precipitation intensity is not straightforward; and over many areas, ground observations are lacking and satellite observations are used to fill this gap. The most common way of retrieving rainfall is by addressing the problem “top‐down” by inverting the atmospheric signals reflected or radiated by atmospheric hydrometeors. However, most applications are interested in how much water reaches the ground, a problem that is notoriously difficult to solve from a top‐down perspective. In this study, a novel “bottom‐up” approach is proposed that, by doing “hydrology backward,” uses variations in soil moisture (SM) sensed by microwave satellite sensors to infer preceding rainfall amounts. In other words, the soil is used as a natural rain gauge. Three different satellite SM data sets from the Advanced SCATterometer (ASCAT), the Advanced Microwave Scanning Radiometer (AMSR‐E), and the Microwave Imaging Radiometer with Aperture Synthesis are used to obtain three new daily global rainfall products. The “First Guess Daily” product of the Global Precipitation Climatology Centre (GPCC) is employed as main benchmark in the validation period 2010–2011 for determining the continuous and categorical performance of the SM‐derived rainfall products by considering the 5 day accumulated values. The real‐time version of the Tropical Rainfall Measuring Mission (TRMM) Multisatellite Precipitation Analysis product, i.e., the TRMM‐3B42RT, is adopted as a state‐of‐the‐art satellite rainfall product. The SM‐derived rainfall products show good Pearson correlation values (R) with the GPCC data set, mainly in areas where SM retrievals are found to be accurate. The global median R values (in the latitude band ±50°) are equal to 0.54, 0.28, and 0.31 for ASCAT‐, AMSR‐E‐, and SMOS‐derived products, respectively. For comparison, the median R for the TRMM‐3B42RT product is equal to 0.53. Interestingly, the SM‐derived products are found to outperform TRMM‐3B42RT in terms of average global root‐mean‐square error statistics and in terms of detection of rainfall events. The regions for which the SM‐derived products perform very well are Australia, Spain, South and North Africa, India, China, the Eastern part of South America, and the central part of the United States. The SM‐derived products are found to estimate accurately the rainfall accumulated over a 5 day period, an aspect particularly important for their use for hydrological applications, and that address the difficulties of estimating light rainfall from TRMM‐3B42RT.
Online Equitable Ride-sharing Car Distribution in a Congested Traffic

The usability of ride-sharing services like Uber and Lyft has been considerably improved by advancements in cellular communications. Such a tech-driven transportation system can reduce the number of private cars, in roads with limited physical capacity, effectively match drivers with passengers requesting service, and save drivers and passengers time by optimal scheduling and estimating of the trips. However, the existing services offered by ride-sharing companies may not necessarily reduce congestion, if they are not equitably accessed in urban areas. This paper addresses this important issue by classifying cars as ride-sharing and non-ride-sharing cars and developing a novel dissensus-based traffic evolution dynamics to effectively model their distribution in a shared network of interconnected roads (NOIR). This new dynamics models the ride-sharing car evolution as a non-stationary Markov process with uncertainty matrices decomposed into outflow and tendency probability matrices, where outflow probabilities are constrained by the non-ride-sharing cars behavior, but the tendency probabilities are considered as decision variables (or distributed controls) for achieving an equitable distribution of ride-sharing cars in a congested traffic.
Cross-head mutual Mean-Teaching for semi-supervised medical image segmentation

Semi-supervised medical image segmentation (SSMIS) has witnessed substantial advancements by leveraging limited labeled data and abundant unlabeled data. Nevertheless, existing state-of-the-art (SOTA) methods encounter challenges in accurately predicting labels for the unlabeled data, giving rise to disruptive noise during training and susceptibility to erroneous information overfitting. Moreover, applying perturbations to inaccurate predictions further reduces consistent learning. To address these concerns, we propose a novel Cross-head mutual mean-teaching Network (CMMT-Net) incorporated strong-weak data augmentation, thereby benefitting both self-training and consistency learning. Specifically, our CMMT-Net consists of both teacher-student peer networks with a share encoder and dual slightly different decoders, and the pseudo labels generated by one mean teacher head are adopted to supervise the other student branch to achieve a mutual consistency. Furthermore, we propose mutual virtual adversarial training (MVAT) to smooth the decision boundary and enhance feature representations. To diversify the consistency training samples, we employ Cross-Set CutMix strategy, which also helps address distribution mismatch issues. Notably, CMMT-Net simultaneously implements data, feature, and network perturbations, amplifying model diversity and generalization performance. Experimental results on three publicly available datasets indicate that our approach yields remarkable improvements over previous SOTA methods across various semi-supervised scenarios. Code and logs will be available at https://github.com/Leesoon1984/CMMT-Net.
Topology-Aware Neural Networks for Fast Contingency Analysis of Power Systems

Training Neural Networks able to capture the topology changes of the power grid is one of the significant challenges towards the adoption of machine learning techniques for N-k security computations and a wide range of other operations that involve grid reconfiguration. As the number of N-k scenarios increases exponentially with increasing system size this renders such problems extremely time-consuming to solve with traditional solvers. In this paper, we combine Physics-Informed Neural Networks with both a Guided-Dropout (GD) Neural Network (which associates dedicated neurons with specific line connections/disconnections) and an edge-varrying Graph Neural Neural Network (GNN) architecture to learn the setpoints for a grid that considers all probable single-line reconfigurations (all critical N-1 scenarios) and subsequently apply the trained models to N-k scenarios.We demonstrate how incorporating the underlying physical equations for the network equations within the training procedure of the GD and the GNN architectures, performs with N-1, N-2, and N-3 case studies. Using the AC Power Flow as a guiding application, we test our methods on the 14-bus, 30-bus, 57-bus, and 118-bus systems. We find that these topology-aware NNs not only achieve the task of contingency screening with satisfactory accuracy but do this at up to 1000 times faster than the Newton Raphson power flow solver. Moreover, our results provide a comparison of the GD and GNN models in terms of accuracy and computational speed and provide recommendations on their adoption for contingency analysis of power systems.
Strongly subradiant states in planar atomic arrays

The optically trapped ensembles of atoms provide a versatile platform for storing and coherent manipulation of quantum information. However, efficient realization of quantum information processing requires long-lived quantum states protected from the decoherence e.g. via spontaneous emission. Here, we theoretically study collective dipolar oscillations in finite planar arrays of quantum emitters in free space and analyze mechanisms that govern the emergence of strongly subradiant collective states. We demonstrate that the external coupling between the collective states associated with the symmetry of the array and with the quasi-flat dispersion of the corresponding infinite lattice plays a crucial role in the boost of their radiative lifetime. We show that among different regular arrangements of the atoms the square atomic arrays support eigenstates with minimal radiative losses ∝ N tot − 5 $\propto {N}_{\text{tot}}^{-5}$ scaled with the total number of atoms N tot.
Deconstructing Cooperation and Ostracism via Multi-Agent Reinforcement Learning

Cooperation is challenging in biological systems, human societies, and multi-agent systems in general. While a group can benefit when everyone cooperates, it is tempting for each agent to act selfishly instead. Prior human studies show that people can overcome such social dilemmas while choosing interaction partners, i.e., strategic network rewiring. However, little is known about how agents, including humans, can learn about cooperation from strategic rewiring and vice versa. Here, we perform multi-agent reinforcement learning simulations in which two agents play the Prisoner's Dilemma game iteratively. Each agent has two policies: one controls whether to cooperate or defect; the other controls whether to rewire connections with another agent. This setting enables us to disentangle complex causal dynamics between cooperation and network rewiring. We find that network rewiring facilitates mutual cooperation even when one agent always offers cooperation, which is vulnerable to free-riding. We then confirm that the network-rewiring effect is exerted through agents' learning of ostracism, that is, connecting to cooperators and disconnecting from defectors. However, we also find that ostracism alone is not sufficient to make cooperation emerge. Instead, ostracism emerges from the learning of cooperation, and existing cooperation is subsequently reinforced due to the presence of ostracism. Our findings provide insights into the conditions and mechanisms necessary for the emergence of cooperation with network rewiring.
Diffusion Random Feature Model

Diffusion probabilistic models have been successfully used to generate data from noise. However, most diffusion models are computationally expensive and difficult to interpret with a lack of theoretical justification. Random feature models on the other hand have gained popularity due to their interpretability but their application to complex machine learning tasks remains limited. In this work, we present a diffusion model-inspired deep random feature model that is interpretable and gives comparable numerical results to a fully connected neural network having the same number of trainable parameters. Specifically, we extend existing results for random features and derive generalization bounds between the distribution of sampled data and the true distribution using properties of score matching. We validate our findings by generating samples on the fashion MNIST dataset and instrumental audio data.
Rationale-Enhanced Language Models are Better Continual Relation Learners

Continual relation extraction (CRE) aims to solve the problem of catastrophic forgetting when learning a sequence of newly emerging relations. Recent CRE studies have found that catastrophic forgetting arises from the model's lack of robustness against future analogous relations. To address the issue, we introduce rationale, i.e., the explanations of relation classification results generated by large language models (LLM), into CRE task. Specifically, we design the multi-task rationale tuning strategy to help the model learn current relations robustly. We also conduct contrastive rationale replay to further distinguish analogous relations. Experimental results on two standard benchmarks demonstrate that our method outperforms the state-of-the-art CRE models.
Enhancing the Authenticity of Rendered Portraits with Identity-Consistent Transfer Learning

Despite rapid advances in computer graphics, creating high-quality photo-realistic virtual portraits is prohibitively expensive. Furthermore, the well-know ''uncanny valley'' effect in rendered portraits has a significant impact on the user experience, especially when the depiction closely resembles a human likeness, where any minor artifacts can evoke feelings of eeriness and repulsiveness. In this paper, we present a novel photo-realistic portrait generation framework that can effectively mitigate the ''uncanny valley'' effect and improve the overall authenticity of rendered portraits. Our key idea is to employ transfer learning to learn an identity-consistent mapping from the latent space of rendered portraits to that of real portraits. During the inference stage, the input portrait of an avatar can be directly transferred to a realistic portrait by changing its appearance style while maintaining the facial identity. To this end, we collect a new dataset, Daz-Rendered-Faces-HQ (DRFHQ), that is specifically designed for rendering-style portraits. We leverage this dataset to fine-tune the StyleGAN2 generator, using our carefully crafted framework, which helps to preserve the geometric and color features relevant to facial identity. We evaluate our framework using portraits with diverse gender, age, and race variations. Qualitative and quantitative evaluations and ablation studies show the advantages of our method compared to state-of-the-art approaches.
SPADE: Sparsity-Guided Debugging for Deep Neural Networks

Interpretability, broadly defined as mechanisms for understanding why and how machine learning models reach their decisions, is one of the key open goals at the intersection of deep learning theory and practice. Towards this goal, multiple tools have been proposed to aid a human examiner in reasoning about a network's behavior in general or on a set of instances. However, the outputs of these tools-such as input saliency maps or neuron visualizations-are frequently difficult for a human to interpret, or even misleading, due, in particular, to the fact that neurons can be multifaceted, i.e., a single neuron can be associated with multiple distinct feature combinations. In this paper, we present a new general approach to address this problem, called SPADE, which, given a trained model and a target sample, uses sample-targeted pruning to provide a"trace"of the network's execution on the sample, reducing the network to the connections that are most relevant to the specific prediction. We demonstrate that preprocessing with SPADE significantly increases both the accuracy of image saliency maps across several interpretability methods and the usefulness of neuron visualizations, aiding humans in reasoning about network behavior. Our findings show that sample-specific pruning of connections can disentangle multifaceted neurons, leading to consistently improved interpretability.
Variety and origin of magmas on Shatsky Rise, northwest Pacific Ocean

Shatsky Rise consists of thick (∼30 km maximum) basaltic crust with various geochemical compositions. Geochemistry data indicate that four magma types exist on the plateau; namely normal, low‐Ti, high‐Nb, and U1349 types. The normal type is the most abundant in volume and appears on all three large edifices of the plateau: Tamu, Ori, and Shirshov massifs. Composition of the normal type is similar to normal mid‐ocean ridge basalt (N‐MORB) composition, but with slight relative enrichment of the more incompatible elements. The low‐Ti type is distinguished from the normal type basalt by slightly lower Ti content at a given MgO. Composition of the high‐Nb type is characterized by distinctively high contents of incompatible trace elements. U1349 type basalts are composed of more primitive and depleted compositions compared with the others. The normal type basalts constitute ∼94% of the lava units of the oldest Tamu Massif and non‐normal types (i.e., the other three types) basalts comprise ∼57% on the younger Ori Massif, implying that geochemical compositions may have become heterogeneous with time. Petrological examination demonstrates that compositions of the normal‐, low‐Ti‐, and high‐Nb‐type basalts evolved through fractional crystallization of olivine, plagioclase, and augite in shallow magma chambers (<200 MPa). Model calculations of immobile trace elements estimate that the normal type basalt can be formed by ∼15% melting of a depleted mantle source in the presence of residual garnet. This degree of melting is similar to N‐MORB, but the larger effect of residual garnet during petrogenesis implies that a greater depth of melting.
A Survey of Large Language Models for Healthcare: from Data, Technology, and Applications to Accountability and Ethics

The utilization of large language models (LLMs) in the Healthcare domain has generated both excitement and concern due to their ability to effectively respond to freetext queries with certain professional knowledge. This survey outlines the capabilities of the currently developed LLMs for Healthcare and explicates their development process, with the aim of providing an overview of the development roadmap from traditional Pretrained Language Models (PLMs) to LLMs. Specifically, we first explore the potential of LLMs to enhance the efficiency and effectiveness of various Healthcare applications highlighting both the strengths and limitations. Secondly, we conduct a comparison between the previous PLMs and the latest LLMs, as well as comparing various LLMs with each other. Then we summarize related Healthcare training data, training methods, optimization strategies, and usage. Finally, the unique concerns associated with deploying LLMs in Healthcare settings are investigated, particularly regarding fairness, accountability, transparency and ethics. Our survey provide a comprehensive investigation from perspectives of both computer science and Healthcare specialty. Besides the discussion about Healthcare concerns, we supports the computer science community by compiling a collection of open source resources, such as accessible datasets, the latest methodologies, code implementations, and evaluation benchmarks in the Github. Summarily, we contend that a significant paradigm shift is underway, transitioning from PLMs to LLMs. This shift encompasses a move from discriminative AI approaches to generative AI approaches, as well as a shift from model-centered methodologies to datacentered methodologies.
Real diffusion with complex spectral gap

The low-lying eigenvalues of the generator of a Langevin process are known to satisfy the Eyring-Kramers law in the low temperature regime under suitable assumptions. These eigenvalues are generically real. We construct generators whose spectral gap is given by non-real eigenvalues or by a real eigenvalue having a Jordan block.
Optimal Exploration is no harder than Thompson Sampling

Given a set of arms $\mathcal{Z}\subset \mathbb{R}^d$ and an unknown parameter vector $\theta_\ast\in\mathbb{R}^d$, the pure exploration linear bandit problem aims to return $\arg\max_{z\in \mathcal{Z}} z^{\top}\theta_{\ast}$, with high probability through noisy measurements of $x^{\top}\theta_{\ast}$ with $x\in \mathcal{X}\subset \mathbb{R}^d$. Existing (asymptotically) optimal methods require either a) potentially costly projections for each arm $z\in \mathcal{Z}$ or b) explicitly maintaining a subset of $\mathcal{Z}$ under consideration at each time. This complexity is at odds with the popular and simple Thompson Sampling algorithm for regret minimization, which just requires access to a posterior sampling and argmax oracle, and does not need to enumerate $\mathcal{Z}$ at any point. Unfortunately, Thompson sampling is known to be sub-optimal for pure exploration. In this work, we pose a natural question: is there an algorithm that can explore optimally and only needs the same computational primitives as Thompson Sampling? We answer the question in the affirmative. We provide an algorithm that leverages only sampling and argmax oracles and achieves an exponential convergence rate, with the exponent being the optimal among all possible allocations asymptotically. In addition, we show that our algorithm can be easily implemented and performs as well empirically as existing asymptotically optimal methods.