Miracle-dz/UniFAR-FTUs huggingface dataset:
Spatiotemporal Besov Priors for Bayesian Inverse Problems

Fast development in science and technology has driven the need for proper statistical tools to capture special data features such as abrupt changes or sharp contrast. Many inverse problems in data science require spatiotemporal solutions derived from a sequence of time-dependent objects with these spatial features, e.g., dynamic reconstruction of computerized tomography (CT) images with edges. Conventional methods based on Gaussian processes (GP) often fall short in providing satisfactory solutions since they tend to offer over-smooth priors. Recently, the Besov process (BP), defined by wavelet expansions with random coefficients, has emerged as a more suitable prior for Bayesian inverse problems of this nature. While BP excels in handling spatial inhomogeneity, it does not automatically incorporate temporal correlation inherited in the dynamically changing objects. In this paper, we generalize BP to a novel spatiotemporal Besov process (STBP) by replacing the random coefficients in the series expansion with stochastic time functions as Q-exponential process (Q-EP) which governs the temporal correlation structure. We thoroughly investigate the mathematical and statistical properties of STBP. A white-noise representation of STBP is also proposed to facilitate the inference. Simulations, two limited-angle CT reconstruction examples and a highly non-linear inverse problem involving Navier-Stokes equation are used to demonstrate the advantage of the proposed STBP in preserving spatial features while accounting for temporal changes compared with the classic STGP and a time-uncorrelated approach.
Is ChatGPT a Biomedical Expert?

We assessed the performance of commercial Large Language Models (LLMs) GPT-3.5-Turbo and GPT-4 on tasks from the 2023 BioASQ challenge. In Task 11b Phase B, which is focused on answer generation, both models demonstrated competitive abilities with leading systems. Remarkably, they achieved this with simple zero-shot learning, grounded with relevant snippets. Even without relevant snippets, their performance was decent, though not on par with the best systems. Interestingly, the older and cheaper GPT-3.5-Turbo system was able to compete with GPT-4 in the grounded Q&A setting on factoid and list answers. In Task 11b Phase A, focusing on retrieval, query expansion through zero-shot learning improved performance, but the models fell short compared to other systems. The code needed to rerun these experiments is available through GitHub.
Large Language Model as Attributed Training Data Generator: A Tale of Diversity and Bias

Large language models (LLMs) have been recently leveraged as training data generators for various natural language processing (NLP) tasks. While previous research has explored different approaches to training models using generated data, they generally rely on simple class-conditional prompts, which may limit the diversity of the generated data and inherit systematic biases of LLM. Thus, we investigate training data generation with diversely attributed prompts (e.g., specifying attributes like length and style), which have the potential to yield diverse and attributed generated data. Our investigation focuses on datasets with high cardinality and diverse domains, wherein we demonstrate that attributed prompts outperform simple class-conditional prompts in terms of the resulting model's performance. Additionally, we present a comprehensive empirical study on data generation encompassing vital aspects like bias, diversity, and efficiency, and highlight three key observations: firstly, synthetic datasets generated by simple prompts exhibit significant biases, such as regional bias; secondly, attribute diversity plays a pivotal role in enhancing model performance; lastly, attributed prompts achieve the performance of simple class-conditional prompts while utilizing only 5\% of the querying cost of ChatGPT associated with the latter. The data and code are available on \url{https://github.com/yueyu1030/AttrPrompt}.
Shape and parameter identification by the linear sampling method for a restricted Fourier integral operator

In this paper we provide a new linear sampling method based on the same data but a different definition of the data operator for two inverse problems: the multi-frequency inverse source problem for a fixed observation direction and the Born inverse scattering problems. We show that the associated regularized linear sampling indicator converges to the average of the unknown in a small neighborhood as the regularization parameter approaches to zero. We develop both a shape identification theory and a parameter identification theory which are stimulated, analyzed, and implemented with the help of the prolate spheroidal wave functions and their generalizations. We further propose a prolate-based implementation of the linear sampling method and provide numerical experiments to demonstrate how this linear sampling method is capable of reconstructing both the shape and the parameter.
Charge-Density-Waves Tuned by Crystal Symmetry

