Miracle-dz/UniFAR-FTUs huggingface dataset:
Disentangling heterogeneity in Substance Use Disorders: Insights from Genome-Wide Polygenic Scores

Substance use disorder (SUD) is a global health problem with significant impact on individuals and society. The presentation of SUD is diverse, involving various substances, ages at onset, comorbid conditions, and disease trajectories. Current treatments for SUD struggle to address this heterogeneity, resulting in high relapse rates. SUD often co-occurs with other psychiatric and mental-health related conditions that contribute to the heterogeneity of the disorder and predispose to adverse disease trajectories. Family and genetic studies highlight the role of genetic and environmental factors in the course of SUD, and point to a shared genetic liability between SUDs and comorbid psychopathology. In this study, we aimed to disentangle SUD heterogeneity using a deeply phenotyped SUD cohort and polygenic scores (PGSs) for psychiatric disorders and related traits. We explored associations between PGSs and various SUD-related phenotypes, as well as PGS-environment interactions using information on lifetime emotional, physical and/or sexual abuse. Our results revealed different patterns of associations between the genetic liability for mental-health related traits and SUD-related phenotypes, which may help explain part of the heterogeneity observed in SUD. In our SUD sample, we found associations linking the genetic liability for ADHD with lower educational attainment, the genetic liability for PTSD with higher rates of unemployment, the genetic liability for educational attainment with lower rates of criminal records and unemployment and the genetic liability for well-being with lower rates of outpatient treatments and fewer problems related to family and social relationships. We also found evidence of PGS-environment interactions showing that genetic liability for suicide attempt worsened the psychiatric status in SUD individuals with a history of emotional physical and/or sexual abuse. Collectively, these data contribute to a better understanding of the role of the genetic liability for mental health-related conditions and adverse life experiences in SUD heterogeneity.
THREADS: A Life in Geochemistry

I returned and saw under the sun, that the race is not to the swift, nor the battle to the strong, neither yet bread to the wise, nor yet riches to men of understanding, nor yet favour to men of skill; but time and chance happeneth to them all. Ecclesiastes 9:11 (King James version)
EControl: Fast Distributed Optimization with Compression and Error Control

Modern distributed training relies heavily on communication compression to reduce the communication overhead. In this work, we study algorithms employing a popular class of contractive compressors in order to reduce communication overhead. However, the naive implementation often leads to unstable convergence or even exponential divergence due to the compression bias. Error Compensation (EC) is an extremely popular mechanism to mitigate the aforementioned issues during the training of models enhanced by contractive compression operators. Compared to the effectiveness of EC in the data homogeneous regime, the understanding of the practicality and theoretical foundations of EC in the data heterogeneous regime is limited. Existing convergence analyses typically rely on strong assumptions such as bounded gradients, bounded data heterogeneity, or large batch accesses, which are often infeasible in modern machine learning applications. We resolve the majority of current issues by proposing EControl, a novel mechanism that can regulate error compensation by controlling the strength of the feedback signal. We prove fast convergence for EControl in standard strongly convex, general convex, and nonconvex settings without any additional assumptions on the problem or data heterogeneity. We conduct extensive numerical evaluations to illustrate the efficacy of our method and support our theoretical findings.
GIPCOL: Graph-Injected Soft Prompting for Compositional Zero-Shot Learning

Pre-trained vision-language models (VLMs) have achieved promising success in many fields, especially with prompt learning paradigm. In this work, we propose GIP-COL (Graph-Injected Soft Prompting for COmpositional Learning) to better explore the compositional zero-shot learning (CZSL) ability of VLMs within the prompt-based learning framework. The soft prompt in GIPCOL is structured and consists of the prefix learnable vectors, attribute label and object label. In addition, the attribute and object labels in the soft prompt are designated as nodes in a compositional graph. The compositional graph is constructed based on the compositional structure of the objects and attributes extracted from the training data and consequently feeds the updated concept representation into the soft prompt to capture this compositional structure for a better prompting for CZSL. With the new prompting strategy, GIPCOL achieves state-of-the-art AUC results on all three CZSL benchmarks, including MIT-States, UT-Zappos, and C-GQA datasets in both closed and open settings compared to previous non-CLIP as well as CLIP-based methods. We analyze when and why GIPCOL operates well given the CLIP backbone and its training data limitations, and our findings shed light on designing more effective prompts for CZSL
A note on a Vlasov-Fokker-Planck equation with non-symmetric interaction

