Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
51works
0followers
31topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

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

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

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.

Published work

51 published item(s)

preprint2026arXiv

Belief-Guided Inference Control for Large Language Model Services via Verifiable Observations

In black-box large language model (LLM) services, response reliability is often only partially observable at decision time, while stronger inference pathways incur substantial computational cost, inducing a budgeted sequential decision problem: for each request, the system should decide whether the default low-cost response is sufficiently reliable or whether additional computation should be allocated to improve response quality. In this paper, we propose \textbf{Ver}ifiable \textbf{O}bservations for Risk-aware \textbf{I}nference \textbf{C}ontrol (\textsc{Veroic}), a framework for adaptive inference control in black-box LLM settings, which formulates request-time control as a \textit{partially observable Markov decision process} to capture partial observability and sequential budget coupling. It constructs a lightweight verifiable observation channel from the input-output pair by aggregating heterogeneous quality signals into a belief state over latent response reliability, which is then used by a budget-aware policy to decide whether to return the default output or trigger a higher-cost inference pathway. Experiments on diverse tasks show that \textsc{Veroic} achieves improved quality-cost trade-offs, stronger risk estimation and calibration, and more robust long-horizon inference control than competitive baselines.

preprint2026arXiv

ClimateIQA: A New Dataset and Benchmark to Advance Vision-Language Models in Meteorology Anomalies Analysis

Meteorological heatmaps play a vital role in deciphering extreme weather phenomena, yet their inherent complexities marked by irregular contours, unstructured patterns, and complex color variations present unique analytical hurdles for state-of-the-art Vision-Language Models (VLMs). Current state-of-the-art models like GPT-4o, Qwen-VL, and LLaVA 1.6 struggle with tasks such as precise color identification and spatial localization, resulting in inaccurate or incomplete interpretations. To address these challenges, we introduce Sparse Position and Outline Tracking (SPOT), a novel algorithm specifically designed to process irregularly shaped colored regions in visual data. SPOT identifies and localizes these regions by extracting their spatial coordinates, enabling structured representations of irregular shapes. Building on SPOT, we construct ClimateIQA, a novel meteorological visual question answering (VQA) dataset, comprising 26,280 high-resolution heatmaps and 762,120 instruction samples for wind gust, total precipitation, wind chill index and heat index analysis. ClimateIQA enhances VLM training by incorporating spatial cues, geographic metadata, and reanalysis data, improving model accuracy in interpreting and describing extreme weather features. Furthermore, we develop Climate-Zoo, a suite of fine-tuned VLMs based on SPOT-empowered ClimateIQA, which significantly outperforms existing models in meteorological heatmap tasks.

preprint2026arXiv

Compliance-to-Code: Enhancing Financial Compliance Checking via Code Generation

Nowadays, regulatory compliance has become a cornerstone of corporate governance, ensuring adherence to systematic legal frameworks. At its core, financial regulations often comprise highly intricate provisions, layered logical structures, and numerous exceptions, which inevitably result in labor-intensive or comprehension challenges. To mitigate this, recent Regulatory Technology (RegTech) and Large Language Models (LLMs) have gained significant attention in automating the conversion of regulatory text into executable compliance logic. However, their performance remains suboptimal particularly when applied to Chinese-language financial regulations, due to three key limitations: (1) incomplete domain-specific knowledge representation, (2) insufficient hierarchical reasoning capabilities, and (3) failure to maintain temporal and logical coherence. One promising solution is to develop a domain specific and code-oriented datasets for model training. Existing datasets such as LexGLUE, LegalBench, and CODE-ACCORD are often English-focused, domain-mismatched, or lack fine-grained granularity for compliance code generation. To fill these gaps, we present Compliance-to-Code, the first large-scale Chinese dataset dedicated to financial regulatory compliance. Covering 1,159 annotated clauses from 361 regulations across ten categories, each clause is modularly structured with four logical elements-subject, condition, constraint, and contextual information-along with regulation relations. We provide deterministic Python code mappings, detailed code reasoning, and code explanations to facilitate automated auditing. To demonstrate utility, we present FinCheck: a pipeline for regulation structuring, code generation, and report generation.

preprint2026arXiv

DeKeyNLU: Enhancing Natural Language to SQL Generation through Task Decomposition and Keyword Extraction

Natural Language to SQL (NL2SQL) provides a new model-centric paradigm that simplifies database access for non-technical users by converting natural language queries into SQL commands. Recent advancements, particularly those integrating Retrieval-Augmented Generation (RAG) and Chain-of-Thought (CoT) reasoning, have made significant strides in enhancing NL2SQL performance. However, challenges such as inaccurate task decomposition and keyword extraction by LLMs remain major bottlenecks, often leading to errors in SQL generation. While existing datasets aim to mitigate these issues by fine-tuning models, they struggle with over-fragmentation of tasks and lack of domain-specific keyword annotations, limiting their effectiveness. To address these limitations, we present DeKeyNLU, a novel dataset which contains 1,500 meticulously annotated QA pairs aimed at refining task decomposition and enhancing keyword extraction precision for the RAG pipeline. Fine-tuned with DeKeyNLU, we propose DeKeySQL, a RAG-based NL2SQL pipeline that employs three distinct modules for user question understanding, entity retrieval, and generation to improve SQL generation accuracy. We benchmarked multiple model configurations within DeKeySQL RAG pipeline. Experimental results demonstrate that fine-tuning with DeKeyNLU significantly improves SQL generation accuracy on both BIRD (62.31% to 69.10%) and Spider (84.2% to 88.7%) dev datasets.

preprint2026arXiv

Echo-α: Large Agentic Multimodal Reasoning Model for Ultrasound Interpretation

Ultrasound interpretation requires both precise lesion localization and holistic clinical reasoning, yet existing methods typically excel at only one of these capabilities: specialized detectors offer strong localization but limited reasoning, whereas multimodal large language models (MLLMs) provide flexible reasoning but weak grounding in specialized medical domains. We present Echo-α, an agentic multimodal reasoning model for ultrasound interpretation that unifies these strengths within an invoke-and-reason framework. Echo-α is trained to coordinate organ-specific detector outputs, integrate them with global visual context, and convert the resulting evidence into grounded diagnostic decisions beyond detector-only inference. This behavior is established through a nine-task supervised curriculum and then refined by sequential reinforcement learning under different reward trade-offs, yielding Echo-α-Grounding for lesion anchoring and Echo-α-Diagnosis for final diagnosis. On multi-center renal and breast ultrasound benchmarks, Echo-α outperforms competitive baselines on both grounding and diagnosis. In particular, on cross-center test sets, Echo-α-Grounding attains 56.73%/43.78% F1@0.5 and Echo- α-Diagnosis reaches 74.90%/49.20% overall accuracy on renal/breast ultrasound. These results suggest that agentic multimodal reasoning can turn specialized detectors into verifiable clinical evidence, offering a practical route toward ultrasound AI systems that are more accurate, interpretable, and transferable. The repository is at https://github.com/MiliLab/Echo-Alpha.

