Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards Faster Reinforcement Learning of Quantum Circuit Optimisation: Exponential Reward Functions

Reinforcement learning for the optimization of quantum circuits uses an agent whose goal is to maximize the value of a reward function that decides what is correct and what is wrong during the exploration of the search space. It is an open problem how to formulate reward functions that lead to fast and efficient learning. We propose an exponential reward function which is sensitive to structural properties of the circuit. We benchmark our function on circuits with known optimal depths, and conclude that our function is reducing the learning time and improves the optimization. Our results are a next step towards fast, large scale optimization of quantum circuits.
Neural networks as an intelligence amplification tool: A review of applications

The sophisticated algorithms we use to process, analyze, and interpret geophysical data automate tasks we used to do by hand, transform data into domains where patterns are more obvious, and allow us to calculate quantities where we used to rely on intuition or back‐of‐envelope estimates. But, the crux of the exploration problem is still interpretation—associating abstract patterns with geologic formations of economic value. Artificial neural networks are able to couple the speed and efficiency of the computer with the pattern recognition and association capabilities of the brain to aid the exploration process. The key concept to understand in the application of neural network technology is that they should not be used as an artificial intelligence tool to replace a human interpreter; rather, neural networks are an intelligence amplification toolkit that allows the interpreter to focus on the important information.More than 102 neural network papers have been published by SEG since 1988, and more than 550.
Beyond Turing: A Comparative Analysis of Approaches for Detecting Machine-Generated Text

Significant progress has been made on text generation by pre-trained language models (PLMs), yet distinguishing between human and machine-generated text poses an escalating challenge. This paper offers an in-depth evaluation of three distinct methods used to address this task: traditional shallow learning, Language Model (LM) fine-tuning, and Multilingual Model fine-tuning. These approaches are rigorously tested on a wide range of machine-generated texts, providing a benchmark of their competence in distinguishing between human-authored and machine-authored linguistic constructs. The results reveal considerable differences in performance across methods, thus emphasizing the continued need for advancement in this crucial area of NLP. This study offers valuable insights and paves the way for future research aimed at creating robust and highly discriminative models.
FrePolad: Frequency-Rectified Point Latent Diffusion for Point Cloud Generation

We propose FrePolad: frequency-rectified point latent diffusion, a point cloud generation pipeline integrating a variational autoencoder (VAE) with a denoising diffusion probabilistic model (DDPM) for the latent distribution. FrePolad simultaneously achieves high quality, diversity, and flexibility in point cloud cardinality for generation tasks while maintaining high computational efficiency. The improvement in generation quality and diversity is achieved through (1) a novel frequency rectification module via spherical harmonics designed to retain high-frequency content while learning the point cloud distribution; and (2) a latent DDPM to learn the regularized yet complex latent distribution. In addition, FrePolad supports variable point cloud cardinality by formulating the sampling of points as conditional distributions over a latent shape distribution. Finally, the low-dimensional latent space encoded by the VAE contributes to FrePolad's fast and scalable sampling. Our quantitative and qualitative results demonstrate the state-of-the-art performance of FrePolad in terms of quality, diversity, and computational efficiency.
Fair Enough? A map of the current limitations of the requirements to have "fair" algorithms

In the recent years, the raise in the usage and efficiency of Artificial Intelligence and, more in general, of Automated Decision-Making systems has brought with it an increasing and welcome awareness of the risks associated with such systems. One of such risks is that of perpetuating or even amplifying bias and unjust disparities present in the data from which many of these systems learn to adjust and optimise their decisions. This awareness has on one side encouraged several scientific communities to come up with more and more appropriate ways and methods to assess, quantify, and possibly mitigate such biases and disparities. On the other hand, it has prompted more and more layers of society, including policy makers, to call for"fair"algorithms. We believe that while a lot of excellent and multidisciplinary research is currently being conducted, what is still fundamentally missing is the awareness that having"fair"algorithms is per se a nearly meaningless requirement, that needs to be complemented with a lot of additional societal choices to become actionable. Namely, there is a hiatus between what the society is demanding from Automated Decision-Making systems, and what this demand actually means in real-world scenarios. In this work, we outline the key features of such a hiatus, and pinpoint a list of fundamental ambiguities and attention points that we as a society must address in order to give a concrete meaning to the increasing demand of fairness in Automated Decision-Making systems.
Energizing Federated Learning via Filter-Aware Attention