In the recent [3], Cesbron and Herda study a Vlasov-Fokker-Planck (VFP) equation with non-symmetric interaction, introduced in physics to model the distribution of electrons in a synchrotron particle accelerator. We make four remarks in view of their work: first, it is noticed in [3] that the free energy classically considered for the (symmetric) VFP equation is not a Lyapunov function in the non-symmetric case, and we will show however that this is still the case for a suitable definition of the free energy (with no explicit expression in general). Second, when the interaction is sufficiently small (in $W^{1,\infty}$), it is proven in [3] that the equation has a unique stationary solution which is locally attractive; in this spirit, we will see that, when the interaction force is Lipschitz with a sufficiently small constant, the convergence is global. Third, we also briefly discuss the mean-field interacting particle system corresponding to the VFP equation which, interestingly, is a non-equilibrium Langevin process. Finally, we will see that, in the small interaction regime, a suitable (explicit) non-linear Fisher information is contracted at constant rate, similarly to the situation of Wasserstein gradient flows for convex functionals (although here the dynamics is not a gradient flow).
Perspective on Nanoscaled Magnonic Networks

With the rapid development of artificial intelligence in recent years, mankind is facing an unprecedented demand for data processing. Today, almost all data processing is performed using electrons in conventional complementary metal-oxide-semiconductor (CMOS) circuits. Over the past few decades, scientists have been searching for faster and more efficient ways to process data. Now, magnons, the quanta of spin waves, show the potential for higher efficiency and lower energy consumption in solving some specific problems. While magnonics remains predominantly in the realm of academia, significant efforts are being made to explore the scientific and technological challenges of the field. Numerous proof-of-concept prototypes have already been successfully developed and tested in laboratories. In this article, we review the developed magnonic devices and discuss the current challenges in realizing magnonic circuits based on these building blocks. We look at the application of spin waves in neuromorphic networks, stochastic and reservoir computing and discuss the advantages over conventional electronics in these areas. We then introduce a new powerful tool, inverse design magnonics, which has the potential to revolutionize the field by enabling the precise design and optimization of magnonic devices in a short time. Finally, we provide a theoretical prediction of energy consumption and propose benchmarks for universal magnonic circuits.
Bayesian Image-on-Image Regression via Deep Kernel Learning based Gaussian Processes

In neuroimaging studies, it becomes increasingly important to study associations between different imaging modalities using image-on-image regression (IIR), which faces challenges in interpretation, statistical inference, and prediction. Our motivating problem is how to predict task-evoked fMRI activity using resting-state fMRI data in the Human Connectome Project (HCP). The main difficulty lies in effectively combining different types of imaging predictors with varying resolutions and spatial domains in IIR. To address these issues, we develop Bayesian Image-on-image Regression via Deep Kernel Learning Gaussian Processes (BIRD-GP) and develop efficient posterior computation methods through Stein variational gradient descent. We demonstrate the advantages of BIRD-GP over state-of-the-art IIR methods using simulations. For HCP data analysis using BIRD-GP, we combine the voxel-wise fALFF maps and region-wise connectivity matrices to predict fMRI contrast maps for language and social recognition tasks. We show that fALFF is less predictive than the connectivity matrix for both tasks, but combining both yields improved results. Angular Gyrus Right emerges as the most predictable region for the language task (75.9% predictable voxels), while Superior Parietal Gyrus Right tops for the social recognition task (48.9% predictable voxels). Additionally, we identify features from the resting-state fMRI data that are important for task fMRI prediction.
Distribution of Hα Emitters in Merging Galaxy Clusters

Studies of star formation in various galaxy cluster mergers have reached apparently contradictory conclusions regarding whether mergers stimulate star formation, quench it, or have no effect. Because the mergers studied span a range of time since pericenter (TSP), it is possible that the apparent effect on star formation is a function of the TSP. We use a sample of 12 bimodal mergers to assess the star formation as a function of TSP. We measure the equivalent width of the Hα emission line in ∼100 member galaxies in each merger, classify galaxies as emitters or nonemitters, and then classify emitters as star-forming galaxies (SFGs) or active galactic nucleus (AGN) based on the [N ii] λ6583 line. We quantify the distribution of SFG and AGN relative to nonemitters along the spatial axis defined by the subcluster separation. The SFG and AGN fractions vary from merger to merger but show no trend with TSP. The spatial distribution of SFG is consistent with that of nonemitters in eight mergers, but show significant avoidance of the system center in the remaining four mergers, including the three with the lowest TSP. If there is a connection between star formation activity and TSP, probing it further will require more precise TSP estimates and more mergers with TSP in the range of 0–400 Myr.
Dynamics of spin glass formation under tunable fluctuations in frustrated cavity QED experiments

