Miracle-dz/UniFAR-FTUs huggingface dataset:
H2S donor S‐propargyl‐cysteine for skin wound healing improvement via smart transdermal delivery

Abstract Hydrogen sulfide for wound healing has drawn a lot of attention recently. In this research, the S‐propargyl‐cysteine (SPRC), an endogenous H2S donor, was loaded on carbomer hydrogel, and a copper sheet rat burn model was developed. Pathological changes in rat skin tissue were examined using hematoxylin–eosin (HE) and Masson staining. The immunohistochemistry (IHC) staining was performed to detect the expression of Collagen I (Col I) and Collagen III (Col III). The mRNA levels of interleukin (IL)‐6, Col Iα2, Col IIIα1, tissue inhibitors of metalloproteinase (TIMP)‐1, matrix metalloproteinase (MMP)‐9, vascular endothelial growth factor (VEGF), and transforming growth factor (TGF)‐β1 were examined by quantitative real‐time chain polymerase reaction. The findings demonstrated that the collagen layer was thicker in the SPRC group during the proliferative phase, SPRC hydrogel promoted VEGF expression. In the late stage of wound healing, the expression of IL‐6, TIMP‐1, MMP‐9, and TGF‐β1 was inhibited, and the Col I content was closer to that of normal tissue. These results surface that SPRC hydrogel can promote wound healing and play a positive role in reducing scar formation. Our results imply that SPRC can facilitate wound healing and play a positive role in reducing scar formation.
Global and Local Prompts Cooperation via Optimal Transport for Federated Learning

Prompt learning in pretrained visual-language models has shown remarkable flexibility across various downstream tasks. Leveraging its inherent lightweight nature, recent research attempted to integrate the powerful pretrained models into federated learning frameworks to simultaneously reduce communication costs and promote local training on insufficient data. Despite these efforts, current federated prompt learning methods lack specialized designs to systematically address severe data heterogeneities, e.g., data distribution with both label and feature shifts involved. To address this challenge, we present Federated Prompts Cooperation via Optimal Transport (FedOTP), which introduces efficient collaborative prompt learning strategies to capture diverse category traits on a per-client basis. Specifically, for each client, we learn a global prompt to extract consensus knowledge among clients, and a local prompt to capture client-specific category characteristics. Unbalanced Optimal Transport is then employed to align local visual features with these prompts, striking a balance between global consensus and local personalization. Extensive experiments on datasets with various types of heterogeneities have demonstrated that our FedOTP outperforms the state-of-the-art methods.
On the Challenges and Opportunities in Generative AI

The field of deep generative modeling has grown rapidly and consistently over the years. With the availability of massive amounts of training data coupled with advances in scalable unsupervised learning paradigms, recent large-scale generative models show tremendous promise in synthesizing high-resolution images and text, as well as structured data such as videos and molecules. However, we argue that current large-scale generative AI models do not sufficiently address several fundamental issues that hinder their widespread adoption across domains. In this work, we aim to identify key unresolved challenges in modern generative AI paradigms that should be tackled to further enhance their capabilities, versatility, and reliability. By identifying these challenges, we aim to provide researchers with valuable insights for exploring fruitful research directions, thereby fostering the development of more robust and accessible generative AI solutions.
A proof of Bott periodicity via Quot schemes and bulk-edge correspondence

In this paper, we give alternative proofs of Bott periodicity of $ K $-theory and the bulk-edge correspondence of integer quantum Hall effect. Regarding Bott periodicity, we connect its proof with configuration spaces and use Quot schemes in algebraic geometry in our proof. Regarding the bulk-edge correspondence, we formulate edge indices based on the consideration of Graf--Porta and give a more elementary and self-contained proof.
Thermodynamic bounds on generalized transport: From single-molecule to bulk observables