preprint2026arXiv

FastFLUX: Pruning FLUX with Block-wise Replacement and Sandwich Training

Recent advancements in text-to-image (T2I) generation have led to the emergence of highly expressive models such as diffusion transformers (DiTs), exemplified by FLUX. However, their massive parameter sizes lead to slow inference, high memory usage, and poor deployability. Existing acceleration methods (e.g., single-step distillation and attention pruning) often suffer from significant performance degradation and incur substantial training costs. To address these limitations, we propose FastFLUX, an architecture-level pruning framework designed to enhance the inference efficiency of FLUX. At its core is the Block-wise Replacement with Linear Layers (BRLL) method, which replaces structurally complex residual branches in ResBlocks with lightweight linear layers while preserving the original shortcut connections for stability. Furthermore, we introduce Sandwich Training (ST), a localized fine-tuning strategy that leverages LoRA to supervise neighboring blocks, mitigating performance drops caused by structural replacement. Experiments show that our FastFLUX maintains high image quality under both qualitative and quantitative evaluations, while significantly improving inference speed, even with 20\% of the hierarchy pruned. Our code will be available soon.

preprint2026arXiv

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective

In this paper, we develop a unified majorization-minimization scheme and convergence analysis with first-order surrogate functions for unconstrained vector optimization problems (VOPs). By selecting different surrogate functions, the unified method can be reduced to various existing first-order methods. The unified convergence analysis reveals that the slow convergence of the steepest descent method is primarily attributed to the significant gap between the surrogate and objective functions. Consequently, narrowing this surrogate gap can enhance the performance of first-order methods for VOPs. To strike a better trade-off in terms of surrogate gap and per-iteration cost, we reformulate the direction-finding subproblem and elucidate that selecting a tighter surrogate function is equivalent to using an appropriate base of the dual cone in the direction-finding subproblem. Building on this insight, we employ the Barzilai-Borwein method to narrow the surrogate gap and propose a Barzilai-Borwein descent method for VOPs (BBDVO) with polyhedral cones. By reformulating the corresponding subproblem, we provide a novel perspective on the Barzilai-Borwein descent method, bridging the gap between this method and the steepest descent method. Finally, several numerical experiments are presented to validate the efficiency of the BBDVO.

preprint2026arXiv

InsHuman: Towards Natural and Identity-Preserving Human Insertion

Human insertion aims to naturally place specific individuals into a target background. Although existing image editing models may have such ability, they often produce failure cases, including inappropriate human pose in new background, inconsistent number of people, and modified facial identity. Moreover, publicly available human datasets often lack full-body portraits and realistic physical interaction between humans and their background. To address these challenges, we propose InsHuman for natural and identity-preserving human insertion. Specifically, we propose Human-Background Adaptive Fusion (HBAF), which detects foreground humans to obtain a binary mask and applies region-aware weighting to align the human regions between predicted and ground-truth latents, ensuring the person's pose, count, and overall appearance are coherently adapted to the target background.We further propose Face-to-Face ID-Preserving (FFIP), which detects and matches faces between the generated image and the source image in terms of face recognition features to enforce identity consistency for each face.In addition, we propose Bidirectional Data Pairing (BDP) strategy to construct BDP-InsHuman, a high-quality dataset with realistic human-background interactions. Experiments demonstrate that InsHuman achieves significant improvements in generating plausible images while keeping human identity unchanged.

preprint2026arXiv

OpenEM: Large-scale multi-structural 3D datasets for electromagnetic methods

Electromagnetic methods have become one of the most widely used techniques in geological exploration. With the remarkable success of deep learning, applying such techniques to EM methods has emerged as a promising research direction to overcome the limitations of conventional approaches. The effectiveness of deep learning methods depends heavily on the quality of datasets, which directly influences model performance and generalization ability. Existing application studies often construct datasets from random one-dimensional or structurally simple three-dimensional models, which fail to represent the real geological environments. Furthermore, the absence of standardized, publicly 3D geoelectric datasets continues to hinder progress in deep learning based EM exploration. To address these limitations, we present OpenEM, a large-scale, multi-structural three-dimensional geoelectric dataset that encompasses a broad range of geologically plausible subsurface structures. OpenEM consists of nine categories of geoelectric models, spanning from simple configurations with anomalous bodies in half-space to more complex structures such as flat layers, folded layers, flat faults, curved faults, and their corresponding variants with anomalous bodies. Since three-dimensional forward modeling in electromagnetics is extremely time-consuming, we further developed a deep learning based fast forward modeling approach for OpenEM, enabling efficient and reliable forward modeling across the entire dataset. This capability allows OpenEM to be rapidly deployed for a wide range of tasks. OpenEM provides a unified, comprehensive, and large-scale dataset for common EM exploration systems to accelerate the application of deep learning in electromagnetic methods.The complete dataset is publicly available at https://doi.org/10.5281/zenodo.17141981.

preprint2023arXiv

STARS-ISAC: How Many Sensors Do We Need?

A simultaneously transmitting and reflecting surface (STARS) enabled integrated sensing and communications (ISAC) framework is proposed, where a novel bi-directional sensing-STARS architecture is devised to facilitate the full-space communication and sensing. Based on the proposed framework, a joint optimization problem is formulated, where the Cramer-Rao bound (CRB) for estimating the 2-dimension direction-of-arrival of the sensing target is minimized. Two cases are considered for sensing performance enhancement. 1) For the two-user case, an alternating optimization algorithm is proposed. In particular, the maximum number of deployable sensors is obtained in the closed-form expressions. 2) For the multi-user case, an extended CRB (ECRB) metric is proposed to characterize the impact of the number of sensors on the sensing performance. Based on the proposed metric, a novel penalty-based double-loop (PDL) algorithm is proposed to solve the ECRB minimization problem. To tackle the coupling of the ECRB, a general decoupling approach is proposed to convert it to a tractable weighted linear summation form. Simulation results reveal that 1) the proposed PDL algorithm can achieve a near-optimal performance with consideration of sensor deployment; 2) without violating the communication under the quality of service requirements, reducing the receive antennas at the BS does not deteriorate the sensing performance; and 3) it is preferable to deploy more passive elements than sensors in terms of achieving optimal sensing performance

