Researcher profile

Bo Zhang

Bo Zhang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

114works

0followers

44topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

AEGIS: A Holistic Benchmark for Evaluating Forensic Analysis of AI-Generated Academic Images

We introduce AEGIS, A holistic benchmark for Evaluating forensic analysis of AI-Generated academic ImageS. Compared to existing benchmarks, AEGIS features three key advances: (1) Domain-Specific Complexity: covering seven academic categories with 39 fine-grained subtypes, exposing intrinsic forensic difficulty, where even GPT-5.1 reaches 48.80% overall performance and expert models achieve only limited localization accuracy (IoU 30.09%); (2) Diverse Forgery Simulations: modeling four prevalent academic forgery strategies across 25 generative models, with 11 yielding average forensic accuracy below 50%, showing that forensics lag behind generative advances; and (3) Multi-Dimensional Forensic Evaluation: jointly assessing detection, reasoning, and localization, revealing complementary strengths between model families, with multimodal large language models (MLLMs) at 84.74% accuracy in textual artifact recognition and expert detectors peaking at 79.54% accuracy in binary authenticity detection. By evaluating 25 leading MLLMs, nine expert models, and one unified multimodal understanding and generation model, AEGIS serves as a diagnostic testbed exposing fundamental limitations in academic image forensics.

preprint2025arXiv

GeoBench: Rethinking Multimodal Geometric Problem-Solving via Hierarchical Evaluation

Geometric problem solving constitutes a critical branch of mathematical reasoning, requiring precise analysis of shapes and spatial relationships. Current evaluations of geometric reasoning in vision-language models (VLMs) face limitations, including the risk of test data contamination from textbook-based benchmarks, overemphasis on final answers over reasoning processes, and insufficient diagnostic granularity. To address these issues, we present GeoBench, a hierarchical benchmark featuring four reasoning levels in geometric problem-solving: Visual Perception, Goal-Oriented Planning, Rigorous Theorem Application, and Self-Reflective Backtracking. Through six formally verified tasks generated via TrustGeoGen, we systematically assess capabilities ranging from attribute extraction to logical error correction. Experiments reveal that while reasoning models like OpenAI-o3 outperform general MLLMs, performance declines significantly with increasing task complexity. Key findings demonstrate that sub-goal decomposition and irrelevant premise filtering critically influence final problem-solving accuracy, whereas Chain-of-Thought prompting unexpectedly degrades performance in some tasks. These findings establish GeoBench as a comprehensive benchmark while offering actionable guidelines for developing geometric problem-solving systems.

preprint2025arXiv

SCP: Accelerating Discovery with a Global Web of Autonomous Scientific Agents

We introduce SCP: the Science Context Protocol, an open-source standard designed to accelerate discovery by enabling a global network of autonomous scientific agents. SCP is built on two foundational pillars: (1) Unified Resource Integration: At its core, SCP provides a universal specification for describing and invoking scientific resources, spanning software tools, models, datasets, and physical instruments. This protocol-level standardization enables AI agents and applications to discover, call, and compose capabilities seamlessly across disparate platforms and institutional boundaries. (2) Orchestrated Experiment Lifecycle Management: SCP complements the protocol with a secure service architecture, which comprises a centralized SCP Hub and federated SCP Servers. This architecture manages the complete experiment lifecycle (registration, planning, execution, monitoring, and archival), enforces fine-grained authentication and authorization, and orchestrates traceable, end-to-end workflows that bridge computational and physical laboratories. Based on SCP, we have constructed a scientific discovery platform that offers researchers and agents a large-scale ecosystem of more than 1,600 tool resources. Across diverse use cases, SCP facilitates secure, large-scale collaboration between heterogeneous AI systems and human researchers while significantly reducing integration overhead and enhancing reproducibility. By standardizing scientific context and tool orchestration at the protocol level, SCP establishes essential infrastructure for scalable, multi-institution, agent-driven science.

preprint2024arXiv

An Event-Oriented Diffusion-Refinement Method for Sparse Events Completion

Event cameras or dynamic vision sensors (DVS) record asynchronous response to brightness changes instead of conventional intensity frames, and feature ultra-high sensitivity at low bandwidth. The new mechanism demonstrates great advantages in challenging scenarios with fast motion and large dynamic range. However, the recorded events might be highly sparse due to either limited hardware bandwidth or extreme photon starvation in harsh environments. To unlock the full potential of event cameras, we propose an inventive event sequence completion approach conforming to the unique characteristics of event data in both the processing stage and the output form. Specifically, we treat event streams as 3D event clouds in the spatiotemporal domain, develop a diffusion-based generative model to generate dense clouds in a coarse-to-fine manner, and recover exact timestamps to maintain the temporal resolution of raw data successfully. To validate the effectiveness of our method comprehensively, we perform extensive experiments on three widely used public datasets with different spatial resolutions, and additionally collect a novel event dataset covering diverse scenarios with highly dynamic motions and under harsh illumination. Besides generating high-quality dense events, our method can benefit downstream applications such as object classification and intensity frame reconstruction.

preprint2024arXiv

Outer-space branch-and-bound algorithm for generalized linear multiplicative programs

This paper introduces a new global optimization algorithm for solving the generalized linear multiplicative problem (GLMP). The algorithm starts by introducing $\bar{p}$ new variables and applying a logarithmic transformation to convert the problem into an equivalent problem (EP). By using the strong duality of linear program, a new convex relaxation subproblem is formulated to obtain the lower bounds for the optimal value of EP. This relaxation subproblem, combined with a simplicial branching process, forms the foundation of a simplicial branch-and-bound algorithm that can globally solve the problem. The paper also includes an analysis of the theoretical convergence and computational complexity of the algorithm. Additionally, numerical experiments are conducted to demonstrate the effectiveness of the proposed algorithm in various test instances.

preprint2023arXiv

AI of Brain and Cognitive Sciences: From the Perspective of First Principles

Nowadays, we have witnessed the great success of AI in various applications, including image classification, game playing, protein structure analysis, language translation, and content generation. Despite these powerful applications, there are still many tasks in our daily life that are rather simple to humans but pose great challenges to AI. These include image and language understanding, few-shot learning, abstract concepts, and low-energy cost computing. Thus, learning from the brain is still a promising way that can shed light on the development of next-generation AI. The brain is arguably the only known intelligent machine in the universe, which is the product of evolution for animals surviving in the natural environment. At the behavior level, psychology and cognitive sciences have demonstrated that human and animal brains can execute very intelligent high-level cognitive functions. At the structure level, cognitive and computational neurosciences have unveiled that the brain has extremely complicated but elegant network forms to support its functions. Over years, people are gathering knowledge about the structure and functions of the brain, and this process is accelerating recently along with the initiation of giant brain projects worldwide. Here, we argue that the general principles of brain functions are the most valuable things to inspire the development of AI. These general principles are the standard rules of the brain extracting, representing, manipulating, and retrieving information, and here we call them the first principles of the brain. This paper collects six such first principles. They are attractor network, criticality, random network, sparse coding, relational memory, and perceptual learning. On each topic, we review its biological background, fundamental property, potential application to AI, and future development.

preprint2023arXiv

Danlu Tongdu tablets treat lumbar spinal stenosis through reducing reactive oxygen species and apoptosis by regulating CDK2/CDK4/CDKN1A expression

Lumbar spinal stenosis (LSS) is caused by the compression of the nerve root or cauda equina nerve by stenosis of the lumbar spinal canal or intervertebral foramen, and is manifested as chronic low back and leg pain. Danlu Tongdu (DLTD) tablets can relieve chronic pain caused by LSS, but the molecular mechanism remains largely unknown. In this study, the potential molecular mechanism of DLTD tablets in the treatment of LSS was firstly predicted by network pharmacology method. Results showed that DLTD functions in regulating anti-oxidative, apoptosis, and inflammation signaling pathways. Furthermore, the flow cytometry results showed that DLTD tablets efficiently reduced ROS content and inhibited rat neural stem cell apoptosis induced by hydrogen peroxide. DLTD also inhibited the mitochondrial membrane potential damage induced by hydrogen peroxide. Elisa analysis showed that DLTD induced cell cycle related protein, CDK2 and CDK4 and reduced CDKN1A protein expression level. Taken together, our study provided new insights of DLTD in treating LSS through reducing ROS content, decreasing apoptosis by inhibiting CDKN1A and promoting CDK2 and CDK4 expression levels.

preprint2023arXiv

DarkVision: A Benchmark for Low-light Image/Video Perception

Imaging and perception in photon-limited scenarios is necessary for various applications, e.g., night surveillance or photography, high-speed photography, and autonomous driving. In these cases, cameras suffer from low signal-to-noise ratio, which degrades the image quality severely and poses challenges for downstream high-level vision tasks like object detection and recognition. Data-driven methods have achieved enormous success in both image restoration and high-level vision tasks. However, the lack of high-quality benchmark dataset with task-specific accurate annotations for photon-limited images/videos delays the research progress heavily. In this paper, we contribute the first multi-illuminance, multi-camera, and low-light dataset, named DarkVision, serving for both image enhancement and object detection. We provide bright and dark pairs with pixel-wise registration, in which the bright counterpart provides reliable reference for restoration and annotation. The dataset consists of bright-dark pairs of 900 static scenes with objects from 15 categories, and 32 dynamic scenes with 4-category objects. For each scene, images/videos were captured at 5 illuminance levels using three cameras of different grades, and average photons can be reliably estimated from the calibration data for quantitative studies. The static-scene images and dynamic videos respectively contain around 7,344 and 320,667 instances in total. With DarkVision, we established baselines for image/video enhancement and object detection by representative algorithms. To demonstrate an exemplary application of DarkVision, we propose two simple yet effective approaches for improving performance in video enhancement and object detection respectively. We believe DarkVision would advance the state-of-the-arts in both imaging and related computer vision tasks in low-light environment.

preprint2023arXiv

Generalizing the intention-to-treat effect of an active control against placebo from historical placebo-controlled trials to an active-controlled trial: A case study of the efficacy of daily oral TDF/FTC in the HPTN 084 study

In many clinical settings, an active-controlled trial design (e.g., a non-inferiority or superiority design) is often used to compare an experimental medicine to an active control (e.g., an FDA-approved, standard therapy). One prominent example is a recent phase 3 efficacy trial, HIV Prevention Trials Network Study 084 (HPTN 084), comparing long-acting cabotegravir, a new HIV pre-exposure prophylaxis (PrEP) agent, to the FDA-approved daily oral tenofovir disoproxil fumarate plus emtricitabine (TDF/FTC) in a population of heterosexual women in 7 African countries. One key complication of interpreting study results in an active-controlled trial like HPTN 084 is that the placebo arm is not present and the efficacy of the active control (and hence the experimental drug) compared to the placebo can only be inferred by leveraging other data sources. \bz{In this article, we study statistical inference for the intention-to-treat (ITT) effect of the active control using relevant historical placebo-controlled trials data under the potential outcomes (PO) framework}. We highlight the role of adherence and unmeasured confounding, discuss in detail identification assumptions and two modes of inference (point versus partial identification), propose estimators under identification assumptions permitting point identification, and lay out sensitivity analyses needed to relax identification assumptions. We applied our framework to estimating the intention-to-treat effect of daily oral TDF/FTC versus placebo in HPTN 084 using data from an earlier Phase 3, placebo-controlled trial of daily oral TDF/FTC (Partners PrEP).

preprint2023arXiv

MobileVLM : A Fast, Strong and Open Vision Language Assistant for Mobile Devices

We present MobileVLM, a competent multimodal vision language model (MMVLM) targeted to run on mobile devices. It is an amalgamation of a myriad of architectural designs and techniques that are mobile-oriented, which comprises a set of language models at the scale of 1.4B and 2.7B parameters, trained from scratch, a multimodal vision model that is pre-trained in the CLIP fashion, cross-modality interaction via an efficient projector. We evaluate MobileVLM on several typical VLM benchmarks. Our models demonstrate on par performance compared with a few much larger models. More importantly, we measure the inference speed on both a Qualcomm Snapdragon 888 CPU and an NVIDIA Jeston Orin GPU, and we obtain state-of-the-art performance of 21.5 tokens and 65.3 tokens per second, respectively. Our code will be made available at: https://github.com/Meituan-AutoML/MobileVLM.

preprint2023arXiv

Towards simultaneous coherent radiation in the visible and microwave bands with doped molecular crystals

Coherent sources exploiting the stimulated emission of non-equilibrium quantum systems, i.e. gain media, have proven indispensable for advancing fundamental research and engineering. The operating electromagnetic bands of such coherent sources have been continuously enriched for increasing demands.Nevertheless, for a single bench top coherent source, simultaneous generation of radiation in multiple bands, especially when the bands are widely separated, present formidable challenges with a single gain medium. Here, we propose a mechanism of simultaneously realizing the stimulated emission of radiation in the visible and microwave bands, i.e. lasing and masing actions, at ambient conditions by utilizing photoexcited singlet and triplet states of the pentacene molecules that are doped in p-terphenyl. The possibility is validated by the observed amplified spontaneous emission (ASE) at 645 nm with a narrow linewidth around 1 nm from the pentacene-doped p-terphenyl crystal used for masing at 1.45 GHz and consolidated by a 20 fold lower threshold of ASE compared to the reported masing threshold. The overall threshold of the pentacene-based multiband coherent source can be optimized by appropriate alignment of the pump-light polarization with the pentacene's transition dipole moment. Our work not only shows a great promise on immediate realization of multiband coherent sources but also establishes an intriguing solid-state platform for fundamental research of quantum optics in multiple frequency domains.

preprint2023arXiv

YOLOv6 v3.0: A Full-Scale Reloading

The YOLO community has been in high spirits since our first two releases! By the advent of Chinese New Year 2023, which sees the Year of the Rabbit, we refurnish YOLOv6 with numerous novel enhancements on the network architecture and the training scheme. This release is identified as YOLOv6 v3.0. For a glimpse of performance, our YOLOv6-N hits 37.5% AP on the COCO dataset at a throughput of 1187 FPS tested with an NVIDIA Tesla T4 GPU. YOLOv6-S strikes 45.0% AP at 484 FPS, outperforming other mainstream detectors at the same scale (YOLOv5-S, YOLOv8-S, YOLOX-S and PPYOLOE-S). Whereas, YOLOv6-M/L also achieve better accuracy performance (50.0%/52.8% respectively) than other detectors at a similar inference speed. Additionally, with an extended backbone and neck design, our YOLOv6-L6 achieves the state-of-the-art accuracy in real-time. Extensive experiments are carefully conducted to validate the effectiveness of each improving component. Our code is made available at https://github.com/meituan/YOLOv6.

preprint2022arXiv

A new model for preferential attachment scheme with time-varying parameters

We propose an extension of the preferential attachment scheme by allowing the connecting probability to depend on time t. We estimate the parameters involved in the model by minimizing the expected squared difference between the number of vertices of degree one and its conditional expectation. The asymptotic properties of the estimators are also investigated when the parameters are time-varying by establishing the central limit theorem (CLT) of the number of vertices of degree one. We propose a new statistic to test whether the parameters have change points. We also offer some methods to estimate the number of change points and detect the locations of change points. Simulations are conducted to illustrate the performances of the above results.

preprint2022arXiv

A new preferential model with homophily for recommender systems

"Rich-get-richer" and "homophily" are two important phenomena in evolving social networks. "Rich-get-richer" means people with higher followings are more likely to attract new fans, and "homophily" means people prefer to bond with others of the same social group or who have some other attribute in common. To formalize the phenomena simultaneously in the context of an evolving social network, we consider a K-groups preferential attachment (KPA) network model, which is helpful for the social networks recommender system. The main contribution of this paper is to propose a new evolving social network model with the mechanisms of rich-get-richer and homophily. We show that the KPA model exhibits a power-law degree distribution for each group and prove the central limit theorem (CLT) for the maximum likelihood estimation (MLE) of the parameters in the KPA model. We illustrate our results through simulated data and explore the usage of this model with real data examples.

preprint2022arXiv

A physical perturbation based study on the prediction of free-fall disks with chaotic modes in the water