Federated learning (FL) is a promising distributed paradigm, eliminating the need for data sharing but facing challenges from data heterogeneity. Personalized parameter generation through a hypernetwork proves effective, yet existing methods fail to personalize local model structures. This leads to redundant parameters struggling to adapt to diverse data distributions. To address these limitations, we propose FedOFA, utilizing personalized orthogonal filter attention for parameter recalibration. The core is the Two-stream Filter-aware Attention (TFA) module, meticulously designed to extract personalized filter-aware attention maps, incorporating Intra-Filter Attention (IntraFa) and Inter-Filter Attention (InterFA) streams. These streams enhance representation capability and explore optimal implicit structures for local models. Orthogonal regularization minimizes redundancy by averting inter-correlation between filters. Furthermore, we introduce an Attention-Guided Pruning Strategy (AGPS) for communication efficiency. AGPS selectively retains crucial neurons while masking redundant ones, reducing communication costs without performance sacrifice. Importantly, FedOFA operates on the server side, incurring no additional computational cost on the client, making it advantageous in communication-constrained scenarios. Extensive experiments validate superior performance over state-of-the-art approaches, with code availability upon paper acceptance.
Game Theoretic Application to Intersection Management: A Literature Review

The emergence of vehicle-to-everything (V2X) technology offers new insights into intersection management. This, however, has also presented new challenges, such as the need to understand and model the interactions of traffic participants, including their competition and cooperation behaviors. Game theory has been widely adopted to study rationally selfish or cooperative behaviors during interactions and has been applied to advanced intersection management. In this paper, we review the application of game theory to intersection management and sort out relevant studies under various levels of intelligence and connectivity. First, the problem of urban intersection management and its challenges are briefly introduced. The basic elements of game theory specifically for intersection applications are then summarized. Next, we present the game-theoretic models and solutions that have been applied to intersection management. Finally, the limitations and potential opportunities for subsequent studies within the game-theoretic application to intersection management are discussed.
GPUSCAN++: Eficient Structural Graph Clustering on GPUs

Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the state-of-the-art GPU-based structural clustering algorithm, GPUSCAN, still suffers from efficiency issues since lots of extra costs are introduced for parallelization. Moreover, GPUSCAN assumes that the graph is resident in the GPU memory. However, the GPU memory capacity is limited currently while many real-world graphs are big and cannot fit in the GPU memory, which makes GPUSCAN unable to handle large graphs. Motivated by this, we present a new GPU-based structural clustering algorithm, GPUSCAN++, in this paper. To address the efficiency issue, we propose a new progressive clustering method tailored for GPUs that not only avoid high parallelization costs but also fully exploits the computing resources of GPUs. To address the GPU memory limitation issue, we propose a partition-based algorithm for structural clustering that can process large graphs with limited GPU memory. We conduct experiments on real graphs, and the experimental results demonstrate that our algorithm can achieve up to 168 times speedup compared with the state-of-the-art GPU-based algorithm when the graph can be resident in the GPU memory. Moreover, our algorithm is scalable to handle large graphs. As an example, our algorithm can finish the structural clustering on a graph with 1.8 billion edges using less than 2 GB GPU memory.
Differentiable Sampling of Categorical Distributions Using the CatLog-Derivative Trick

Categorical random variables can faithfully represent the discrete and uncertain aspects of data as part of a discrete latent variable model. Learning in such models necessitates taking gradients with respect to the parameters of the categorical probability distributions, which is often intractable due to their combinatorial nature. A popular technique to estimate these otherwise intractable gradients is the Log-Derivative trick. This trick forms the basis of the well-known REINFORCE gradient estimator and its many extensions. While the Log-Derivative trick allows us to differentiate through samples drawn from categorical distributions, it does not take into account the discrete nature of the distribution itself. Our first contribution addresses this shortcoming by introducing the CatLog-Derivative trick - a variation of the Log-Derivative trick tailored towards categorical distributions. Secondly, we use the CatLog-Derivative trick to introduce IndeCateR, a novel and unbiased gradient estimator for the important case of products of independent categorical distributions with provably lower variance than REINFORCE. Thirdly, we empirically show that IndeCateR can be efficiently implemented and that its gradient estimates have significantly lower bias and variance for the same number of samples compared to the state of the art.
Enigmatic Emission Structure around Mrk 783: Cross-Ionization of a Companion 100 kpc Away