preprint2023arXiv

Timed Model-Based Mutation Operators for Simulink Models

Model-based mutation analysis is a recent research area, and real-time system testing can benefit from using model mutants. Model-based mutation testing (MBMT) is a particular branch of model-based testing. It generates faulty versions of a model using mutation operators to evaluate and improve test cases. Mutation testing is an effective way to ensure software correctness and has been applied to various application areas. Simulink is a vital modeling language for real-time systems. This paper introduces Simulink model mutation analysis to improve Model-in-the-loop (MIL) testing. We propose a set of Simulink mutation operators based on AUTOSAR, which reflects the temporal correctness when a Simulink model is mapped to Operating System tasks. We implement a mutation framework that generates mutants for implicit clock Simulink models. Finally, we demonstrate how this framework generates mutants to reveal task interference issues in the simulation. Our work integrates the Simulink model with the timed systems to better support mutation testing automation.

preprint2022arXiv

A Barzilai-Borwein Descent Method for Multiobjective Optimization Problems

The steepest descent method proposed by Fliege et al. motivates the research on descent methods for multiobjective optimization, which has received increasing attention in recent years. However, empirical results show that the Armijo line search often gives a very small stepsize along the steepest direction, which decelerates the convergence seriously. This paper points out that the issue is mainly due to the imbalances among objective functions. To address this issue, we propose a Barzilai-Borwein descent method for multiobjective optimization (BBDMO) that dynamically tunes gradient magnitudes using Barzilai-Borwein's rule in direction-finding subproblem. With monotone and nonmonotone line search techniques, it is proved that accumulation points generated by BBDMO are Pareto critical points, respectively. Furthermore, theoretical results indicate the Armijo line search can achieve a better stepsize in BBDMO. Finally, comparative results of numerical experiments are reported to illustrate the efficiency of BBDMO and verify the theoretical results.

preprint2022arXiv

Caching and Computation Offloading in High Altitude Platform Station (HAPS) Assisted Intelligent Transportation Systems

Edge intelligence, a new paradigm to accelerate artificial intelligence (AI) applications by leveraging computing resources on the network edge, can be used to improve intelligent transportation systems (ITS). However, due to physical limitations and energy-supply constraints, the computing powers of edge equipment are usually limited. High altitude platform station (HAPS) computing can be considered as a promising extension of edge computing. HAPS is deployed in the stratosphere to provide wide coverage and strong computational capabilities. It is suitable to coordinate terrestrial resources and store the fundamental data associated with ITS-based applications. In this work, three computing layers,i.e., vehicles, terrestrial network edges, and HAPS, are integrated to build a computation framework for ITS, where the HAPS data library stores the fundamental data needed for the applications. In addition, the caching technique is introduced for network edges to store some of the fundamental data from the HAPS so that large propagation delays can be reduced. We aim to minimize the delay of the system by optimizing computation offloading and caching decisions as well as bandwidth and computing resource allocations. The simulation results highlight the benefits of HAPS computing for mitigating delays and the significance of caching at network edges.

preprint2022arXiv

Charge transport in monolayers of metal nanoparticles

Two-dimensional (2D) nanoparticle films are a new class of materials with interesting physical properties and applications ranging from nanoelectronics to sensing and photonics. The importance of conducting nanoparticle films makes the fundamental understanding of their charge transport extremely important for materials and process design. Various hopping and transport mechanisms have been proposed and the nanoparticle monolayer is consistent with the electrical equivalent RC circuit, but their theoretical methods are limited to the model of the single electron tunneling between capacitively coupled nanoparticles with a characteristic time constant RC and the conductivity of thin film is the experimental conductivity, which cannot be deduced from these theoretical models. It is also unclear that how the specific process of electron transpot is affected by temperature. So, nowadays the electron dynamics of thin film cannot be understood fundamentally. Here, we develop an analytical theory based on the model of Sommerfeld, backed up by Monte-Carlo simulations, that predicts the process of charge transport and the effect of temperature on the electron transport in the thin film. In this paper two different nanoparticle models were built to cope with different types of morphology: triangular array and rectangular array. The transport properties of these different kinds of arrays including 2D ordered nanoparticle arrays with/without local structural disorder and 2D gradient nanoparticle arrays were investigated at different temperatures. For 2D well-ordered nanoparticle array without local structural disorder, the I-V curves are non-linear and highly symmetric.

preprint2022arXiv

Convergence rates analysis of Interior Bregman Gradient Method for Vector Optimization Problems

In recent years, by using Bregman distance, the Lipschitz gradient continuity and strong convexity were lifted and replaced by relative smoothness and relative strong convexity. Under the mild assumptions, it was proved that gradient methods with Bregman regularity converge linearly for single-objective optimization problems (SOPs). In this paper, we extend the relative smoothness and relative strong convexity to vector-valued functions and analyze the convergence of an interior Bregman gradient method for vector optimization problems (VOPs). Specifically, the global convergence rates are $\mathcal{O}(\frac{1}{k})$ and $\mathcal{O}(r^{k})(0<r<1)$ for convex and relative strongly convex VOPs, respectively. Moreover, the proposed method converges linearly for VOPs that satisfy a vector Bregman-PL inequality.

preprint2022arXiv

Electron heating in a current-driven turbulence as a result of nonlinear interaction of electron- and ion-acoustic waves

We study electron heating in collisionless current-driven turbulence due to the nonlinear interactions between electron- and ion-acoustic waves. PIC simulation results show that due to a large difference between the electron and ion mean velocities the Buneman instability excites large-amplitude ion-acoustic waves, which strongly modifies the electron velocity distribution function, leading to a secondary instability that generates fast electron-acoustic waves; and in this process, a giant electron hole is ultimately created. This giant electron hole is responsible for strong electron heating due to phase mixing. The numerical simulation results are consistent with the previous observations and provide insight into the key processes responsible for electron heating and the generation of nonlinear waves in a collisionless current-driven instability.

preprint2022arXiv

Electron transport in the single-layer semiconductor