The electronic orders appearing in condensed matter systems are originating from the precise arrangement of atoms constituting the crystal as well as their nature. This teneous relationship can lead to highly different phases in condensed matter, and drive electronic phase transitions. Here, we show that a very slight deformation of the crystal structure of TbTe$_3$ can have a dramatic influence on the electronic order that is stabilized. In particular, we show that the Charge Density Wave (CDW) developping along the $\vec{c}$ axis in the pristine state, switches to an orientation along $\vec{a}$ when the naturally orthorhombic system is turned into a tetragonal system. This is achieved by performing true biaxial mechanical deformation of a TbTe$_3$ sample from 250K to 375K, and by measuring both structural and electronic parameters with x-ray diffraction and transport measurements. We show that this switching transition is driven by the tetragonality parameter $a/c$, and that the transition occurs for $a=c$, with a coexistence region for $0.9985<a/c<1.002$. The CDW transition temperature $T_c$ is found to have a linear dependence with $a/c$, with no saturation in the deformed states investigated here, while the gap saturates out of the coexistence region. The linear dependence of $T_c$ is accounted for within a tight-binding model. Our results question the relationship between the gap and $T_c$ in RTe$_3$ systems. More generally, our method of applying true biaxial deformation at cryogenic temperatures can be applied to many systems displaying electronic phase transitions, and opens a new route towards the study of coexisting or competing electronic orders in condensed matter.
Investigating the Uncanny Valley Phenomenon Through the Temporal Dynamics of Neural Responses to Virtual Characters

The Uncanny Valley phenomenon refers to the feeling of unease that arises when interacting with characters that appear almost, but not quite, human-like. First theorised by Masahiro Mori in 1970, it has since been widely observed in different contexts from humanoid robots to video games, in which it can result in players feeling uncomfortable or disconnected from the game, leading to a lack of immersion and potentially reducing the overall enjoyment. The phenomenon has been observed and described mostly through behavioural studies based on self-reported scales of uncanny feeling: however, there is still no consensus on its cognitive and perceptual origins, which limits our understanding of its impact on player experience. In this paper, we present a study aimed at identifying the mechanisms that trigger the uncanny response by collecting and analysing both self-reported feedback and EEG data.
Revealing ultrafast phonon mediated inter-valley scattering through transient absorption and high harmonic spectroscopies

Processes involving ultrafast laser driven electron-phonon dynamics play a fundamental role in the response of quantum systems in a growing number of situations of interest, as evidenced by phenomena such as strongly driven phase transitions and light driven engineering of material properties. To show how these processes can be captured from a computational perspective, we simulate the transient absorption spectra and high harmonic generation signals associated with valley selective excitation and intra-band charge carrier relaxation in monolayer hexagonal boron nitride. We show that the multi-trajectory Ehrenfest dynamics approach, implemented in combination with real-time time-dependent density functional theory and tight-binding models, offers a simple, accurate and efficient method to study ultrafast electron-phonon coupled phenomena in solids under diverse pump-probe regimes which can be easily incorporated into the majority of real-time ab-initio software packages.
Deep learning for post-processing global probabilistic forecasts on sub-seasonal time scales

Sub-seasonal weather forecasts are becoming increasingly important for a range of socio-economic activities. However, the predictive ability of physical weather models is very limited on these time scales. We propose four post-processing methods based on convolutional neural networks to improve sub-seasonal forecasts by correcting systematic errors of numerical weather prediction models. Our post-processing models operate directly on spatial input fields and are therefore able to retain spatial relationships and to generate spatially homogeneous predictions. They produce global probabilistic tercile forecasts for biweekly aggregates of temperature and precipitation for weeks 3-4 and 5-6. In a case study based on a public forecasting challenge organized by the World Meteorological Organization, our post-processing models outperform the bias-corrected forecasts from the European Centre for Medium-Range Weather Forecasts (ECMWF), and achieve improvements over climatological forecasts for all considered variables and lead times. We compare several model architectures and training modes and demonstrate that all approaches lead to skillful and well-calibrated probabilistic forecasts. The good calibration of the post-processed forecasts emphasizes that our post-processing models reliably quantify the forecast uncertainty based on deterministic input information in form of ECMWF ensemble mean forecast fields only.
Dyck Paths and Topological Quantum Computation

The fusion basis of Fibonacci anyons supports unitary braid representations that can be utilized for universal quantum computation. We show a mapping between the fusion basis of three Fibonacci anyons, $\{|1\rangle, |\tau\rangle\}$, and the two length 4 Dyck paths via an isomorphism between the two dimensional braid group representations on the fusion basis and the braid group representation built on the standard $(2,2)$ Young diagrams using the Jones construction. This correspondence helps us construct the fusion basis of the Fibonacci anyons using Dyck paths as the number of standard $(N,N)$ Young tableaux is the Catalan number, $C_N$ . We then use the local Fredkin moves to construct a spin chain that contains precisely those Dyck paths that correspond to the Fibonacci fusion basis, as a degenerate set. We show that the system is gapped and examine its stability to random noise thereby establishing its usefulness as a platform for topological quantum computation. Finally, we show braidwords in this rotated space that efficiently enable the execution of any desired single-qubit operation, achieving the desired level of precision($\sim 10^{-3}$).
Positive Label Is All You Need for Multi-Label Classification

