Miracle-dz/UniFAR-FTUs huggingface dataset:
Human CD4+CD25+CD127lowFOXP3+ regulatory T lymphocytes and CD4+CD25-FOXP3- conventional T lymphocytes: a differential transcriptome profile

Abstract CD4+CD25+ FOXP3+ regulatory T cells (Tregs) represent a subpopulation of CD4+ T cells central for the suppression of physiological and pathological immune reactions. Although distinct cell surface antigens are expressed in regulatory T cells, those components are also present on the surface of activated CD4+CD25- FOXP3-T cells, thus making the discrimination between Tregs and conventional CD4+ T difficult and isolation of Tregs complex. Yet, the molecular components driving Tregs’ function are still not fully characterized. Aiming at unraveling molecular components specifically marking Tregs, and upon using quantitative real-time PCR (qRT-PCR) followed by bioinformatics analysis, we identified, in this study, differential transcriptional profiles, in peripheral blood CD4 + CD25 + CD127low FOXP3+ Tregs versus CD4 + CD25-FOXP3- conventional T cells, for set of genes with distinct immunological roles. In conclusion, this study identifies some novel genes that appeared to be differentially transcribed in CD4+ Tregs versus conventional T cells. The identified genes could serve as novel molecular targets relevant to Tregs’ function and isolation.
Euler characteristics, lengths of loops in hyperbolic 3-manifolds, and Wilson's Freiheitssatz

Let $p$ be a point of an orientable hyperbolic $3$-manifold $M$, and let $m\ge1$ and $k\ge2$ be integers. Suppose that $\alpha_1,\ldots,\alpha_m$ are loops based at $p$ having length less than $\log(2k-1)$. We show that if $G$ denotes the subgroup of $\pi_1(M,p)$ generated by $[\alpha_1],\ldots,[\alpha_m]$, then $\overline{\chi}(G)\doteq-\chi(G)\le k-2$; here $\chi(G)$ denotes the Euler characteristic of the group $G$, which is always defined in this situation. This result is deduced from a result about an arbitrary finitely generated subgroup $G$ of the fundamental group of an orientable hyperbolic $3$-manifold. If $\Delta$ is a finite generating set for $G$, we define the $index\ of\ freedom$ ${\rm iof}(\Delta)$ to be the largest integer $k$ such that $\Delta$ contains $k$ elements that freely generate a rank-$k$ free subgroup of $G$. We define the $minimum\ index\ of\ freedom$ ${\rm miof}(G)$ to be $\min_{\Delta }{\rm iof}(\Delta )$, where $\Delta $ ranges over all finite generating sets for $G$. The result is that $\overline{\chi}(G)<{\rm iof}(G)$. The author has recently learned that this is equivalent to a special case of a theorem about arbitrary finitely presented groups due to J. S. Wilson.
EvIcon: Designing High‐Usability Icon with Human‐in‐the‐loop Exploration and IconCLIP

Interface icons are prevalent in various digital applications. Due to limited time and budgets, many designers rely on informal evaluation, which often results in poor usability icons. In this paper, we propose a unique human‐in‐the‐loop framework that allows our target users, that is novice and professional user interface (UI) designers, to improve the usability of interface icons efficiently. We formulate several usability criteria into a perceptual usability function and enable users to iteratively revise an icon set with an interactive design tool, EvIcon. We take a large‐scale pre‐trained joint image‐text embedding (CLIP) and fine‐tune it to embed icon visuals with icon tags in the same embedding space (IconCLIP). During the revision process, our design tool provides two types of instant perceptual usability feedback. First, we provide perceptual usability feedback modelled by deep learning models trained on IconCLIP embeddings and crowdsourced perceptual ratings. Second, we use the embedding space of IconCLIP to assist users in improving icons' visual distinguishability among icons within the user‐prepared icon set. To provide the perceptual prediction, we compiled IconCEPT10K, the first large‐scale dataset of perceptual usability ratings over 10,000 interface icons, by conducting a crowdsourcing study. We demonstrated that our framework could benefit UI designers' interface icon revision process with a wide range of professional experience. Moreover, the interface icons designed using our framework achieved better semantic distance and familiarity, verified by an additional online user study.
The Key Role of Diabatic Outflow in Amplifying the Midlatitude Flow: A Representative Case Study of Weather Systems Surrounding Western North Pacific Extratropical Transition