Two-dimensional (2D) materials are a new class of materials with interesting physical properties and applications ranging from nanoelectronics to sensing and photonics. In addition to graphene, the most studied 2D material, monolayers of other layered materials such as semiconducting dichalcogenides MoS2 or WSe2 are gaining in importance as promising channel materials for field-effect transistors (FETs) and phototransistors. However, it is unclear that how the specific process of electron transport is affected by temperature. So, nowadays the electron dynamics of single-layer semiconductor cannot be understood fundamentally. Here, we develop an analytical theory distinguishing from traditional energy band theory, backed up by Monte-Carlo simulations, that predicts the process of electron transport and the effect of temperature on the electron transport in the single-layer semiconductor. In this paper, A new model is built to deal with electron transporting in the sing-layer semiconductor. The resistance is decided by the barrier rather than the electron scattering in the single-layer semiconductor, which is macroscopic quantum effect. Electron transport in FETs with different dielectric configurations are investigated at different temperatures and a new control factor that is decided by top-gate voltage or bottom-gate voltage is introduced to describe the effect of gate voltage on the electron transport in 2D semiconductor. The results of simulation show the drain current is mainly determined by some elements, such as temperature, top-gate voltage, bottom-gate voltage and source-drain voltage.

preprint2022arXiv

Evaluating Alternative Glyph Design for Showing Large-Magnitude-Range Quantum Spins

We present experimental results to explore a form of bivariate glyphs for representing large-magnitude-range vectors. The glyphs meet two conditions: (1) two visual dimensions are separable; and (2) one of the two visual dimensions uses a categorical representation (e.g., a categorical colormap). We evaluate how much these two conditions determine the bivariate glyphs&#39; effectiveness. The first experiment asks participants to perform three local tasks requiring reading no more than two glyphs. The second experiment scales up the search space in global tasks when participants must look at the entire scene of hundreds of vector glyphs to get an answer. Our results support that the first condition is necessary for local tasks when a few items are compared. But it is not enough to understand a large amount of data. The second condition is necessary for perceiving global structures of examining very complex datasets. Participants&#39; comments reveal that the categorical features in the bivariate glyphs trigger emergent optimal viewers&#39; behaviors. This work contributes to perceptually accurate glyph representations for revealing patterns from large scientific results. We release source code, quantum physics data, training documents, participants&#39; answers, and statistical analyses for reproducible science https://osf.io/4xcf5/?view_only=94123139df9c4ac984a1e0df811cd580.

preprint2022arXiv

Fano Interference in a Single-Molecule Junction

Trends of miniaturized devices and quantum interference electronics lead to the long desire of Fano interference in single-molecule junctions, here, which is successfully demonstrated using the 2,7-di(4-pyridyl)-9,9&#39;-spirobifluorene molecule with a long backbone group and a short side group. Experimentally, the two electrically coupled groups are found to contribute to two blurred degenerate points in the differential conductance mapping. This forms a characteristic non-centrosymmetric double-crossing feature, with distinct temperature response for each crossing. Theoretically, we describe the practical in-junction electron transmission using a new two-tunnelling-channel coupling model and obtain a working formula with a Fano term and a Breit-Wigner term. The formula is shown to provide a good fit for all the mapping data and their temperature dependence in three dimensions, identifying the Fano component. Our work thus forms a complete set of evidence of the Fano interference in a single-molecule junction induced by two-tunnelling-channel coupling transport. Density functional theory calculations are used to corroborate this new physics.

preprint2022arXiv

Giant viscoelasticity near Mott criticality in PbCrO3 with large lattice anomalies

Coupling of charge and lattice degrees of freedom in materials can produce intriguing electronic phenomena, such as conventional superconductivity where the electrons are mediated by lattice for creating supercurrent. The Mott transition, which is a source for many fascinating emergent behaviors, is originally thought to be driven solely by correlated electrons with an Ising criticality. Recent studies on the known Mott systems have shown that the lattice degree of freedom is also at play, giving rise to either Landau or unconventional criticality. However, the underlying coupling mechanism of charge and lattice degrees of freedom around the Mott critical endpoint remains elusive, leading to difficulties in understanding the associated Mott physics. Here we report a study of Mott transition in cubic PbCrO3 by measuring the lattice parameter, using high-pressure x-ray diffraction techniques. The Mott criticality in this material is revealed with large lattice anomalies, which is governed by giant viscoelasticity that presumably results from a combination of lattice elasticity and electron viscosity. Because of the viscoelastic effect, the lattice of this material behaves peculiarly near the critical endpoint, inconsistent with any existing university classes. We argue that the viscoelasticity may play as a hidden degree of freedom behind the Mott criticality.

preprint2022arXiv

Improving Fine-tuning of Self-supervised Models with Contrastive Initialization

Self-supervised learning (SSL) has achieved remarkable performance in pretraining the models that can be further used in downstream tasks via fine-tuning. However, these self-supervised models may not capture meaningful semantic information since the images belonging to the same class are always regarded as negative pairs in the contrastive loss. Consequently, the images of the same class are often located far away from each other in learned feature space, which would inevitably hamper the fine-tuning process. To address this issue, we seek to provide a better initialization for the self-supervised models by enhancing the semantic information. To this end, we propose a Contrastive Initialization (COIN) method that breaks the standard fine-tuning pipeline by introducing an extra initialization stage before fine-tuning. Extensive experiments show that, with the enriched semantics, our COIN significantly outperforms existing methods without introducing extra training cost and sets new state-of-the-arts on multiple downstream tasks.

preprint2022arXiv

New Massive Contact Twin Binary in a Radio-quiet HII Region Associated with the M17 Complex

Early-B stars may create an HII region that appears as radio-quiet. We report the identification of new early-B stars associated with the radio-quiet HII region G014.645--00.606 in the M17 complex. The ratio-quiet HII region G014.645--00.606 is adjacent to three radio-quiet WISE HII region candidates. The ionizing sources of the radio-quiet HII regions are expected to later than B1V, given the sensitivity about 1-2 mJy of the MAGPIS 20 cm survey. The stars were first selected if their parallaxes of GAIA EDR3 match that of the 22 GHz H$_2$O maser source within the same region. We used the color-magnitude diagram made from the ZTF photometric catalog to select the candidates for massive stars because the intrinsic $g-r$ colors of massive stars change little from B-type to O-type stars. Five stars lie in the areas of the color-magnitude diagram where either reddened massive stars or evolved post-main sequence stars of lower masses are commonly found. Three of the five stars, sources 1, 2, and 3, are located at the cavities of the three IR bubbles, and extended H$α$ emission is detected around the three IR bubbles. We suggest that sources 1, 2, and 3 are candidates for early-B stars associated with the radio-quiet region G014.645--00.606. Particularly, source 1 is an EW type eclipsing binary with a short period of 0.825 day, while source 2 is an EA type eclipsing binary with a short period of 0.919 day. The physical parameters of the two binary systems have been derived through the PHOEBE model. Source 1 is a twin binary of two stars with T~23,500 K, and source 2 contains a hotter component (T~20,100 K) and a cooler one (T~15,500 K). The $O-C$ values of source 1 show a trend of decline, implying that the period of the source is deceasing. Source 1 is likely a contacting early-B twin binary, for which mass transfer might cause its orbit to shrink.

