Miracle-dz/UniFAR-FTUs huggingface dataset:
Lay representations on climate change

Lay representations on climate change were mapped via the free-word association method in two pilot studies. Participants were asked to generate words associated to “the big problems faced by humankind nowadays” (1 study) and to “climate change” (2 study). Climate change was not spontaneously evoked by the participants in the first study: pollution was among the top 10 problems, but references to other environmental issues were very low. In the second study, climate change was considered as a threat, and it was associated with diseases, death and destruction. Possible mitigation actions were mentioned by only 4% of the participants, which portrayed themselves as potential victims rather than potential actors of mitigation actions. Results suggest that feelings of risk associated with climate change are not closely related with pro-environment behaviours.
Calibration of SMOS Soil Moisture Retrieval Algorithm: A Case of Tropical Site in Malaysia

Soil Moisture and Ocean Salinity (SMOS) mission has successfully contributed to global soil moisture products since 2009. Validation and calibration activities were conducted worldwide, yet some of the validation results do not fulfill the targeted accuracy of ±0.04 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>. This paper presented the site-specific calibration of the V620 retrieval algorithm with <italic>in situ</italic> data collected at selected agricultural sites in the humid tropical regions, Malaysia. This set of data has been validated where low accuracy of SMOS soil moisture products was found. To improve the SMOS soil moisture retrieval, calibration of SMOS soil moisture retrieval algorithm based on the L-band Microwave Emission and Biosphere model and SMOS Level 1C <inline-formula> <tex-math notation="LaTeX">$\text{T}_{\mathrm {B}}$ </tex-math></inline-formula> products, considering the local parameters was conducted. The calibration proves that these site-specific parameters improve the product’s accuracy. Validation of SMOS Level 2 product with <italic>in situ</italic> data showed bias, root-mean-square error (RMSE), and unbiased RMSE (ubRMSE) ranging from 0.050 to 0.118 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>, 0.068 to 0.142 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>, and 0.069 to 0.103 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>, respectively. The soil moisture retrieval based on the calibrated model showed an improved bias of 0.020–0.056 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text {m}^{-3}$ </tex-math></inline-formula> and RMSE of 0.026–0.065 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>. The ubRMSE ranges from 0.017 to 0.034 <inline-formula> <tex-math notation="LaTeX">$\text{m}^{3}\text{m}^{-3}$ </tex-math></inline-formula>. Recently released SMOS-IC V105 product was also validated, where small improvements were noticed when compared to the accuracy of SMOS Level 2. This paper shows the importance of local parameters in retrieving soil moisture with higher accuracy compared to the use of global generalized parameters that are used in the original SMOS soil moisture retrieval algorithm.
AI4GCC - Track 3: Consumption and the Challenges of Multi-Agent RL

The AI4GCC competition presents a bold step forward in the direction of integrating machine learning with traditional economic policy analysis. Below, we highlight two potential areas for improvement that could enhance the competition's ability to identify and evaluate proposed negotiation protocols. Firstly, we suggest the inclusion of an additional index that accounts for consumption/utility as part of the evaluation criteria. Secondly, we recommend further investigation into the learning dynamics of agents in the simulator and the game theoretic properties of outcomes from proposed negotiation protocols. We hope that these suggestions can be of use for future iterations of the competition/simulation.
Prostate Age Gap (PAG): An MRI surrogate marker of aging for prostate cancer detection

Background: Prostate cancer (PC) MRI-based risk calculators are commonly based on biological (e.g. PSA), MRI markers (e.g. volume), and patient age. Whilst patient age measures the amount of years an individual has existed, biological age (BA) might better reflect the physiology of an individual. However, surrogates from prostate MRI and linkage with clinically significant PC (csPC) remain to be explored. Purpose: To obtain and evaluate Prostate Age Gap (PAG) as an MRI marker tool for csPC risk. Study type: Retrospective. Population: A total of 7243 prostate MRI slices from 468 participants who had undergone prostate biopsies. A deep learning model was trained on 3223 MRI slices cropped around the gland from 81 low-grade PC (ncsPC, Gleason score<=6) and 131 negative cases and tested on the remaining 256 participants. Assessment: Chronological age was defined as the age of the participant at the time of the visit and used to train the deep learning model to predict the age of the patient. Following, we obtained PAG, defined as the model predicted age minus the patient's chronological age. Multivariate logistic regression models were used to estimate the association through odds ratio (OR) and predictive value of PAG and compared against PSA levels and PI-RADS>=3. Statistical tests: T-test, Mann-Whitney U test, Permutation test and ROC curve analysis. Results: The multivariate adjusted model showed a significant difference in the odds of clinically significant PC (csPC, Gleason score>=7) (OR =3.78, 95% confidence interval (CI):2.32-6.16, P<. 001). PAG showed a better predictive ability when compared to PI-RADS>=3 and adjusted by other risk factors, including PSA levels: AUC =0.981 vs AUC =0.704, p<. 001. Conclusion: PAG was significantly associated with the risk of clinically significant PC and outperformed other well-established PC risk factors.
Measuring Renyi Entropy in Neural Network Quantum States