We solve the dynamics of multi-mode cavity QED with frustrated atom-photon couplings using non-perturbative diagrammatics. Our technique enables a thorough investigation of the nature of the spin glass transition hosted in these platforms. We focus in particular on the role of quantum correlations in each of the atomic ensembles which form the frustrated spin network modeling the experiment. We report on the stabilizing effect of strong quantum fluctuations in fostering a glassy phase over extended time scales. At variance with this behaviour, in the semi-classical limit, spin glass order is pre-thermally obstructed by the ferromagnetic correlations present at the level of individual atomic ensembles, which substantially delay spin glass formation, acting as competing order. Our results set the stage for studying cavity QED experiments with tunable quantum fluctuations, and accompanying them in the transition from semi-classical to strongly correlated operational regimes.
PolyMaX: General Dense Prediction with Mask Transformer

Dense prediction tasks, such as semantic segmentation, depth estimation, and surface normal prediction, can be easily formulated as per-pixel classification (discrete outputs) or regression (continuous outputs). This per-pixel prediction paradigm has remained popular due to the prevalence of fully convolutional networks. However, on the recent frontier of segmentation task, the community has been witnessing a shift of paradigm from per-pixel prediction to cluster-prediction with the emergence of transformer architectures, particularly the mask transformers, which directly predicts a label for a mask instead of a pixel. Despite this shift, methods based on the per-pixel prediction paradigm still dominate the benchmarks on the other dense prediction tasks that require continuous outputs, such as depth estimation and surface normal prediction. Motivated by the success of DORN and AdaBins in depth estimation, achieved by discretizing the continuous output space, we propose to generalize the cluster-prediction based method to general dense prediction tasks. This allows us to unify dense prediction tasks with the mask transformer framework. Remarkably, the resulting model PolyMaX demonstrates state-of-the-art performance on three benchmarks of NYUD-v2 dataset. We hope our simple yet effective design can inspire more research on exploiting mask transformers for more dense prediction tasks. Code and model will be made available.
Low-Multi-Rank High-Order Bayesian Robust Tensor Factorization

The recently proposed tensor robust principal component analysis (TRPCA) methods based on tensor singular value decomposition (t-SVD) have achieved numerous successes in many fields. However, most of these methods are only applicable to third-order tensors, whereas the data obtained in practice are often of higher order, such as fourth-order color videos, fourth-order hyperspectral videos, and fifth-order light-field images. Additionally, in the t-SVD framework, the multi-rank of a tensor can describe more fine-grained low-rank structure in the tensor compared with the tubal rank. However, determining the multi-rank of a tensor is a much more difficult problem than determining the tubal rank. Moreover, most of the existing TRPCA methods do not explicitly model the noises except the sparse noise, which may compromise the accuracy of estimating the low-rank tensor. In this work, we propose a novel high-order TRPCA method, named as Low-Multi-rank High-order Bayesian Robust Tensor Factorization (LMH-BRTF), within the Bayesian framework. Specifically, we decompose the observed corrupted tensor into three parts, i.e., the low-rank component, the sparse component, and the noise component. By constructing a low-rank model for the low-rank component based on the order-$d$ t-SVD and introducing a proper prior for the model, LMH-BRTF can automatically determine the tensor multi-rank. Meanwhile, benefiting from the explicit modeling of both the sparse and noise components, the proposed method can leverage information from the noises more effectivly, leading to an improved performance of TRPCA. Then, an efficient variational inference algorithm is established for parameters estimation. Empirical studies on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in terms of both qualitative and quantitative results.
OmniVec: Learning robust representations with cross modal sharing

Majority of research in learning based methods has been towards designing and training networks for specific tasks. However, many of the learning based tasks, across modalities, share commonalities and could be potentially tackled in a joint framework. We present an approach in such direction, to learn multiple tasks, in multiple modalities, with a unified architecture. The proposed network is composed of task specific encoders, a common trunk in the middle, followed by task specific prediction heads. We first pre-train it by self-supervised masked training, followed by sequential training for the different tasks. We train the network on all major modalities, e.g.\ visual, audio, text and 3D, and report results on $22$ diverse and challenging public benchmarks. We demonstrate empirically that, using a joint network to train across modalities leads to meaningful information sharing and this allows us to achieve state-of-the-art results on most of the benchmarks. We also show generalization of the trained network on cross-modal tasks as well as unseen datasets and tasks.
Predictive AI for SME and Large Enterprise Financial Performance Management