Mrk 783 is a narrow-line Seyfert 1 galaxy that possesses a relatively large two-sided radio emission extending up to 14 kpc from the active nucleus possibly connected with a large-scale ionized gas emission. We obtained a deep [O iii] image that revealed an extended system of emission knots and diffuse ionized gas surrounding the main galaxy. The highly-excited gas is related not only to the radio structure, but also to tidal features illuminated by the active nucleus radiation up to the projected distance of 41 kpc as it follows from the emission lines’ intensities and kinematics derived from the long-slit spectroscopic data. Moreover, the part of the disk of the companion galaxy SDSS J130257.20+162537.1, located at ∼99 kpc projected distances to the north of Mrk 783, also falls in the AGN ionizing cone. It is possiblethat Mrk 783 can be considered as ‘Hanny’s Voorwerp precursor’, i.e., a galaxy that demonstrates signs of sequential switching from radio-loud to radio-quiet nuclear activity, in the moment before its ionization luminosity falls.
Ontological Reasoning over Shy and Warded Datalog+/- for Streaming-based Architectures (technical report)

Recent years witnessed a rising interest towards Datalog-based ontological reasoning systems, both in academia and industry. These systems adopt languages, often shared under the collective name of Datalog$+/-$, that extend Datalog with the essential feature of existential quantification, while introducing syntactic limitations to sustain reasoning decidability and achieve a good trade-off between expressive power and computational complexity. From an implementation perspective, modern reasoners borrow the vast experience of the database community in developing streaming-based data processing systems, such as volcano-iterator architectures, that sustain a limited memory footprint and good scalability. In this paper, we focus on two extremely promising, expressive, and tractable languages, namely, Shy and Warded Datalog$+/-$. We leverage their theoretical underpinnings to introduce novel reasoning techniques, technically,"chase variants", that are particularly fit for efficient reasoning in streaming-based architectures. We then implement them in Vadalog, our reference streaming-based engine, to efficiently solve ontological reasoning tasks over real-world settings.
Scaling up the formation of agents with heterogeneous sensing: mixed distance and bearing-only

Unlike the case with identical neighboring agents whose actions are mirrored, the problem of distributed formation control design with heterogeneous sensing is not straightforward. In this paper, we consider the problem of distributed formation control where each agent can only control distances or bearings with its neighbors. We firstly develop a rigidity theory with heterogeneous sensing to ensure that the desired shape is well-posed. Secondly, we propose an iterative method that allows us to scale up the number of agents with heterogeneous sensing. Finally, numerical simulations show the effectiveness of our method.
An ImprovedRadioimmunoassay of C-Peptideand ItsApplication in a Multiyear Study

treatment withactivated charcoal(biological matrix),instead of ina definedmatrix.Thisyieldedessentially100% analytical recoveriesfor C-peptideconcentrationsup to 300 pmoi/L, a broaderanalytical range.We alsocorrectedcalibratorsand unknown samples fornonspecificbinding(NSB). Decreasing the concentration of ethanol(from950 to 880 mL/L) for differential precipitationof the antigen-antibody complex resultedin an NSB of <10%, while maintaininghighbound! total count percentages for samples and calibrators. Cpeptideis thermallyunstablewithoutaprotininat -20 #{176}C and with or without aprotinin at 4 #{176}C orabove,butmultiple freezethawcyclesdo notaffectC-peptidein serum.The modified C-peptide assay was applied to plasma from a multiyear study (fasting and post-carbohydrate-challenge subjects). DuringthefouryearsofthestudyCVsrangedfrom1.9%to 8.6% for replicate analyses of C-peptide in samples with concentrations�500 pmol/L.Between-runCVs were 3.8% to
Human Learning by Model Feedback: The Dynamics of Iterative Prompting with Midjourney

Generating images with a Text-to-Image model often requires multiple trials, where human users iteratively update their prompt based on feedback, namely the output image. Taking inspiration from cognitive work on reference games and dialogue alignment, this paper analyzes the dynamics of the user prompts along such iterations. We compile a dataset of iterative interactions of human users with Midjourney. Our analysis then reveals that prompts predictably converge toward specific traits along these iterations. We further study whether this convergence is due to human users, realizing they missed important details, or due to adaptation to the model's ``preferences'', producing better images for a specific language style. We show initial evidence that both possibilities are at play. The possibility that users adapt to the model's preference raises concerns about reusing user data for further training. The prompts may be biased towards the preferences of a specific model, rather than align with human intentions and natural manner of expression.
A Squeeze-and-Excitation and Transformer based Cross-task System for Environmental Sound Recognition