We compute the Renyi entropy in a one-dimensional transverse-field quantum Ising model by employing a swapping operator acting on the states which are prepared from the neural network methods. In the static ground state, Renyi entropy can uncover the critical point of the quantum phase transition from paramagnetic to ferromagnetic. At the critical point, the relation between the Renyi entropy and the subsystem size satisfies the predictions from conformal field theory. In the dynamical case, we find coherent oscillations of the Renyi entropy after the end of the linear quench. These oscillations have universal frequencies which may come from the superpositions of excited states. The asymptotic form of the Renyi entropy implies a new length scale away from the critical point. This length scale is also verified by the overlap of the reduced Renyi entropy against the dimensionless subsystem size.
Effect of eHMI on pedestrian road crossing behavior in shared space with Automated Vehicles - A Virtual Reality study

A shared space area is a low-speed urban area in which pedestrians, cyclists, and vehicles share the road, often relying on informal interaction rules and greatly expanding freedom of movement for pedestrians and cyclists. While shared space has the potential to improve pedestrian priority in urban areas, it presents unique challenges for pedestrian-AV interaction due to the absence of a clear right of way. The current study applied Virtual Reality (VR) experiments to investigate pedestrian-AV interaction in a shared space, with a particular focus on the impact of external human-machine interfaces (eHMIs) on pedestrian crossing behavior. Fifty-three participants took part in the VR experiment and three eHMI conditions were investigated: no eHMI, eHMI with a pedestrian sign on the windshield, and eHMI with a projected zebra crossing on the road. Data collected via VR and questionnaires were used for objective and subjective measures to understand pedestrian-AV interaction. The study revealed that the presence of eHMI had an impact on participants' gazing behavior but not on their crossing decisions. Additionally, participants had a positive user experience with the current VR setting and expressed a high level of trust and perceived safety during their interaction with the AV. These findings highlight the potential of utilizing VR to explore and understand pedestrian-AV interactions.
A Preliminary Evaluation of LLM-Based Fault Localization

Large Language Models (LLMs) have shown a surprising level of performance on multiple software engineering problems. However, they have not yet been applied to Fault Localization (FL), in which one must find the code element responsible for a bug from a potentially vast codebase. Nonetheless, LLM application to FL has the potential to benefit developers both in terms of performance and explainability. In this work, we present AutoFL, an automated fault localization technique that only requires a single failing test, and in its fault localization process generates an explanation about why the given test fails. Using the function call API of the OpenAI LLM, ChatGPT, we provide tools that allow it to explore a large source code repository, which would otherwise pose a significant challenge as it would be impossible to fit all the source code within the limited prompt length. Our results indicate that, on the widely used Defects4J benchmark, AutoFL can identify the faulty method on the first try more often than all standalone techniques we compared against from prior work. Nonetheless, there is ample room to improve performance, and we encourage further experimentation of language model-based FL as a promising research area.
MapTRv2: An End-to-End Framework for Online Vectorized HD Map Construction