preprint2022arXiv

On the Ohmic-dominant heating mode of capacitively-coupled plasma inverted by boundary electron emission

Electron emission from the boundary is ubiquitous in capacitively coupled plasma (CCP) and precipitates nonnegligible influences on the discharge properties. Here we present the PIC-MCC simulation of an Ohmic-dominant heating mode of capacitively coupled plasma where the stochastic heating vanishes and only Ohmic heating sustains the discharge, due to sheath inversion by boundary electron emission. The inverted CCP features negative sheath potential without Bohm presheath, hence excluding plasma heating due to sheath edge oscillation. The particle and energy transport of the proposed heating mode is analyzed. The influences of boundary electron emission flux, source voltage, and neutral pressure on the transition between classic and Ohmic-dominant CCP heating modes are shown with designated simulation scans. A modified inverse sheath-plasma coupling due to excessive ionization is discovered. In the end, key indicators of the proposed heating mode in plasma diagnostics are provided for future experimental verifications.

preprint2022arXiv

Security Enhancement for Coupled Phase-Shift STAR-RIS Networks

The secure transmission of the simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided communication system is investigated. Considering the coupled phase shifts of STAR-RISs and the fair secrecy requirement of users, a novel secure beamforming design is proposed for addressing the unique full-space mutual eavesdropping of STAR-RIS aided communication. In particular, a penalty based secrecy beamforming algorithm is developed to solve the resulting non-convex optimization problem, where the closed-form solutions of the coupled transmission/reflection coefficients are obtained in each iteration. Numerical results demonstrate that 1) the proposed scheme achieves higher secrecy capacity than conventional RIS; 2) 4-bit discrete phase shifters are sufficient for secrecy guarantee.

preprint2022arXiv

Variable Metric Method for Unconstrained Multiobjective Optimization Problems

In this paper, we propose a variable metric method for unconstrained multiobjective optimization problems (MOPs). First, a sequence of points is generated using different positive definite matrices in the generic framework. It is proved that accumulation points of the sequence are Pareto critical points. Then, without convexity assumption, strong convergence is established for the proposed method. Moreover, we use a common matrix to approximate the Hessian matrices of all objective functions, along which, a new nonmonotone line search technique is proposed to achieve a local superlinear convergence rate. Finally, several numerical results demonstrate the effectiveness of the proposed method.

preprint2021arXiv

$L^2$ extension of $\bar\partial$-closed forms on weakly pseudoconvex Kähler manifolds

Combining V. Koziarz&#39;s observation about the regularity of some modified section related to the initial extension with J. McNeal--D. Varolin&#39;s regularity argument, we generalize two theorems of McNeal--Varolin for the $L^2$ extension of $\bar\partial$-closed high-degree forms on a Stein manifold to the weakly pseudoconvex Kähler case under mixed positivity conditions.

preprint2021arXiv

Document Domain Randomization for Deep Learning Document Layout Extraction

We present document domain randomization (DDR), the first successful transfer of convolutional neural networks (CNNs) trained only on graphically rendered pseudo-paper pages to real-world document segmentation. DDR renders pseudo-document pages by modeling randomized textual and non-textual contents of interest, with user-defined layout and font styles to support joint learning of fine-grained classes. We demonstrate competitive results using our DDR approach to extract nine document classes from the benchmark CS-150 and papers published in two domains, namely annual meetings of Association for Computational Linguistics (ACL) and IEEE Visualization (VIS). We compare DDR to conditions of style mismatch, fewer or more noisy samples that are more easily obtained in the real world. We show that high-fidelity semantic information is not necessary to label semantic classes but style mismatch between train and test can lower model accuracy. Using smaller training samples had a slightly detrimental effect. Finally, network models still achieved high test accuracy when correct labels are diluted towards confusing labels; this behavior hold across several classes.

preprint2021arXiv

Experimental demonstration of cylindrical vector spatiotemporal optical vortex

We experimentally generate cylindrically polarized wavepackets with transverse orbital angular momentum, demonstrating the coexistence of spatiotemporal optical vortex with spatial polarization singularity. The results in this paper extend the study of spatiotemporal wavepackets to a broader scope, paving the way for its applications in various areas such as light-matter interaction, optical tweezers, spatiotemporal spin-orbit angular momentum coupling, etc.

preprint2021arXiv

Pareto-Frontier-aware Neural Architecture Generation for Diverse Budgets

Designing feasible and effective architectures under diverse computation budgets incurred by different applications/devices is essential for deploying deep models in practice. Existing methods often perform an independent architecture search for each target budget, which is very inefficient yet unnecessary. Moreover, the repeated independent search manner would inevitably ignore the common knowledge among different search processes and hamper the search performance. To address these issues, we seek to train a general architecture generator that automatically produces effective architectures for an arbitrary budget merely via model inference. To this end, we propose a Pareto-Frontier-aware Neural Architecture Generator (NAG) which takes an arbitrary budget as input and produces the Pareto optimal architecture for the target budget. We train NAG by learning the Pareto frontier (i.e., the set of Pareto optimal architectures) over model performance and computational cost (e.g., latency). Extensive experiments on three platforms (i.e., mobile, CPU, and GPU) show the superiority of the proposed method over existing NAS methods.

preprint2021arXiv

Photonic toroidal vortex

Toroidal vortices are whirling disturbances rotating about a ring-shaped core while advancing in the direction normal to the ring orifice. Toroidal vortices are commonly found in nature and being studied in a wide range of disciplines. Here we report the experimental observation of photonic toroidal vortex as a new solution to Maxwell&#39;s equations with the use of conformal mapping. The helical phase twists around a closed loop leading to an azimuthal local orbital angular momentum density. The preparation of such intriguing light field may offer insights of extending toroidal vortex to other disciplines and find important applications in light-matter interaction, optical manipulation, photonic symmetry and topology, and quantum information.

preprint2021arXiv

Towards Accurate and Compact Architectures via Neural Architecture Transformer