Financial performance management is at the core of business management and has historically relied on financial ratio analysis using Balance Sheet and Income Statement data to assess company performance as compared with competitors. Little progress has been made in predicting how a company will perform or in assessing the risks (probabilities) of financial underperformance. In this study I introduce a new set of financial and macroeconomic ratios that supplement standard ratios of Balance Sheet and Income Statement. I also provide a set of supervised learning models (ML Regressors and Neural Networks) and Bayesian models to predict company performance. I conclude that the new proposed variables improve model accuracy when used in tandem with standard industry ratios. I also conclude that Feedforward Neural Networks (FNN) are simpler to implement and perform best across 6 predictive tasks (ROA, ROE, Net Margin, Op Margin, Cash Ratio and Op Cash Generation); although Bayesian Networks (BN) can outperform FNN under very specific conditions. BNs have the additional benefit of providing a probability density function in addition to the predicted (expected) value. The study findings have significant potential helping CFOs and CEOs assess risks of financial underperformance to steer companies in more profitable directions; supporting lenders in better assessing the condition of a company and providing investors with tools to dissect financial statements of public companies more accurately.
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof

Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n^{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any computable function $f$. This lower bound is widely used to show that certain parameterized problems cannot be solved in time $f(k)\cdot n^{o(k/\log k)}$ time (assuming the ETH). The purpose of this note is to give a streamlined proof of this result.
RIGA: A Regret-Based Interactive Genetic Algorithm

In this paper, we propose an interactive genetic algorithm for solving multi-objective combinatorial optimization problems under preference imprecision. More precisely, we consider problems where the decision maker's preferences over solutions can be represented by a parameterized aggregation function (e.g., a weighted sum, an OWA operator, a Choquet integral), and we assume that the parameters are initially not known by the recommendation system. In order to quickly make a good recommendation, we combine elicitation and search in the following way: 1) we use regret-based elicitation techniques to reduce the parameter space in a efficient way, 2) genetic operators are applied on parameter instances (instead of solutions) to better explore the parameter space, and 3) we generate promising solutions (population) using existing solving methods designed for the problem with known preferences. Our algorithm, called RIGA, can be applied to any multi-objective combinatorial optimization problem provided that the aggregation function is linear in its parameters and that a (near-)optimal solution can be efficiently determined for the problem with known preferences. We also study its theoretical performances: RIGA can be implemented in such way that it runs in polynomial time while asking no more than a polynomial number of queries. The method is tested on the multi-objective knapsack and traveling salesman problems. For several performance indicators (computation times, gap to optimality and number of queries), RIGA obtains better results than state-of-the-art algorithms.
Magnetic Field Strength Effects on Nucleosynthesis from Neutron Star Merger Outflows

Magnetohydrodynamic turbulence drives the central engine of post-merger remnants, potentially powering both a nucleosynthetically active disk wind and the relativistic jet behind a short gamma-ray burst. We explore the impact of the magnetic field on this engine by simulating three post-merger black hole accretion disks using general relativistic magnetohydrodynamics with Monte Carlo neutrino transport, in each case varying the initial magnetic field strength. We find increasing ejecta masses associated with increasing magnetic field strength. We find that a fairly robust main r-process pattern is produced in all three cases, scaled by the ejected mass. Changing the initial magnetic field strength has a considerable effect on the geometry of the outflow and hints at complex central engine dynamics influencing lanthanide outflows. We find that actinide production is especially sensitive to magnetic field strength, with the overall actinide mass fraction calculated at 1 Gyr post-merger increasing by more than a factor of 6 with a tenfold increase in magnetic field strength. This hints at a possible connection to the variability in actinide enhancements exhibited by metal-poor, r-process-enhanced stars.
Combating Misinformation in the Age of LLMs: Opportunities and Challenges

Misinformation such as fake news and rumors is a serious threat on information ecosystems and public trust. The emergence of Large Language Models (LLMs) has great potential to reshape the landscape of combating misinformation. Generally, LLMs can be a double-edged sword in the fight. On the one hand, LLMs bring promising opportunities for combating misinformation due to their profound world knowledge and strong reasoning abilities. Thus, one emergent question is: how to utilize LLMs to combat misinformation? On the other hand, the critical challenge is that LLMs can be easily leveraged to generate deceptive misinformation at scale. Then, another important question is: how to combat LLM-generated misinformation? In this paper, we first systematically review the history of combating misinformation before the advent of LLMs. Then we illustrate the current efforts and present an outlook for these two fundamental questions respectively. The goal of this survey paper is to facilitate the progress of utilizing LLMs for fighting misinformation and call for interdisciplinary efforts from different stakeholders for combating LLM-generated misinformation.
Characterization of non-adaptive Clifford channels

We show that multiqubit quantum channels which may be realised via stabilizer circuits without classical control (Clifford channels) have a particularly simple structure. They can be equivalently defined as channels that preserve mixed stabilizer states, or the channels with stabilizer Choi state. Up to unitary encoding and decoding maps any Clifford channel is a product of stabilizer state preparations, qubit discardings, identity channels and dephasing channels. This simple structure allows to characterise information-theoretic properties of such channels.