Multi-label classification (MLC) suffers from the inevitable label noise in training data due to the difficulty in annotating various semantic labels in each image. To mitigate the influence of noisy labels, existing methods mainly devote to identifying and correcting the label mistakes via a trained MLC model. However, these methods still involve annoying noisy labels in training, which can result in imprecise recognition of noisy labels and weaken the performance. In this paper, considering that the negative labels are substantially more than positive labels, and most noisy labels are from the negative labels, we directly discard all the negative labels in the dataset, and propose a new method dubbed positive and unlabeled multi-label classification (PU-MLC). By extending positive-unlabeled learning into MLC task, our method trains model with only positive labels and unlabeled data, and introduces adaptive re-balance factor and adaptive temperature coefficient in the loss function to alleviate the catastrophic imbalance in label distribution and over-smoothing of probabilities in training. Furthermore, to capture both local and global dependencies in the image, we also introduce a local-global convolution module, which supplements global information into existing convolution layers with no retraining of backbone required. Our PU-MLC is simple and effective, and it is applicable to both MLC and MLC with partial labels (MLC-PL) tasks. Extensive experiments on MS-COCO and PASCAL VOC datasets demonstrate that our PU-MLC achieves significantly improvements on both MLC and MLC-PL settings with even fewer annotations. Code will be released.
DUET: 2D Structured and Approximately Equivariant Representations

Multiview Self-Supervised Learning (MSSL) is based on learning invariances with respect to a set of input transformations. However, invariance partially or totally removes transformation-related information from the representations, which might harm performance for specific downstream tasks that require such information. We propose 2D strUctured and EquivarianT representations (coined DUET), which are 2d representations organized in a matrix structure, and equivariant with respect to transformations acting on the input data. DUET representations maintain information about an input transformation, while remaining semantically expressive. Compared to SimCLR (Chen et al., 2020) (unstructured and invariant) and ESSL (Dangovski et al., 2022) (unstructured and equivariant), the structured and equivariant nature of DUET representations enables controlled generation with lower reconstruction error, while controllability is not possible with SimCLR or ESSL. DUET also achieves higher accuracy for several discriminative tasks, and improves transfer learning.
Mulsemedia Communication Research Challenges for Metaverse in 6G Wireless Systems

Although humans have five basic senses, sight, hearing, touch, smell, and taste, most multimedia systems today only capture two of them, namely, sight and hearing. With the development of the metaverse and related technologies, there is a growing need for a more immersive media format that leverages all human senses. Multisensory media (Mulsemedia) that can stimulate multiple senses will play a critical role in the near future. This paper provides an overview of the history, background, use cases, existing research, devices, and standards of mulsemedia. Emerging mulsemedia technologies such as extended Reality (XR) and Holographic-Type Communication (HTC) are introduced. Additionally, the challenges in mulsemedia research from the perspective of wireless communication and networking are discussed. The potential of 6G wireless systems to address these challenges is highlighted, and several research directions that can advance mulsemedia communications are identified.
Multi-network Contrastive Learning Based on Global and Local Representations

The popularity of self-supervised learning has made it possible to train models without relying on labeled data, which saves expensive annotation costs. However, most existing self-supervised contrastive learning methods often overlook the combination of global and local feature information. This paper proposes a multi-network contrastive learning framework based on global and local representations. We introduce global and local feature information for self-supervised contrastive learning through multiple networks. The model learns feature information at different scales of an image by contrasting the embedding pairs generated by multiple networks. The framework also expands the number of samples used for contrast and improves the training efficiency of the model. Linear evaluation results on three benchmark datasets show that our method outperforms several existing classical self-supervised learning methods.
Characterizing the Spectral Structure of Weak Impulsive Narrowband Quiet Sun Emissions

Weak Impulsive Narrowband Quiet Sun Emissions (WINQSEs) are a newly discovered class of radio emission from the solar corona. These emissions are characterized by their extremely impulsive, narrowband, and ubiquitous nature. We have systematically been working on their detailed characterization, including their strengths, morphologies, temporal characteristics, energies, etc. This work is the next step in this series and focuses on the spectral nature of WINQSEs. Given that their strength is only a few percent of the background solar emission, we have adopted an extremely conservative approach to reliably identify WINQSES. Only a handful of WINQSEs meet all of our stringent criteria. Their flux densities lie in the 20–50 Jy range and they have compact morphologies. For the first time, we estimate their bandwidths and find them to be less than 700 kHz, consistent with expectations based on earlier observations. Interestingly, we also find similarities between the spectral nature of WINQSEs and the solar radio spikes. This is consistent with our hypothesis that the WINQSEs are the weaker cousins of the type III radio bursts and are likely to be the low-frequency radio counterparts of the nanoflares, originally hypothesized as a possible explanation for coronal heating.
Rough analysis of two scale systems