We prove that the transport of any scalar observable in $d$-dimensional non-equilibrium systems is bounded from above by the total entropy production scaled by the amount the observation"stretches"microscopic coordinates. The result -- a time-integrated generalized speed limit -- reflects the thermodynamic cost of transport of observables, and places underdamped and overdamped stochastic dynamics on equal footing with deterministic motion. Our work allows for stochastic thermodynamics to make contact with bulk experiments, and fills an important gap in thermodynamic inference, since microscopic dynamics is, at least for short times, underdamped. Requiring only averages but not sample-to-sample fluctuations, the proven transport bound is practical and applicable not only to single-molecule but also bulk experiments where only averages are observed, which we demonstrate by examples. Our results may facilitate thermodynamic inference on molecular machines without an obvious directionality from bulk observations of transients probed, e.g. in time-resolved X-ray scattering.
Creating area level indices of behaviours impacting cancer in Australia with a Bayesian generalised shared component model

This study develops a model-based index creation approach called the Generalized Shared Component Model (GSCM) by drawing on the large field of factor models. The proposed fully Bayesian approach accommodates heteroscedastic model error, multiple shared factors and flexible spatial priors. Moreover, our model, unlike previous index approaches, provides indices with uncertainty. Focusing on Australian risk factor data, the proposed GSCM is used to develop the Area Indices of Behaviors Impacting Cancer product - representing the first area level cancer risk factor index in Australia. This advancement aids in identifying communities with elevated cancer risk, facilitating targeted health interventions.
Improving Acne Image Grading with Label Distribution Smoothing

Acne, a prevalent skin condition, necessitates precise severity assessment for effective treatment. Acne severity grading typically involves lesion counting and global assessment. However, manual grading suffers from variability and inefficiency, highlighting the need for automated tools. Recently, label distribution learning (LDL) was proposed as an effective framework for acne image grading, but its effectiveness is hindered by severity scales that assign varying numbers of lesions to different severity grades. Addressing these limitations, we proposed to incorporate severity scale information into lesion counting by combining LDL with label smoothing, and to decouple if from global assessment. A novel weighting scheme in our approach adjusts the degree of label smoothing based on the severity grading scale. This method helped to effectively manage label uncertainty without compromising class distinctiveness. Applied to the benchmark ACNE04 dataset, our model demonstrated improved performance in automated acne grading, showcasing its potential in enhancing acne diagnostics. The source code is publicly available at http://github.com/openface-io/acne-lds.
Extracting Polymer Nanocomposite Samples from Full-Length Documents

This paper investigates the use of large language models (LLMs) for extracting sample lists of polymer nanocomposites (PNCs) from full-length materials science research papers. The challenge lies in the complex nature of PNC samples, which have numerous attributes scattered throughout the text. The complexity of annotating detailed information on PNCs limits the availability of data, making conventional document-level relation extraction techniques impractical due to the challenge in creating comprehensive named entity span annotations. To address this, we introduce a new benchmark and an evaluation technique for this task and explore different prompting strategies in a zero-shot manner. We also incorporate self-consistency to improve the performance. Our findings show that even advanced LLMs struggle to extract all of the samples from an article. Finally, we analyze the errors encountered in this process, categorizing them into three main challenges, and discuss potential strategies for future research to overcome them.
Tracing the origin of Southwest Japan using the Hf isotopic composition of detrital zircons from the Akiyoshi Belt

The Permian Akiyoshi Belt, which is the oldest unmetamorphosed accretionary complex in Southwest Japan, plays an important role in understanding the origin of the Japanese Islands; however, its tectonic affinity is still not well constrained. Herein, we present the first Hf isotopic data for U–Pb dated detrital zircons of the Late Permian sandstones in the Akiyoshi Belt. Almost all the late Palaeozoic detrital zircons yielded highly positive ɛHf (t) values compatible with a juvenile source, suggesting that the major provenance of the trench sediments was from the South China block and not from the Bureya‐Jiamusi‐Khanka massif. We propose that in the late Palaeozoic, a block of juvenile lower crust existed outboard of the South China block, and it was being melted during the westward subduction of the Palaeo‐Pacific oceanic plate to produce voluminous volcanic and plutonic rocks with positive ɛHf (t) values.
The Price of Fairness in Bipartite Matching