AbstractRecurving tropical cyclones (TCs) undergoing extratropical transition (ET) may substantially modify the large-scale midlatitude flow pattern. This study highlights the role of diabatic outflow in midlatitude flow amplification within the context of a review of the physical and dynamical processes involved in ET. Composite fields of 12 western North Pacific ET cases are used as initial and boundary conditions for high-resolution numerical simulations of the North Pacific–North American sector with and without the TC present. It is demonstrated that a three-stage sequence of diabatic outflow associated with different weather systems is involved in triggering a highly amplified midlatitude flow pattern: 1) preconditioning by a predecessor rain event (PRE), 2) TC–extratropical flow interaction, and 3) downstream flow amplification by a downstream warm conveyor belt (WCB). An ensemble of perturbed simulations demonstrates the robustness of these stages. Beyond earlier studies investigating PREs, recurv.
Image Captioning with Multi-Context Synthetic Data

Image captioning requires numerous annotated image-text pairs, resulting in substantial annotation costs. Recently, large models (e.g. diffusion models and large language models) have excelled in producing high-quality images and text. This potential can be harnessed to create synthetic image-text pairs for training captioning models. Synthetic data can improve cost and time efficiency in data collection, allow for customization to specific domains, bootstrap generalization capability for zero-shot performance, and circumvent privacy concerns associated with real-world data. However, existing methods struggle to attain satisfactory performance solely through synthetic data. We identify the issue as generated images from simple descriptions mostly capture a solitary perspective with limited context, failing to align with the intricate scenes prevalent in real-world imagery. To tackle this, we present an innovative pipeline that introduces multi-context data generation. Beginning with an initial text corpus, our approach employs a large language model to extract multiple sentences portraying the same scene from diverse viewpoints. These sentences are then condensed into a single sentence with multiple contexts. Subsequently, we generate intricate images using the condensed captions through diffusion models. Our model is exclusively trained on synthetic image-text pairs crafted through this process. The effectiveness of our pipeline is validated through experimental results in both the in-domain and cross-domain settings, where it achieves state-of-the-art performance on well-known datasets such as MSCOCO, Flickr30k, and NoCaps.
Fair Clustering via Hierarchical Fair-Dirichlet Process

The advent of ML-driven decision-making and policy formation has led to an increasing focus on algorithmic fairness. As clustering is one of the most commonly used unsupervised machine learning approaches, there has naturally been a proliferation of literature on {\em fair clustering}. A popular notion of fairness in clustering mandates the clusters to be {\em balanced}, i.e., each level of a protected attribute must be approximately equally represented in each cluster. Building upon the original framework, this literature has rapidly expanded in various aspects. In this article, we offer a novel model-based formulation of fair clustering, complementing the existing literature which is almost exclusively based on optimizing appropriate objective functions.
Is Centralized Training with Decentralized Execution Framework Centralized Enough for MARL?

Centralized Training with Decentralized Execution (CTDE) has recently emerged as a popular framework for cooperative Multi-Agent Reinforcement Learning (MARL), where agents can use additional global state information to guide training in a centralized way and make their own decisions only based on decentralized local policies. Despite the encouraging results achieved, CTDE makes an independence assumption on agent policies, which limits agents to adopt global cooperative information from each other during centralized training. Therefore, we argue that existing CTDE methods cannot fully utilize global information for training, leading to an inefficient joint-policy exploration and even suboptimal results. In this paper, we introduce a novel Centralized Advising and Decentralized Pruning (CADP) framework for multi-agent reinforcement learning, that not only enables an efficacious message exchange among agents during training but also guarantees the independent policies for execution. Firstly, CADP endows agents the explicit communication channel to seek and take advices from different agents for more centralized training. To further ensure the decentralized execution, we propose a smooth model pruning mechanism to progressively constraint the agent communication into a closed one without degradation in agent cooperation capability. Empirical evaluations on StarCraft II micromanagement and Google Research Football benchmarks demonstrate that the proposed framework achieves superior performance compared with the state-of-the-art counterparts. Our code will be made publicly available.
WiFi-TCN: Temporal Convolution for Human Interaction Recognition based on WiFi signal

The utilization of Wi-Fi based human activity recognition has gained considerable interest in recent times, primarily owing to its applications in various domains such as healthcare for monitoring breath and heart rate, security, elderly care. These Wi-Fi-based methods exhibit several advantages over conventional state-of-the-art techniques that rely on cameras and sensors, including lower costs and ease of deployment. However, a significant challenge associated with Wi-Fi-based HAR is the significant decline in performance when the scene or subject changes. To mitigate this issue, it is imperative to train the model using an extensive dataset. In recent studies, the utilization of CNN-based models or sequence-to-sequence models such as LSTM, GRU, or Transformer has become prevalent. While sequence-to-sequence models can be more precise, they are also more computationally intensive and require a larger amount of training data. To tackle these limitations, we propose a novel approach that leverages a temporal convolution network with augmentations and attention, referred to as TCN-AA. Our proposed method is computationally efficient and exhibits improved accuracy even when the data size is increased threefold through our augmentation techniques. Our experiments on a publicly available dataset indicate that our approach outperforms existing state-of-the-art methods, with a final accuracy of 99.42%.
LE2Fusion: A novel local edge enhancement module for infrared and visible image fusion

