Miracle-dz/UniFAR-FTUs huggingface dataset:
Few-shots Portrait Generation with Style Enhancement and Identity Preservation

Nowadays, the wide application of virtual digital human promotes the comprehensive prosperity and development of digital culture supported by digital economy. The personalized portrait automatically generated by AI technology needs both the natural artistic style and human sentiment. In this paper, we propose a novel StyleIdentityGAN model, which can ensure the identity and artistry of the generated portrait at the same time. Specifically, the style-enhanced module focuses on artistic style features decoupling and transferring to improve the artistry of generated virtual face images. Meanwhile, the identity-enhanced module preserves the significant features extracted from the input photo. Furthermore, the proposed method requires a small number of reference style data. Experiments demonstrate the superiority of StyleIdentityGAN over state-of-art methods in artistry and identity effects, with comparisons done qualitatively, quantitatively and through a perceptual user study. Code has been released on Github3.
R-U-SURE? Uncertainty-Aware Code Suggestions By Maximizing Utility Across Random User Intents

Large language models show impressive results at predicting structured text such as code, but also commonly introduce errors and hallucinations in their output. When used to assist software developers, these models may make mistakes that users must go back and fix, or worse, introduce subtle bugs that users may miss entirely. We propose Randomized Utility-driven Synthesis of Uncertain REgions (R-U-SURE), an approach for building uncertainty-aware suggestions based on a decision-theoretic model of goal-conditioned utility, using random samples from a generative model as a proxy for the unobserved possible intents of the end user. Our technique combines minimum-Bayes-risk decoding, dual decomposition, and decision diagrams in order to efficiently produce structured uncertainty summaries, given only sample access to an arbitrary generative model of code and an optional AST parser. We demonstrate R-U-SURE on three developer-assistance tasks, and show that it can be applied different user interaction patterns without retraining the model and leads to more accurate uncertainty estimates than token-probability baselines. We also release our implementation as an open-source library at https://github.com/google-research/r_u_sure.
Forward-PECVaR Algorithm: Exact Evaluation for CVaR SSPs

The Stochastic Shortest Path (SSP) problem models probabilistic sequential-decision problems where an agent must pursue a goal while minimizing a cost function. Because of the probabilistic dynamics, it is desired to have a cost function that considers risk. Conditional Value at Risk (CVaR) is a criterion that allows modeling an arbitrary level of risk by considering the expectation of a fraction $\alpha$ of worse trajectories. Although an optimal policy is non-Markovian, solutions of CVaR-SSP can be found approximately with Value Iteration based algorithms such as CVaR Value Iteration with Linear Interpolation (CVaRVIQ) and CVaR Value Iteration via Quantile Representation (CVaRVILI). These type of solutions depends on the algorithm's parameters such as the number of atoms and $\alpha_0$ (the minimum $\alpha$). To compare the policies returned by these algorithms, we need a way to exactly evaluate stationary policies of CVaR-SSPs. Although there is an algorithm that evaluates these policies, this only works on problems with uniform costs. In this paper, we propose a new algorithm, Forward-PECVaR (ForPECVaR), that evaluates exactly stationary policies of CVaR-SSPs with non-uniform costs. We evaluate empirically CVaR Value Iteration algorithms that found solutions approximately regarding their quality compared with the exact solution, and the influence of the algorithm parameters in the quality and scalability of the solutions. Experiments in two domains show that it is important to use an $\alpha_0$ smaller than the $\alpha$ target and an adequate number of atoms to obtain a good approximation.
The Virtues of Laziness in Model-based RL: A Unified Objective and Algorithms