Environmental sound recognition (ESR) is an emerging research topic in audio pattern recognition. Many tasks are presented to resort to computational systems for ESR in real-life applications. However, current systems are usually designed for individual tasks, and are not robust and applicable to other tasks. Cross-task systems, which promote uniﬁed knowledge modeling across various tasks, have not been thoroughly investigated. In this paper, we propose a cross-task system for three diﬀerent tasks of ESR: acoustic scene classiﬁ-cation, urban sound tagging, and anomalous sound detection. An architecture named SE-Trans is presented that uses attention mechanism-based Squeeze-and-Excitation and Transformer encoder modules to learn channel-wise relationship and temporal dependencies of the acoustic features. FMix is employed as the data augmentation method that improves the performance of ESR. Evaluations for the three tasks are conducted on the recent databases of DCASE challenges. The experimental results show that the proposed cross-task system achieves state-of-the-art performance on all tasks. Further analysis demonstrates that the proposed cross-task system can eﬀectively utilize acoustic knowledge across diﬀerent ESR tasks.
Cardiac Molecular Analysis Reveals Aging-Associated Metabolic Alterations Promoting Glycosaminoglycans Accumulation Via Hexosamine Biosynthetic Pathway

Age is a prominent risk factor for cardiometabolic disease, and often leads to heart structural and functional changes. However, precise molecular mechanisms underlying cardiac remodeling and dysfunction resulting from physiological aging per se remain elusive. Understanding these mechanisms requires biological models with optimal translation to humans. Previous research demonstrated that baboons undergo age-related reduction in ejection fraction and increased heart sphericity, mirroring changes observed in humans. The goal of this study was to identify early cardiac molecular alterations that precede functional adaptations, shedding light on the regulation of age-associated changes. We performed unbiased transcriptomics of left ventricle (LV) samples from female baboons aged 7.5-22.1 years (human equivalent ∼30-88 years). Weighted-gene correlation network and pathway enrichment analyses were performed to identify potential age-associated mechanisms in LV, with histological validation. Myocardial modules of transcripts negatively associated with age were primarily enriched for cardiac metabolism, including oxidative phosphorylation, tricarboxylic acid cycle, glycolysis, and fatty-acid β-oxidation. Transcripts positively correlated with age suggest upregulation of glucose uptake, pentose phosphate pathway, and hexosamine biosynthetic pathway (HBP), indicating a metabolic shift towards glucose-dependent anabolic pathways. Upregulation of HBP commonly results in increased glycosaminoglycan precursor synthesis. Transcripts involved in glycosaminoglycan synthesis, modification, and intermediate metabolism were also upregulated in older animals, while glycosaminoglycan degradation transcripts were downregulated with age. These alterations would promote glycosaminoglycan accumulation, which was verified histologically. Upregulation of extracellular matrix (ECM)-induced signaling pathways temporally coincided with glycosaminoglycan accumulation. We found a subsequent upregulation of cardiac hypertrophy-related pathways and an increase in cardiomyocyte width. Overall, our findings revealed a transcriptional shift in metabolism from catabolic to anabolic pathways that leads to ECM glycosaminoglycan accumulation through HBP prior to upregulation of transcripts of cardiac hypertrophy-related pathways. This study illuminates cellular mechanisms that precede development of cardiac hypertrophy, providing novel potential targets to remediate age-related cardiac diseases.
A Novel Approach to Context-Aware Content-Based Middleware

The application of pervasive computing is extending from field-specific to everyday use. The Internet of Things (IoT) is the shiniest example of its application and of its intrinsic complexity compared with classical application development. The main characteristic that differentiates pervasive from other forms of computing lies in the use of contextual information. Some classical applications do not use any contextual information whatsoever. Others, on the other hand, use only part of the contextual information, which is integrated in an ad hoc fashion using an application-specific implementation. This information is handled in a one-off manner because of the difficulty of sharing context across applications. As a matter of fact, the application type determines what the contextual information is. For instance, for an imaging editor, the image is the information and its meta-data, like the time of the shot or camera settings, are the context, whereas, for a file-system application, the image, including its camera settings, is the information and the meta-data external to the file, like the modification date or the last accessed timestamps, constitute the context. This means that contextual information is hard to share. A communication middleware that supports context decidedly eases application development in pervasive computing. However, the use of context should not be mandatory; otherwise, the communication middleware would be reduced to a context middleware and no longer be compatible with non-context-aware applications. SilboPS, our implementation of content-based publish/subscribe inspired by SIENA [11, 9], solves this problem by adding two new elements to the paradigm: the context and the context function. Context represents the actual contextual information specific to the message to be sent or that needs to be notified to the subscriber, whereas the context function is evaluated using the publisher’s context and the subscriber’s context to decide whether the current message and context are useful for the subscriber. In this manner, context logic management is decoupled from context management, increasing the flexibility of communication and usage across different applications.