We report a phenomenon that physical perturbations sometimes can benefit the certainty of a free-fall motion with chaotic modes, albeit, as commonly believed, they can ruin it. We statistically compare those factors that may lead to uncertainty, by which we find that the growth of the standard deviation of the landing locations is directly determined by the physical perturbations. A significant yardstick is defined in the meantime. This temporal criterion is of big relevance to the replicability of such problems experimentally, although they are inherently chaotic. Our hypothesis is verified by experiments from other literature. This outcome also provides a practical strategy to evaluate the credible prediction time by estimating the disturbances from physical parameters as a priori.

preprint2022arXiv

A Semiparametric Approach to Model-based Sensitivity Analysis in Observational Studies

When drawing causal inference from observational data, there is always concern about unmeasured confounding. One way to tackle this is to conduct a sensitivity analysis. One widely-used sensitivity analysis framework hypothesizes the existence of a scalar unmeasured confounder U and asks how the causal conclusion would change were U measured and included in the primary analysis. Works along this line often make various parametric assumptions on U, for the sake of mathematical and computational simplicity. In this article, we further this line of research by developing a valid sensitivity analysis that leaves the distribution of U unrestricted. Our semiparametric estimator has three desirable features compared to many existing methods in the literature. First, our method allows for a larger and more flexible family of models, and mitigates observable implications (Franks et al., 2019). Second, our methods work seamlessly with any primary analysis that models the outcome regression parametrically. Third, our method is easy to use and interpret. We construct both pointwise confidence intervals and confidence bands that are uniformly valid over a given sensitivity parameter space, thus formally accounting for unknown sensitivity parameters. We apply our proposed method on an influential yet controversial study of the causal relationship between war experiences and political activeness using observational data from Uganda.

preprint2022arXiv

A VLBA Trigonometric Parallax for RR Aql and the Mira PL Relation

We report VLBA observations of 22 GHz H$_{2}$O and 43 GHz SiO masers toward the Mira variable RR Aql. By fitting the SiO maser emission to a circular ring, we estimate the absolute stellar position of RR Aql and find agreement with Gaia astrometry to within the joint uncertainty of $\approx1$ mas. Using the maser astrometry we measure a stellar parallax of 2.44 $\pm$ 0.07 mas, corresponding to a distance of 410$^{+12}_{-11}$ pc. The maser parallax deviates significantly from the Gaia EDR3 parallax of 1.95 $\pm$ 0.11 mas, indicating a $3.8σ$ tension between radio and optical measurements. This tension is most likely caused by optical photo-center variations limiting the Gaia astrometric accuracy for this Mira variable. Combining infrared magnitudes with parallaxes for RR Aql and other Miras, we fit a period-luminosity relation using a Bayesian approach with MCMC sampling and a strong prior for the slope of -3.60 $\pm$ 0.30 from the LMC. We find a $K$-band zero-point (defined at logP(days) = 2.30) of -6.79 $\pm$ 0.15 mag using VLBI parallaxes and -7.08 $\pm$ 0.29 mag using Gaia parallaxes. The Gaia zero-point is statistically consistent with the more accurate VLBI value.

preprint2022arXiv

Adaptable Text Matching via Meta-Weight Regulator

Neural text matching models have been used in a range of applications such as question answering and natural language inference, and have yielded a good performance. However, these neural models are of a limited adaptability, resulting in a decline in performance when encountering test examples from a different dataset or even a different task. The adaptability is particularly important in the few-shot setting: in many cases, there is only a limited amount of labeled data available for a target dataset or task, while we may have access to a richly labeled source dataset or task. However, adapting a model trained on the abundant source data to a few-shot target dataset or task is challenging. To tackle this challenge, we propose a Meta-Weight Regulator (MWR), which is a meta-learning approach that learns to assign weights to the source examples based on their relevance to the target loss. Specifically, MWR first trains the model on the uniformly weighted source examples, and measures the efficacy of the model on the target examples via a loss function. By iteratively performing a (meta) gradient descent, high-order gradients are propagated to the source examples. These gradients are then used to update the weights of source examples, in a way that is relevant to the target performance. As MWR is model-agnostic, it can be applied to any backbone neural model. Extensive experiments are conducted with various backbone text matching models, on four widely used datasets and two tasks. The results demonstrate that our proposed approach significantly outperforms a number of existing adaptation methods and effectively improves the cross-dataset and cross-task adaptability of the neural text matching models in the few-shot setting.

preprint2022arXiv

Adversarial Texture for Fooling Person Detectors in the Physical World