Infrared and visible image fusion task aims to generate a fused image which contains salient features and rich texture details from multi-source images. However, under complex illumination conditions, few algorithms pay attention to the edge information of local regions which is crucial for downstream tasks. To this end, we propose a fusion network based on the local edge enhancement, named LE2Fusion. Specifically, a local edge enhancement (LE2) module is proposed to improve the edge information under complex illumination conditions and preserve the essential features of image. For feature extraction, a multi-scale residual attention (MRA) module is applied to extract rich features. Then, with LE2, a set of enhancement weights are generated which are utilized in feature fusion strategy and used to guide the image reconstruction. To better preserve the local detail information and structure information, the pixel intensity loss function based on the local region is also presented. The experiments demonstrate that the proposed method exhibits better fusion performance than the state-of-the-art fusion methods on public datasets.
Bayesian Decision Making to Localize Visual Queries in 2D

This report describes our approach for the EGO4D 2023 Visual Query 2D Localization Challenge. Our method aims to reduce the number of False Positives (FP) that occur because of high similarity between the visual crop and the proposed bounding boxes from the baseline's Region Proposal Network (RPN). Our method uses a transformer to determine similarity in higher dimensions which is used as our prior belief. The results are then combined together with the similarity in lower dimensions from the Siamese Head, acting as our measurement, to generate a posterior which is then used to determine the final similarity of the visual crop with the proposed bounding box. Our code is publicly available $\href{https://github.com/s-m-asjad/EGO4D_VQ2D}{here}$.
Phenomenological implications of nonlocal quantum electrodynamics

We analyze several phenomenological implications of a nonlocal generalization of quantum electrodynamics (QED). We compute the nonlocal corrections to the photon propagator up to one loop, and we show that nonlocality leads to a change of the Coulomb potential. We then investigate the ensuing modifications to the Lamb shift and to the electrostatic forces and comparing our results with the data from the muonic hydrogen anomaly, we set lower bounds on the nonlocality scales. We also discuss the running of the electromagnetic coupling for the nonlocal theory. The results obtained indicate that future experimental analyses on atomic phenomena, such as the Lamb shift, could allow to verify the presence of non-local effects on microscopic scales and impose effective limits on the non-locality scale.
Attention Schema in Neural Agents

Attention has become a common ingredient in deep learning architectures. It adds a dynamical selection of information on top of the static selection of information supported by weights. In the same way, we can imagine a higher-order informational filter built on top of attention: an Attention Schema (AS), namely, a descriptive and predictive model of attention. In cognitive neuroscience, Attention Schema Theory (AST) supports this idea of distinguishing attention from AS. A strong prediction of this theory is that an agent can use its own AS to also infer the states of other agents' attention and consequently enhance coordination with other agents. As such, multi-agent reinforcement learning would be an ideal setting to experimentally test the validity of AST. We explore different ways in which attention and AS interact with each other. Our preliminary results indicate that agents that implement the AS as a recurrent internal control achieve the best performance. In general, these exploratory experiments suggest that equipping artificial agents with a model of attention can enhance their social intelligence.
Adapting Language-Audio Models as Few-Shot Audio Learners

We presented the Treff adapter, a training-efficient adapter for CLAP, to boost zero-shot classification performance by making use of a small set of labelled data. Specifically, we designed CALM to retrieve the probability distribution of text-audio clips over classes using a set of audio-label pairs and combined it with CLAP's zero-shot classification results. Furthermore, we designed a training-free version of the Treff adapter by using CALM as a cosine similarity measure. Experiments showed that the proposed Treff adapter is comparable and even better than fully-supervised methods and adaptation methods in low-shot and data-abundant scenarios. While the Treff adapter shows that combining large-scale pretraining and rapid learning of domain-specific knowledge is non-trivial for obtaining generic representations for few-shot learning, it is still limited to audio classification tasks. In the future, we will explore how to use audio-language models in diverse audio domains.
Query-Efficient Black-Box Red Teaming via Bayesian Optimization

