Miracle-dz/UniFAR-FTUs huggingface dataset:
Image-to-Image Translation with Deep Reinforcement Learning

Most existing Image-to-Image Translation (I2IT) methods generate images in a single run of a deep learning (DL) model. However, designing such a single-step model is always challenging, requiring a huge number of parameters and easily falling into bad global minimums and overfitting. In this work, we reformulate I2IT as a step-wise decision-making problem via deep reinforcement learning (DRL) and propose a novel framework that performs RL-based I2IT (RL-I2IT). The key feature in the RL-I2IT framework is to decompose a monolithic learning process into small steps with a lightweight model to progressively transform a source image successively to a target image. Considering that it is challenging to handle high dimensional continuous state and action spaces in the conventional RL framework, we introduce meta policy with a new concept Plan to the standard Actor-Critic model, which is of a lower dimension than the original image and can facilitate the actor to generate a tractable high dimensional action. In the RL-I2IT framework, we also employ a task-specific auxiliary learning strategy to stabilize the training process and improve the performance of the corresponding task. Experiments on several I2IT tasks demonstrate the effectiveness and robustness of the proposed method when facing high-dimensional continuous action space problems. Our implementation of the RL-I2IT framework is available at https://github.com/Algolzw/SPAC-Deformable-Registration.
Artificial Neural Network Optimal Modeling and Optimization of UAV Measurements for Mobile Communications Using the L-SHADE Algorithm

Channel modeling of wireless communications from unmanned aerial vehicles (UAVs) is an emerging research challenge. In this paper, we propose a solution to this issue by applying a new framework for the prediction of received signal strength (RSS) in mobile communications based on artificial neural networks (ANNs). The experimental data measurements are taken with a UAV at different altitudes. We apply several evolutionary algorithms (EAs) in conjunction with the Levenberg–Marquardt (LM) backpropagation algorithm in order to train different ANNs and in particular the L-SHADE algorithm, which self-adapts control parameters and dynamically adjusts population size. Five new hybrid training methods are designed by combining LM with self-adaptive differential evolution (DE) strategies. These new training methods obtain better performance to ANN weight optimization than the original LM method. The received results are compared with the real values using representative ANN performance indices and exhibit satisfactory accuracy.
Connecting Speech Encoder and Large Language Model for ASR

The impressive capability and versatility of large language models (LLMs) have aroused increasing attention in automatic speech recognition (ASR), with several pioneering studies attempting to build integrated ASR models by connecting a speech encoder with an LLM. This paper presents a comparative study of three commonly used structures as connectors, including fully connected layers, multi-head cross-attention, and Q-Former. Speech encoders from the Whisper model series as well as LLMs from the Vicuna model series with different model sizes were studied. Experiments were performed on the commonly used LibriSpeech, Common Voice, and GigaSpeech datasets, where the LLMs with Q-Formers demonstrated consistent and considerable word error rate (WER) reductions over LLMs with other connector structures. Q-Former-based LLMs can generalise well to out-of-domain datasets, where 12% relative WER reductions over the Whisper baseline ASR model were achieved on the Eval2000 test set without using any in-domain training data from Switchboard. Moreover, a novel segment-level Q-Former is proposed to enable LLMs to recognise speech segments with a duration exceeding the limitation of the encoders, which results in 17% relative WER reductions over other connector structures on 90-second-long speech data.
Simultaneous High-Speed and Low-Dose 4-D STEM Using Compressive Sensing Techniques

Here we show that compressive sensing allow 4-dimensional (4-D) STEM data to be obtained and accurately reconstructed with both high-speed and low fluence. The methodology needed to achieve these results compared to conventional 4-D approaches requires only that a random subset of probe locations is acquired from the typical regular scanning grid, which immediately generates both higher speed and the lower fluence experimentally. We also consider downsampling of the detector, showing that oversampling is inherent within convergent beam electron diffraction (CBED) patterns, and that detector downsampling does not reduce precision but allows faster experimental data acquisition. Analysis of an experimental atomic resolution yttrium silicide data-set shows that it is possible to recover over 25dB peak signal-to-noise in the recovered phase using 0.3% of the total data.
Irregular loci in the Emerton-Gee stack for GL_2

Let K/Q_p be unramified. Inside the Emerton-Gee stack X_2, one can consider the locus of two-dimensional mod p representations of the absolute Galois group of K having a crystalline lift with specified Hodge-Tate weights. We study the case where the Hodge-Tate weights are irregular, which is an analogue for Galois representations of the partial weight one condition for Hilbert modular forms. We prove that if the gap between each pair of weights is bounded by p (the irregular analogue of a Serre weight), then this locus is irreducible. We also establish various inclusion relations between these loci.
AI-Copilot for Business Optimisation: A Framework and A Case Study in Production Scheduling