Designing effective architectures is one of the key factors behind the success of deep neural networks. Existing deep architectures are either manually designed or automatically searched by some Neural Architecture Search (NAS) methods. However, even a well-designed/searched architecture may still contain many nonsignificant or redundant modules/operations. Thus, it is necessary to optimize the operations inside an architecture to improve the performance without introducing extra computational cost. To this end, we have proposed a Neural Architecture Transformer (NAT) method which casts the optimization problem into a Markov Decision Process (MDP) and seeks to replace the redundant operations with more efficient operations, such as skip or null connection. Note that NAT only considers a small number of possible transitions and thus comes with a limited search/transition space. As a result, such a small search space may hamper the performance of architecture optimization. To address this issue, we propose a Neural Architecture Transformer++ (NAT++) method which further enlarges the set of candidate transitions to improve the performance of architecture optimization. Specifically, we present a two-level transition rule to obtain valid transitions, i.e., allowing operations to have more efficient types (e.g., convolution->separable convolution) or smaller kernel sizes (e.g., 5x5->3x3). Note that different operations may have different valid transitions. We further propose a Binary-Masked Softmax (BMSoftmax) layer to omit the possible invalid transitions. Extensive experiments on several benchmark datasets show that the transformed architecture significantly outperforms both its original counterpart and the architectures optimized by existing methods.

preprint2020arXiv

A Gd@C82-based single molecular electret device with switchable electrical polarization

Single molecular electrets exhibiting single molecule electric polarization switching have been long desired as a platform for extremely small non-volatile storage devices, although it is controversial because of the poor stability of single molecular electric dipoles. Here we study the single molecular device of GdC82, where the encapsulated Gd atom forms a charge center, and we have observed a gate controlled switching behavior between two sets of single electron transport stability diagrams. The switching is operated in a hysteresis loop with a coercive gate field of around 0.5Vnm. Theoretical calculations have assigned the two conductance diagrams to corresponding energy levels of two states that the Gd atom is trapped at two different sites of the C82 cage, which possess two different permanent electrical dipole orientations. The two dipole states are stabilized by the anisotropic energy and separated by a transition energy barrier of 70 meV. Such switching is then accessed to the electric field driven reorientation of individual dipole while overcoming the barriers by the coercive gate field, and demonstrates the creation of a single molecular electret.

preprint2020arXiv

An Application-Driven Non-Orthogonal Multiple Access Enabled Computation Offloading Scheme

To cope with the unprecedented surge in demand for data computing for the applications, the promising concept of multi-access edge computing (MEC) has been proposed to enable the network edges to provide closer data processing for mobile devices (MDs). Since enormous workloads need to be migrated, and MDs always remain resource-constrained, data offloading from devices to the MEC server will inevitably require more efficient transmission designs. The integration of nonorthogonal multiple access (NOMA) technique with MEC has been shown to provide applications with lower latency and higher energy efficiency. However, existing designs of this type have mainly focused on the transmission technique, which is still insufficient. To further advance offloading performance, in this work, we propose an application-driven NOMA enabled computation offloading scheme by exploring the characteristics of applications, where the common data of the application is offloaded through multi-device cooperation. Under the premise of successfully offloading the common data, we formulate the problem as the maximization of individual offloading throughput, where the time allocation and power control are jointly optimized. By using the successive convex approximation (SCA) method, the formulated problem can be iteratively solved. Simulation results demonstrate the convergence of our method and the effectiveness of the proposed scheme.

preprint2020arXiv

BigGAN-based Bayesian reconstruction of natural images from human brain activity

In the visual decoding domain, visually reconstructing presented images given the corresponding human brain activity monitored by functional magnetic resonance imaging (fMRI) is difficult, especially when reconstructing viewed natural images. Visual reconstruction is a conditional image generation on fMRI data and thus generative adversarial network (GAN) for natural image generation is recently introduced for this task. Although GAN-based methods have greatly improved, the fidelity and naturalness of reconstruction are still unsatisfactory due to the small number of fMRI data samples and the instability of GAN training. In this study, we proposed a new GAN-based Bayesian visual reconstruction method (GAN-BVRM) that includes a classifier to decode categories from fMRI data, a pre-trained conditional generator to generate natural images of specified categories, and a set of encoding models and evaluator to evaluate generated images. GAN-BVRM employs the pre-trained generator of the prevailing BigGAN to generate masses of natural images, and selects the images that best matches with the corresponding brain activity through the encoding models as the reconstruction of the image stimuli. In this process, the semantic and detailed contents of reconstruction are controlled by decoded categories and encoding models, respectively. GAN-BVRM used the Bayesian manner to avoid contradiction between naturalness and fidelity from current GAN-based methods and thus can improve the advantages of GAN. Experimental results revealed that GAN-BVRM improves the fidelity and naturalness, that is, the reconstruction is natural and similar to the presented image stimuli.

preprint2020arXiv

Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Search

Neural architecture search (NAS) has become an important approach to automatically find effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we may face a very challenging issue of space explosion. However, due to the limitation of computational resources, we can only sample a very small proportion of the architectures, which provides insufficient information for the training. As a result, existing methods may often produce suboptimal architectures. To alleviate this issue, we propose a curriculum search method that starts from a small search space and gradually incorporates the learned knowledge to guide the search in a large space. With the proposed search strategy, our Curriculum Neural Architecture Search (CNAS) method significantly improves the search efficiency and finds better architectures than existing NAS methods. Extensive experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of the proposed method.

preprint2020arXiv

Closed-loop Matters: Dual Regression Networks for Single Image Super-Resolution

Deep neural networks have exhibited promising performance in image super-resolution (SR) by learning a nonlinear mapping function from low-resolution (LR) images to high-resolution (HR) images. However, there are two underlying limitations to existing SR methods. First, learning the mapping function from LR to HR images is typically an ill-posed problem, because there exist infinite HR images that can be downsampled to the same LR image. As a result, the space of the possible functions can be extremely large, which makes it hard to find a good solution. Second, the paired LR-HR data may be unavailable in real-world applications and the underlying degradation method is often unknown. For such a more general case, existing SR models often incur the adaptation problem and yield poor performance. To address the above issues, we propose a dual regression scheme by introducing an additional constraint on LR data to reduce the space of the possible functions. Specifically, besides the mapping from LR to HR images, we learn an additional dual regression mapping estimates the down-sampling kernel and reconstruct LR images, which forms a closed-loop to provide additional supervision. More critically, since the dual regression process does not depend on HR images, we can directly learn from LR images. In this sense, we can easily adapt SR models to real-world data, e.g., raw video frames from YouTube. Extensive experiments with paired training data and unpaired real-world data demonstrate our superiority over existing methods.

preprint2020arXiv

Core-level x-ray photoemission and Raman spectroscopy studies on electronic structures in Mott-Hubbard type nickelate oxide NdNiO$_2$