We investigate notions of group fairness in bipartite matching markets involving agents and jobs, where agents are grouped based on sensitive attributes. Employing a geometric approach, we characterize how many agents can be matched in each group, showing that the set of feasible matchings forms a (discrete) polymatroid. We show how we can define weakly-fair matchings geometrically, for which poly-matroid properties imply that they are maximal. Next, we focus on strong fairness notions (inspired by group-fairness metrics in machine learning), where each group gets their exact same fraction of their entitlement, and we explore the Price of Fairness (PoF), i.e., the loss in optimality when imposing such fairness constraints. Importantly, we advocate for the notion of opportunity fairness, where a group entitlement is the maximum number of agents that can be matched without the presence of other competing groups. We show that the opportunity PoF is bounded independently of the number of agents and jobs, but may be linear in the number of groups. Finally, we provide improved bounds with additional structural properties, or with stochastic graphs.
Geometry-free renormalization of directed networks: scale-invariance and reciprocity

Recent research has tried to extend the concept of renormalization, which is naturally defined for geometric objects, to more general networks with arbitrary topology. The current attempts do not naturally apply to directed networks, for instance because they are based on the identification of (necessarily symmetric) inter-node distances arising from geometric embeddings or on the definition of Hermitian Laplacian operators requiring symmetric adjacency matrices in spectral approaches. Here we show that the Scale-Invariant Model, recently proposed as an approach to consistently model undirected networks at arbitrary (and possibly multi-scale) resolution levels, can be extended coherently to directed networks without the requirement of an embedding geometry or Laplacian structure. Moreover, it can account for nontrivial reciprocity, i.e. the empirically well-documented tendency of links to occur in mutual pairs more or less often than predicted by chance. After deriving the renormalization rules for networks with arbitrary reciprocity, we consider various examples. In particular we propose the first multiscale model of the international trade network with nontrivial reciprocity and an annealed model where positive reciprocity emerges spontaneously from coarse-graining. In the latter case, the renormalization process defines a group, not only a semigroup, and therefore allows to fine-grain networks to arbitrarily small scales. These results strengthen the notion that network renormalization can be defined in a much more general way than required by geometric or spectral approaches, because it needs only node-specific (metric-free) features and can coexist with the asymmetry of directed networks.
Federated Linear Contextual Bandits with Heterogeneous Clients

The demand for collaborative and private bandit learning across multiple agents is surging due to the growing quantity of data generated from distributed systems. Federated bandit learning has emerged as a promising framework for private, efficient, and decentralized online learning. However, almost all previous works rely on strong assumptions of client homogeneity, i.e., all participating clients shall share the same bandit model; otherwise, they all would suffer linear regret. This greatly restricts the application of federated bandit learning in practice. In this work, we introduce a new approach for federated bandits for heterogeneous clients, which clusters clients for collaborative bandit learning under the federated learning setting. Our proposed algorithm achieves non-trivial sub-linear regret and communication cost for all clients, subject to the communication protocol under federated learning that at anytime only one model can be shared by the server.
SEED: Customize Large Language Models with Sample-Efficient Adaptation for Code Generation