Nowadays, cameras equipped with AI systems can capture and analyze images to detect people automatically. However, the AI system can make mistakes when receiving deliberately designed patterns in the real world, i.e., physical adversarial examples. Prior works have shown that it is possible to print adversarial patches on clothes to evade DNN-based person detectors. However, these adversarial examples could have catastrophic drops in the attack success rate when the viewing angle (i.e., the camera's angle towards the object) changes. To perform a multi-angle attack, we propose Adversarial Texture (AdvTexture). AdvTexture can cover clothes with arbitrary shapes so that people wearing such clothes can hide from person detectors from different viewing angles. We propose a generative method, named Toroidal-Cropping-based Expandable Generative Attack (TC-EGA), to craft AdvTexture with repetitive structures. We printed several pieces of cloth with AdvTexure and then made T-shirts, skirts, and dresses in the physical world. Experiments showed that these clothes could fool person detectors in the physical world.

preprint2022arXiv

Aspect-specific Context Modeling for Aspect-based Sentiment Analysis

Aspect-based sentiment analysis (ABSA) aims at predicting sentiment polarity (SC) or extracting opinion span (OE) expressed towards a given aspect. Previous work in ABSA mostly relies on rather complicated aspect-specific feature induction. Recently, pretrained language models (PLMs), e.g., BERT, have been used as context modeling layers to simplify the feature induction structures and achieve state-of-the-art performance. However, such PLM-based context modeling can be not that aspect-specific. Therefore, a key question is left under-explored: how the aspect-specific context can be better modeled through PLMs? To answer the question, we attempt to enhance aspect-specific context modeling with PLM in a non-intrusive manner. We propose three aspect-specific input transformations, namely aspect companion, aspect prompt, and aspect marker. Informed by these transformations, non-intrusive aspect-specific PLMs can be achieved to promote the PLM to pay more attention to the aspect-specific context in a sentence. Additionally, we craft an adversarial benchmark for ABSA (advABSA) to see how aspect-specific modeling can impact model robustness. Extensive experimental results on standard and adversarial benchmarks for SC and OE demonstrate the effectiveness and robustness of the proposed method, yielding new state-of-the-art performance on OE and competitive performance on SC.

preprint2022arXiv

Asymptotic Inference for Infinitely Imbalanced Logistic Regression

In this paper we extend the work of Owen (2007) by deriving a second order expansion for the slope parameter in logistic regression, when the size of the majority class is unbounded and the minority class is finite. More precisely, we demonstrate that the second order term converges to a normal distribution and explicitly compute its variance, which surprisingly once again depends only on the mean of the minority class points and not their arrangement under mild regularity assumptions. In the case that the majority class is normally distributed, we illustrate that the variance of the the limiting slope depends exponentially on the z-score of the average of the minority class's points with respect to the majority class's distribution. We confirm our results by Monte Carlo simulations.

preprint2022arXiv

Blind Source Separation over Space

We propose a new estimation method for the blind source separation model of Bachoc et al. (2020). The new estimation is based on an eigenanalysis of a positive definite matrix defined in terms of multiple normalized spatial local covariance matrices, and, therefore, can handle moderately high-dimensional random fields. The consistency of the estimated mixing matrix is established with explicit error rates even when the eigen-gap decays to zero slowly. The proposed method is illustrated via both simulation and a real data example.

preprint2022arXiv

Bringing Old Films Back to Life

We present a learning-based framework, recurrent transformer network (RTN), to restore heavily degraded old films. Instead of performing frame-wise restoration, our method is based on the hidden knowledge learned from adjacent frames that contain abundant information about the occlusion, which is beneficial to restore challenging artifacts of each frame while ensuring temporal coherency. Moreover, contrasting the representation of the current frame and the hidden knowledge makes it possible to infer the scratch position in an unsupervised manner, and such defect localization generalizes well to real-world degradations. To better resolve mixed degradation and compensate for the flow estimation error during frame alignment, we propose to leverage more expressive transformer blocks for spatial restoration. Experiments on both synthetic dataset and real-world old films demonstrate the significant superiority of the proposed RTN over existing solutions. In addition, the same framework can effectively propagate the color from keyframes to the whole video, ultimately yielding compelling restored films. The implementation and model will be released at https://github.com/raywzy/Bringing-Old-Films-Back-to-Life.

preprint2022arXiv

Contrastive Cross-domain Recommendation in Matching

Cross-domain recommendation (CDR) aims to provide better recommendation results in the target domain with the help of the source domain, which is widely used and explored in real-world systems. However, CDR in the matching (i.e., candidate generation) module struggles with the data sparsity and popularity bias issues in both representation learning and knowledge transfer. In this work, we propose a novel Contrastive Cross-Domain Recommendation (CCDR) framework for CDR in matching. Specifically, we build a huge diversified preference network to capture multiple information reflecting user diverse interests, and design an intra-domain contrastive learning (intra-CL) and three inter-domain contrastive learning (inter-CL) tasks for better representation learning and knowledge transfer. The intra-CL enables more effective and balanced training inside the target domain via a graph augmentation, while the inter-CL builds different types of cross-domain interactions from user, taxonomy, and neighbor aspects. In experiments, CCDR achieves significant improvements on both offline and online evaluations in a real-world system. Currently, we have deployed our CCDR on WeChat Top Stories, affecting plenty of users. The source code is in https://github.com/lqfarmer/CCDR.

preprint2022arXiv

Diagnosing Circumburst Environment with Multiband Gamma-Ray Burst Radio Afterglows

It has been widely recognized that gamma-ray burst (GRB) afterglows arise from interactions between GRB outflow and circumburst medium, while their evolution follows the behaviors of relativistic shock waves. Assuming the distribution of circumburst medium follows a general power-law form, that is, $n = A_{\ast} R^{-k}$, where $R$ denotes the distance from the burst, it is obvious that the value of density-distribution index $k$ can affect the behaviors of the afterglow. In this paper, we analyze the temporal and spectral behaviors of GRB radio afterglows with arbitrary $k$-values. In the radio band, a standard GRB afterglow produced by forward shock exhibits a late-time flux peak, and the relative peak fluxes as well as peak times at different frequencies show dependencies on $k$. Thus with multi-band radio peak observations, one can determine the density profile of circumburst medium by comparing the relations between peak flux/time and frequency at each observing band. Also, the effects of trans-relativistic shock waves, as well as jets in afterglows are discussed. By analyzing 31 long and 1 short GRBs with multi-band data of radio afterglows, we find that nearly half of them can be explained with uniform interstellar medium ($k=0$), $\sim 1/5$ can be constrained to exhibiting stellar wind environment ($k=2$), while less than $\sim 1/3$ samples show $0< k< 2$.

preprint2022arXiv

Diagnosis of ultrafast ultraintense laser pulse characteristics by machine-learning-assisted electron spin

Rapid development of ultrafast ultraintense laser technologies continues to create opportunities for studying strong-field physics under extreme conditions. However, accurate determination of the spatial and temporal characteristics of a laser pulse is still a great challenge, especially when laser powers higher than hundreds of terawatts are involved. In this paper, by utilizing the radiative spin-flip effect, we find that the spin depolarization of an electron beam can be employed to diagnose characteristics of ultrafast ultraintense lasers with peak intensities around $10^{20}$-$10^{22}$~W/cm$^2$. With three shots, our machine-learning-assisted model can predict, simultaneously, the pulse duration, peak intensity, and focal radius of a focused Gaussian ultrafast ultraintense laser (in principle, the profile can be arbitrary) with relative errors of $0.1\%$-$10\%$. The underlying physics and an alternative diagnosis method (without the assistance of machine learning) are revealed by the asymptotic approximation of the final spin degree of polarization. Our proposed scheme exhibits robustness and detection accuracy with respect to fluctuations in the electron beam parameters. Accurate measurements of the ultrafast ultraintense laser parameters will lead to much higher precision in, for example, laser nuclear physics investigations and laboratory astrophysics studies. Robust machine learning techniques may also find applications in more general strong-field physics scenarios.

preprint2022arXiv

Disentangled Inference for GANs with Latently Invertible Autoencoder

Generative Adversarial Networks (GANs) play an increasingly important role in machine learning. However, there is one fundamental issue hindering their practical applications: the absence of capability for encoding real-world samples. The conventional way of addressing this issue is to learn an encoder for GAN via Variational Auto-Encoder (VAE). In this paper, we show that the entanglement of the latent space for the VAE/GAN framework poses the main challenge for encoder learning. To address the entanglement issue and enable inference in GAN we propose a novel algorithm named Latently Invertible Autoencoder (LIA). The framework of LIA is that an invertible network and its inverse mapping are symmetrically embedded in the latent space of VAE. The decoder of LIA is first trained as a standard GAN with the invertible network and then the partial encoder is learned from a disentangled autoencoder by detaching the invertible network from LIA, thus avoiding the entanglement problem caused by the random latent space. Experiments conducted on the FFHQ face dataset and three LSUN datasets validate the effectiveness of LIA/GAN.

preprint2022arXiv

Enhanced quantum sensing with room-temperature solid-state masers

Quantum sensing with solid-state systems finds broad applications in diverse areas ranging from material and biomedical sciences to fundamental physics. Several solid-state spin sensors have been developed, facilitating the ultra-sensitive detection of physical quantities such as magnetic and electric fields and temperature. Exploiting collective behaviour of non-interacting spins holds the promise of pushing the detection limit to even lower levels, while to date, those levels are scarcely reached due to the broadened linewidth and inefficient readout of solid-state spin ensembles. Here, we experimentally demonstrate that such drawbacks can be overcome by newly reborn maser technology at room temperature in the solid state. Owing to maser action, we observe a 4-fold reduction in the inhomogeneously broadened linewidth of a molecular spin ensemble, which is narrower than the same measured from single spins at cryogenic temperatures. The maser-based readout applied to magnetometry showcases a signal-to-noise ratio (SNR) of 30 dB for single shots. This technique would be a significant addition to the toolbox for boosting the sensitivity of solid-state ensemble spin sensors.

preprint2022arXiv

Estimating the Optimal Covariance with Imperfect Mean in Diffusion Probabilistic Models

Diffusion probabilistic models (DPMs) are a class of powerful deep generative models (DGMs). Despite their success, the iterative generation process over the full timesteps is much less efficient than other DGMs such as GANs. Thus, the generation performance on a subset of timesteps is crucial, which is greatly influenced by the covariance design in DPMs. In this work, we consider diagonal and full covariances to improve the expressive power of DPMs. We derive the optimal result for such covariances, and then correct it when the mean of DPMs is imperfect. Both the optimal and the corrected ones can be decomposed into terms of conditional expectations over functions of noise. Building upon it, we propose to estimate the optimal covariance and its correction given imperfect mean by learning these conditional expectations. Our method can be applied to DPMs with both discrete and continuous timesteps. We consider the diagonal covariance in our implementation for computational efficiency. For an efficient practical implementation, we adopt a parameter sharing scheme and a two-stage training process. Empirically, our method outperforms a wide variety of covariance design on likelihood results, and improves the sample quality especially on a small number of timesteps.

preprint2022arXiv

Factor Modelling for Clustering High-dimensional Time Series

We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure. Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact on all the time series concerned. Our setting also offers the flexibility that some time series may not belong to any clusters. The consistency with explicit convergence rates is established for the estimation of the common factors, the cluster-specific factors, the latent clusters. Numerical illustration with both simulated data as well as a real data example is also reported. As a spin-off, the proposed new approach also advances significantly the statistical inference for the factor model of Lam and Yao (2012).

preprint2022arXiv

Fast Density Estimation for Density-based Clustering Methods

Density-based clustering algorithms are widely used for discovering clusters in pattern recognition and machine learning since they can deal with non-hyperspherical clusters and are robustness to handle outliers. However, the runtime of density-based algorithms are heavily dominated by finding fixed-radius near neighbors and calculating the density, which is time-consuming. Meanwhile, the traditional acceleration methods using indexing technique such as KD tree is not effective in processing high-dimensional data. In this paper, we propose a fast region query algorithm named fast principal component analysis pruning (called FPCAP) with the help of the fast principal component analysis technique in conjunction with geometric information provided by principal attributes of the data, which can process high-dimensional data and be easily applied to density-based methods to prune unnecessary distance calculations when finding neighbors and estimating densities. As an application in density-based clustering methods, FPCAP method was combined with the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. And then, an improved DBSCAN (called IDBSCAN) is obtained, which preserves the advantage of DBSCAN and meanwhile, greatly reduces the computation of redundant distances. Experiments on seven benchmark datasets demonstrate that the proposed algorithm improves the computational efficiency significantly.

preprint2022arXiv

Fast Lossless Neural Compression with Integer-Only Discrete Flows

By applying entropy codecs with learned data distributions, neural compressors have significantly outperformed traditional codecs in terms of compression ratio. However, the high inference latency of neural networks hinders the deployment of neural compressors in practical applications. In this work, we propose Integer-only Discrete Flows (IODF), an efficient neural compressor with integer-only arithmetic. Our work is built upon integer discrete flows, which consists of invertible transformations between discrete random variables. We propose efficient invertible transformations with integer-only arithmetic based on 8-bit quantization. Our invertible transformation is equipped with learnable binary gates to remove redundant filters during inference. We deploy IODF with TensorRT on GPUs, achieving 10x inference speedup compared to the fastest existing neural compressors, while retaining the high compression rates on ImageNet32 and ImageNet64.

preprint2022arXiv

Guiding self-assembly of active colloids by temporal modulation of activity

Self-organization phenomena in ensembles of self-propelled particles open pathways to the synthesis of new dynamic states not accessible by traditional equilibrium processes. The challenge is to develop a set of principles that facilitate the control and manipulation of emergent active states. Here, we report that dielectric rolling colloids energized by a pulsating electric field self-organize into alternating square lattices with a lattice constant controlled by the parameters of the field. We combine experiments and simulations to examine spatiotemporal properties of the emergent collective patterns, and investigate the underlying dynamics of the self-organization.We reveal the resistance of the dynamic lattices to compression/expansion stresses leading to a hysteretic behavior of the lattice constant. The general mechanism of pattern synthesis and control in active ensembles via temporal modulation of activity can be applied to other active colloidal systems.

preprint2022arXiv

Human-centric Image Cropping with Partition-aware and Content-preserving Features

Image cropping aims to find visually appealing crops in an image, which is an important yet challenging task. In this paper, we consider a specific and practical application: human-centric image cropping, which focuses on the depiction of a person. To this end, we propose a human-centric image cropping method with two novel feature designs for the candidate crop: partition-aware feature and content-preserving feature. For partition-aware feature, we divide the whole image into nine partitions based on the human bounding box and treat different partitions in a candidate crop differently conditioned on the human information. For content-preserving feature, we predict a heatmap indicating the important content to be included in a good crop, and extract the geometric relation between the heatmap and a candidate crop. Extensive experiments demonstrate that our method can perform favorably against state-of-the-art image cropping methods on human-centric image cropping task. Code is available at https://github.com/bcmi/Human-Centric-Image-Cropping.

preprint2022arXiv

Hyperuniform Active Chiral Fluids with Tunable Internal Structure

Large density fluctuations observed in active systems and hyperuniformity are two seemingly incompatible phenomena. However, the formation of hyperuniform states has been recently predicted in non-equilibrium fluids formed by chiral particles performing circular motion with the same handedness. Here we report evidence of hyperuniformity realized in a chiral active fluid comprised of pear-shaped Quincke rollers of arbitrary handedness. We show that hyperuniformity and large density fluctuations, triggered by dynamic clustering, coexist in this system at different length scales. The system loses its hyperuniformity as the curvature of particles' motion increases transforming them into localized spinners. Our results experimentally demonstrate a novel hyperuniform active fluid and provide new insights into an interplay between chirality, activity and hyperuniformity.

preprint2022arXiv

Joint Distribution Alignment via Adversarial Learning for Domain Adaptive Object Detection

Unsupervised domain adaptive object detection aims to adapt a well-trained detector from its original source domain with rich labeled data to a new target domain with unlabeled data. Recently, mainstream approaches perform this task through adversarial learning, yet still suffer from two limitations. First, they mainly align marginal distribution by unsupervised cross-domain feature matching, and ignore each feature's categorical and positional information that can be exploited for conditional alignment; Second, they treat all classes as equally important for transferring cross-domain knowledge and ignore that different classes usually have different transferability. In this paper, we propose a joint adaptive detection framework (JADF) to address the above challenges. First, an end-to-end joint adversarial adaptation framework for object detection is proposed, which aligns both marginal and conditional distributions between domains without introducing any extra hyperparameter. Next, to consider the transferability of each object class, a metric for class-wise transferability assessment is proposed, which is incorporated into the JADF objective for domain adaptation. Further, an extended study from unsupervised domain adaptation (UDA) to unsupervised few-shot domain adaptation (UFDA) is conducted, where only a few unlabeled training images are available in unlabeled target domain. Extensive experiments validate that JADF is effective in both the UDA and UFDA settings, achieving significant performance gains over existing state-of-the-art cross-domain detection methods.

preprint2022arXiv

LAMOST medium-resolution spectroscopic survey of binarity and exotic star (LAMOST-MRS-B): Observation strategy and target selection

LAMOST-MRS-B is one of the sub-surveys of LAMOST medium-resolution (R~7500) spectroscopic survey. It aims at studying the statistical properties (e.g., binary fraction, orbital period distribution, mass ratio distribution) of binary stars and exotic stars. We intend to observe about 30000 stars (10 mag <= G <= 14.5 mag) with at least 10 visits in five years. We first planned to observe 25 plates around the galactic plane in 2018. Then the plates were reduced to 12 in 2019 because of the limitation of observation. At the same time, two new plates located at the high galactic latitude were added to explore binary properties influenced by the different environments. In this survey project, we set the identified exotic and low-metallicity stars with the highest observation priorities. For the rest of the selected stars, we gave higher priority to the relatively brighter stars in order to obtain high-quality spectra as many as possible. Spectra of 49129 stars have been obtained in LAMOST-MRS-B field and released in DR8, of which 28828 and 3375 stars have been visited more than twice and ten times with SNR >= 10, respectively. Most of the sources are B-, A-, and F-type stars with 0.6 < [Fe/H] < 0.4 dex. We also obtain 347 identified variable and exotic stars and about 250 stars with [Fe/H] < 1 dex. We measure radial velocities (RVs) by using 892233 spectra of the stars. The uncertainties of RV achieve about 1 km/s and 10 km/s1 for 95% of late- and early-type stars, respectively. The datasets presented in this paper are available at http://www.doi.org/10.57760/sciencedb.j00113.00035.

preprint2022arXiv

Learning Cross-Image Object Semantic Relation in Transformer for Few-Shot Fine-Grained Image Classification

Few-shot fine-grained learning aims to classify a query image into one of a set of support categories with fine-grained differences. Although learning different objects' local differences via Deep Neural Networks has achieved success, how to exploit the query-support cross-image object semantic relations in Transformer-based architecture remains under-explored in the few-shot fine-grained scenario. In this work, we propose a Transformer-based double-helix model, namely HelixFormer, to achieve the cross-image object semantic relation mining in a bidirectional and symmetrical manner. The HelixFormer consists of two steps: 1) Relation Mining Process (RMP) across different branches, and 2) Representation Enhancement Process (REP) within each individual branch. By the designed RMP, each branch can extract fine-grained object-level Cross-image Semantic Relation Maps (CSRMs) using information from the other branch, ensuring better cross-image interaction in semantically related local object regions. Further, with the aid of CSRMs, the developed REP can strengthen the extracted features for those discovered semantically-related local regions in each branch, boosting the model's ability to distinguish subtle feature differences of fine-grained objects. Extensive experiments conducted on five public fine-grained benchmarks demonstrate that HelixFormer can effectively enhance the cross-image object semantic relation matching for recognizing fine-grained objects, achieving much better performance over most state-of-the-art methods under 1-shot and 5-shot scenarios. Our code is available at: https://github.com/JiakangYuan/HelixFormer

preprint2022arXiv

Li-rich Giants in LAMOST Survey. III. The statistical analysis of Li-rich giants

The puzzle of Li-rich giant is still unsolved, contradicting the prediction of the standard stellar models. Although the exact evolutionary stages play a key role in the knowledge of Li-rich giants, a limited number of Li-rich giants have been taken with high-quality asteroseismic parameters to clearly distinguish the stellar evolutionary stages. Based on the LAMOST Data Release 7 (DR7), we applied a data-driven neural network method to derive the parameters for giant stars, which contain the largest number of Li-rich giants. The red giant stars are classified into three stages of Red Giant Branch (RGB), Primary Red Clump (PRC), and Secondary Red Clump (SRC) relying on the estimated asteroseismic parameters. In the statistical analysis of the properties (i.e. stellar mass, carbon, nitrogen, Li-rich distribution, and frequency) of Li-rich giants, we found that: (1) Most of the Li-rich RGB stars are suggested to be the descendants of Li-rich pre-RGB stars and/or the result of engulfment of planet or substellar companions; (2) The massive Li-rich SRC stars could be the natural consequence of Li depletion from the high-mass Li-rich RGB stars. (3) Internal mixing processes near the helium flash can account for the phenomenon of Li-rich on PRC that dominated the Li-rich giants. Based on the comparison of [C/N] distributions between Li-rich and normal PRC stars, the Li-enriched processes probably depend on the stellar mass.

preprint2022arXiv

Machine learning for percolation utilizing auxiliary Ising variables

Machine learning for phase transition has received intensive research interest in recent years. However, its application in percolation still remains challenging. We propose an auxiliary Ising mapping method for machine learning study of the standard percolation as well as a variety of statistical mechanical systems in correlated percolation representations. We demonstrate that unsupervised machine learning is able to accurately locate the percolation threshold, independent of the spatial dimension of system or the type of phase transition, which can be first order or continuous. Moreover, we show that, by neural network machine learning, auxiliary Ising configurations for different universalities can be classified with high confidence level. Our results indicate that the auxiliary Ising mapping method, despite of it simplicity, can advance the application of machine learning in statistical and condensed-matter physics.

preprint2022arXiv

Mining Error Templates for Grammatical Error Correction

Some grammatical error correction (GEC) systems incorporate hand-crafted rules and achieve positive results. However, manually defining rules is time-consuming and laborious. In view of this, we propose a method to mine error templates for GEC automatically. An error template is a regular expression aiming at identifying text errors. We use the web crawler to acquire such error templates from the Internet. For each template, we further select the corresponding corrective action by using the language model perplexity as a criterion. We have accumulated 1,119 error templates for Chinese GEC based on this method. Experimental results on the newly proposed CTC-2021 Chinese GEC benchmark show that combing our error templates can effectively improve the performance of a strong GEC system, especially on two error types with very little training data. Our error templates are available at \url{https://github.com/HillZhang1999/gec_error_template}.

preprint2022arXiv

MuCGEC: a Multi-Reference Multi-Source Evaluation Dataset for Chinese Grammatical Error Correction

This paper presents MuCGEC, a multi-reference multi-source evaluation dataset for Chinese Grammatical Error Correction (CGEC), consisting of 7,063 sentences collected from three Chinese-as-a-Second-Language (CSL) learner sources. Each sentence is corrected by three annotators, and their corrections are carefully reviewed by a senior annotator, resulting in 2.3 references per sentence. We conduct experiments with two mainstream CGEC models, i.e., the sequence-to-sequence model and the sequence-to-edit model, both enhanced with large pretrained language models, achieving competitive benchmark performance on previous and our datasets. We also discuss CGEC evaluation methodologies, including the effect of multiple references and using a char-based metric. Our annotation guidelines, data, and code are available at \url{https://github.com/HillZhang1999/MuCGEC}.

preprint2022arXiv

Multi-granularity Item-based Contrastive Recommendation

Contrastive learning (CL) has shown its power in recommendation. However, most CL-based recommendation models build their CL tasks merely focusing on the user's aspects, ignoring the rich diverse information in items. In this work, we propose a novel Multi-granularity item-based contrastive learning (MicRec) framework for the matching stage (i.e., candidate generation) in recommendation, which systematically introduces multi-aspect item-related information to representation learning with CL. Specifically, we build three item-based CL tasks as a set of plug-and-play auxiliary objectives to capture item correlations in feature, semantic and session levels. The feature-level item CL aims to learn the fine-grained feature-level item correlations via items and their augmentations. The semantic-level item CL focuses on the coarse-grained semantic correlations between semantically related items. The session-level item CL highlights the global behavioral correlations of items from users' sequential behaviors in all sessions. In experiments, we conduct both offline and online evaluations on real-world datasets, verifying the effectiveness and universality of three proposed CL tasks. Currently, MicRec has been deployed on a real-world recommender system, affecting millions of users. The source code will be released in the future.

preprint2022arXiv

Neutron spectroscopy evidence for a possible magnetic-field-induced gapless quantum-spin-liquid phase in a Kitaev material $α$-RuCl$_3$

As one of the most promising Kitaev quantum-spin-liquid (QSL) candidates, $α$-RuCl$_3$ has received a great amount of attention. However, its ground state exhibits a long-range zigzag magnetic order, which defies the QSL phase. Nevertheless, the magnetic order is fragile and can be completely suppressed by applying an external magnetic field. Here, we explore the evolution of magnetic excitations of $α$-RuCl$_3$ under an in-plane magnetic field, by carrying out inelastic neutron scattering measurements on high-quality single crystals. Under zero field, there exist spin-wave excitations near the $M$ point and a continuum near the $\mitΓ$ point, which are believed to be associated with the zigzag magnetic order and fractional excitations of the Kitaev QSL state, respectively. By increasing the magnetic field, the spin-wave excitations gradually give way to the continuous excitations. On the verge of the critical field $μ_0H_{\rm c}=7.5$ T, the former vanish and only the latter is left, indicating the emergence of a pure QSL state. By further increasing the field strength, the excitations near the $\mitΓ$ point become more intense. By following the gap evolution of the excitations near the $\mitΓ$ point, we are able to establish a phase diagram composed of three interesting phases, including a gapped zigzag order phase at low fields, possibly-gapless QSL phase near $μ_0H_{\rm c}$, and gapped partially polarized phase at high fields. These results demonstrate that an in-plane magnetic field can drive $α$-RuCl$_3$ into a long-sought QSL state near the critical field.

preprint2022arXiv

On the HI Content of MaNGA Major Merger Pairs

The role of HI content in galaxy interactions is still under debate. To study the HI content of galaxy pairs at different merging stages, we compile a sample of 66 major-merger galaxy pairs and 433 control galaxies from the SDSS-IV MaNGA IFU survey. In this study, we adopt kinematic asymmetry as a new effective indicator to describe the merging stage of galaxy pairs. With archival data from the HI-MaNGA survey and new observations from the Five-hundred-meter Aperture Spherical Radio Telescope (FAST), we investigate the differences in HI gas fraction ($f_{\text{HI}}$), star formation rate (SFR), and HI star formation efficiency ($\rm SFE_{\text{HI}}$) between the pair and control samples. Our results suggest that the HI gas fraction of major-merger pairs on average is marginally decreased by $\sim 15\%$ relative to isolated galaxies, implying mild HI depletion during galaxy interactions. Compared to isolated galaxies, pre-passage paired galaxies have similar $f_{\text{HI}}$, SFR and $\rm SFE_{\text{HI}}$, while pairs during pericentric passage have weakly decreased $f_{\text{HI}}$ ($-0.10\pm0.05$ dex), significantly enhanced SFR ($0.42\pm0.11$ dex) and $\rm SFE_{\text{HI}}$ ($0.48\pm0.12$ dex). When approaching the apocenter, paired galaxies show marginally decreased $f_{\text{HI}}$ ($-0.05\pm0.04$ dex), comparable SFR ($0.04\pm0.06$ dex) and $\rm SFE_{\text{HI}}$ ($0.08\pm0.08$ dex). We propose the marginally detected HI depletion may originate from the gas consumption in fuelling the enhanced $\rm H_2$ reservoir of galaxy pairs. In addition, new FAST observations also reveal an HI absorber ($N_{\text{HI}}\sim 4.7 \times 10^{21} \text{ cm}^{-2}$), which may suggest gas infalling and the triggering of AGN activity.

preprint2022arXiv

OPA: Object Placement Assessment Dataset

Image composition aims to generate realistic composite image by inserting an object from one image into another background image, where the placement (e.g., location, size, occlusion) of inserted object may be unreasonable, which would significantly degrade the quality of the composite image. Although some works attempted to learn object placement to create realistic composite images, they did not focus on assessing the plausibility of object placement. In this paper, we focus on object placement assessment task, which verifies whether a composite image is plausible in terms of the object placement. To accomplish this task, we construct the first Object Placement Assessment (OPA) dataset consisting of composite images and their rationality labels. We also propose a simple yet effective baseline for this task. Dataset is available at https://github.com/bcmi/Object-Placement-Assessment-Dataset-OPA.

preprint2022arXiv

Pretraining is All You Need for Image-to-Image Translation

We propose to use pretraining to boost general image-to-image translation. Prior image-to-image translation methods usually need dedicated architectural design and train individual translation models from scratch, struggling for high-quality generation of complex scenes, especially when paired training data are not abundant. In this paper, we regard each image-to-image translation problem as a downstream task and introduce a simple and generic framework that adapts a pretrained diffusion model to accommodate various kinds of image-to-image translation. We also propose adversarial training to enhance the texture synthesis in the diffusion model training, in conjunction with normalized guidance sampling to improve the generation quality. We present extensive empirical comparison across various tasks on challenging benchmarks such as ADE20K, COCO-Stuff, and DIODE, showing the proposed pretraining-based image-to-image translation (PITI) is capable of synthesizing images of unprecedented realism and faithfulness.

preprint2022arXiv

Radio properties of the OH megamaser galaxy IIZw 096

Based on the two epochs EVN archive data from OH line observations of IIZw 096, we confirm that the high-resolution OH emission in this source mainly comes from two spots (OH1 and OH2) of comp D1 of this merging system. We found no significant variations in the OH line emission. The OH 1665 MHz line emission is detected at about 6 $σ$ level in the OH1 region by combining two epoch EVN observations. We found that the comp D1 shows the brightest CO, HCO+ line emission, as well as multi-band radio continuum emission. The environment around D1 shows no clear velocity structure associated with circular motions, making it different from most other OHMs in the literature, which might have been caused by an effect during the merger stage. Meanwhile, we found that the CO emission shows three velocity structures around D1, including the central broad FWHM region, the double peak region where the CO line profile shows two separated peaks, and the region of the high-velocity clouds where the CO line peaks at a high velocity ($\sim$ 11000 \kms). \HI in absorption also show high-velocity clouds around the D1 region, which might be due to inflows caused by the merging of two or more galaxy components. Based on the high-resolution K-band VLA and L-band VLBA observations of the radio continuum emission, we derived the brightness temperature in the range $10^{5}$ K to $10^{6}$ K, which is consistent with other starburst dominant OHM sources in the literature. The multi-band VLA observations show that the radio continuum emission of comp D might also have contributions from free-free emission, besides synchrotron emission. As a concenquence, these results support a starburst origin for the OHMs, without the presence of an AGN.

preprint2022arXiv

Real-Time Neural Character Rendering with Pose-Guided Multiplane Images

We propose pose-guided multiplane image (MPI) synthesis which can render an animatable character in real scenes with photorealistic quality. We use a portable camera rig to capture the multi-view images along with the driving signal for the moving subject. Our method generalizes the image-to-image translation paradigm, which translates the human pose to a 3D scene representation -- MPIs that can be rendered in free viewpoints, using the multi-views captures as supervision. To fully cultivate the potential of MPI, we propose depth-adaptive MPI which can be learned using variable exposure images while being robust to inaccurate camera registration. Our method demonstrates advantageous novel-view synthesis quality over the state-of-the-art approaches for characters with challenging motions. Moreover, the proposed method is generalizable to novel combinations of training poses and can be explicitly controlled. Our method achieves such expressive and animatable character rendering all in real time, serving as a promising solution for practical applications.

preprint2022arXiv

Robust PCA for High Dimensional Data based on Characteristic Transformation

In this paper, we propose a novel robust Principal Component Analysis (PCA) for high-dimensional data in the presence of various heterogeneities, especially the heavy-tailedness and outliers. A transformation motivated by the characteristic function is constructed to improve the robustness of the classical PCA. Besides the typical outliers, the proposed method has the unique advantage of dealing with heavy-tail-distributed data, whose covariances could be nonexistent (positively infinite, for instance). The proposed approach is also a case of kernel principal component analysis (KPCA) method and adopts the robust and non-linear properties via a bounded and non-linear kernel function. The merits of the new method are illustrated by some statistical properties including the upper bound of the excess error and the behaviors of the large eigenvalues under a spiked covariance model. In addition, we show the advantages of our method over the classical PCA by a variety of simulations. At last, we apply the new robust PCA to classify mice with different genotypes in a biological study based on their protein expression data and find that our method is more accurately on identifying abnormal mice comparing to the classical PCA.

preprint2022arXiv

Robust quantum control for the manipulation of solid-state spins

Robust and high-fidelity control of electron spins in solids is the cornerstone for facilitating applications of solid-state spins in quantum information processing and quantum sensing. However, precise control of spin systems is always challenging due to the presence of a variety of noises originating from the environment and control fields. Herein, noise-resilient quantum gates, designed with robust optimal control (ROC) algorithms, are demonstrated experimentally with nitrogen-vacancy (NV) centers in diamond to realize tailored robustness against detunings and Rabi errors simultaneously. In the presence of both 10% off-resonant detuning and deviation of a Rabi frequency, we achieve an average single-qubit gate fidelity of up to 99.97%. Our experiments also show that, ROCbased multipulse quantum sensing sequences can suppress spurious responses resulting from finite widths and imperfections of microwave pulses, which provides an efficient strategy for enhancing the performance of existing multipulse quantum sensing sequences.

preprint2022arXiv

Some Reflections on Drawing Causal Inference using Textual Data: Parallels Between Human Subjects and Organized Texts

We examine the role of textual data as study units when conducting causal inference by drawing parallels between human subjects and organized texts. %in human population research. We elaborate on key causal concepts and principles, and expose some ambiguity and sometimes fallacies. To facilitate better framing a causal query, we discuss two strategies: (i) shifting from immutable traits to perceptions of them, and (ii) shifting from some abstract concept/property to its constituent parts, i.e., adopting a constructivist perspective of an abstract concept. We hope this article would raise the awareness of the importance of articulating and clarifying fundamental concepts before delving into developing methodologies when drawing causal inference using textual data.

preprint2022arXiv

Spatial Transformation for Image Composition via Correspondence Learning

When using cut-and-paste to acquire a composite image, the geometry inconsistency between foreground and background may severely harm its fidelity. To address the geometry inconsistency in composite images, several existing works learned to warp the foreground object for geometric correction. However, the absence of annotated dataset results in unsatisfactory performance and unreliable evaluation. In this work, we contribute a Spatial TRAnsformation for virtual Try-on (STRAT) dataset covering three typical application scenarios. Moreover, previous works simply concatenate foreground and background as input without considering their mutual correspondence. Instead, we propose a novel correspondence learning network (CorrelNet) to model the correspondence between foreground and background using cross-attention maps, based on which we can predict the target coordinate that each source coordinate of foreground should be mapped to on the background. Then, the warping parameters of foreground object can be derived from pairs of source and target coordinates. Additionally, we learn a filtering mask to eliminate noisy pairs of coordinates to estimate more accurate warping parameters. Extensive experiments on our STRAT dataset demonstrate that our proposed CorrelNet performs more favorably against previous methods.

preprint2022arXiv

Statistical matching and subclassification with a continuous dose: characterization, algorithm, and application to a health outcomes study

Subclassification and matching are often used in empirical studies to adjust for observed covariates; however, they are largely restricted to relatively simple study designs with a binary treatment and less developed for designs with a continuous exposure. Matching with exposure doses is particularly useful in instrumental variable designs and in understanding the dose-response relationships. In this article, we propose two criteria for optimal subclassification based on subclass homogeneity in the context of having a continuous exposure dose, and propose an efficient polynomial-time algorithm that is guaranteed to find an optimal subclassification with respect to one criterion and serves as a 2-approximation algorithm for the other criterion. We discuss how to incorporate dose and use appropriate penalties to control the number of subclasses in the design. Via extensive simulations, we systematically compare our proposed design to optimal non-bipartite pair matching, and demonstrate that combining our proposed subclassification scheme with regression adjustment helps reduce model dependence for parametric causal inference with a continuous dose. We apply the new design and associated randomization-based inferential procedure to study the effect of transesophageal echocardiography (TEE) monitoring during coronary artery bypass graft (CABG) surgery on patients' post-surgery clinical outcomes using Medicare and Medicaid claims data, and find evidence that TEE monitoring lowers patients' all-cause $30$-day mortality rate.

preprint2022arXiv

StyleSwin: Transformer-based GAN for High-resolution Image Generation

Despite the tantalizing success in a broad of vision tasks, transformers have not yet demonstrated on-par ability as ConvNets in high-resolution image generative modeling. In this paper, we seek to explore using pure transformers to build a generative adversarial network for high-resolution image synthesis. To this end, we believe that local attention is crucial to strike the balance between computational efficiency and modeling capacity. Hence, the proposed generator adopts Swin transformer in a style-based architecture. To achieve a larger receptive field, we propose double attention which simultaneously leverages the context of the local and the shifted windows, leading to improved generation quality. Moreover, we show that offering the knowledge of the absolute position that has been lost in window-based transformers greatly benefits the generation quality. The proposed StyleSwin is scalable to high resolutions, with both the coarse geometry and fine structures benefit from the strong expressivity of transformers. However, blocking artifacts occur during high-resolution synthesis because performing the local attention in a block-wise manner may break the spatial coherency. To solve this, we empirically investigate various solutions, among which we find that employing a wavelet discriminator to examine the spectral discrepancy effectively suppresses the artifacts. Extensive experiments show the superiority over prior transformer-based GANs, especially on high resolutions, e.g., 1024x1024. The StyleSwin, without complex training strategies, excels over StyleGAN on CelebA-HQ 1024, and achieves on-par performance on FFHQ-1024, proving the promise of using transformers for high-resolution image generation. The code and models will be available at https://github.com/microsoft/StyleSwin.

preprint2022arXiv

Testing Biased Randomization Assumptions and Quantifying Imperfect Matching and Residual Confounding in Matched Observational Studies

One central goal of design of observational studies is to embed non-experimental data into an approximate randomized controlled trial using statistical matching. Despite empirical researchers' best intention and effort to create high-quality matched samples, residual imbalance due to observed covariates not being well matched often persists. Although statistical tests have been developed to test the randomization assumption and its implications, few provide a means to quantify the level of residual confounding due to observed covariates not being well matched in matched samples. In this article, we develop two generic classes of exact statistical tests for a biased randomization assumption. One important by-product of our testing framework is a quantity called residual sensitivity value (RSV), which provides a means to quantify the level of residual confounding due to imperfect matching of observed covariates in a matched sample. We advocate taking into account RSV in the downstream primary analysis. The proposed methodology is illustrated by re-examining a famous observational study concerning the effect of right heart catheterization (RHC) in the initial care of critically ill patients. Code implementing the method can be found in the supplementary materials.

preprint2022arXiv

The Eclipsing Binaries from the LAMOST Medium-resolution Survey.III. A High-precision Empirical Stellar Mass Library

High-precision stellar mass and radius measured directly from binaries can effectively calibrate the stellar models. However, such a database containing full spectral types and large range of metallicity is still not fully established. A continuous effort of data collecting and analysis are requested to complete the database. In this work, we provide a catalog containing 184 binaries with independent atmospheric parameters and accurate masses and radii as the benchmark of stellar mass and radius. The catalog contains 56 new detached binaries from LAMOST Medium-resolution spectroscopic (MRS) survey and 128 detached eclipsing binaries compiled from previous studies. We obtain the orbital solutions of the new detached binaries with uncertainties of masses and radii smaller than 5%. These new samples densify the distribution of metallicity of the high-precision stellar mass library and add 9 hot stars with Teff>8000 K. Comparisons show that these samples well agree with the PARSEC isochrones in Teff-logg-mass-radius-luminosity space. We compare mass and radius estimates from isochrone and SED fitting, respectively, with those from the binary orbital solution. We find that the precision of the stellar-model dependent mass estimates is >10% and the precision of the radius estimates based on atmospheric parameters is >15%. These give a general view of the uncertainty of the usual approaches to estimate stellar mass and radius.

preprint2022arXiv

The Properties and Evolutions of Starspots on Three Detached Eclipsing Binaries in the LAMOST-Kepler survey

The spotted detached eclipsing binary (DEB) offers insights into starspots on the binary. Three spotted DEBs, KIC 8097825, KIC 6859813, and KIC 5527172, which were observed by the Kepler photometry and LAMOST spectroscopy, are studied in this work. The physical parameters of binaries are determined by binary modeling. The sizes, lifetimes, and single/double-dip ratio (SDR) of starspots are derived by starspot analysis. KIC 8097825 has large starspots. KIC 6859813 has a spot rotation period shorter than its orbital period but the system should be synchronized inferred from timescale estimation. The difference may be the result of the surface differential rotation. The KIC 5527172 has a long spot lifetime and an M dwarf component with an inflation radius. The primaries of these binaries and the secondary of KIC 8097825 have spots. Adding spotted DEBs of literature, we compare the starspots on binaries with those on the single stars. The spot sizes of starspots on 65% binaries are smaller than the median of those on single stars. The lifetimes of starspots on binaries are consistent with those on single stars when the rotation periods are larger than 3 days. SDRs for half of the binaries are consistent with those of single star systems, while another half are smaller. The relative lifetime positively correlates with the RMS and SDR but negatively correlates with the rotation period. These relations are similar to those of spots on the single star systems. Binaries with luminosity ratios close to the unit tend to have more double dips.

preprint2022arXiv

The Role of Placebo Samples in Observational Studies

In an observational study, it is common to leverage known null effect to detect bias. One such strategy is to set aside a placebo sample -- a subset of data immune from the hypothesized cause-and-effect relationship. Existence of an effect in the placebo sample raises concern of unmeasured confounding bias while absence of it corroborates the causal conclusion. This paper establishes a formal framework for using a placebo sample to detect and remove bias. We state identification assumption, and develop estimation and inference methods based on outcome regression, inverse probability weighting, and doubly-robust approaches. Simulation studies and an empirical application illustrate the finite-sample performance of the proposed methods.

preprint2022arXiv

TransLog: A Unified Transformer-based Framework for Log Anomaly Detection

Log anomaly detection is a key component in the field of artificial intelligence for IT operations (AIOps). Considering log data of variant domains, retraining the whole network for unknown domains is inefficient in real industrial scenarios especially for low-resource domains. However, previous deep models merely focused on extracting the semantics of log sequence in the same domain, leading to poor generalization on multi-domain logs. Therefore, we propose a unified Transformer-based framework for log anomaly detection (\ourmethod{}), which is comprised of the pretraining and adapter-based tuning stage. Our model is first pretrained on the source domain to obtain shared semantic knowledge of log data. Then, we transfer the pretrained model to the target domain via the adapter-based tuning. The proposed method is evaluated on three public datasets including one source domain and two target domains. The experimental results demonstrate that our simple yet efficient approach, with fewer trainable parameters and lower training costs in the target domain, achieves state-of-the-art performance on three benchmarks.

preprint2022arXiv

Uniqueness in inverse diffraction grating problems with infinitely many plane waves at a fixed frequency

This paper is concerned with the inverse diffraction problems by a periodic curve with Dirichlet boundary condition in two dimensions. It is proved that the periodic curve can be uniquely determined by the near-field measurement data corresponding to infinitely many incident plane waves with distinct directions at a fixed frequency. Our proof is based on Schiffer's idea which consists of two ingredients: i) the total fields for incident plane waves with distinct directions are linearly independent, and ii) there exist only finitely many linearly independent Dirichlet eigenfunctions in a bounded domain or in a closed waveguide under additional assumptions on the waveguide boundary. Based on the Rayleigh expansion, we prove that the phased near-field data can be uniquely determined by the phaseless near-field data in a bounded domain, with the exception of a finite set of incident angles. Such a phase retrieval result leads to a new uniqueness result for the inverse grating diffraction problem with phaseless near-field data at a fixed frequency. Since the incident direction determines the quasi-periodicity of the boundary value problem, our inverse issues are different from the existing results of [Htttlich & Kirsch, Inverse Problems 13 (1997): 351-361] where fixed-direction plane waves at multiple frequencies were considered.

preprint2022arXiv

Water Maser Survey towards off-plane O-rich AGBs around the orbital plane of the Sagittarius Stellar Stream

A 22 GHz water maser survey was conducted towards 178 O-rich AGB stars with the aim of identifying maser emission associated with the Sagittarius stellar stream. In this survey, maser emissions were detected in 21 targets, of which 20 were new detections. We studied the Galactic distributions of H2O and SiO maser-traced AGBs towards the Sgr orbital plane, and found an elongated structure towards the (l, b)~(340, 40) direction. In order to verify its association with the Sagittarius tidal stream, we further studied the 3D motions of these sources, but found, kinematically, these maser-traced AGBs are still Galactic disc sources rather than Stream debris. In addition, we found a remarkable outward motion, ~50 km/s away from the Galactic center of these maser-traced AGBs, but with no systermatic lag of rotational speed which were reported in 2000 for solar neighborhood Miras.

preprint2022arXiv

YOLOv6: A Single-Stage Object Detection Framework for Industrial Applications

For years, the YOLO series has been the de facto industry-level standard for efficient object detection. The YOLO community has prospered overwhelmingly to enrich its use in a multitude of hardware platforms and abundant scenarios. In this technical report, we strive to push its limits to the next level, stepping forward with an unwavering mindset for industry application. Considering the diverse requirements for speed and accuracy in the real environment, we extensively examine the up-to-date object detection advancements either from industry or academia. Specifically, we heavily assimilate ideas from recent network design, training strategies, testing techniques, quantization, and optimization methods. On top of this, we integrate our thoughts and practice to build a suite of deployment-ready networks at various scales to accommodate diversified use cases. With the generous permission of YOLO authors, we name it YOLOv6. We also express our warm welcome to users and contributors for further enhancement. For a glimpse of performance, our YOLOv6-N hits 35.9% AP on the COCO dataset at a throughput of 1234 FPS on an NVIDIA Tesla T4 GPU. YOLOv6-S strikes 43.5% AP at 495 FPS, outperforming other mainstream detectors at the same scale~(YOLOv5-S, YOLOX-S, and PPYOLOE-S). Our quantized version of YOLOv6-S even brings a new state-of-the-art 43.3% AP at 869 FPS. Furthermore, YOLOv6-M/L also achieves better accuracy performance (i.e., 49.5%/52.3%) than other detectors with a similar inference speed. We carefully conducted experiments to validate the effectiveness of each component. Our code is made available at https://github.com/meituan/YOLOv6.

preprint2021arXiv

AutoKWS: Keyword Spotting with Differentiable Architecture Search

Smart audio devices are gated by an always-on lightweight keyword spotting program to reduce power consumption. It is however challenging to design models that have both high accuracy and low latency for accurate and fast responsiveness. Many efforts have been made to develop end-to-end neural networks, in which depthwise separable convolutions, temporal convolutions, and LSTMs are adopted as building units. Nonetheless, these networks designed with human expertise may not achieve an optimal trade-off in an expansive search space. In this paper, we propose to leverage recent advances in differentiable neural architecture search to discover more efficient networks. Our searched model attains 97.2% top-1 accuracy on Google Speech Command Dataset v1 with only nearly 100K parameters.

preprint2021arXiv

Convergence of the uniaxial PML method for time-domain electromagnetic scattering problems

In this paper, we propose and study the uniaxial perfectly matched layer (PML) method for three-dimensional time-domain electromagnetic scattering problems, which has a great advantage over the spherical one in dealing with problems involving anisotropic scatterers. The truncated uniaxial PML problem is proved to be well-posed and stable, based on the Laplace transform technique and the energy method. Moreover, the $L^2$-norm and $L^{\infty}$-norm error estimates in time are given between the solutions of the original scattering problem and the truncated PML problem, leading to the exponential convergence of the time-domain uniaxial PML method in terms of the thickness and absorbing parameters of the PML layer. The proof depends on the error analysis between the EtM operators for the original scattering problem and the truncated PML problem, which is different from our previous work (SIAM J. Numer. Anal. 58(3) (2020), 1918-1940).

preprint2021arXiv

DARTS-: Robustly Stepping out of Performance Collapse Without Indicators

Despite the fast development of differentiable architecture search (DARTS), it suffers from long-standing performance instability, which extremely limits its application. Existing robustifying methods draw clues from the resulting deteriorated behavior instead of finding out its causing factor. Various indicators such as Hessian eigenvalues are proposed as a signal to stop searching before the performance collapses. However, these indicator-based methods tend to easily reject good architectures if the thresholds are inappropriately set, let alone the searching is intrinsically noisy. In this paper, we undertake a more subtle and direct approach to resolve the collapse. We first demonstrate that skip connections have a clear advantage over other candidate operations, where it can easily recover from a disadvantageous state and become dominant. We conjecture that this privilege is causing degenerated performance. Therefore, we propose to factor out this benefit with an auxiliary skip connection, ensuring a fairer competition for all operations. We call this approach DARTS-. Extensive experiments on various datasets verify that it can substantially improve robustness. Our code is available at https://github.com/Meituan-AutoML/DARTS- .

preprint2021arXiv

Data completion algorithms and their applications in inverse acoustic scattering with limited-aperture backscattering data

We introduce two data completion algorithms for the limited-aperture problems in inverse acoustic scattering. Both completion algorithms are independent of the topological and physical properties of the unknown scatterers. The main idea is to relate the limited-aperture data to the full-aperture data via the prolate matrix. The data completion algorithms are simple and fast since only the approximate inversion of the prolate matrix is involved. We then combine the data completion algorithms with imaging methods such as factorization method and direct sampling method for the object reconstructions. A variety of numerical examples are presented to illustrate the effectiveness and robustness of the proposed algorithms.

preprint2021arXiv

Deep Sketch-guided Cartoon Video Inbetweening

We propose a novel framework to produce cartoon videos by fetching the color information from two input keyframes while following the animated motion guided by a user sketch. The key idea of the proposed approach is to estimate the dense cross-domain correspondence between the sketch and cartoon video frames, and employ a blending module with occlusion estimation to synthesize the middle frame guided by the sketch. After that, the input frames and the synthetic frame equipped with established correspondence are fed into an arbitrary-time frame interpolation pipeline to generate and refine additional inbetween frames. Finally, a module to preserve temporal consistency is employed. Compared to common frame interpolation methods, our approach can address frames with relatively large motion and also has the flexibility to enable users to control the generated video sequences by editing the sketch guidance. By explicitly considering the correspondence between frames and the sketch, we can achieve higher quality results than other image synthesis methods. Our results show that our system generalizes well to different movie frames, achieving better results than existing solutions.

preprint2021arXiv

Efficient Compressed Sensing Based Image Coding by Using Gray Transformation

In recent years, compressed sensing (CS) based image coding has become a hot topic in image processing field. However, since the bit depth required for encoding each CS sample is too large, the compression performance of this paradigm is unattractive. To address this issue, a novel CS-based image coding system by using gray transformation is proposed. In the proposed system, we use a gray transformation to preprocess the original image firstly and then use CS to sample the transformed image. Since gray transformation makes the probability distribution of CS samples centralized, the bit depth required for encoding each CS sample is reduced significantly. Consequently, the proposed system can considerably improve the compression performance of CS-based image coding. Simulation results show that the proposed system outperforms the traditional one without using gray transformation in terms of compression performance.

preprint2021arXiv

LAMOST Time-Domain Survey: First Results of four $K$2 plates

From Oct. 2019 to Apr. 2020, LAMOST performs a time-domain spectroscopic survey of four $K$2 plates with both low- and med-resolution observations. The low-resolution spectroscopic survey gains 282 exposures ($\approx$46.6 hours) over 25 nights, yielding a total of about 767,000 spectra, and the med-resolution survey takes 177 exposures ($\approx$49.1 hours) over 27 nights, collecting about 478,000 spectra. More than 70%/50% of low-resolution/med-resolution spectra have signal-to-noise ratio higher than 10. We determine stellar parameters (e.g., $T_{\rm eff}$, log$g$, [Fe/H]) and radial velocity (RV) with different methods, including LASP, DD-Payne, and SLAM. In general, these parameter estimations from different methods show good agreement, and the stellar parameter values are consistent with those of APOGEE. We use the $Gaia$ DR2 RV data to calculate a median RV zero point (RVZP) for each spectrograph exposure by exposure, and the RVZP-corrected RVs agree well with the APOGEE data. The stellar evolutionary and spectroscopic masses are estimated based on the stellar parameters, multi-band magnitudes, distances and extinction values. Finally, we construct a binary catalog including about 2700 candidates by analyzing their light curves, fitting the RV data, calculating the binarity parameters from med-resolution spectra, and cross-matching the spatially resolved binary catalog from $Gaia$ EDR3. The LAMOST TD survey is expected to get breakthrough in various scientific topics, such as binary system, stellar activity, and stellar pulsation, etc.

preprint2021arXiv

LTD064402+245919: A Subgiant with a 1-3 M$_{\odot}$ Undetected Companion Identified from LAMOST-TD Data

Single-line spectroscopic binaries recently contribute to the stellar-mass black hole discovery, independently of the X-ray transient method. We report the identification of a single-line binary system LTD064402+245919, with an orbital period of 14.50 days. The observed component is a subgiant with a mass of 2.77$\pm$0.68M$_{\odot}$, radius 15.5$\pm$2.5R$_{\odot}$, effective temperature $T_{\rm eff}$ 4500$\pm$200K, and surface gravity log\emph{g} 2.5$\pm$0.25dex. The discovery makes use of the LAMOST time-domain (LAMOST-TD) and ZTF survey. Our general-purpose software pipeline applies the Lomb-Scargle periodogram to determine the orbital period and uses machine-learning to classify the variable type from the folded light curves. We apply a combined model to estimate the orbital parameters from both the light and radial velocity curves, taking constraints on the primary star mass, mass function, and detection limit of secondary luminosity into consideration. We obtain a radial velocity semi-amplitude of 44.6$\pm$1.5 km s$^{-1}$, mass ratio of 0.73$\pm$0.07, and an undetected component mass of 2.02$\pm$0.49M$_{\odot}$ when the type of the undetected component is not set. We conclude that the inclination is not well constrained, and that the secondary mass is larger than 1M$_{\odot}$ when the undetected component is modelled as a compact object. According to our investigations using an MCMC simulation, increasing the spectra SNR by a factor of 3 would enable the secondary light to be distinguished (if present). The algorithm and software in this work are able to serve as general-purpose tools for the identification of compact objects quiescent in X-rays.

preprint2021arXiv

Polar state memory in active fluids

Spontaneous emergence of correlated states such as flocks and vortices are prime examples of remarkable collective dynamics and self-organization observed in active matter. The formation of globally correlated polar states in geometrically confined systems proceeds through the emergence of a macroscopic steadily rotating vortex that spontaneously selects a clockwise or counterclockwise global chiral state. Here, we reveal that a global vortex formed by colloidal rollers exhibits state memory. The information remains stored even when the energy injection is ceased and the activity is terminated. We show that a subsequent formation of the collective states upon re-energizing the system is not random. We combine experiments and simulations to elucidate how a combination of hydrodynamic and electrostatic interactions leads to hidden asymmetries in the local particle positional order encoding the chiral state of the system. The stored information can be accessed and exploited to systematically command subsequent polar states of active liquid through temporal control of the activity. With the chirality of the emergent collective states controlled on-demand, active liquids offer new possibilities for flow manipulation, transport, and mixing at the microscale.

preprint2021arXiv

Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation

Self-training is a competitive approach in domain adaptive segmentation, which trains the network with the pseudo labels on the target domain. However inevitably, the pseudo labels are noisy and the target features are dispersed due to the discrepancy between source and target domains. In this paper, we rely on representative prototypes, the feature centroids of classes, to address the two issues for unsupervised domain adaptation. In particular, we take one step further and exploit the feature distances from prototypes that provide richer information than mere prototypes. Specifically, we use it to estimate the likelihood of pseudo labels to facilitate online correction in the course of training. Meanwhile, we align the prototypical assignments based on relative feature distances for two different views of the same target, producing a more compact target feature space. Moreover, we find that distilling the already learned knowledge to a self-supervised pretrained model further boosts the performance. Our method shows tremendous performance advantage over state-of-the-art methods. We will make the code publicly available.

preprint2021arXiv

Robust Dynamical Decoupling for the Manipulation of a Spin Network via a Single Spin

High-fidelity control of quantum systems is crucial for quantum information processing, but is often limited by perturbations from the environment and imperfections in the applied control fields. Here, we investigate the combination of dynamical decoupling (DD) and robust optimal control (ROC) to address this problem. In this combination, ROC is employed to find robust shaped pulses, wherein the directional derivatives of the controlled dynamics with respect to control errors are reduced to a desired order. Then, we incorporate ROC pulses into DD sequences, achieving a remarkable improvement of robustness against multiple error channels. We demonstrate this method in the example of manipulating nuclear spin bath via an electron spin in the NV center system. Simulation results indicate that ROC based DD sequences outperform the state-of-the-art robust DD sequences. Our work has implications for robust quantum control on near-term noisy quantum devices.

preprint2021arXiv

Simultaneous recovery of a locally rough interface and the embedded obstacle with its surrounding medium

Consider the scattering of time-harmonic point sources by an infinite locally rough interface with bounded obstacles embedded in the lower half-space. The model problem is first reduced to an equivalent integral equation formulation defined in a bounded domain, where the well-posedness is obtained in $L^p$ by the classical Fredholm theory. Then a global uniqueness theorem is proved for the inverse problem of recovering the locally rough interface, the embedded obstacles and the wave number in the lower-half space by means of near-field measurements above the interface.

preprint2021arXiv

The Spectroscopic Binaries from LAMOST Medium-Resolution Survey (MRS). I. Searching for Double-lined Spectroscopic Binaries (SB2s) with Convolutional Neural Network

We developed a convolutional neural network (CNN) model to distinguish the double-lined spectroscopic binaries (SB2s) from others based on single exposure medium-resolution spectra ($R\sim 7,500$). The training set consists of a large set of mock spectra of single stars and binaries synthesized based on the MIST stellar evolutionary model and ATLAS9 atmospheric model. Our model reaches a novel theoretic false positive rate by adding a proper penalty on the negative sample (e.g., 0.12\% and 0.16\% for the blue/red arm when the penalty parameter $Λ=16$). Tests show that the performance is as expected and favors FGK-type Main-sequence binaries with high mass ratio ($q \geq 0.7$) and large radial velocity separation ($Δv \geq 50\,\mathrm{km\,s^{-1}}$). Although the real false positive rate can not be estimated reliably, validating on eclipsing binaries identified from Kepler light curves indicates that our model predicts low binary probabilities at eclipsing phases (0, 0.5, and 1.0) as expected. The color-magnitude diagram also helps illustrate its feasibility and capability of identifying FGK MS binaries from spectra. We conclude that this model is reasonably reliable and can provide an automatic approach to identify SB2s with period $\lesssim 10$ days. This work yields a catalog of binary probabilities for over 5 million spectra of 1 million sources from the LAMOST medium-resolution survey (MRS), and a catalog of 2198 SB2 candidates whose physical properties will be analyzed in our following-up paper. Data products are made publicly available at the journal as well as our Github website.

preprint2021arXiv

Time domain analysis for electromagnetic scattering by an elastic obstacle in a two-layered medium

In this paper, we consider the scattering of a time-dependent electromagnetic wave by an elastic body immersed in the lower half-space of a two-layered background medium which is separated by an unbounded rough surface. By proposing two exact transparent boundary conditions (TBCs) on the artificial planes, we reformulate the unbounded scattering problem into an equivalent initial-boundary value problem in a strip domain with the well-posedness and stability proved using the Laplace transform, variational method and energy method. A perfectly matched layer (PML) is then introduced to truncate the interaction problem with two finite layers containing the elastic body, leading to a PML problem in a finite strip domain. We further verify the existence, uniqueness and stability estimate of solution for the PML problem. Finally, we establish the exponential convergence in terms of the thickness and parameters of the PML layers via an error estimate on the electric-to-magnetic (EtM) capacity operators between the original problem and the PML problem.

preprint2021arXiv

User-Level Privacy-Preserving Federated Learning: Analysis and Performance Optimization

Federated learning (FL), as a type of collaborative machine learning framework, is capable of preserving private data from mobile terminals (MTs) while training the data into useful models. Nevertheless, from a viewpoint of information theory, it is still possible for a curious server to infer private information from the shared models uploaded by MTs. To address this problem, we first make use of the concept of local differential privacy (LDP), and propose a user-level differential privacy (UDP) algorithm by adding artificial noise to the shared models before uploading them to servers. According to our analysis, the UDP framework can realize $(ε_{i}, δ_{i})$-LDP for the $i$-th MT with adjustable privacy protection levels by varying the variances of the artificial noise processes. We then derive a theoretical convergence upper-bound for the UDP algorithm. It reveals that there exists an optimal number of communication rounds to achieve the best learning performance. More importantly, we propose a communication rounds discounting (CRD) method. Compared with the heuristic search method, the proposed CRD method can achieve a much better trade-off between the computational complexity of searching and the convergence performance. Extensive experiments indicate that our UDP algorithm using the proposed CRD method can effectively improve both the training efficiency and model quality for the given privacy protection levels.

preprint2020arXiv

A calibrated sensitivity analysis for matched observational studies with application to the effect of second-hand smoke exposure on blood lead levels in U.S. children

Matched observational studies are commonly used to study treatment effects in non-randomized data. After matching for observed confounders, there could remain bias from unobserved confounders. A standard way to address this problem is to do a sensitivity analysis. A sensitivity analysis asks how sensitive the result is to a hypothesized unmeasured confounder U. One method, known as simultaneous sensitivity analysis, has two sensitivity parameters: one relating U to treatment assignment and the other to response. This method assumes that in each matched set, U is distributed to make the bias worst. This approach has two concerning features. First, this worst case distribution of U in each matched set does not correspond to a realistic distribution of U in the population. Second, sensitivity parameters are in absolute scales which are hard to compare to observed covariates. We address these concerns by introducing a method that endows U with a probability distribution in the population and calibrates the unmeasured confounder to the observed covariates. We compare our method to simultaneous sensitivity analysis in simulations and in a study of the effect of second-hand smoke exposure on blood lead levels in U.S. children.

preprint2020arXiv

A Catalog of Short Period Spectroscopic and Eclipsing Binaries Identified from the LAMOST & PTF Surveys

Binaries play key roles in determining stellar parameters and exploring stellar evolution models. We build a catalog of 88 eclipsing binaries with spectroscopic information, taking advantage of observations from both the Large Sky Area Multi-Object fiber Spectroscopic Telescope (LAMOST) and the Palomar Transient Factory (PTF) surveys. A software pipeline is constructed to identify binary candidates by examining their light curves. The orbital periods of binaries are derived from the Lomb-Scargle method. The key distinguishing features of eclipsing binaries are recognized by a new filter \textit{Flat Test}. We classify the eclipsing binaries by applying Fourier analysis on the light curves. Among all the binary stars, 13 binaries are identified as eclipsing binaries for the first time. The catalog contains information: position, primary eclipsing magnitude and time, eclipsing depth, the number of photometry and radial velocity observations, largest radial velocity difference, binary type, the effective temperature of observable star $T_{\rm eff}$, and surface gravity of observable star log \emph{g}. The false-positive probability is calculated by using both a Monte Carlo simulation and real data from the SDSS Stripe 82 Standard Catalog. The binaries in the catalog are mostly with a period of less than one day. The period distribution shows a 0.22-day cut-off which is consistent with the low probability of an eclipsing binary rotating with such a period.

preprint2020arXiv

A linear sampling method for inverse acoustic scattering by a locally rough interface

This paper is concerned with the inverse problem of time-harmonic acoustic scattering by an unbounded, locally rough interface which is assumed to be a local perturbation of a plane. The purpose of this paper is to recover the local perturbation of the interface from the near-field measurement given on a straight line segment with a finite distance above the interface and generated by point sources. Precisely, we propose a novel version of the linear sampling method to recover the location and shape of the local perturbation of the interface numerically. Our method is based on a modified near-field operator equation associated with a special rough surface, constructed by reformulating the forward scattering problem into an equivalent integral equation formulation in a bounded domain, leading to a fast imaging algorithm. Numerical experiments are presented to illustrate the effectiveness of the imaging method.

preprint2020arXiv

A Wasserstein Minimum Velocity Approach to Learning Unnormalized Models

Score matching provides an effective approach to learning flexible unnormalized models, but its scalability is limited by the need to evaluate a second-order derivative. In this paper, we present a scalable approximation to a general family of learning objectives including score matching, by observing a new connection between these objectives and Wasserstein gradient flows. We present applications with promise in learning neural density estimators on manifolds, and training implicit variational and Wasserstein auto-encoders with a manifold-valued prior.

preprint2020arXiv

Automatic, Dynamic, and Nearly Optimal Learning Rate Specification by Local Quadratic Approximation

In deep learning tasks, the learning rate determines the update step size in each iteration, which plays a critical role in gradient-based optimization. However, the determination of the appropriate learning rate in practice typically replies on subjective judgement. In this work, we propose a novel optimization method based on local quadratic approximation (LQA). In each update step, given the gradient direction, we locally approximate the loss function by a standard quadratic function of the learning rate. Then, we propose an approximation step to obtain a nearly optimal learning rate in a computationally efficient way. The proposed LQA method has three important features. First, the learning rate is automatically determined in each update step. Second, it is dynamically adjusted according to the current loss function value and the parameter estimates. Third, with the gradient direction fixed, the proposed method leads to nearly the greatest reduction in terms of the loss function. Extensive experiments have been conducted to prove the strengths of the proposed LQA method.

preprint2020arXiv

Bringing Old Photos Back to Life

We propose to restore old photos that suffer from severe degradation through a deep learning approach. Unlike conventional restoration tasks that can be solved through supervised learning, the degradation in real photos is complex and the domain gap between synthetic images and real old photos makes the network fail to generalize. Therefore, we propose a novel triplet domain translation network by leveraging real photos along with massive synthetic image pairs. Specifically, we train two variational autoencoders (VAEs) to respectively transform old photos and clean photos into two latent spaces. And the translation between these two latent spaces is learned with synthetic paired data. This translation generalizes well to real photos because the domain gap is closed in the compact latent space. Besides, to address multiple degradations mixed in one old photo, we design a global branch with a partial nonlocal block targeting to the structured defects, such as scratches and dust spots, and a local branch targeting to the unstructured defects, such as noises and blurriness. Two branches are fused in the latent space, leading to improved capability to restore old photos from multiple defects. The proposed method outperforms state-of-the-art methods in terms of visual quality for old photos restoration.

preprint2020arXiv

Convergence analysis of the PML method for time-domain electromagnetic scattering problems

In this paper, a perfectly matched layer (PML) method is proposed to solve the time-domain electromagnetic scattering problems in 3D effectively. The PML problem is defined in a spherical layer and derived by using the Laplace transform and real coordinate stretching in the frequency domain. The well-posedness and the stability estimate of the PML problem are first proved based on the Laplace transform and the energy method. The exponential convergence of the PML method is then established in terms of the thickness of the layer and the PML absorbing parameter. As far as we know, this is the first convergence result for the time-domain PML method for the three-dimensional Maxwell equations. Our proof is mainly based on the stability estimates of solutions of the truncated PML problem and the exponential decay estimates of the stretched dyadic Green's function for the Maxwell equations in the free space.

preprint2020arXiv

Cross-domain Correspondence Learning for Exemplar-based Image Translation

We present a general framework for exemplar-based image translation, which synthesizes a photo-realistic image from the input in a distinct domain (e.g., semantic segmentation mask, or edge map, or pose keypoints), given an exemplar image. The output has the style (e.g., color, texture) in consistency with the semantically corresponding objects in the exemplar. We propose to jointly learn the crossdomain correspondence and the image translation, where both tasks facilitate each other and thus can be learned with weak supervision. The images from distinct domains are first aligned to an intermediate domain where dense correspondence is established. Then, the network synthesizes images based on the appearance of semantically corresponding patches in the exemplar. We demonstrate the effectiveness of our approach in several image translation tasks. Our method is superior to state-of-the-art methods in terms of image quality significantly, with the image style faithful to the exemplar with semantic consistency. Moreover, we show the utility of our method for several applications

preprint2020arXiv

Deep residual detection of radio frequency interference for FAST

Radio frequency interference (RFI) detection and excision are key steps in the data-processing pipeline of the Five-hundred-meter Aperture Spherical radio Telescope (FAST). Because of its high sensitivity and large data rate, FAST requires more accurate and efficient RFI flagging methods than its counterparts. In the last decades, approaches based upon artificial intelligence (AI), such as codes using convolutional neural networks (CNNs), have been proposed to identify RFI more reliably and efficiently. However, RFI flagging of FAST data with such methods has often proved to be erroneous, with further manual inspections required. In addition, network construction as well as preparation of training data sets for effective RFI flagging has imposed significant additional workloads. Therefore, rapid deployment and adjustment of AI approaches for different observations is impractical to implement with existing algorithms. To overcome such problems, we propose a model called RFI-Net. With the input of raw data without any processing, RFI-Net can detect RFI automatically, producing corresponding masks without any alteration of the original data. Experiments with RFI-Net using simulated astronomical data show that our model has outperformed existing methods in terms of both precision and recall. Besides, compared with other models, our method can obtain the same relative accuracy with fewer training data, thus reducing the effort and time required to prepare the training data set. Further, the training process of RFI-Net can be accelerated, with overfittings being minimized, compared with other CNN codes. The performance of RFI-Net has also been evaluated with observing data obtained by FAST and the Bleien Observatory. Our results demonstrate the ability of RFI-Net to accurately identify RFI with fine-grained, high-precision masks that required no further modification.

preprint2020arXiv

Differential rotation of the halo traced by the K-giant stars

We use K-giant stars selected from the LAMOST DR5 to study the variation of the rotational velocity of the galactic halo at different space positions. Modelling the rotational velocity distribution with both the halo and disk components, we find that the rotational velocity of the halo population decreases almost linearly with increasing vertical distance to the galactic disk plane, $Z$, at fixed galactocentric radius, $R$. The samples are separated into two parts with $6<R<12$ kpc and $12<R<20$ kpc. We derive that the decreasing rates along $Z$ for the two subsamples are $-3.07\pm0.63$ and $-1.89\pm0.37$ km s$^{-1}$ kpc$^{-1}$, respectively. Compared with the TNG simulations, we suggest that this trend is probably caused by the interaction between the disk and halo. The results from the simulations show that only the oblate halo can provide a decreasing rotational velocity with an increasing $Z$. This indicates that the Galactic halo is oblate with galactocentric radius $R<20$ kpc. On the other hand, the flaring of the disk component (mainly the thick disk) is clearly traced by this study, with $R$ between 12 and 20 kpc, the disk can vertically extend to $6\sim10$ kpc above the disk plane. What is more interesting is that, we find the Gaia-Enceladus-Sausage (GES) component has a significant contribution only in the halo with $R<12$ kpc, i.e. a fraction of 23$-$47\%. While in the outer subsample, the contribution is too low to be well constrained.

preprint2020arXiv

Fair DARTS: Eliminating Unfair Advantages in Differentiable Architecture Search

Differentiable Architecture Search (DARTS) is now a widely disseminated weight-sharing neural architecture search method. However, it suffers from well-known performance collapse due to an inevitable aggregation of skip connections. In this paper, we first disclose that its root cause lies in an unfair advantage in exclusive competition. Through experiments, we show that if either of two conditions is broken, the collapse disappears. Thereby, we present a novel approach called Fair DARTS where the exclusive competition is relaxed to be collaborative. Specifically, we let each operation's architectural weight be independent of others. Yet there is still an important issue of discretization discrepancy. We then propose a zero-one loss to push architectural weights towards zero or one, which approximates an expected multi-hot solution. Our experiments are performed on two mainstream search spaces, and we derive new state-of-the-art results on CIFAR-10 and ImageNet. Our code is available on https://github.com/xiaomi-automl/fairdarts .

preprint2020arXiv

Fast, Accurate and Lightweight Super-Resolution with Neural Architecture Search

Deep convolutional neural networks demonstrate impressive results in the super-resolution domain. A series of studies concentrate on improving peak signal noise ratio (PSNR) by using much deeper layers, which are not friendly to constrained resources. Pursuing a trade-off between the restoration capacity and the simplicity of models is still non-trivial. Recent contributions are struggling to manually maximize this balance, while our work achieves the same goal automatically with neural architecture search. Specifically, we handle super-resolution with a multi-objective approach. We also propose an elastic search tactic at both micro and macro level, based on a hybrid controller that profits from evolutionary computation and reinforcement learning. Quantitative experiments help us to draw a conclusion that our generated models dominate most of the state-of-the-art methods with respect to the individual FLOPS.

preprint2020arXiv

Galaxy Optical Variability of Virgo Cluster: New Tracer for Environmental Influences on Galaxies

We investigate the relationship between the optical variability of galaxies and their distances from the centre of the Virgo Cluster using Palomar Transient Factory data. We define the ratio between the standard deviation of the galaxy brightness and the mean value of the standard deviation as a measure of a galaxy's optical variability. A sample of 814 Virgo galaxies with 230263 observations shows a monotonically decreasing trend of optical variability with increasing clustercentric distance. The variability level inside the cluster is 3.2$σ$ higher than the level outside. We fit the variability with a linear function and find that the data reject a distance-independent model. We examine 217 background galaxies for comparison and find no significant trend in galaxy variability. We assess the relation with Monte Carlo simulation by rebuilding the brightness of each galaxy. The simulation shows a monotonically decreasing relation for member galaxy variability and a distance-independent relation for background galaxies. Our result is consistent with the theory that the cold gas flowing inwards the cluster centre fuels AGN activity. This work is a new implementation of the method using optical variability to investigate the relation between galaxies evolution and their environment.

preprint2020arXiv

HCGrid: A Convolution-based Gridding Framework for RadioAstronomy in Hybrid Computing Environments

Gridding operation, which is to map non-uniform data samples onto a uniformly distributedgrid, is one of the key steps in radio astronomical data reduction process. One of the mainbottlenecks of gridding is the poor computing performance, and a typical solution for suchperformance issue is the implementation of multi-core CPU platforms. Although such amethod could usually achieve good results, in many cases, the performance of gridding is stillrestricted to an extent due to the limitations of CPU, since the main workload of gridding isa combination of a large number of single instruction, multi-data-stream operations, which ismore suitable for GPU, rather than CPU implementations. To meet the challenge of massivedata gridding for the modern large single-dish radio telescopes, e.g., the Five-hundred-meterAperture Spherical radio Telescope (FAST), inspired by existing multi-core CPU griddingalgorithms such as Cygrid, here we present an easy-to-install, high-performance, and open-source convolutional gridding framework, HCGrid,in CPU-GPU heterogeneous platforms. Itoptimises data search by employing multi-threading on CPU, and accelerates the convolutionprocess by utilising massive parallelisation of GPU. In order to make HCGrid a more adaptivesolution, we also propose the strategies of thread organisation and coarsening, as well as optimalparameter settings under various GPU architectures. A thorough analysis of computing timeand performance gain with several GPU parallel optimisation strategies show that it can leadto excellent performance in hybrid computing environments.

preprint2020arXiv

Integrated and Spectrally Selective Thermal Emitters Enabled by Layered Metamaterials

Nanophotonic engineering of light-matter interaction at subwavelength scale allows thermal radiation that is fundamentally different from that of traditional thermal emitters and provides exciting opportunities for various thermal-photonic applications. We propose a new kind of integrated and electrically controlled thermal emitter that exploits layered metamaterials with lithography-free and dielectric/metallic nanolayers. We demonstrate both theoretically and experimentally that the proposed concept can create a strong photonic bandgap in the visible regime and allow small impedance mismatch at the infrared wavelengths, which gives rise to optical features of significantly enhanced emissivity at the broad infrared wavelengths of 1.4-14 um as well as effectively suppressed emissivity in the visible region. The electrically driven metamaterial devices are optically and thermally stable at temperature up to ~800 K with electro-optical conversion efficiency reaching ~30%. We believe that the proposed high efficiency thermal emitters will pave the way towards integrated infrared light source platforms for various thermal-photonic applications and particularly provide a novel alternative for cost-effective, compact, low glare, and energy-efficient infrared heating.

preprint2020arXiv

LAMOST Medium-Resolution Spectroscopic Survey (LAMOST-MRS): Scientific goals and survey plan

Since September 2018, LAMOST starts a new 5-year medium-resolution spectroscopic survey (MRS) using bright/gray nights. We present the scientific goals of LAMOST-MRS and propose a near optimistic strategy of the survey. A complete footprint is also provided. Not only the regular medium-resolution survey, but also a time-domain spectroscopic survey is being conducted since 2018 and will be end in 2023. According to the detailed survey plan, we expect that LAMOST-MRS can observe about 2 million stellar spectra with ~7500 and limiting magnitude of around G=15 mag. Moreover, it will also provide about 200 thousand stars with averagely 60-epoch observations and limiting magnitude of G~14 mag. These high quality spectra will give around 20 elemental abundances, rotational velocities, emission line profiles as well as precise radial velocity with uncertainty less than 1 km/s. With these data, we expect that LAMOST can effectively leverage sciences on stellar physics, e.g. exotic binary stars, detailed observation of many types of variable stars etc., planet host stars, emission nebulae, open clusters, young pre-main-sequence stars etc.

preprint2020arXiv

Latent Variables on Spheres for Autoencoders in High Dimensions

Variational Auto-Encoder (VAE) has been widely applied as a fundamental generative model in machine learning. For complex samples like imagery objects or scenes, however, VAE suffers from the dimensional dilemma between reconstruction precision that needs high-dimensional latent codes and probabilistic inference that favors a low-dimensional latent space. By virtue of high-dimensional geometry, we propose a very simple algorithm, called Spherical Auto-Encoder (SAE), completely different from existing VAEs to address the issue. SAE is in essence the vanilla autoencoder with spherical normalization on the latent space. We analyze the unique characteristics of random variables on spheres in high dimensions and argue that random variables on spheres are agnostic to various prior distributions and data modes when the dimension is sufficiently high. Therefore, SAE can harness a high-dimensional latent space to improve the inference precision of latent codes while maintain the property of stochastic sampling from priors. The experiments on sampling and inference validate our theoretical analysis and the superiority of SAE.

preprint2020arXiv

Learning Implicit Generative Models by Teaching Explicit Ones

Implicit generative models are difficult to train as no explicit density functions are defined. Generative adversarial nets (GANs) present a minimax framework to train such models, which however can suffer from mode collapse due to the nature of the JS-divergence. This paper presents a learning by teaching (LBT) approach to learning implicit models, which intrinsically avoids the mode collapse problem by optimizing a KL-divergence rather than the JS-divergence in GANs. In LBT, an auxiliary density estimator is introduced to fit the implicit model's distribution while the implicit model teaches the density estimator to match the data distribution. LBT is formulated as a bilevel optimization problem, whose optimal generator matches the true data distribution. LBT can be naturally integrated with GANs to derive a hybrid LBT-GAN that enjoys complimentary benefits. Finally, we present a stochastic gradient ascent algorithm with unrolling to solve the challenging learning problems. Experimental results demonstrate the effectiveness of our method.

preprint2020arXiv

Modeling and Detailed Numerical Simulation of the Primary Breakup of a Gasoline Surrogate Jet under Non-Evaporative Operating Conditions

In the present study, detailed numerical simulations are performed to investigate the primary breakup of a gasoline surrogate jet under non-evaporative "Spray G" operating conditions. The Spray G injector and operating conditions, developed by the Engine Combustion Network (ECN), represent the early phase of spray-guided gasoline injection. To focus the computational resources on resolving the primary breakup, simplifications have been made on the injector geometry. The effect of the internal flow on the primary breakup is modeled by specifying a nonzero injection angle at the inlet. The nonzero injection angle results in an increase of the jet penetration speed and also a deflection of the liquid jet. A parametric study on the injection angle is performed, and the numerical results are compared to the experimental data to identify the injection angle that best represents the Spray G conditions. The nonzero injection angle introduces an azimuthally non-uniform velocity in the liquid jet, which in turn influences the instability development on the jet surfaces and also the deformation and breakup of the jet head. The asymmetric primary breakup dynamics eventually lead to an azimuthal variation of droplet size distributions. The number of droplets varies significantly with the azimuthal angle, but interestingly, the probability density functions (PDF) of droplet size for different azimuthal angles collapse to a self-similar profile. Analysis has also been conducted to estimate the percentage and statistics of the tiny droplets that are under resolved in the present simulation. The PDF of the azimuthal angle is also presented, which is also shown to exhibit a self-similar form that varies little over time. Finally, a model is developed to predict the droplet number as a function of droplet diameter, azimuthal angle where a droplet is located, and time.

preprint2020arXiv

MoGA: Searching Beyond MobileNetV3

The evolution of MobileNets has laid a solid foundation for neural network applications on mobile end. With the latest MobileNetV3, neural architecture search again claimed its supremacy in network design. Unfortunately, till today all mobile methods mainly focus on CPU latencies instead of GPU, the latter, however, is much preferred in practice for it has faster speed, lower overhead and less interference. Bearing the target hardware in mind, we propose the first Mobile GPU-Aware (MoGA) neural architecture search in order to be precisely tailored for real-world applications. Further, the ultimate objective to devise a mobile network lies in achieving better performance by maximizing the utilization of bounded resources. Urging higher capability while restraining time consumption is not reconcilable. We alleviate the tension by weighted evolution techniques. Moreover, we encourage increasing the number of parameters for higher representational power. With 200x fewer GPU days than MnasNet, we obtain a series of models that outperform MobileNetV3 under the similar latency constraints, i.e., MoGA-A achieves 75.9% top-1 accuracy on ImageNet, MoGA-B meets 75.5% which costs only 0.5 ms more on mobile GPU. MoGA-C best attests GPU-awareness by reaching 75.3% and being slower on CPU but faster on GPU.The models and test code is made available here https://github.com/xiaomi-automl/MoGA.

preprint2020arXiv

Near-field imaging of a locally rough interface and buried obstacles with the linear sampling method

Consider the problem of inverse scattering of time-harmonic point sources from an infinite, penetrable rough interface with bounded obstacles buried in the lower half-space, where the interface is assumed to be a local perturbation of a planar surface. A novel version of the sampling method is proposed to simultaneously reconstruct the local perturbation of the rough interface and buried obstacles by constructing a modified near-field equation associated with a special rough surface, yielding a fast imaging algorithm. Numerical examples are presented to illustrate the effectiveness of the inversion algorithm.

preprint2020arXiv

Neural Architecture Search on Acoustic Scene Classification

Convolutional neural networks are widely adopted in Acoustic Scene Classification (ASC) tasks, but they generally carry a heavy computational burden. In this work, we propose a lightweight yet high-performing baseline network inspired by MobileNetV2, which replaces square convolutional kernels with unidirectional ones to extract features alternately in temporal and frequency dimensions. Furthermore, we explore a dynamic architecture space built on the basis of the proposed baseline with the recent Neural Architecture Search (NAS) paradigm, which first trains a supernet that incorporates all candidate networks and then applies a well-known evolutionary algorithm NSGA-II to discover more efficient networks with higher accuracy and lower computational cost. Experimental results demonstrate that our searched network is competent in ASC tasks, which achieves 90.3% F1-score on the DCASE2018 task 5 evaluation set, marking a new state-of-the-art performance while saving 25% of FLOPs compared to our baseline network.

preprint2020arXiv

Old Photo Restoration via Deep Latent Space Translation

We propose to restore old photos that suffer from severe degradation through a deep learning approach. Unlike conventional restoration tasks that can be solved through supervised learning, the degradation in real photos is complex and the domain gap between synthetic images and real old photos makes the network fail to generalize. Therefore, we propose a novel triplet domain translation network by leveraging real photos along with massive synthetic image pairs. Specifically, we train two variational autoencoders (VAEs) to respectively transform old photos and clean photos into two latent spaces. And the translation between these two latent spaces is learned with synthetic paired data. This translation generalizes well to real photos because the domain gap is closed in the compact latent space. Besides, to address multiple degradations mixed in one old photo, we design a global branch with apartial nonlocal block targeting to the structured defects, such as scratches and dust spots, and a local branch targeting to the unstructured defects, such as noises and blurriness. Two branches are fused in the latent space, leading to improved capability to restore old photos from multiple defects. Furthermore, we apply another face refinement network to recover fine details of faces in the old photos, thus ultimately generating photos with enhanced perceptual quality. With comprehensive experiments, the proposed pipeline demonstrates superior performance over state-of-the-art methods as well as existing commercial tools in terms of visual quality for old photos restoration.

preprint2020arXiv

Perceptual Image Super-Resolution with Progressive Adversarial Network

Single Image Super-Resolution (SISR) aims to improve resolution of small-size low-quality image from a single one. With popularity of consumer electronics in our daily life, this topic has become more and more attractive. In this paper, we argue that the curse of dimensionality is the underlying reason of limiting the performance of state-of-the-art algorithms. To address this issue, we propose Progressive Adversarial Network (PAN) that is capable of coping with this difficulty for domain-specific image super-resolution. The key principle of PAN is that we do not apply any distance-based reconstruction errors as the loss to be optimized, thus free from the restriction of the curse of dimensionality. To maintain faithful reconstruction precision, we resort to U-Net and progressive growing of neural architecture. The low-level features in encoder can be transferred into decoder to enhance textural details with U-Net. Progressive growing enhances image resolution gradually, thereby preserving precision of recovered image. Moreover, to obtain high-fidelity outputs, we leverage the framework of the powerful StyleGAN to perform adversarial learning. Without the curse of dimensionality, our model can super-resolve large-size images with remarkable photo-realistic details and few distortions. Extensive experiments demonstrate the superiority of our algorithm over state-of-the-arts both quantitatively and qualitatively.

preprint2020arXiv

Privacy for All: Demystify Vulnerability Disparity of Differential Privacy against Membership Inference Attack

Machine learning algorithms, when applied to sensitive data, pose a potential threat to privacy. A growing body of prior work has demonstrated that membership inference attack (MIA) can disclose specific private information in the training data to an attacker. Meanwhile, the algorithmic fairness of machine learning has increasingly caught attention from both academia and industry. Algorithmic fairness ensures that the machine learning models do not discriminate a particular demographic group of individuals (e.g., black and female people). Given that MIA is indeed a learning model, it raises a serious concern if MIA ``fairly'' treats all groups of individuals equally. In other words, whether a particular group is more vulnerable against MIA than the other groups. This paper examines the algorithmic fairness issue in the context of MIA and its defenses. First, for fairness evaluation, it formalizes the notation of vulnerability disparity (VD) to quantify the difference of MIA treatment on different demographic groups. Second, it evaluates VD on four real-world datasets, and shows that VD indeed exists in these datasets. Third, it examines the impacts of differential privacy, as a defense mechanism of MIA, on VD. The results show that although DP brings significant change on VD, it cannot eliminate VD completely. Therefore, fourth, it designs a new mitigation algorithm named FAIRPICK to reduce VD. An extensive set of experimental results demonstrate that FAIRPICK can effectively reduce VD for both with and without the DP deployment.

preprint2020arXiv

Protocol for an Observational Study on the Effects of Social Distancing on Influenza-Like Illness and COVID-19

The novel coronavirus disease (COVID-19) is a highly contagious respiratory disease that was first detected in Wuhan, China in December 2019, and has since spread around the globe, claiming more than 69,000 lives by the time this protocol is written. It has been widely acknowledged that the most effective public policy to mitigate the pandemic is \emph{social and physical distancing}: keeping at least six feet away from people, working from home, closing non-essential businesses, etc. There have been a lot of anecdotal evidences suggesting that social distancing has a causal effect on disease mitigation; however, few studies have investigated the effect of social distancing on disease mitigation in a transparent and statistically-sound manner. We propose to perform an optimal non-bipartite matching to pair counties with similar observed covariates but vastly different average social distancing scores during the first week (March 16th through Match 22nd) of President's \emph{15 Days to Slow the Spread} campaign. We have produced a total of $302$ pairs of two U.S. counties with good covariate balance on a total of $16$ important variables. Our primary outcome will be the average observed illness collected by Kinsa Inc. two weeks after the intervention period. Although the observed illness does not directly measure COVID-19, it reflects a real-time aspect of the pandemic, and unlike confirmed cases, it is much less confounded by counties' testing capabilities. We also consider observed illness three weeks after the intervention period as a secondary outcome. We will test a proportional treatment effect using a randomization-based test with covariance adjustment and conduct a sensitivity analysis.

preprint2020arXiv

Sex Differences in Severity and Mortality Among Patients With COVID-19: Evidence from Pooled Literature Analysis and Insights from Integrated Bioinformatic Analysis

Objective: To conduct a meta-analysis of current studies that examined sex differences in severity and mortality in patients with COVID-19, and identify potential mechanisms underpinning these differences. Methods: We performed a systematic review to collate data from observational studies examining associations of sex differences with clinical outcomes of COVID-19. PubMed, Web of Science and four preprint servers were searched for relevant studies. Data were extracted and analyzed using meta-analysis where possible, with summary data presented otherwise. Publicly available bulk RNA sequencing (RNA-seq), single-cell RNA sequencing (scRNA-seq), and chromatin immunoprecipitation sequencing (ChIP-seq) data were analyzed to explore the potential mechanisms underlying the observed association. Results: 39 studies met inclusion criteria, representing 77932 patients, of which 41510 (53.3%) were males. Men were at a markedly increased risk of developing severe cases compared with women. Furthermore, the pooled odds ratio (OR) of mortality for male group compared with the female group indicated significant higher mortality rate for male. Data from scRNA-seq suggest that men have a higher amount of ACE2-expressing pulmonary alveolar type II cells than women. Sex-based immunological differences exist. The expression of androgen receptor (AR) is positively correlated with ACE2, and there is evidence that AR may directly regulate the expression of ACE2. Conclusions: This meta-analysis detected an increased severity and mortality rate in the male populations with COVID-19, which might be attributable to the sex-based differences in cellular compositions and immunological microenvironments of the lung. The host cell receptor ACE2 is likely regulated by AR signaling pathway, which is identified as a potential target for prevention and treatment of SARS-Cov-2 infections in men.

preprint2020arXiv

Short-term oscillation and falling dynamics for a water drop dripping in quiescent air

The short-term transient falling dynamics of a dripping water drop in quiescent air has been investigated through both simulation and experiment. The focus is on the short term behavior and the time range considered covers about eight dominant second-mode oscillations of the drop after it is formed. Due to the small fluid inertia the growth of the drop is quasi-static and is well captured by the static pendant drop theory. Nevertheless, the pinching dynamics and the resulting post-formation state of the drop trigger a nonlinear oscillation when the drop falls. The initial shape of the drop when it is just formed is decomposed into spherical harmonic modes. The pinching dynamics such as interface overturning introduces small-scale variation on the drop contour, which in turn contributes to the finite amplitudes of the higher-order modes. Furthermore, the initial kinetic energy when the droplet is just formed is as important as the initial surface energy contained in the drop shape, and is found to amplify the initial oscillation amplitude and to induce a phase shift in the oscillation of all the modes. By incorporating both the initial surface and kinetic energy, the linear model for a free drop oscillation yields very good predictions for the second and third modes. The mode amplitude spectra show both the primary frequencies that are consistent with the Lamb's theory and the secondary frequencies arising from different modes due to nonlinear inter-mode coupling. The complex transient flow inside and outside the drop is induced by the interaction between the falling motion and the nonlinear oscillation. The streamlines indicate that the internal flow is substantially different from the Hill vortex for a falling drop without oscillation. The temporal evolutions of both the internal flow and the wake morphology follow the dominant second oscillation mode.

preprint2020arXiv

The atomic gas of star-forming galaxies at z$\sim$0.05 as revealed by the Five-hundred-meter Aperture Spherical Radio Telescope

We report new HI observations of four z$\sim$0.05 star-forming galaxies undertaken during the commissioning phase of the Five-hundred-meter Aperture Spherical Radio Telescope (FAST). FAST is the largest single-dish telescope with a 500 meter aperture and a 19-Beam receiver. Exploiting the unprecedented sensitivity provided by FAST, we aim to study the atomic gas, via the HI 21cm emission line, in low-$z$ star-forming galaxies taken from the Valparaíso ALMA/APEX Line Emission Survey (VALES) project. Together with previous ALMA CO($J=1-0$) observations, the HI data provides crucial information to measure the gas mass and dynamics. As a pilot HI survey, we targeted four local star-forming galaxies at $z\sim0.05$. In particular, one of them has already been detected in HI by the Arecibo Legacy Fast ALFA survey (ALFALFA), allowing a careful comparison. We use an ON-OFF observing approach that allowed us to reach an rms of 0.7mJy/beam at a 1.7km/s velocity resolution within only 20 minutes ON-target integration time. We demonstrate the great capabilities of the FAST 19-beam receiver for pushing the detectability of the HI emission line of extra-galactic sources. The HI emission line detected by FAST shows good consistency with the previous ALFALFA results. Our observations are put in context with previous multi-wavelength data to reveal the physical properties of these low-$z$ galaxies. We find that the CO($J=1-0$) and HI emission line profiles are similar. The dynamical mass estimated from the HI data is an order of magnitude higher than the baryon mass and the dynamical mass derived from the CO observations, implying that the mass probed by dynamics of HI is dominated by the dark matter halo. In one case, a target shows an excess of CO($J=1-0$) in the line centre, which can be explained by an enhanced CO($J=1-0$) emission induced by a nuclear starburst showing high velocity dispersion.

preprint2020arXiv

The radio properties of the OH megamaser galaxy IRAS 02524+2046

We present results from VLBI observations of continuum and OH line emission in IRAS 02524+2046 and also arcsecond-scale radio properties of this galaxy using VLA archive data. We found that there is no significant detection of radio continuum emission from VLBI observations. The arcsecond-scale radio images of this source show no clear extended emission, the total radio flux density at L and C band are around 2.9 mJy and 1.0 mJy respectively, which indicate a steep radio spectral index between the two band. Steep spectral index, low brightness temperature and high $q$-ratio (the FIR to the radio flux density), which are three critical indicators in classification of radio activity in the nuclei of galaxies, are all consistent with the classification of this source as a starburst galaxy from its optical spectrum. The high-resolution line profile show that both of \textbf{the 1665 and 1667 MHz OH maser} line have been detected which show three and two clear components respectively. The channel maps show that the maser emission are distributed in a region $\sim$ 210 pc $\times$ 90 pc, the detected maser components at different region show similar double spectral feature, which might be an evidence that this galaxy is at a stage of major merger as seen from the optical morphology.

preprint2020arXiv

To Relieve Your Headache of Training an MRF, Take AdVIL

We propose a black-box algorithm called {\it Adversarial Variational Inference and Learning} (AdVIL) to perform inference and learning on a general Markov random field (MRF). AdVIL employs two variational distributions to approximately infer the latent variables and estimate the partition function of an MRF, respectively. The two variational distributions provide an estimate of the negative log-likelihood of the MRF as a minimax optimization problem, which is solved by stochastic gradient descent. AdVIL is proven convergent under certain conditions. On one hand, compared with contrastive divergence, AdVIL requires a minimal assumption about the model structure and can deal with a broader family of MRFs. On the other hand, compared with existing black-box methods, AdVIL provides a tighter estimate of the log partition function and achieves much better empirical results.

preprint2020arXiv

Triple Generative Adversarial Networks

We propose a unified game-theoretical framework to perform classification and conditional image generation given limited supervision. It is formulated as a three-player minimax game consisting of a generator, a classifier and a discriminator, and therefore is referred to as Triple Generative Adversarial Network (Triple-GAN). The generator and the classifier characterize the conditional distributions between images and labels to perform conditional generation and classification, respectively. The discriminator solely focuses on identifying fake image-label pairs. Under a nonparametric assumption, we prove the unique equilibrium of the game is that the distributions characterized by the generator and the classifier converge to the data distribution. As a byproduct of the three-player mechanism, Triple-GAN is flexible to incorporate different semi-supervised classifiers and GAN architectures. We evaluate Triple-GAN in two challenging settings, namely, semi-supervised learning and the extreme low data regime. In both settings, Triple-GAN can achieve excellent classification results and generate meaningful samples in a specific class simultaneously. In particular, using a commonly adopted 13-layer CNN classifier, Triple-GAN outperforms extensive semi-supervised learning methods substantially on more than 10 benchmarks no matter data augmentation is applied or not.

preprint2020arXiv

Understanding and Stabilizing GANs' Training Dynamics with Control Theory

Generative adversarial networks (GANs) are effective in generating realistic images but the training is often unstable. There are existing efforts that model the training dynamics of GANs in the parameter space but the analysis cannot directly motivate practically effective stabilizing methods. To this end, we present a conceptually novel perspective from control theory to directly model the dynamics of GANs in the function space and provide simple yet effective methods to stabilize GANs' training. We first analyze the training dynamic of a prototypical Dirac GAN and adopt the widely-used closed-loop control (CLC) to improve its stability. We then extend CLC to stabilize the training dynamic of normal GANs, where CLC is implemented as a squared $L2$ regularizer on the output of the discriminator. Empirical results show that our method can effectively stabilize the training and obtain state-of-the-art performance on data generation tasks.

preprint2019arXiv

Deriving the stellar labels of LAMOST spectra with Stellar LAbel Machine (SLAM)

The LAMOST survey has provided 9 million spectra in its Data Release 5 (DR5) at R$\sim$1800. Extracting precise stellar labels is crucial for such a large sample. In this paper, we report the implementation of the Stellar LAbel Machine (SLAM), which is a data-driven method based on Support Vector Regression (SVR), a robust non-linear regression technique. Thanks to the capability to model highly non-linear problems with SVR, SLAM generally can derive stellar labels over a wide range of spectral types. This gives it a unique capability compared to other popular data-driven methods. To illustrate this capability, we test the performance of SLAM on stars ranging from Teff$\sim$4000 to $\sim$8000 K trained on LAMOST spectra and stellar labels. At g-band signal-to-noise ratio (SNRg) higher than 100, the random uncertainties of Teff, logg and [Fe/H] are 50 K, 0.09 dex, and 0.07 dex, respectively. We then set up another SLAM model trained by APOGEE and LAMOST common stars to demonstrate its capability of dealing with high dimensional problems. The spectra are from LAMOST DR5 and the stellar labels of the training set are from APOGEE DR15, including Teff, logg, [M/H],[$α$/M], [C/M], and [N/M]. The cross-validated scatters at SNRg$\sim$100 are 49 K, 0.10 dex, 0.037 dex,0.026 dex, 0.058 dex, and 0.106 dex for these parameters, respectively. This performance is at the same level as other up-to-date data-driven models. As a byproduct, we also provide the latest catalog of $\sim$1 million LAMOST DR5 K giant stars with SLAM-predicted stellar labels in this work.

preprint2019arXiv

Exploring the spectral \textit{information content} in the LAMOST medium-resolution survey (MRS)

Low-resolution spectra are proved competitive to high-resolution spectra in determining many stellar labels at comparable precision. It is useful to consider the spectral information content when assessing the capability of a stellar spectrum in deriving precise stellar labels. In this work, we quantify the information content brought by the LAMOST-II medium-resolution spectroscopic survey (MRS) using the gradient spectra and the coefficients-of-dependence (CODs). In general, the wavelength coverage of the MRS well constrains the stellar labels but the sensitivities of different stellar labels vary with spectral types and metallicity of the stars of interest and, therefore, affect the performance of the stellar label determination from the MRS spectra. Applying the SLAM to the synthetic spectra which mimic the MRS data, we find the precision of the fundamental stellar parameters Teff, logg and [M/H] are better when combining both the blue and red bands of the MRS. This is especially important for warm stars since the H$α$ line located in the red part plays a more important role in determining the effective temperature for warm stars. With blue and red parts together, we are able to reach similar performance to the low-resolution spectra except for warm stars. However, at [M/H]$\sim-2.0$ dex, the uncertainties of fundamental stellar labels estimated from MRS are substantially larger than those from low-resolution spectra. We also tested the uncertainties of Teff, logg and [M/H] of from MRS data induced from the radial velocity mismatch and find that a mismatch of about 1 km s$^{-1}$, which is typical for LAMOST MRS data, would not significantly affect the stellar label estimates. At last, reference precision limits are calculated using synthetic gradient spectra, according to which we expect abundances of at least 17 elements to be measured precisely from MRS spectra.

preprint2019arXiv

Tracing Kinematic and Chemical Properties of Sagittarius Stream by K-Giants, M-Giants, and BHB stars

We characterize the kinematic and chemical properties of $\sim$3,000 Sagittarius (Sgr) stream stars, including K-giants, M-giants, and BHBs, select from SEGUE-2, LAMOST, and SDSS separately in Integrals-of-Motion space. The orbit of Sgr stream is quite clear from the velocity vector in $X$-$Z$ plane. Stars traced by K-giants and M-giants present the apogalacticon of trailing steam is $\sim$ 100 kpc. The metallicity distributions of Sgr K-, M-giants, and BHBs present that the M-giants are on average the most metal-rich population, followed by K-giants and BHBs. All of the K-, M-giants, and BHBs indicate that the trailing arm is on average more metal-rich than leading arm, and the K-giants show that the Sgr debris is the most metal-poor part. The $α$-abundance of Sgr stars exhibits a similar trend with the Galactic halo stars at lower metallicity ([Fe/H] $<\sim$ $-$1.0 dex), and then evolve down to lower [$α$/Fe] than disk stars at higher metallicity, which is close to the evolution pattern of $α$-element of Milky Way dwarf galaxies. We find $V_Y$ and metallicity of K-giants have gradients along the direction of line-of-sight from the Galactic center in $X$-$Z$ plane, and the K-giants show that $V_Y$ increases with metallicity at [Fe/H] $>\sim-$1.5 dex. After dividing the Sgr stream into bright and faint stream according to their locations in equatorial coordinate, the K-giants and BHBs show that the bright and faint stream present different $V_Y$ and metallicities, the bright stream is on average higher in $V_Y$ and metallicity than the faint stream.

Bo Zhang

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

114 published item(s)

AEGIS: A Holistic Benchmark for Evaluating Forensic Analysis of AI-Generated Academic Images

GeoBench: Rethinking Multimodal Geometric Problem-Solving via Hierarchical Evaluation

SCP: Accelerating Discovery with a Global Web of Autonomous Scientific Agents

An Event-Oriented Diffusion-Refinement Method for Sparse Events Completion

Outer-space branch-and-bound algorithm for generalized linear multiplicative programs

AI of Brain and Cognitive Sciences: From the Perspective of First Principles

Danlu Tongdu tablets treat lumbar spinal stenosis through reducing reactive oxygen species and apoptosis by regulating CDK2/CDK4/CDKN1A expression

DarkVision: A Benchmark for Low-light Image/Video Perception

Generalizing the intention-to-treat effect of an active control against placebo from historical placebo-controlled trials to an active-controlled trial: A case study of the efficacy of daily oral TDF/FTC in the HPTN 084 study

MobileVLM : A Fast, Strong and Open Vision Language Assistant for Mobile Devices

Towards simultaneous coherent radiation in the visible and microwave bands with doped molecular crystals

YOLOv6 v3.0: A Full-Scale Reloading

A new model for preferential attachment scheme with time-varying parameters

A new preferential model with homophily for recommender systems

A physical perturbation based study on the prediction of free-fall disks with chaotic modes in the water

A Semiparametric Approach to Model-based Sensitivity Analysis in Observational Studies

A VLBA Trigonometric Parallax for RR Aql and the Mira PL Relation

Adaptable Text Matching via Meta-Weight Regulator

Adversarial Texture for Fooling Person Detectors in the Physical World

Aspect-specific Context Modeling for Aspect-based Sentiment Analysis

Asymptotic Inference for Infinitely Imbalanced Logistic Regression

Blind Source Separation over Space

Bringing Old Films Back to Life

Contrastive Cross-domain Recommendation in Matching

Diagnosing Circumburst Environment with Multiband Gamma-Ray Burst Radio Afterglows

Diagnosis of ultrafast ultraintense laser pulse characteristics by machine-learning-assisted electron spin

Disentangled Inference for GANs with Latently Invertible Autoencoder

Enhanced quantum sensing with room-temperature solid-state masers

Estimating the Optimal Covariance with Imperfect Mean in Diffusion Probabilistic Models

Factor Modelling for Clustering High-dimensional Time Series

Fast Density Estimation for Density-based Clustering Methods

Fast Lossless Neural Compression with Integer-Only Discrete Flows

Guiding self-assembly of active colloids by temporal modulation of activity

Human-centric Image Cropping with Partition-aware and Content-preserving Features

Hyperuniform Active Chiral Fluids with Tunable Internal Structure

Joint Distribution Alignment via Adversarial Learning for Domain Adaptive Object Detection

LAMOST medium-resolution spectroscopic survey of binarity and exotic star (LAMOST-MRS-B): Observation strategy and target selection

Learning Cross-Image Object Semantic Relation in Transformer for Few-Shot Fine-Grained Image Classification

Li-rich Giants in LAMOST Survey. III. The statistical analysis of Li-rich giants

Machine learning for percolation utilizing auxiliary Ising variables

Mining Error Templates for Grammatical Error Correction

MuCGEC: a Multi-Reference Multi-Source Evaluation Dataset for Chinese Grammatical Error Correction

Multi-granularity Item-based Contrastive Recommendation

Neutron spectroscopy evidence for a possible magnetic-field-induced gapless quantum-spin-liquid phase in a Kitaev material $α$-RuCl$_3$

On the HI Content of MaNGA Major Merger Pairs

OPA: Object Placement Assessment Dataset

Pretraining is All You Need for Image-to-Image Translation

Radio properties of the OH megamaser galaxy IIZw 096

Real-Time Neural Character Rendering with Pose-Guided Multiplane Images

Robust PCA for High Dimensional Data based on Characteristic Transformation

Robust quantum control for the manipulation of solid-state spins

Some Reflections on Drawing Causal Inference using Textual Data: Parallels Between Human Subjects and Organized Texts

Spatial Transformation for Image Composition via Correspondence Learning

Statistical matching and subclassification with a continuous dose: characterization, algorithm, and application to a health outcomes study

StyleSwin: Transformer-based GAN for High-resolution Image Generation

Testing Biased Randomization Assumptions and Quantifying Imperfect Matching and Residual Confounding in Matched Observational Studies

The Eclipsing Binaries from the LAMOST Medium-resolution Survey.III. A High-precision Empirical Stellar Mass Library

The Properties and Evolutions of Starspots on Three Detached Eclipsing Binaries in the LAMOST-Kepler survey

The Role of Placebo Samples in Observational Studies

TransLog: A Unified Transformer-based Framework for Log Anomaly Detection

Uniqueness in inverse diffraction grating problems with infinitely many plane waves at a fixed frequency

Water Maser Survey towards off-plane O-rich AGBs around the orbital plane of the Sagittarius Stellar Stream

YOLOv6: A Single-Stage Object Detection Framework for Industrial Applications

AutoKWS: Keyword Spotting with Differentiable Architecture Search

Convergence of the uniaxial PML method for time-domain electromagnetic scattering problems

DARTS-: Robustly Stepping out of Performance Collapse Without Indicators

Data completion algorithms and their applications in inverse acoustic scattering with limited-aperture backscattering data

Deep Sketch-guided Cartoon Video Inbetweening

Efficient Compressed Sensing Based Image Coding by Using Gray Transformation

LAMOST Time-Domain Survey: First Results of four $K$2 plates

LTD064402+245919: A Subgiant with a 1-3 M$_{\odot}$ Undetected Companion Identified from LAMOST-TD Data

Polar state memory in active fluids

Understanding and Stabilizing GANs' Training Dynamics with Control Theory