We perform core-level X-ray photoemission spectroscopy (XPS) and electronic Raman scattering studies of electronic structures and spin fluctuations in the bulk samples of the nickelate oxide NdNiO$_2$. According to Nd $3d$ and O $1s$ XPS spectra, we conclude that NdNiO$_2$ has a large transfer energy. From the analysis of the main line of the Ni $2p_{3/2}$ XPS, we confirm the NiO$_2$ planes in NdNiO$_2$ are of Mott-Hubbard type in the Zaanen-Sawatzky-Allen scheme. The two-magnon peak in the Raman scattering provides direct evidence for the strong spin-fluctuation in NdNiO$_2$. The peak position determines the antiferromagnetic exchange $J=25$~meV. Our experimental results agree well with our previous theoretical results.

preprint2020arXiv

Deep Learning for Image Super-resolution: A Survey

Image Super-Resolution (SR) is an important class of image processing techniques to enhance the resolution of images and videos in computer vision. Recent years have witnessed remarkable progress of image super-resolution using deep learning techniques. This article aims to provide a comprehensive survey on recent advances of image super-resolution using deep learning approaches. In general, we can roughly group the existing studies of SR techniques into three major categories: supervised SR, unsupervised SR, and domain-specific SR. In addition, we also cover some other important issues, such as publicly available benchmark datasets and performance evaluation metrics. Finally, we conclude this survey by highlighting several future directions and open issues which should be further addressed by the community in the future.

preprint2020arXiv

Exemplar-based Layout Fine-tuning for Node-link Diagrams

We design and evaluate a novel layout fine-tuning technique for node-link diagrams that facilitates exemplar-based adjustment of a group of substructures in batching mode. The key idea is to transfer user modifications on a local substructure to other substructures in the whole graph that are topologically similar to the exemplar. We first precompute a canonical representation for each substructure with node embedding techniques and then use it for on-the-fly substructure retrieval. We design and develop a light-weight interactive system to enable intuitive adjustment, modification transfer, and visual graph exploration. We also report some results of quantitative comparisons, three case studies, and a within-participant user study.

preprint2020arXiv

Hierarchical Neural Architecture Search for Single Image Super-Resolution

Deep neural networks have exhibited promising performance in image super-resolution (SR). Most SR models follow a hierarchical architecture that contains both the cell-level design of computational blocks and the network-level design of the positions of upsampling blocks. However, designing SR models heavily relies on human expertise and is very labor-intensive. More critically, these SR models often contain a huge number of parameters and may not meet the requirements of computation resources in real-world applications. To address the above issues, we propose a Hierarchical Neural Architecture Search (HNAS) method to automatically design promising architectures with different requirements of computation cost. To this end, we design a hierarchical SR search space and propose a hierarchical controller for architecture search. Such a hierarchical controller is able to simultaneously find promising cell-level blocks and network-level positions of upsampling layers. Moreover, to design compact architectures with promising performance, we build a joint reward by considering both the performance and computation cost to guide the search process. Extensive experiments on five benchmark datasets demonstrate the superiority of our method over existing methods.

preprint2020arXiv

Investigating Task-driven Latent Feasibility for Nonconvex Image Modeling

Properly modeling latent image distributions plays an important role in a variety of image-related vision problems. Most exiting approaches aim to formulate this problem as optimization models (e.g., Maximum A Posterior, MAP) with handcrafted priors. In recent years, different CNN modules are also considered as deep priors to regularize the image modeling process. However, these explicit regularization techniques require deep understandings on the problem and elaborately mathematical skills. In this work, we provide a new perspective, named Task-driven Latent Feasibility (TLF), to incorporate specific task information to narrow down the solution space for the optimization-based image modeling problem. Thanks to the flexibility of TLF, both designed and trained constraints can be embedded into the optimization process. By introducing control mechanisms based on the monotonicity and boundedness conditions, we can also strictly prove the convergence of our proposed inference process. We demonstrate that different types of image modeling problems, such as image deblurring and rain streaks removals, can all be appropriately addressed within our TLF framework. Extensive experiments also verify the theoretical results and show the advantages of our method against existing state-of-the-art approaches.

preprint2020arXiv

NAT: Neural Architecture Transformer for Accurate and Compact Architectures

Designing effective architectures is one of the key factors behind the success of deep neural networks. Existing deep architectures are either manually designed or automatically searched by some Neural Architecture Search (NAS) methods. However, even a well-searched architecture may still contain many non-significant or redundant modules or operations (e.g., convolution or pooling), which may not only incur substantial memory consumption and computation cost but also deteriorate the performance. Thus, it is necessary to optimize the operations inside an architecture to improve the performance without introducing extra computation cost. Unfortunately, such a constrained optimization problem is NP-hard. To make the problem feasible, we cast the optimization problem into a Markov decision process (MDP) and seek to learn a Neural Architecture Transformer (NAT) to replace the redundant operations with the more computationally efficient ones (e.g., skip connection or directly removing the connection). Based on MDP, we learn NAT by exploiting reinforcement learning to obtain the optimization policies w.r.t. different architectures. To verify the effectiveness of the proposed strategies, we apply NAT on both hand-crafted architectures and NAS based architectures. Extensive experiments on two benchmark datasets, i.e., CIFAR-10 and ImageNet, demonstrate that the transformed architecture by NAT significantly outperforms both its original form and those architectures optimized by existing methods.

preprint2020arXiv

Neural encoding and interpretation for high-level visual cortices based on fMRI using image caption features

On basis of functional magnetic resonance imaging (fMRI), researchers are devoted to designing visual encoding models to predict the neuron activity of human in response to presented image stimuli and analyze inner mechanism of human visual cortices. Deep network structure composed of hierarchical processing layers forms deep network models by learning features of data on specific task through big dataset. Deep network models have powerful and hierarchical representation of data, and have brought about breakthroughs for visual encoding, while revealing hierarchical structural similarity with the manner of information processing in human visual cortices. However, previous studies almost used image features of those deep network models pre-trained on classification task to construct visual encoding models. Except for deep network structure, the task or corresponding big dataset is also important for deep network models, but neglected by previous studies. Because image classification is a relatively fundamental task, it is difficult to guide deep network models to master high-level semantic representations of data, which causes into that encoding performance for high-level visual cortices is limited. In this study, we introduced one higher-level vision task: image caption (IC) task and proposed the visual encoding model based on IC features (ICFVEM) to encode voxels of high-level visual cortices. Experiment demonstrated that ICFVEM obtained better encoding performance than previous deep network models pre-trained on classification task. In addition, the interpretation of voxels was realized to explore the detailed characteristics of voxels based on the visualization of semantic words, and comparative analysis implied that high-level visual cortices behaved the correlative representation of image content.

preprint2020arXiv

One-Shot Parameter Identification of the Thevenin&#39;s Model for Batteries: Methods and Validation