Business optimisation refers to the process of finding and implementing efficient and cost-effective means of operation to bring a competitive advantage for businesses. Synthesizing problem formulations is an integral part of business optimisation, which relies on human expertise to construct problem formulations using optimisation languages. Interestingly, with advancements in Large Language Models (LLMs), the human expertise needed in problem formulation can be minimized. However, developing an LLM for problem formulation is challenging, due to training data, token limitations, and lack of appropriate performance metrics. For the requirement of training data, recent attention has been directed towards fine-tuning pre-trained LLMs for downstream tasks rather than training an LLM from scratch for a specific task. In this paper, we adopt an LLM fine-tuning approach and propose an AI-Copilot for business optimisation problem formulation. For token limitations, we introduce modularization and prompt engineering techniques to synthesize complex problem formulations as modules that fit into the token limits of LLMs. Additionally, we design performance evaluation metrics that are better suited for assessing the accuracy and quality of problem formulations. The experiment results demonstrate that with this approach we can synthesize complex and large problem formulations for a typical business optimisation problem in production scheduling.
Turbulence in Focus: Benchmarking Scaling Behavior of 3D Volumetric Super-Resolution with BLASTNet 2.0 Data

Analysis of compressible turbulent flows is essential for applications related to propulsion, energy generation, and the environment. Here, we present BLASTNet 2.0, a 2.2 TB network-of-datasets containing 744 full-domain samples from 34 high-fidelity direct numerical simulations, which addresses the current limited availability of 3D high-fidelity reacting and non-reacting compressible turbulent flow simulation data. With this data, we benchmark a total of 49 variations of five deep learning approaches for 3D super-resolution - which can be applied for improving scientific imaging, simulations, turbulence models, as well as in computer vision applications. We perform neural scaling analysis on these models to examine the performance of different machine learning (ML) approaches, including two scientific ML techniques. We demonstrate that (i) predictive performance can scale with model size and cost, (ii) architecture matters significantly, especially for smaller models, and (iii) the benefits of physics-based losses can persist with increasing model size. The outcomes of this benchmark study are anticipated to offer insights that can aid the design of 3D super-resolution models, especially for turbulence models, while this data is expected to foster ML methods for a broad range of flow physics applications. This data is publicly available with download links and browsing tools consolidated at https://blastnet.github. io.
DeWave: Discrete EEG Waves Encoding for Brain Dynamics to Text Translation

The translation of brain dynamics into natural language is pivotal for brain-computer interfaces (BCIs). With the swift advancement of large language models, such as ChatGPT, the need to bridge the gap between the brain and languages becomes increasingly pressing. Current methods, however, require eye-tracking fixations or event markers to segment brain dynamics into word-level features, which can restrict the practical application of these systems. To tackle these issues, we introduce a novel framework, DeWave, that integrates discrete encoding sequences into open-vocabulary EEG-to-text translation tasks. DeWave uses a quantized variational encoder to derive discrete codex encoding and align it with pre-trained language models. This discrete codex representation brings forth two advantages: 1) it realizes translation on raw waves without marker by introducing text-EEG contrastive alignment training, and 2) it alleviates the interference caused by individual differences in EEG waves through an invariant discrete codex with or without markers. Our model surpasses the previous baseline (40.1 and 31.7) by 3.06% and 6.34%, respectively, achieving 41.35 BLEU-1 and 33.71 Rouge-F on the ZuCo Dataset. This work is the first to facilitate the translation of entire EEG signal periods without word-level order markers (e.g., eye fixations), scoring 20.5 BLEU-1 and 29.5 Rouge-1 on the ZuCo Dataset.
Cloud Watching: Understanding Attacks Against Cloud-Hosted Services

Cloud computing has dramatically changed service deployment patterns. In this work, we analyze how attackers identify and target cloud services in contrast to traditional enterprise networks and network telescopes. Using a diverse set of cloud honeypots in 5 providers and 23 countries as well as 2 educational networks and 1 network telescope, we analyze how IP address assignment, geography, network, and service-port selection, influence what services are targeted in the cloud. We find that scanners that target cloud compute are selective: they avoid scanning networks without legitimate services and they discriminate between geographic regions. Further, attackers mine Internet-service search engines to find exploitable services and, in some cases, they avoid targeting IANA-assigned protocols, causing researchers to misclassify at least 15% of traffic on select ports. Based on our results, we derive recommendations for researchers and operators.
A SAM-based Solution for Hierarchical Panoptic Segmentation of Crops and Weeds Competition