High-definition (HD) map provides abundant and precise static environmental information of the driving scene, serving as a fundamental and indispensable component for planning in autonomous driving system. In this paper, we present \textbf{Map} \textbf{TR}ansformer, an end-to-end framework for online vectorized HD map construction. We propose a unified permutation-equivalent modeling approach, \ie, modeling map element as a point set with a group of equivalent permutations, which accurately describes the shape of map element and stabilizes the learning process. We design a hierarchical query embedding scheme to flexibly encode structured map information and perform hierarchical bipartite matching for map element learning. To speed up convergence, we further introduce auxiliary one-to-many matching and dense supervision. The proposed method well copes with various map elements with arbitrary shapes. It runs at real-time inference speed and achieves state-of-the-art performance on both nuScenes and Argoverse2 datasets. Abundant qualitative results show stable and robust map construction quality in complex and various driving scenes. Code and more demos are available at \url{https://github.com/hustvl/MapTR} for facilitating further studies and applications.
Decoding Layer Saliency in Language Transformers

In this paper, we introduce a strategy for identifying textual saliency in large-scale language models applied to classification tasks. In visual networks where saliency is more well-studied, saliency is naturally localized through the convolutional layers of the network; however, the same is not true in modern transformer-stack networks used to process natural language. We adapt gradient-based saliency methods for these networks, propose a method for evaluating the degree of semantic coherence of each layer, and demonstrate consistent improvement over numerous other methods for textual saliency on multiple benchmark classification datasets. Our approach requires no additional training or access to labelled data, and is comparatively very computationally efficient.
Informative Scene Graph Generation via Debiasing

Scene graph generation aims to detect visual relationship triplets, (subject, predicate, object). Due to biases in data, current models tend to predict common predicates, e.g."on"and"at", instead of informative ones, e.g."standing on"and"looking at". This tendency results in the loss of precise information and overall performance. If a model only uses"stone on road"rather than"stone blocking road"to describe an image, it may be a grave misunderstanding. We argue that this phenomenon is caused by two imbalances: semantic space level imbalance and training sample level imbalance. For this problem, we propose DB-SGG, an effective framework based on debiasing but not the conventional distribution fitting. It integrates two components: Semantic Debiasing (SD) and Balanced Predicate Learning (BPL), for these imbalances. SD utilizes a confusion matrix and a bipartite graph to construct predicate relationships. BPL adopts a random undersampling strategy and an ambiguity removing strategy to focus on informative predicates. Benefiting from the model-agnostic process, our method can be easily applied to SGG models and outperforms Transformer by 136.3%, 119.5%, and 122.6% on mR@20 at three SGG sub-tasks on the SGG-VG dataset. Our method is further verified on another complex SGG dataset (SGG-GQA) and two downstream tasks (sentence-to-graph retrieval and image captioning).
NUPES : Non-Uniform Post-Training Quantization via Power Exponent Search

Deep neural network (DNN) deployment has been confined to larger hardware devices due to their expensive computational requirements. This challenge has recently reached another scale with the emergence of large language models (LLMs). In order to reduce both their memory footprint and latency, a promising technique is quantization. It consists in converting floating point representations to low bit-width fixed point representations, usually by assuming a uniform mapping onto a regular grid. This process, referred to in the literature as uniform quantization, may however be ill-suited as most DNN weights and activations follow a bell-shaped distribution. This is even worse on LLMs whose weight distributions are known to exhibit large, high impact, outlier values. In this work, we propose an improvement over the most commonly adopted way to tackle this limitation in deep learning models quantization, namely, non-uniform quantization. NUPES leverages automorphisms to preserve the scalar multiplications. Such transformations are derived from power functions. However, the optimization of the exponent parameter and weight values remains a challenging and novel problem which could not be solved with previous post training optimization techniques which only learn to round up or down weight values in order to preserve the predictive function. We circumvent this limitation with a new paradigm: learning new quantized weights over the entire quantized space. Similarly, we enable the optimization of the power exponent, i.e. the optimization of the quantization operator itself during training by alleviating all the numerical instabilities. The resulting predictive function is compatible with integer-only low-bit inference. We show the ability of the method to achieve state-of-the-art compression rates in both, data-free and data-driven configurations.
Surface Masked AutoEncoder: Self-Supervision for Cortical Imaging Data

Self-supervision has been widely explored as a means of addressing the lack of inductive biases in vision transformer architectures, which limits generalisation when networks are trained on small datasets. This is crucial in the context of cortical imaging, where phenotypes are complex and heterogeneous, but the available datasets are limited in size. This paper builds upon recent advancements in translating vision transformers to surface meshes and investigates the potential of Masked AutoEncoder (MAE) self-supervision for cortical surface learning. By reconstructing surface data from a masked version of the input, the proposed method effectively models cortical structure to learn strong representations that translate to improved performance in downstream tasks. We evaluate our approach on cortical phenotype regression using the developing Human Connectome Project (dHCP) and demonstrate that pre-training leads to a 26\% improvement in performance, with an 80\% faster convergence, compared to models trained from scratch. Furthermore, we establish that pre-training vision transformer models on large datasets, such as the UK Biobank (UKB), enables the acquisition of robust representations for finetuning in low-data scenarios. Our code and pre-trained models are publicly available at \url{https://github.com/metrics-lab/surface-vision-transformers}.
Multi-domain Recommendation with Embedding Disentangling and Domain Alignment

Multi-domain recommendation (MDR) aims to provide recommendations for different domains (e.g., types of products) with overlapping users/items and is common for platforms such as Amazon, Facebook, and LinkedIn that host multiple services. Existing MDR models face two challenges: First, it is difficult to disentangle knowledge that generalizes across domains (e.g., a user likes cheap items) and knowledge specific to a single domain (e.g., a user likes blue clothing but not blue cars). Second, they have limited ability to transfer knowledge across domains with small overlaps. We propose a new MDR method named EDDA with two key components, i.e., embedding disentangling recommender and domain alignment, to tackle the two challenges respectively. In particular, the embedding disentangling recommender separates both the model and embedding for the inter-domain part and the intra-domain part, while most existing MDR methods only focus on model-level disentangling. The domain alignment leverages random walks from graph processing to identify similar user/item pairs from different domains and encourages similar user/item pairs to have similar embeddings, enhancing knowledge transfer. We compare EDDA with 12 state-of-the-art baselines on 3 real datasets. The results show that EDDA consistently outperforms the baselines on all datasets and domains. All datasets and codes are available at https://github.com/Stevenn9981/EDDA.
Are Sex-based Physiological Differences the Cause of Gender Bias for Chest X-ray Diagnosis?

While many studies have assessed the fairness of AI algorithms in the medical field, the causes of differences in prediction performance are often unknown. This lack of knowledge about the causes of bias hampers the efficacy of bias mitigation, as evidenced by the fact that simple dataset balancing still often performs best in reducing performance gaps but is unable to resolve all performance differences. In this work, we investigate the causes of gender bias in machine learning-based chest X-ray diagnosis. In particular, we explore the hypothesis that breast tissue leads to underexposure of the lungs and causes lower model performance. Methodologically, we propose a new sampling method which addresses the highly skewed distribution of recordings per patient in two widely used public datasets, while at the same time reducing the impact of label errors. Our comprehensive analysis of gender differences across diseases, datasets, and gender representations in the training set shows that dataset imbalance is not the sole cause of performance differences. Moreover, relative group performance differs strongly between datasets, indicating important dataset-specific factors influencing male/female group performance. Finally, we investigate the effect of breast tissue more specifically, by cropping out the breasts from recordings, finding that this does not resolve the observed performance gaps. In conclusion, our results indicate that dataset-specific factors, not fundamental physiological differences, are the main drivers of male--female performance gaps in chest X-ray analyses on widely used NIH and CheXpert Dataset.
Deep Richardson-Lucy Deconvolution for Low-Light Image Deblurring

Images taken under the low-light condition often contain blur and saturated pixels at the same time. Deblurring images with saturated pixels is quite challenging. Because of the limited dynamic range, the saturated pixels are usually clipped in the imaging process and thus cannot be modeled by the linear blur model. Previous methods use manually designed smooth functions to approximate the clipping procedure. Their deblurring processes often require empirically defined parameters, which may not be the optimal choices for different images. In this paper, we develop a data-driven approach to model the saturated pixels by a learned latent map. Based on the new model, the non-blind deblurring task can be formulated into a maximum a posterior (MAP) problem, which can be effectively solved by iteratively computing the latent map and the latent image. Specifically, the latent map is computed by learning from a map estimation network (MEN), and the latent image estimation process is implemented by a Richardson-Lucy (RL)-based updating scheme. To estimate high-quality deblurred images without amplified artifacts, we develop a prior estimation network (PEN) to obtain prior information, which is further integrated into the RL scheme. Experimental results demonstrate that the proposed method performs favorably against state-of-the-art algorithms both quantitatively and qualitatively on synthetic and real-world images.
Interacting Tachyonic Scalar Field III

This study explores the plausibility of an interacting tachyonic scalar, homogeneous in nature, as a promising candidate for dynamic dark energy, offering insights into the observed accelerated expansion of the universe. The parameterization of the interaction between the tachyonic field, matter, and Hubble's parameter is performed linearly. The analysis focuses on fundamental cosmological parameters in a flat universe $(K = 0)$: expansion rate, universe age, energy density evolution for matter and the tachyonic field. The study also examines the coupling strength between the tachyonic field and matter, revealing a maximum value of unity when the interaction depends solely on their energy densities. Combining them also yields an upper limit of unity (precisely 0.7) for the coupling strength.
High-Level Parallelism and Nested Features for Dynamic Inference Cost and Top-Down Attention

This paper introduces a novel network topology that seamlessly integrates dynamic inference cost with a top-down attention mechanism, addressing two significant gaps in traditional deep learning models. Drawing inspiration from human perception, we combine sequential processing of generic low-level features with parallelism and nesting of high-level features. This design not only reflects a finding from recent neuroscience research regarding - spatially and contextually distinct neural activations - in human cortex, but also introduces a novel"cutout"technique: the ability to selectively activate %segments of the network for task-relevant only network segments of task-relevant categories to optimize inference cost and eliminate the need for re-training. We believe this paves the way for future network designs that are lightweight and adaptable, making them suitable for a wide range of applications, from compact edge devices to large-scale clouds. Our proposed topology also comes with a built-in top-down attention mechanism, which allows processing to be directly influenced by either enhancing or inhibiting category-specific high-level features, drawing parallels to the selective attention mechanism observed in human cognition. Using targeted external signals, we experimentally enhanced predictions across all tested models. In terms of dynamic inference cost our methodology can achieve an exclusion of up to $73.48\,\%$ of parameters and $84.41\,\%$ fewer giga-multiply-accumulate (GMAC) operations, analysis against comparative baselines show an average reduction of $40\,\%$ in parameters and $8\,\%$ in GMACs across the cases we evaluated.