We propose a novel approach to addressing two fundamental challenges in Model-based Reinforcement Learning (MBRL): the computational expense of repeatedly finding a good policy in the learned model, and the objective mismatch between model fitting and policy computation. Our"lazy"method leverages a novel unified objective, Performance Difference via Advantage in Model, to capture the performance difference between the learned policy and expert policy under the true dynamics. This objective demonstrates that optimizing the expected policy advantage in the learned model under an exploration distribution is sufficient for policy computation, resulting in a significant boost in computational efficiency compared to traditional planning methods. Additionally, the unified objective uses a value moment matching term for model fitting, which is aligned with the model's usage during policy computation. We present two no-regret algorithms to optimize the proposed objective, and demonstrate their statistical and computational gains compared to existing MBRL methods through simulated benchmarks.
Neural Stochastic Agent-Based Limit Order Book Simulation: A Hybrid Methodology

Modern financial exchanges use an electronic limit order book (LOB) to store bid and ask orders for a specific financial asset. As the most fine-grained information depicting the demand and supply of an asset, LOB data is essential in understanding market dynamics. Therefore, realistic LOB simulations offer a valuable methodology for explaining empirical properties of markets. Mainstream simulation models include agent-based models (ABMs) and stochastic models (SMs). However, ABMs tend not to be grounded on real historical data, while SMs tend not to enable dynamic agent-interaction. To overcome these limitations, we propose a novel hybrid LOB simulation paradigm characterised by: (1) representing the aggregation of market events' logic by a neural stochastic background trader that is pre-trained on historical LOB data through a neural point process model; and (2) embedding the background trader in a multi-agent simulation with other trading agents. We instantiate this hybrid NS-ABM model using the ABIDES platform. We first run the background trader in isolation and show that the simulated LOB can recreate a comprehensive list of stylised facts that demonstrate realistic market behaviour. We then introduce a population of `trend' and `value' trading agents, which interact with the background trader. We show that the stylised facts remain and we demonstrate order flow impact and financial herding behaviours that are in accordance with empirical observations of real markets.
Comparing Nodes of Multivariate Graphs Through Dynamic Layout Adaptations

Visual comparison is an important task in the analysis of multivariate graphs. However, comparison of topological features of a graph with respect to its data attributes for different portions of the data remains challenging because there is no single visual representation that would suit the dynamic nature of comparative analyses. To facilitate the visual comparison in node-link diagrams, we propose the comparison lens as a focus+context approach for dynamic layout adaptation. The core idea is to start with a topology-driven layout and locally inject an attribute-driven layout based on the multivariate similarity of node attributes. This facilitates comparison tasks on a local level while preserving the user's overall mental map of the graph topology. Additional visual enhancements, including color-coding, reduction of edge clutter, and radial guides, further support the comparison. To fit the lens to different comparison situations, it can be configured via user-controllable parameters. To demonstrate the utility of our approach, we use it for comparison in a real-world dataset of soccer players.
Development and Evaluation of a Narrow Linewidth Laser System for 171Yb+ E2 Transition

We report the construction and characterization of a narrow-linewidth laser system to interrogate the E2 clock transitions at 436 nm of ytterbium ions trapped in end-cap traps. The 871 nm seed laser at the fundamental frequency is referenced to a 10 cm long notched ULE cavity. The output of the laser system is delivered to a narrow-linewidth femtosecond fiber comb, which has been referenced to an ultrastable 698 nm laser, with a phase noise-canceled fiber link. The beat between the laser and the comb shows a sub-Hz linewidth, and with a stability better than 2E-15@1~100 s. The performance of the self-developed wavelength extension ports at 871 nm of the narrow linewidth erbium-doped fiber comb with single-point frequency-doubling technique is also verified.
Fast convergence to non-isolated minima: four equivalent conditions for $\mathrm{C}^2$ functions

Optimization algorithms can see their local convergence rates deteriorate when the Hessian at the optimum is singular. These singularities are inescapable when the optima are non-isolated. Yet, under the right circumstances, several algorithms preserve their favorable rates even when optima form a continuum (e.g., due to over-parameterization). This has been explained under various structural assumptions, including the Polyak--{\L}ojasiewicz inequality, Quadratic Growth and the Error Bound. We show that, for cost functions which are twice continuously differentiable ($\mathrm{C}^2$), those three (local) properties are equivalent. Moreover, we show they are equivalent to the Morse--Bott property, that is, local minima form differentiable submanifolds, and the Hessian of the cost function is positive definite along its normal directions. We leverage this insight to improve local convergence guarantees for safe-guarded Newton-type methods under any (hence all) of the above assumptions. First, for adaptive cubic regularization, we secure quadratic convergence even with inexact subproblem solvers. Second, for trust-region methods, we argue convergence can fail with an exact subproblem solver, then proceed to show linear convergence with an inexact one (Cauchy steps).
An Information-Theoretic Perspective on Variance-Invariance-Covariance Regularization

In this paper, we provide an information-theoretic perspective on Variance-Invariance-Covariance Regularization (VICReg) for self-supervised learning. To do so, we first demonstrate how information-theoretic quantities can be obtained for deterministic networks as an alternative to the commonly used unrealistic stochastic networks assumption. Next, we relate the VICReg objective to mutual information maximization and use it to highlight the underlying assumptions of the objective. Based on this relationship, we derive a generalization bound for VICReg, providing generalization guarantees for downstream supervised learning tasks and present new self-supervised learning methods, derived from a mutual information maximization objective, that outperform existing methods in terms of performance. This work provides a new information-theoretic perspective on self-supervised learning and Variance-Invariance-Covariance Regularization in particular and guides the way for improved transfer learning via information-theoretic self-supervised learning objectives.
QCLAB++: Simulating Quantum Circuits on GPUs

We introduce qclab++, a light-weight, fully-templated C++ package for GPU-accelerated quantum circuit simulations. The code offers a high degree of portability as it has no external dependencies and the GPU kernels are generated through OpenMP offloading. qclab++ is designed for performance and numerical stability through highly optimized gate simulation algorithms for 1-qubit, controlled 1-qubit, and 2-qubit gates. Furthermore, we also introduce qclab, a quantum circuit toolbox for Matlab with a syntax that mimics qclab++. This provides users the flexibility and ease of use of a scripting language like Matlab for studying their quantum algorithms, while offering high-performance GPU acceleration when required. As such, the qclab++ library offers a unique combination of features. We compare the CPU simulator in qclab++ with the GPU kernels generated by OpenMP and observe a speedup of over $40\times$. Furthermore, we also compare qclab++ to other circuit simulation packages, such as cirq-qsim and qibo, in a series of benchmarks conducted on NERSC's Perlmutter system and illustrate its competitiveness.
DTW-SiameseNet: Dynamic Time Warped Siamese Network for Mispronunciation Detection and Correction

Personal Digital Assistants (PDAs) - such as Siri, Alexa and Google Assistant, to name a few - play an increasingly important role to access information and complete tasks spanning multiple domains, and by diverse groups of users. A text-to-speech (TTS) module allows PDAs to interact in a natural, human-like manner, and play a vital role when the interaction involves people with visual impairments or other disabilities. To cater to the needs of a diverse set of users, inclusive TTS is important to recognize and pronounce correctly text in different languages and dialects. Despite great progress in speech synthesis, the pronunciation accuracy of named entities in a multi-lingual setting still has a large room for improvement. Existing approaches to correct named entity (NE) mispronunciations, like retraining Grapheme-to-Phoneme (G2P) models, or maintaining a TTS pronunciation dictionary, require expensive annotation of the ground truth pronunciation, which is also time consuming. In this work, we present a highly-precise, PDA-compatible pronunciation learning framework for the task of TTS mispronunciation detection and correction. In addition, we also propose a novel mispronunciation detection model called DTW-SiameseNet, which employs metric learning with a Siamese architecture for Dynamic Time Warping (DTW) with triplet loss. We demonstrate that a locale-agnostic, privacy-preserving solution to the problem of TTS mispronunciation detection is feasible. We evaluate our approach on a real-world dataset, and a corpus of NE pronunciations of an anonymized audio dataset of person names recorded by participants from 10 different locales. Human evaluation shows our proposed approach improves pronunciation accuracy on average by ~6% compared to strong phoneme-based and audio-based baselines.
Inherently Interpretable Multi-Label Classification Using Class-Specific Counterfactuals

Interpretability is essential for machine learning algorithms in high-stakes application fields such as medical image analysis. However, high-performing black-box neural networks do not provide explanations for their predictions, which can lead to mistrust and suboptimal human-ML collaboration. Post-hoc explanation techniques, which are widely used in practice, have been shown to suffer from severe conceptual problems. Furthermore, as we show in this paper, current explanation techniques do not perform adequately in the multi-label scenario, in which multiple medical findings may co-occur in a single image. We propose Attri-Net, an inherently interpretable model for multi-label classification. Attri-Net is a powerful classifier that provides transparent, trustworthy, and human-understandable explanations. The model first generates class-specific attribution maps based on counterfactuals to identify which image regions correspond to certain medical findings. Then a simple logistic regression classifier is used to make predictions based solely on these attribution maps. We compare Attri-Net to five post-hoc explanation techniques and one inherently interpretable classifier on three chest X-ray datasets. We find that Attri-Net produces high-quality multi-label explanations consistent with clinical knowledge and has comparable classification performance to state-of-the-art classification models.
Pressure anisotropy and viscous heating in weakly collisional plasma turbulence

Pressure anisotropy can strongly influence the dynamics of weakly collisional, high-beta plasmas, but its effects are missed by standard magnetohydrodynamics (MHD). Small changes to the magnetic-field strength generate large pressure-anisotropy forces, heating the plasma, driving instabilities and rearranging flows, even on scales far above the particles’ gyroscales where kinetic effects are traditionally considered most important. Here, we study the influence of pressure anisotropy on turbulent plasmas threaded by a mean magnetic field (Alfvénic turbulence). Extending previous results that were concerned with Braginskii MHD, we consider a wide range of regimes and parameters using a simplified fluid model based on drift kinetics with heat fluxes calculated using a Landau-fluid closure. We show that viscous (pressure-anisotropy) heating dissipates between a quarter (in collisionless regimes) and half (in collisional regimes) of the turbulent-cascade power injected at large scales; this does not depend strongly on either plasma beta or the ion-to-electron temperature ratio. This will in turn influence the plasma's thermodynamics by regulating energy partition between different dissipation channels (e.g. electron and ion heat). Due to the pressure anisotropy's rapid dynamic feedback onto the flows that create it – an effect we term ‘magneto-immutability’ – the viscous heating is confined to a narrow range of scales near the forcing scale, supporting a nearly conservative, MHD-like inertial-range cascade, via which the rest of the energy is transferred to small scales. Despite the simplified model, our results – including the viscous heating rate, distributions and turbulent spectra – compare favourably with recent hybrid-kinetic simulations. This is promising for the more general use of extended-fluid (or even MHD) approaches to model weakly collisional plasmas such as the intracluster medium, hot accretion flows and the solar wind.
Performance of CIE94 for nonreference conditions

The CIE94 colour difference equations are known to give good predictions of subjective colour differences for viewing under reference conditions. We have psychophysically tested whether the equations also give useful predictions when the conditions are relaxed. In particular, we collected subjective colour difference data with (i) chromatic illuminants, (ii) textured samples, and (iii) large colour differences. The predicted differences, to be compared with the measured subjective differences, were calculated by using a von Kries transform to predict colour appearance under D65, followed by application of the CIE94 equations (with the default lightness, chroma, and hue weightings). We found that subjective colour differences were not predicted properly. However, if texture is accounted for by modifying predicted colour differences by a sample-pair dependent linear function, then prediction is successful for all data points apart from those corresponding to illumination under a strongly saturated red illuminant. The fit of this model and its utility in predicting illuminants that enhance colour differences was confirmed by statistical tests. © 2002 Wiley Periodicals, Inc. Col Res Appl, 27, 108–115, 2002; DOI 10.1002/col.10029
Detection and classification of defect patterns on semiconductor wafers

The detection of process problems and parameter drift at an early stage is crucial to successful semiconductor manufacture. The defect patterns on the wafer can act as an important source of information for quality engineers allowing them to isolate production problems. Traditionally, defect recognition is performed by quality engineers using a scanning electron microscope. This manual approach is not only expensive and time consuming but also it leads to high misidentification levels. In this paper, an automatic approach consisting of a spatial filter, a classification module and an estimation module is proposed to validate both real and simulated data. Experimental results show that three types of typical defect patterns: (i) a linear scratch; (ii) a circular ring; and (iii) an elliptical zone can be successfully extracted and classified. A Gaussian EM algorithm is used to estimate the elliptic and linear patterns, and a spherical-shell algorithm is used to estimate ring patterns. Furthermore, both convex and nonconvex defect patterns can be simultaneously recognized via a hybrid clustering method. The proposed method has the potential to be applied to other industries.
OmniForce: On Human-Centered, Large Model Empowered and Cloud-Edge Collaborative AutoML System

Automated machine learning (AutoML) seeks to build ML models with minimal human effort. While considerable research has been conducted in the area of AutoML in general, aiming to take humans out of the loop when building artificial intelligence (AI) applications, scant literature has focused on how AutoML works well in open-environment scenarios such as the process of training and updating large models, industrial supply chains or the industrial metaverse, where people often face open-loop problems during the search process: they must continuously collect data, update data and models, satisfy the requirements of the development and deployment environment, support massive devices, modify evaluation metrics, etc. Addressing the open-environment issue with pure data-driven approaches requires considerable data, computing resources, and effort from dedicated data engineers, making current AutoML systems and platforms inefficient and computationally intractable. Human-computer interaction is a practical and feasible way to tackle the problem of open-environment AI. In this paper, we introduce OmniForce, a human-centered AutoML (HAML) system that yields both human-assisted ML and ML-assisted human techniques, to put an AutoML system into practice and build adaptive AI in open-environment scenarios. Specifically, we present OmniForce in terms of ML version management; pipeline-driven development and deployment collaborations; a flexible search strategy framework; and widely provisioned and crowdsourced application algorithms, including large models. Furthermore, the (large) models constructed by OmniForce can be automatically turned into remote services in a few minutes; this process is dubbed model as a service (MaaS). Experimental results obtained in multiple search spaces and real-world use cases demonstrate the efficacy and efficiency of OmniForce.
Exact (1 + 3 + 6)-Dimensional Cosmological-Type Solutions in Gravitational Model with Yang-Mills Field, Gauss-Bonnet Term and Λ Term

We consider a 10-dimensional gravitational model with an SO(6)Yang–Mills field, Gauss–Bonnet term, and Λ term. We study so-called cosmological-type solutions defined on the product manifold M=R×R3×K, where K is 6d a Calabi–Yau manifold. By setting the gauge field 1-form to coincide with the 1-form spin connection on K, we obtain exact cosmological solutions with exponential dependence of scale factors (upon t-variable) governed by two non-coinciding Hubble-like parameters: H>0 and h obeying H+2h≠0. We also present static analogs of these cosmological solutions (for H≠0, h≠H, and H+2h≠0). The islands of stability for both classes of solutions are outlined.
AR3n: A Reinforcement Learning-based Assist-As-Needed Controller for Robotic Rehabilitation

In this paper, we present AR3n (pronounced as Aaron), an assist-as-needed (AAN) controller that utilizes reinforcement learning to supply adaptive assistance during a robot assisted handwriting rehabilitation task. Unlike previous AAN controllers, our method does not rely on patient specific controller parameters or physical models. We propose the use of a virtual patient model to generalize AR3n across multiple subjects. The system modulates robotic assistance in realtime based on a subject's tracking error, while minimizing the amount of robotic assistance. The controller is experimentally validated through a set of simulations and human subject experiments. Finally, a comparative study with a traditional rule-based controller is conducted to analyze differences in assistance mechanisms of the two controllers.