Panoptic segmentation in agriculture is an advanced computer vision technique that provides a comprehensive understanding of field composition. It facilitates various tasks such as crop and weed segmentation, plant panoptic segmentation, and leaf instance segmentation, all aimed at addressing challenges in agriculture. Exploring the application of panoptic segmentation in agriculture, the 8th Workshop on Computer Vision in Plant Phenotyping and Agriculture (CVPPA) hosted the challenge of hierarchical panoptic segmentation of crops and weeds using the PhenoBench dataset. To tackle the tasks presented in this competition, we propose an approach that combines the effectiveness of the Segment AnyThing Model (SAM) for instance segmentation with prompt input from object detection models. Specifically, we integrated two notable approaches in object detection, namely DINO and YOLO-v8. Our best-performing model achieved a PQ+ score of 81.33 based on the evaluation metrics of the competition.
Regularization and Optimal Multiclass Learning

The quintessential learning algorithm of empirical risk minimization (ERM) is known to fail in various settings for which uniform convergence does not characterize learning. It is therefore unsurprising that the practice of machine learning is rife with considerably richer algorithmic techniques for successfully controlling model capacity. Nevertheless, no such technique or principle has broken away from the pack to characterize optimal learning in these more general settings. The purpose of this work is to characterize the role of regularization in perhaps the simplest setting for which ERM fails: multiclass learning with arbitrary label sets. Using one-inclusion graphs (OIGs), we exhibit optimal learning algorithms that dovetail with tried-and-true algorithmic principles: Occam's Razor as embodied by structural risk minimization (SRM), the principle of maximum entropy, and Bayesian reasoning. Most notably, we introduce an optimal learner which relaxes structural risk minimization on two dimensions: it allows the regularization function to be"local"to datapoints, and uses an unsupervised learning stage to learn this regularizer at the outset. We justify these relaxations by showing that they are necessary: removing either dimension fails to yield a near-optimal learner. We also extract from OIGs a combinatorial sequence we term the Hall complexity, which is the first to characterize a problem's transductive error rate exactly. Lastly, we introduce a generalization of OIGs and the transductive learning setting to the agnostic case, where we show that optimal orientations of Hamming graphs -- judged using nodes' outdegrees minus a system of node-dependent credits -- characterize optimal learners exactly. We demonstrate that an agnostic version of the Hall complexity again characterizes error rates exactly, and exhibit an optimal learner using maximum entropy programs.
CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity

With distributed machine learning being a prominent technique for large-scale machine learning tasks, communication complexity has become a major bottleneck for speeding up training and scaling up machine numbers. In this paper, we propose a new technique named Common randOm REconstruction(CORE), which can be used to compress the information transmitted between machines in order to reduce communication complexity without other strict conditions. Especially, our technique CORE projects the vector-valued information to a low-dimensional one through common random vectors and reconstructs the information with the same random noises after communication. We apply CORE to two distributed tasks, respectively convex optimization on linear models and generic non-convex optimization, and design new distributed algorithms, which achieve provably lower communication complexities. For example, we show for linear models CORE-based algorithm can encode the gradient vector to $\mathcal{O}(1)$-bits (against $\mathcal{O}(d)$), with the convergence rate not worse, preceding the existing results.
Deformable 3D Gaussians for High-Fidelity Monocular Dynamic Scene Reconstruction

Implicit neural representation has paved the way for new approaches to dynamic scene reconstruction and rendering. Nonetheless, cutting-edge dynamic neural rendering methods rely heavily on these implicit representations, which frequently struggle to capture the intricate details of objects in the scene. Furthermore, implicit methods have difficulty achieving real-time rendering in general dynamic scenes, limiting their use in a variety of tasks. To address the issues, we propose a deformable 3D Gaussians Splatting method that reconstructs scenes using 3D Gaussians and learns them in canonical space with a deformation field to model monocular dynamic scenes. We also introduce an annealing smoothing training mechanism with no extra overhead, which can mitigate the impact of inaccurate poses on the smoothness of time interpolation tasks in real-world datasets. Through a differential Gaussian rasterizer, the deformable 3D Gaussians not only achieve higher rendering quality but also real-time rendering speed. Experiments show that our method outperforms existing methods significantly in terms of both rendering quality and speed, making it well-suited for tasks such as novel-view synthesis, time interpolation, and real-time rendering.
Second-order optical response of superconductors induced by supercurrent injection