Parameter estimation is of foundational importance for various model-based battery management tasks, including charging control, state-of-charge estimation and aging assessment. However, it remains a challenging issue as the existing methods generally depend on cumbersome and time-consuming procedures to extract battery parameters from data. Departing from the literature, this paper sets the unique aim of identifying all the parameters offline in a one-shot procedure, including the resistance and capacitance parameters and the parameters in the parameterized function mapping from the state-of-charge to the open-circuit voltage. Considering the well-known Thevenin&#39;s battery model, the study begins with the parameter identifiability analysis, showing that all the parameters are locally identifiable. Then, it formulates the parameter identification problem in a prediction-error-minimization framework. As the non-convexity intrinsic to the problem may lead to physically meaningless estimates, two methods are developed to overcome this issue. The first one is to constrain the parameter search within a reasonable space by setting parameter bounds, and the other adopts regularization of the cost function using prior parameter guess. The proposed identifiability analysis and identification methods are extensively validated through simulations and experiments.

preprint2020arXiv

Privacy-Preserving Dynamic Average Consensus via State Decomposition: Case Study on Multi-Robot Formation Control

Dynamic average consensus is a decentralized control/estimation framework where a group of agents cooperatively track the average of local time-varying reference signals. In this paper, we develop a novel state decomposition-based privacy preservation scheme to protect the privacy of agents when sharing information with neighboring agents. Specifically, we first show that an external eavesdropper can successfully wiretap the reference signals of all agents in a conventional dynamic average consensus algorithm. To protect privacy against the eavesdropper, a state decomposition scheme is developed where the original state of each agent is decomposed into two sub-states: one succeeds the role of the original state in inter-node interactions, while the other sub-state only communicates with the first one and is invisible to other neighboring agents. Rigorous analyses are performed to show that 1) the proposed privacy scheme preserves the convergence of the average consensus; and 2) the privacy of the agents is protected such that an eavesdropper cannot discover the private reference signals with any guaranteed accuracy. The developed privacy-preserving dynamic average consensus framework is then applied to the formation control of multiple non-holonomic mobile robots, in which the efficacy of the scheme is demonstrated. Numerical simulation is provided to illustrate the effectiveness of the proposed approach.

preprint2020arXiv

Robust and Secure Communications in Intelligent Reflecting Surface Assisted NOMA networks

This letter investigates secure transmission in an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network. Consider a practical eavesdropping scenario with imperfect channel state information of the eavesdropper, we propose a robust beamforming scheme using artificial noise to guarantee secure NOMA transmission with the IRS. A joint transmit beamforming and IRS phase shift optimization problem is formulated to minimize the transmit power. Since the problem is non-convex and challenging to resolve, we develop an effective alternative optimization (AO) algorithm to obtain stationary point solutions. Simulation results validate the security advantage of the robust beamforming scheme and the effectiveness of the AO algorithm.

preprint2020arXiv

Supporting Real-Time COVID-19 Medical Management Decisions: The Transition Matrix Model Approach

Since the onset of the COVID-19 outbreak in Wuhan, China, numerous forecasting models have been proposed to project the trajectory of coronavirus infection cases. We propose a new discrete-time Markov chain transition matrix model that directly incorporates stochastic behavior and for which parameter estimation is straightforward from available data. Using such data from China&#39;s Hubei province (for which Wuhan is the provincial capital city), the model is shown to be flexible, robust, and accurate. As a result, it has been adopted by the first Shanghai assistance medical team in Wuhan&#39;s Jinyintan Hospital, which was the first designated hospital to take COVID-19 patients in the world. The forecast has been used for preparing medical staff, intensive care unit (ICU) beds, ventilators, and other critical care medical resources and for supporting real-time medical management decisions. Empirical data from China&#39;s first two months (January/February) of fighting COVID-19 was collected and used to enhance the model by embedding NPI efficiency into the model. We applied the model to forecast Italy, South Korea, and Iran on March 9. Later we made forecasts for Spain, Germany, France, US on March 24. Again, the model has performed very well, proven to be flexible, robust, and accurate for most of these countries/regions outside China.

preprint2020arXiv

The Shallow End: Empowering Shallower Deep-Convolutional Networks through Auxiliary Outputs

Depth is one of the key factors behind the success of convolutional neural networks (CNNs). Since ResNet, we are able to train very deep CNNs as the gradient vanishing issue has been largely addressed by the introduction of skip connections. However, we observe that, when the depth is very large, the intermediate layers (especially shallow layers) may fail to receive sufficient supervision from the loss due to the severe transformation through a long backpropagation path. As a result, the representation power of intermediate layers can be very weak and the model becomes very redundant with limited performance. In this paper, we first investigate the supervision vanishing issue in existing backpropagation (BP) methods. And then, we propose to address it via an effective method, called Multi-way BP (MW-BP), which relies on multiple auxiliary losses added to the intermediate layers of the network. The proposed MW-BP method can be applied to most deep architectures with slight modifications, such as ResNet and MobileNet. Our method often gives rise to much more compact models (denoted by &#34;Mw+Architecture&#34;) than existing methods. For example, MwResNet-44 with 44 layers performs better than ResNet-110 with 110 layers on CIFAR-10 and CIFAR-100. More critically, the resultant models even outperform the light models obtained by state-of-the-art model compression methods. Last, our method inherently produces multiple compact models with different depths at the same time, which is helpful for model selection.

preprint2019arXiv

Photonic Cyclone: spatiotemporal optical vortex with controllable transverse orbital angular momentum

Today, it is well known that light possesses a linear momentum which is along the propagation direction. Besides, scientists also discovered that light can possess an angular momentum (AM), a spin angular momentum (SAM) associated with circular polarization and an orbital angular momentum (OAM) owing to the azimuthally dependent phase. Even though such angular momenta are longitudinal in general, a SAM transverse to the propagation has opened up a variety of key applications [1]. In contrast, investigations of the transverse OAM are quite rare due to its complex nature. Here we demonstrate a simple method to generate a three dimensional (3D) optical wave packet with a controllable purely transverse OAM. Such a wave packet is a spatiotemporal (ST) vortex, which resembles an advancing cyclone, with optical energy flowing in the spatial and temporal dimension. Contrary to the transverse SAM, the magnitude of the transverse OAM carried by the photonic cyclone is scalable to a larger value by simple adjustments. Since the ST vortex carries a controllable OAM in the unique transverse dimension, it has a strong potential for novel applications that may not be possible otherwise. The scheme reported here can be readily adapted for the other spectra regime and different wave fields, opening tremendous opportunities for the study and applications of ST vortex in much broader scopes.