We are concerned with a slow-fast system of coupled three dimensional Navier--Stokes equations where the fast component is perturbed by an additive Brownian noise. By means of the rough path theory we establish the convergence in law of the slow component towards a Navier--Stokes system with an It\^o--Stokes drift and a rough path driven transport noise. This gives an alternative, more general and direct proof to Debussche, Pappalettera, 2022. In particular, the limit driving rough path is identified as a geometric rough path which does not necessarily coincide with the Stratonovich lift of the Brownian motion.
Predicting the Impact of Batch Refactoring Code Smells on Application Resource Consumption

Automated batch refactoring has become a de-facto mechanism to restructure software that may have significant design flaws negatively impacting the code quality and maintainability. Although automated batch refactoring techniques are known to significantly improve overall software quality and maintainability, their impact on resource utilization is not well studied. This paper aims to bridge the gap between batch refactoring code smells and consumption of resources. It determines the relationship between software code smell batch refactoring, and resource consumption. Next, it aims to design algorithms to predict the impact of code smell refactoring on resource consumption. This paper investigates 16 code smell types and their joint effect on resource utilization for 31 open source applications. It provides a detailed empirical analysis of the change in application CPU and memory utilization after refactoring specific code smells in isolation and in batches. This analysis is then used to train regression algorithms to predict the impact of batch refactoring on CPU and memory utilization before making any refactoring decisions. Experimental results also show that our ANN-based regression model provides highly accurate predictions for the impact of batch refactoring on resource consumption. It allows the software developers to intelligently decide which code smells they should refactor jointly to achieve high code quality and maintainability without increasing the application resource utilization. This paper responds to the important and urgent need of software engineers across a broad range of software applications, who are looking to refactor code smells and at the same time improve resource consumption. Finally, it brings forward the concept of resource aware code smell refactoring to the most crucial software applications.
c axis electrical transport at the metamagnetic transition in the heavy-fermion superconductor UTe2 under pressure

The electrical resistivity of the unconventional superconductor UTe$_2$ shows very anisotropic behavior in the normal state depending on the current direction. In the present paper we show that the maximum in the resistivity $\rho_c$ for current applied along the $c$ axis at $T^{\rm max}_{\rho_c} \approx 14.75$~K follows the minimum in the thermal expansion $T_\alpha^\star$ along $b$ axis. Under a magnetic field applied along the $b$ axis, $T^{\rm max}_{\rho_c}$ can be tracked up to the critical point of the first order metamagnetic transition, which is located near 6~K and 34.5~T. Surprisingly, at the metamagnetic field $H_m$ the resistivity $\rho_c$ shows a steplike decrease while the resistivities $\rho_a$ and $\rho_b$, for current along the $a$ and $b$ axis, respectively, show a steplike increase. Under hydrostatic pressure $T^{\rm max}_{\rho_c}$ and $H_m$ decrease significantly up to the critical pressure $p_c$ at which superconductivity is suppressed and a long range antiferromagnetic order appears. We show that the phase diagram at different pressures can be scaled by $T^{\rm max}_{\rho_c}$ in field and temperature suggesting that this temperature scale is governing the main interactions in the normal state.
Differentially Private Distributed Estimation and Learning

We study distributed estimation and learning problems in a networked environment where agents exchange information to estimate unknown statistical properties of random variables from their privately observed samples. The agents can collectively estimate the unknown quantities by exchanging information about their private observations, but they also face privacy risks. Our novel algorithms extend the existing distributed estimation literature and enable the participating agents to estimate a complete sufficient statistic from private signals acquired offline or online over time and to preserve the privacy of their signals and network neighborhoods. This is achieved through linear aggregation schemes with adjusted randomization schemes that add noise to the exchanged estimates subject to differential privacy (DP) constraints, both in an offline and online manner. We provide convergence rate analysis and tight finite-time convergence bounds. We show that the noise that minimizes the convergence time to the best estimates is the Laplace noise, with parameters corresponding to each agent's sensitivity to their signal and network characteristics. Our algorithms are amenable to dynamic topologies and balancing privacy and accuracy trade-offs. Finally, to supplement and validate our theoretical results, we run experiments on real-world data from the US Power Grid Network and electric consumption data from German Households to estimate the average power consumption of power stations and households under all privacy regimes and show that our method outperforms existing first-order, privacy-aware, distributed optimization methods.