We develop a theory of the nonlinear optical responses in superconducting systems in the presence of a dc supercurrent. The optical transitions between particle-hole pair bands across the superconducting gap are allowed in clean superconductors as the inversion symmetry breaking by supercurrent. Vertex correction is included in optical conductivity to maintain the $U(1)$ gauge symmetry in the mean-field formalism, which contains the contributions from collective modes. We show two pronounced current-dependent peaks in the second-harmonic generalization $\sigma^{(2)}(2\omega,\omega,\omega)$ at the gap edge $2\hbar\omega=2\Delta$ and $\hbar\omega=2\Delta$ and one in the photocurrent effect $\sigma^{(2)}(0,\omega,-\omega)$ at $\hbar\omega=2\Delta$, all of which diverge in the clean limit. We demonstrate this in the models of a single-band superconductor with $s$-wave and $d$-wave pairings, and Dirac fermion systems with $s$-wave pairing. Our theory predicts that the current-induced peak in $\text{Im}[\sigma^{(2)}(\omega)]$ is proportional to the square of the supercurrent density in the $s$-wave single-band model, with the same order of magnitude as the recent experimental observation of second-harmonic generation in NbN by Nakamura et al. [Phys. Rev. Lett. 125, 097004 (2020)]. Supercurrent induced nonlinear optical spectroscopy provides a valuable toolbox to explore novel superconductors.
Seafloor sediments and sedimentary processes on the outer continental shelf, continental slope and basin floor

This report describes the surficial sediments in SEA4 and the sedimentary processes that are active in the area at the present day. The report is based on sidescan sonar images, multibeam bathymetry, sub-bottom profiles, seabed photographs and sediment samples. The Holocence and late glacial events and processes that contributed to the present day seafloor morphology and sediment distribution are reviewed, as is the present day occeanographic regime.
How to train your VAE

Variational Autoencoders (VAEs) have become a cornerstone in generative modeling and representation learning within machine learning. This paper explores a nuanced aspect of VAEs, focusing on interpreting the Kullback Leibler (KL) Divergence, a critical component within the Evidence Lower Bound (ELBO) that governs the trade off between reconstruction accuracy and regularization. Meanwhile, the KL Divergence enforces alignment between latent variable distributions and a prior imposing a structure on the overall latent space but leaves individual variable distributions unconstrained. The proposed method redefines the ELBO with a mixture of Gaussians for the posterior probability, introduces a regularization term to prevent variance collapse, and employs a PatchGAN discriminator to enhance texture realism. Implementation details involve ResNetV2 architectures for both the Encoder and Decoder. The experiments demonstrate the ability to generate realistic faces, offering a promising solution for enhancing VAE based generative models.
The Optimal Twisted Paper Cylinder

A smooth twisted paper cylinder of aspect ratio $\lambda$ is an isometric embedding of a $1 \times \lambda$ cylinder into $\pmb{R}^3$ such that the images of the boundary components are linked. We prove that for such an object to exist we must have $\lambda>2$ and that this bound is sharp. We also show that any sequence of examples having aspect ratio converging to $2$ must converge, up to isometries, to a certain $4$-fold wrapping of a right-angled isosceles triangle.
Deep Neural Newsvendor

We consider a data-driven newsvendor problem, where one has access to past demand data and the associated feature information. We solve the problem by estimating the target quantile function using a deep neural network (DNN). The remarkable representational power of DNN allows our framework to incorporate or approximate various extant data-driven models. We provide theoretical guarantees in terms of excess risk bounds for the DNN solution characterized by the network structure and sample size in a non-asymptotic manner, which justify the applicability of DNNs in the relevant contexts. Specifically, the convergence rate of the excess risk bound with respect to the sample size increases in the smoothness of the target quantile function but decreases in the dimension of feature variables. This rate can be further accelerated when the target function possesses a composite structure. Compared to other typical models, the nonparametric DNN method can effectively avoid or significantly reduce the model misspecification error. In particular, our theoretical framework can be extended to accommodate the data-dependent scenarios, where the data-generating process is time-dependent but not necessarily identical over time. Finally, we apply the DNN method to a real-world dataset obtained from a food supermarket. Our numerical experiments demonstrate that (1) the DNN method consistently outperforms other alternatives across a wide range of cost parameters, and (2) it also exhibits good performance when the sample size is either very large or relatively limited.
Taking the Null-Hypersurface Limit in the Parikh-Wilczek Membrane Approach (preprint)

We consider subtleties of the horizon (null-hypersurface) limit in the Parikh-Wilczek Membrane Approach to Black Holes. Specifically, we refine the correspondence between the (projected) Einstein equations of gravity with matter and the Raychaudhuri-Damour-Navier-Stokes (RDNS) equations of relativistic hydrodynamics. For a general configuration of gravity with matter we obtain additional terms in the hydrodynamic equations, which include logarithmic derivarives of a parameter (the regularization function) determining the proximity of a stretched membrane to the BH horizon. Direct computation of the new terms for exact (Schwarzschild and Kerr) solutions to the Einstein equations results in vanishing the additions to the RDNS equations in the horizon limit. For spacetimes, which are not exact solutions to the Einstein equations, as, for instance, for space-time configurations mimicking black holes, taking into account new terms in the RDNS equations is the mandatory operation. We also comment the correspondence between the horizon limit of the Parikh-Wilczek Membrane Approach and the Gourgoulhon-Jaramillo method of a null-hypersurface description, as well as the link of the obtained results to our previous work on the Kerr black holes.