Although Large Language Models (LLMs) have made significant progress in code generation, they still struggle with code generation tasks in specific scenarios. These scenarios usually necessitate the adaptation of LLMs to fulfill specific needs, but the limited training samples available in practice lead to poor code generation performance. Therefore, how to effectively adapt LLMs to new scenarios with few training samples is a major challenge for current code generation. In this paper, we propose a novel adaptation approach named SEED, which stands for Sample-Efficient adaptation with Error-Driven learning for code generation. SEED leverages the errors made by LLMs as learning opportunities, using error revision to overcome its own shortcomings, thus achieving efficient learning. Specifically, SEED involves identifying error code generated by LLMs, employing Self-revise for code revision, optimizing the model with revised code, and iteratively adapting the process for continuous improvement. Experimental results show that, compared to other mainstream fine-tuning approaches, SEED achieves superior performance with few training samples, showing an average relative improvement of 54.7% in Pass@1 on multiple code generation benchmarks. We also validate the effectiveness of Self-revise, which generates revised code that optimizes the model more efficiently compared to the code samples from datasets. Moreover, SEED consistently demonstrates strong performance across various LLMs, underscoring its generalizability.
Operators' cognitive performance under extreme hot-humid exposure and its physiological-psychological mechanism based on ECG, fNIRS, and Eye Tracking

Operators' cognitive functions are impaired significantly under extreme heat stress, potentially resulting in more severe secondary disasters. This research investigated the impact of elevated temperature and humidity (25 60%RH, 30 70%RH, 35 80%RH, 40 90%RH) on the cognitive functions and performance of operators. Meanwhile, we explored the psychological-physiological mechanism underlying the change in performance by electrocardiogram (ECG), functional near-infrared spectroscopy (fNIRS), and eye tracking physiologically. Psychological aspects such as situation awareness, workload, and working memory were assessed. Eventually, we verified and extended the maximal adaptability model to the extreme condition. Unexpectedly, a temporary improvement in simple reaction tasks but rapid impairment in advanced cognitive functions (i.e. situation awareness, communication, working memory) was obtained above 35 WBGT. The best performance in a suitable environment was due to more effective activation in the prefrontal cortex (PFC). With temperature increasing, more mistakes occurred and comprehension was impaired due to drowsiness and lower arousal levels, according to evidence of compensatory effect in fNIRS. In the extreme environment, the enhanced PFC cooperation with higher functional connectivity resulted in a temporary improvement, while depressed activation in PFC, heavy physical load, and poor regulation of the cardiovascular system restricted it. Our results provide a detailed study of the process of operators' performance and cognitive functions when encountering increasing heat stress, as well as its underlying mechanisms from a neuroergonomics perspective. This can contribute to a better understanding of the interaction between operators' performance and workplace conditions, and help to achieve a more reliable human-centered production system in the promising era of Industry 5.0.
Evolving to the Future: Unseen Event Adaptive Fake News Detection on Social Media

With the rapid development of social media, the wide dissemination of fake news on social media is increasingly threatening both individuals and society. In the dynamic landscape of social media, fake news detection aims to develop a model trained on news reporting past events. The objective is to predict and identify fake news about future events, which often relate to subjects entirely different from those in the past. However, existing fake detection methods exhibit a lack of robustness and cannot generalize to unseen events. To address this, we introduce Future ADaptive Event-based Fake news Detection (FADE) framework. Specifically, we train a target predictor through an adaptive augmentation strategy and graph contrastive learning to make more robust overall predictions. Simultaneously, we independently train an event-only predictor to obtain biased predictions. Then we further mitigate event bias by obtaining the final prediction by subtracting the output of the event-only predictor from the output of the target predictor. Encouraging results from experiments designed to emulate real-world social media conditions validate the effectiveness of our method in comparison to existing state-of-the-art approaches.
Continuous Approximations of Projected Dynamical Systems via Control Barrier Functions