The deployment of large-scale generative models is often restricted by their potential risk of causing harm to users in unpredictable ways. We focus on the problem of black-box red teaming, where a red team generates test cases and interacts with the victim model to discover a diverse set of failures with limited query access. Existing red teaming methods construct test cases based on human supervision or language model (LM) and query all test cases in a brute-force manner without incorporating any information from past evaluations, resulting in a prohibitively large number of queries.To this end, we propose Bayesian red teaming (BRT), novel query-efficient black-box red teaming methods based on Bayesian optimization, which iteratively identify diverse positive test cases leading to model failures by utilizing the pre-defined user input pool and the past evaluations. Experimental results on various user input pools demonstrate that our method consistently finds a significantly larger number of diverse positive test cases under the limited query budget than the baseline methods.The source code is available at https://github.com/snu-mllab/Bayesian-Red-Teaminghttps://github.com/snu-mllab/Bayesian-Red-Teaming.
Crafting Training Degradation Distribution for the Accuracy-Generalization Trade-off in Real-World Super-Resolution

Super-resolution (SR) techniques designed for real-world applications commonly encounter two primary challenges: generalization performance and restoration accuracy. We demonstrate that when methods are trained using complex, large-range degradations to enhance generalization, a decline in accuracy is inevitable. However, since the degradation in a certain real-world applications typically exhibits a limited variation range, it becomes feasible to strike a trade-off between generalization performance and testing accuracy within this scope. In this work, we introduce a novel approach to craft training degradation distributions using a small set of reference images. Our strategy is founded upon the binned representation of the degradation space and the Fr\'echet distance between degradation distributions. Our results indicate that the proposed technique significantly improves the performance of test images while preserving generalization capabilities in real-world applications.
Selective Communication for Cooperative Perception in End-to-End Autonomous Driving

The reliability of current autonomous driving systems is often jeopardized in situations when the vehicle's field-of-view is limited by nearby occluding objects. To mitigate this problem, vehicle-to-vehicle communication to share sensor information among multiple autonomous driving vehicles has been proposed. However, to enable timely processing and use of shared sensor data, it is necessary to constrain communication bandwidth, and prior work has done so by restricting the number of other cooperative vehicles and randomly selecting the subset of vehicles to exchange information with from all those that are within communication range. Although simple and cost effective from a communication perspective, this selection approach suffers from its susceptibility to missing those vehicles that possess the perception information most critical to navigation planning. Inspired by recent multi-agent path finding research, we propose a novel selective communication algorithm for cooperative perception to address this shortcoming. Implemented with a lightweight perception network and a previously developed control network, our algorithm is shown to produce higher success rates than a random selection approach on previously studied safety-critical driving scenario simulations, with minimal additional communication overhead.
A Critical Evaluation of Evaluations for Long-form Question Answering

Long-form question answering (LFQA) enables answering a wide range of questions, but its flexibility poses enormous challenges for evaluation. We perform the first targeted study of the evaluation of long-form answers, covering both human and automatic evaluation practices. We hire domain experts in seven areas to provide preference judgments over pairs of answers, along with free-form justifications for their choices. We present a careful analysis of experts’ evaluation, which focuses on new aspects such as the comprehensiveness of the answer. Next, we examine automatic text generation metrics, finding that no existing metrics are predictive of human preference judgments. However, some metrics correlate with fine-grained aspects of answers (e.g., coherence). We encourage future work to move away from a single “overall score” of the answer and adopt a multi-faceted evaluation, targeting aspects such as factuality and completeness. We publicly release all of our annotations and code to spur future work into LFQA evaluation.
Alignment-free HDR Deghosting with Semantics Consistent Transformer

High dynamic range (HDR) imaging aims to retrieve information from multiple low-dynamic range inputs to generate realistic output. The essence is to leverage the contextual information, including both dynamic and static semantics, for better image generation. Existing methods often focus on the spatial misalignment across input frames caused by the foreground and/or camera motion. However, there is no research on jointly leveraging the dynamic and static context in a simultaneous manner. To delve into this problem, we propose a novel alignment-free network with a Semantics Consistent Transformer (SCTNet) with both spatial and channel attention modules in the network. The spatial attention aims to deal with the intra-image correlation to model the dynamic motion, while the channel attention enables the inter-image intertwining to enhance the semantic consistency across frames. Aside from this, we introduce a novel realistic HDR dataset with more variations in foreground objects, environmental factors, and larger motions. Extensive comparisons on both conventional datasets and ours validate the effectiveness of our method, achieving the best trade-off on the performance and the computational cost. The source code and dataset are available at https://steven-tel.github. io/sctnet/.
Inequality with Applications in Statistical Mechanics

We prove for Hermitian matrices (or more generally for completely continuous self‐adjoint linear operators in Hilbert space)A and B that Tr (eA+B ) ≤ Tr (eAeB ). The inequality is shown to be sharper than the convexity property (0 ≤ α ≤ 1) Tr (e αA+(1−α)B ) ≤ [Tr (eA )]α[Tr (eB )]1−α, and its possible use for obtaining upper bounds for the partition function is discussed briefly.