Projected Dynamical Systems (PDSs) form a class of discontinuous constrained dynamical systems, and have been used widely to solve optimization problems and variational inequalities. Recently, they have also gained significant attention for control purposes, such as high-performance integrators, saturated control and feedback optimization. In this work, we establish that locally Lipschitz continuous dynamics, involving Control Barrier Functions (CBFs), namely CBF-based dynamics, approximate PDSs. Specifically, we prove that trajectories of CBF-based dynamics uniformly converge to trajectories of PDSs, as a CBF-parameter is taken to infinity. Towards this, we also prove that CBF-based dynamics are perturbations of PDSs, with quantitative bounds on the perturbation. Our results pave the way to implement discontinuous PDS-based controllers in a continuous fashion, employing CBFs. Moreover, they can be employed to numerically simulate PDSs, overcoming disadvantages of existing discretization schemes, such as computing projections to possibly non-convex sets. Finally, this bridge between CBFs and PDSs may yield other potential benefits, including novel insights on stability.
Abductive Ego-View Accident Video Understanding for Safe Driving Perception

We present MM-AU, a novel dataset for Multi-Modal Accident video Understanding. MM-AU contains 11,727 in-the-wild ego-view accident videos, each with temporally aligned text descriptions. We annotate over 2.23 million object boxes and 58,650 pairs of video-based accident reasons, covering 58 accident categories. MM-AU supports various accident understanding tasks, particularly multimodal video diffusion to understand accident cause-effect chains for safe driving. With MM-AU, we present an Abductive accident Video understanding framework for Safe Driving perception (AdVersa-SD). AdVersa-SD performs video diffusion via an Object-Centric Video Diffusion (OAVD) method which is driven by an abductive CLIP model. This model involves a contrastive interaction loss to learn the pair co-occurrence of normal, near-accident, accident frames with the corresponding text descriptions, such as accident reasons, prevention advice, and accident categories. OAVD enforces the causal region learning while fixing the content of the original frame background in video generation, to find the dominant cause-effect chain for certain accidents. Extensive experiments verify the abductive ability of AdVersa-SD and the superiority of OAVD against the state-of-the-art diffusion models. Additionally, we provide careful benchmark evaluations for object detection and accident reason answering since AdVersa-SD relies on precise object and accident reason information.
Axe the X in XAI: A Plea for Understandable AI

In a recent paper, Erasmus et al. (2021) defend the idea that the ambiguity of the term"explanation"in explainable AI (XAI) can be solved by adopting any of four different extant accounts of explanation in the philosophy of science: the Deductive Nomological, Inductive Statistical, Causal Mechanical, and New Mechanist models. In this chapter, I show that the authors' claim that these accounts can be applied to deep neural networks as they would to any natural phenomenon is mistaken. I also provide a more general argument as to why the notion of explainability as it is currently used in the XAI literature bears little resemblance to the traditional concept of scientific explanation. It would be more fruitful to use the label"understandable AI"to avoid the confusion that surrounds the goal and purposes of XAI. In the second half of the chapter, I argue for a pragmatic conception of understanding that is better suited to play the central role attributed to explanation in XAI. Following Kuorikoski&Ylikoski (2015), the conditions of satisfaction for understanding an ML system are fleshed out in terms of an agent's success in using the system, in drawing correct inferences from it.
Shifted Interpolation for Differential Privacy

Noisy gradient descent and its variants are the predominant algorithms for differentially private machine learning. It is a fundamental question to quantify their privacy leakage, yet tight characterizations remain open even in the foundational setting of convex losses. This paper improves over previous analyses by establishing (and refining) the"privacy amplification by iteration"phenomenon in the unifying framework of $f$-differential privacy--which tightly captures all aspects of the privacy loss and immediately implies tighter privacy accounting in other notions of differential privacy, e.g., $(\varepsilon,\delta)$-DP and Renyi DP. Our key technical insight is the construction of shifted interpolated processes that unravel the popular shifted-divergences argument, enabling generalizations beyond divergence-based relaxations of DP. Notably, this leads to the first exact privacy analysis in the foundational setting of strongly convex optimization. Our techniques extend to many settings: convex/strongly convex, constrained/unconstrained, full/cyclic/stochastic batches, and all combinations thereof. As an immediate corollary, we recover the $f$-DP characterization of the exponential mechanism for strongly convex optimization in Gopi et al. (2022), and moreover extend this result to more general settings.