Searcharxiv⌕ Search

arXiv subjects

Yi Jiang

Publications and source records attributed to Yi Jiang.

At least 145 records · Page 8Linked to original sources
arXiv2023

Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding

Incomplete multi-view clustering becomes an important research problem, since multi-view data with missing values are ubiquitous in real-world applications. Although great efforts have been made for incomplete multi-view clustering, there are still some challenges: 1) most existing methods didn't make full use of multi-view information to deal with missing values; 2) most methods just employ the consistent information within multi-view data but ignore the complementary information; 3) For the existing incomplete multi-view clustering methods, incomplete multi-view representation learning and clustering are treated as independent processes, which leads to performance gap. In this work, we proposed a novel Incomplete Contrastive Multi-View Clustering method with high-confidence guiding (ICMVC). Firstly, we proposed a multi-view consistency relation transfer plus graph convolutional network to tackle missing values problem. Secondly, instance-level attention fusion and high-confidence guiding are proposed to exploit the complementary information while instance-level contrastive learning for latent representation is designed to employ the consistent information. Thirdly, an end-to-end framework is proposed to integrate multi-view missing values handling, multi-view representation learning and clustering assignment for joint optimization. Experiments compared with state-of-the-art approaches demonstrated the effectiveness and superiority of our method. Our code is publicly available at https://github.com/liunian-Jay/ICMVC.

cs.CV↗
arXiv2023

General Object Foundation Model for Images and Videos at Scale

We present GLEE in this work, an object-level foundation model for locating and identifying objects in images and videos. Through a unified framework, GLEE accomplishes detection, segmentation, tracking, grounding, and identification of arbitrary objects in the open world scenario for various object perception tasks. Adopting a cohesive learning strategy, GLEE acquires knowledge from diverse data sources with varying supervision levels to formulate general object representations, excelling in zero-shot transfer to new data and tasks. Specifically, we employ an image encoder, text encoder, and visual prompter to handle multi-modal inputs, enabling to simultaneously solve various object-centric downstream tasks while maintaining state-of-the-art performance. Demonstrated through extensive training on over five million images from diverse benchmarks, GLEE exhibits remarkable versatility and improved generalization performance, efficiently tackling downstream tasks without the need for task-specific adaptation. By integrating large volumes of automatically labeled data, we further enhance its zero-shot generalization capabilities. Additionally, GLEE is capable of being integrated into Large Language Models, serving as a foundational model to provide universal object-level information for multi-modal tasks. We hope that the versatility and universality of our method will mark a significant step in the development of efficient visual foundation models for AGI systems. The model and code will be released at https://glee-vision.github.io .

cs.CV↗
arXiv2023

VASP2KP: kp models and Lande g-factors from ab initio calculations

The $k\cdot p$ method is significant in condensed matter physics for the compact and analytical Hamiltonian. In the presence of magnetic field, it is described by the effective Zeeman's coupling Hamiltonian with Landé $ g $-factors. Here, we develop an open-source package VASP2KP (including two parts: vasp2mat and mat2kp) to compute $k\cdot p$ parameters and Landé $g$-factors directly from the wavefunctions provided by the density functional theory (DFT) as implemented in Vienna ab initio Simulation Package (VASP). First, we develop a VASP patch vasp2mat to compute matrix representations of the generalized momentum operator $ \mathbf{\hatπ}=\mathbf{\hat{p}}+\frac{1}{2mc^2}\left(\mathbf{\hat{s}}\times\nabla V(\mathbf{r})\right) $, spin operator $\mathbf{\hat{s}}$, time reversal operator $\hat{T}$ and crystalline symmetry operators $\hat{R}$ on the DFT wavefunctions. Second, we develop a python code mat2kp to obtain the unitary transformation $U$ that rotates the degenerate DFT basis towards the standard basis, and then automatically compute the $k\cdot p$ parameters and $g$-factors. The theory and the methodology behind VASP2KP are described in detail. The matrix elements of the operators are derived comprehensively and computed correctly within the projector augmented wave method. We apply this package to some materials, e.g., Bi$_2$Se$_3$, Na$_3$Bi, Te, InAs and 1H-TMD monolayers. The obtained effective model's dispersions are in good agreement with the DFT data around the specific wave vector, and the $g$-factors are consistent with experimental data. The VASP2KP package is available at https://github.com/zjwang11/VASP2KP.

cond-mat.mtrl-sci↗
arXiv2023

Provable Reinforcement Learning for Networked Control Systems with Stochastic Packet Disordering

This paper formulates a stochastic optimal control problem for linear networked control systems featuring stochastic packet disordering with a unique stabilizing solution certified. The problem is solved by proposing reinforcement learning algorithms. A measurement method is first presented to deal with PD and calculate the newest control input. The NCSs with stochastic PD are modeled as stochastic NCSs. Then, given a cost function, a modified algebraic Riccati equation is derived within the formulation. We propose offline policy iteration and value iteration algorithms to solve the MARE associated with provable convergence. These two algorithms require knowledge of NCS dynamics and PD probabilities. To release that, we further design online model-free off-policy and Q-learning algorithms with an online estimation method for PD probability. Both model-free algorithms solve the optimal control problem using real-time system states, control inputs, and PD probability estimates. Simulation results verify the proposed formulation and algorithms at last.

eess.SY↗
arXiv2023

Imaging Atomic-Scale Chemistry from Fused Multi-Modal Electron Microscopy

Efforts to map atomic-scale chemistry at low doses with minimal noise using electron microscopes are fundamentally limited by inelastic interactions. Here, fused multi-modal electron microscopy offers high signal-to-noise ratio (SNR) recovery of material chemistry at nano- and atomic- resolution by coupling correlated information encoded within both elastic scattering (high-angle annular dark field (HAADF)) and inelastic spectroscopic signals (electron energy loss (EELS) or energy-dispersive x-ray (EDX)). By linking these simultaneously acquired signals, or modalities, the chemical distribution within nanomaterials can be imaged at significantly lower doses with existing detector hardware. In many cases, the dose requirements can be reduced by over one order of magnitude. This high SNR recovery of chemistry is tested against simulated and experimental atomic resolution data of heterogeneous nanomaterials.

physics.comp-ph↗
arXiv2023

CoDet: Co-Occurrence Guided Region-Word Alignment for Open-Vocabulary Object Detection

Deriving reliable region-word alignment from image-text pairs is critical to learn object-level vision-language representations for open-vocabulary object detection. Existing methods typically rely on pre-trained or self-trained vision-language models for alignment, which are prone to limitations in localization accuracy or generalization capabilities. In this paper, we propose CoDet, a novel approach that overcomes the reliance on pre-aligned vision-language space by reformulating region-word alignment as a co-occurring object discovery problem. Intuitively, by grouping images that mention a shared concept in their captions, objects corresponding to the shared concept shall exhibit high co-occurrence among the group. CoDet then leverages visual similarities to discover the co-occurring objects and align them with the shared concept. Extensive experiments demonstrate that CoDet has superior performances and compelling scalability in open-vocabulary detection, e.g., by scaling up the visual backbone, CoDet achieves 37.0 $\text{AP}^m_{novel}$ and 44.7 $\text{AP}^m_{all}$ on OV-LVIS, surpassing the previous SoTA by 4.2 $\text{AP}^m_{novel}$ and 9.8 $\text{AP}^m_{all}$. Code is available at https://github.com/CVMI-Lab/CoDet.

cs.CV↗
arXiv2023

Linkages among the Foreign Exchange, Stock, and Bond Markets in Japan and the United States

While economic theory explains the linkages among the financial markets of different countries, empirical studies mainly verify the linkages through Granger causality, without considering latent variables or instantaneous effects. Their findings are inconsistent regarding the existence of causal linkages among financial markets, which might be attributed to differences in the focused markets, data periods, and methods applied. Our study adopts causal discovery methods including VAR-LiNGAM and LPCMCI with domain knowledge to explore the linkages among financial markets in Japan and the United States (US) for the post Covid-19 pandemic period under divergent monetary policy directions. The VAR-LiNGAM results reveal that the previous day's US market influences the following day's Japanese market for both stocks and bonds, and the bond markets of the previous day impact the following day's foreign exchange (FX) market directly and the following day's Japanese stock market indirectly. The LPCMCI results indicate the existence of potential latent confounders. Our results demonstrate that VAR-LiNGAM uniquely identifies the directed acyclic graph (DAG), and thus provides informative insight into the causal relationship when the assumptions are considered valid. Our study contributes to a better understanding of the linkages among financial markets in the analyzed data period by supporting the existence of linkages between Japan and the US for the same financial markets and among FX, stock, and bond markets, thus highlighting the importance of leveraging causal discovery methods in the financial domain.

q-fin.ST↗
arXiv2023

Coordinates in low-dimensional cell shape-space discriminate migration dynamics from single static cell images

Cell shape has long been used to discern cell phenotypes and states, but the underlying premise has not been quantitatively tested. Here, we show that a single cell image can be used to discriminate its migration behavior by analyzing a large number of cell migration data in vitro. We analyzed a large number of two-dimensional cell migration images over time and found that the cell shape variation space has only six dimensions, and migration behavior can be determined by the coordinates of a single cell image in this 6-dimensional shape-space. We further show that this is possible because persistent cell migration is characterized by spatial-temporally coordinated protrusion and contraction, and a distribution signature in the shape-space. Our findings provide a quantitative underpinning for using cell morphology to differentiate cell dynamical behavior.

q-bio.CB↗
arXiv2023

Optimal Beamforming for MIMO DFRC Systems with Transmit Covariance Constraints

This paper optimizes the beamforming design of a downlink multiple-input multiple-output (MIMO) dual-function radar-communication (DFRC) system to maximize the weighted communication sum-rate under a prescribed transmit covariance constraint for radar performance guarantee. In the single-user case, we show that the transmit covariance constraint implies the existence of inherent orthogonality among the transmit beamforming vectors in use. Then, leveraging Cauchy's interlace theorem, we derive the globally optimal transmit and receive beamforming solution in closed form. In the multi-user case, we exploit the connection between the weighted sum-rate and weighted minimum mean squared error (MMSE) to reformulate the intended problem, and develop a block-coordinate-descent (BCD) algorithm to iteratively compute the transmit beamforming and receive beamforming solutions. Under this approach, we reveal that the optimal receive beamforming is given by the classic MMSE one and the optimal transmit beamforming design amounts to solving an orthogonal Procrustes problem, thereby allowing for closed-form solutions to subproblems in each BCD step and fast convergence of the proposed algorithm to a high-quality (near-optimal) overall beamforming design. Numerical results demonstrate the superiority of our approach to the existing methods, with at least 40% higher sum-rate under a multi-user MIMO setting in the high signal-to-noise regime.

eess.SP↗
arXiv2023

Autonomous Electron Tomography Reconstruction with Machine Learning

Modern electron tomography has progressed to higher resolution at lower doses by leveraging compressed sensing methods that minimize total variation (TV). However, these sparsity-emphasized reconstruction algorithms introduce tunable parameters that greatly influence the reconstruction quality. Here, Pareto front analysis shows that high-quality tomograms are reproducibly achieved when TV minimization is heavily weighted. However, in excess, compressed sensing tomography creates overly smoothed 3D reconstructions. Adding momentum to the gradient descent during reconstruction reduces the risk of over-smoothing and better ensures that compressed sensing is well behaved. For simulated data, the tedious process of tomography parameter selection is efficiently solved using Bayesian optimization with Gaussian processes. In combination, Bayesian optimization with momentum-based compressed sensing greatly reduces the required compute time$-$an 80% reduction was observed for the 3D reconstruction of SrTiO$_3$ nanocubes. Automated parameter selection is necessary for large scale tomographic simulations that enable the 3D characterization of a wider range of inorganic and biological materials.

physics.med-ph↗
arXiv2023

Software Architecture in Practice: Challenges and Opportunities

Software architecture has been an active research field for nearly four decades, in which previous studies make significant progress such as creating methods and techniques and building tools to support software architecture practice. Despite past efforts, we have little understanding of how practitioners perform software architecture related activities, and what challenges they face. Through interviews with 32 practitioners from 21 organizations across three continents, we identified challenges that practitioners face in software architecture practice during software development and maintenance. We reported on common software architecture activities at software requirements, design, construction and testing, and maintenance stages, as well as corresponding challenges. Our study uncovers that most of these challenges center around management, documentation, tooling and process, and collects recommendations to address these challenges.

cs.SE↗
arXiv2023

Universal Instance Perception as Object Discovery and Retrieval

All instance perception tasks aim at finding certain objects specified by some queries such as category names, language expressions, and target annotations, but this complete field has been split into multiple independent subtasks. In this work, we present a universal instance perception model of the next generation, termed UNINEXT. UNINEXT reformulates diverse instance perception tasks into a unified object discovery and retrieval paradigm and can flexibly perceive different types of objects by simply changing the input prompts. This unified formulation brings the following benefits: (1) enormous data from different tasks and label vocabularies can be exploited for jointly training general instance-level representations, which is especially beneficial for tasks lacking in training data. (2) the unified model is parameter-efficient and can save redundant computation when handling multiple tasks simultaneously. UNINEXT shows superior performance on 20 challenging benchmarks from 10 instance-level tasks including classical image-level tasks (object detection and instance segmentation), vision-and-language tasks (referring expression comprehension and segmentation), and six video-level object tracking tasks. Code is available at https://github.com/MasterBin-IIAU/UNINEXT.

cs.CV↗
arXiv2023

Pb$_9$Cu(PO4)$_6$(OH)$_2$: Phonon bands, Localized Flat Band Magnetism, Models, and Chemical Analysis

In a series of recent reports, doped lead apatite (LK-99) has been proposed as a candidate ambient temperature and pressure superconductor. However, from both an experimental and theoretical perspective, these claims are largely unsubstantiated. To this end, our synthesis and subsequent analysis of an LK-99 sample reveals a multiphase material that does not exhibit high-temperature superconductivity. We study the structure of this phase with single-crystal X-ray diffraction (SXRD) and find a structure consistent with doped $\text{Pb}_{10}(\text{PO}_4)_6(\text{OH})_2$. However, the material is transparent which rules out a superconducting nature. From ab initio defect formation energy calculations, we find that the material likely hosts $\text{OH}^-$ anions, rather than divalent $\text{O}^{2-}$ anions, within the hexagonal channels and that Cu substitution is highly thermodynamically disfavored. Phonon spectra on the equilibrium structures reveal numerous unstable phonon modes. Together, these calculations suggest it is doubtful that Cu enters the structure in meaningful concentrations, despite initial attempts to model LK-99 in this way. However for the sake of completeness, we perform ab initio calculations of the topology, quantum geometry, and Wannier function localization in the Cu-dominated flat bands of four separate doped structures. In all cases, we find they are atomically localized by irreps, Wilson loops, and the Fubini-Study metric. It is unlikely that such bands can support strong superfluidity, and instead are susceptible to ferromagnetism (or out-of-plane antiferromagnetism) at low temperatures, which we find in ab initio studies. In sum, $\text{Pb}_{9}\text{Cu}(\text{PO}_4)_6(\text{OH})_2$ could more likely be a magnet, rather than an ambient temperature and pressure superconductor.

cond-mat.supr-con↗
arXiv2023

Exploring Transformers for Open-world Instance Segmentation

Open-world instance segmentation is a rising task, which aims to segment all objects in the image by learning from a limited number of base-category objects. This task is challenging, as the number of unseen categories could be hundreds of times larger than that of seen categories. Recently, the DETR-like models have been extensively studied in the closed world while stay unexplored in the open world. In this paper, we utilize the Transformer for open-world instance segmentation and present SWORD. Firstly, we introduce to attach the stop-gradient operation before classification head and further add IoU heads for discovering novel objects. We demonstrate that a simple stop-gradient operation not only prevents the novel objects from being suppressed as background, but also allows the network to enjoy the merit of heuristic label assignment. Secondly, we propose a novel contrastive learning framework to enlarge the representations between objects and background. Specifically, we maintain a universal object queue to obtain the object center, and dynamically select positive and negative samples from the object queries for contrastive learning. While the previous works only focus on pursuing average recall and neglect average precision, we show the prominence of SWORD by giving consideration to both criteria. Our models achieve state-of-the-art performance in various open-world cross-category and cross-dataset generalizations. Particularly, in VOC to non-VOC setup, our method sets new state-of-the-art results of 40.0% on ARb100 and 34.9% on ARm100. For COCO to UVO generalization, SWORD significantly outperforms the previous best open-world model by 5.9% on APm and 8.1% on ARm100.

cs.CV↗
arXiv2023

Kagome Materials I: SG 191, ScV$_6$Sn$_6$. Flat Phonon Soft Modes and Unconventional CDW Formation: Microscopic and Effective Theory

Kagome Materials with flat bands exhibit wildly different physical properties depending on symmetry group, and electron number. For the case of ScV$_6$Sn$_6$ in space group 191, we investigate the existence of a charge density wave (CDW) at vector $\bar{K}=(\frac{1}{3},\frac{1}{3},\frac{1}{3})$ and its relationship with the phonon behavior. The experimental findings reveal a $\sim$95K CDW without nesting/peaks in the electron susceptibility at $\bar{K}$. Notably, ScV$_6$Sn$_6$ exhibits a collapsed phonon mode at $H=(\frac{1}{3},\frac{1}{3},\frac{1}{2})$ and an imaginary flat phonon band in the vicinity of $H$. The soft phonon is attributed to triangular Sn ($Sn^T$) mirror-even vibrations along the $z$-direction. We develop a simple force constant model to describe the entire soft phonon dispersion. By employing a new (Gaussian) approximation of the hopping parameter, we demonstrate the renormalization of the phonon frequency and the consequent collapse of the $H$ phonon. Additionally, we propose an effective model with two order parameters (OPs) to explain the appearance of the CDW at $\bar{K}$, which competes with the collapsed phonon at $H$. Through comparisons with experimental data, we show that the $H$ OP undergoes a second-order phase transition while exhibiting substantial fluctuations, ultimately inducing the first-order transition of the $\bar{K}$ OP. Furthermore, we extend our analysis to the similar compound YV$_6$Sn$_6$, which lacks a CDW phase, attributing this difference to the participation of the heavier Y atom in the out-of-plane phonon behavior. Our comprehensive study not only elucidates the CDW in ScV$_6$Sn$_6$ but also presents a significant advancement in modeling complex electronic systems, fostering collaborations between ab-initio simulations and analytical approaches.

cond-mat.str-el↗
arXiv2023

EGC: Image Generation and Classification via a Diffusion Energy-Based Model

Learning image classification and image generation using the same set of network parameters is a challenging problem. Recent advanced approaches perform well in one task often exhibit poor performance in the other. This work introduces an energy-based classifier and generator, namely EGC, which can achieve superior performance in both tasks using a single neural network. Unlike a conventional classifier that outputs a label given an image (i.e., a conditional distribution $p(y|\mathbf{x})$), the forward pass in EGC is a classifier that outputs a joint distribution $p(\mathbf{x},y)$, enabling an image generator in its backward pass by marginalizing out the label $y$. This is done by estimating the energy and classification probability given a noisy image in the forward pass, while denoising it using the score function estimated in the backward pass. EGC achieves competitive generation results compared with state-of-the-art approaches on ImageNet-1k, CelebA-HQ and LSUN Church, while achieving superior classification accuracy and robustness against adversarial attacks on CIFAR-10. This work represents the first successful attempt to simultaneously excel in both tasks using a single set of network parameters. We believe that EGC bridges the gap between discriminative and generative learning.

cs.CV↗
arXiv2023

Accelerated deep self-supervised ptycho-laminography for three-dimensional nanoscale imaging of integrated circuits

Three-dimensional inspection of nanostructures such as integrated circuits is important for security and reliability assurance. Two scanning operations are required: ptychographic to recover the complex transmissivity of the specimen; and rotation of the specimen to acquire multiple projections covering the 3D spatial frequency domain. Two types of rotational scanning are possible: tomographic and laminographic. For flat, extended samples, for which the full 180 degree coverage is not possible, the latter is preferable because it provides better coverage of the 3D spatial frequency domain compared to limited-angle tomography. It is also because the amount of attenuation through the sample is approximately the same for all projections. However, both techniques are time consuming because of extensive acquisition and computation time. Here, we demonstrate the acceleration of ptycho-laminographic reconstruction of integrated circuits with 16-times fewer angular samples and 4.67-times faster computation by using a physics-regularized deep self-supervised learning architecture. We check the fidelity of our reconstruction against a densely sampled reconstruction that uses full scanning and no learning. As already reported elsewhere [Zhou and Horstmeyer, Opt. Express, 28(9), pp. 12872-12896], we observe improvement of reconstruction quality even over the densely sampled reconstruction, due to the ability of the self-supervised learning kernel to fill the missing cone.

eess.IV↗
arXiv2023

Multi-Level Contrastive Learning for Dense Prediction Task

In this work, we present Multi-Level Contrastive Learning for Dense Prediction Task (MCL), an efficient self-supervised method for learning region-level feature representation for dense prediction tasks. Our method is motivated by the three key factors in detection: localization, scale consistency and recognition. To explicitly encode absolute position and scale information, we propose a novel pretext task that assembles multi-scale images in a montage manner to mimic multi-object scenarios. Unlike the existing image-level self-supervised methods, our method constructs a multi-level contrastive loss that considers each sub-region of the montage image as a singleton. Our method enables the neural network to learn regional semantic representations for translation and scale consistency while reducing pre-training epochs to the same as supervised pre-training. Extensive experiments demonstrate that MCL consistently outperforms the recent state-of-the-art methods on various datasets with significant margins. In particular, MCL obtains 42.5 AP$^\mathrm{bb}$ and 38.3 AP$^\mathrm{mk}$ on COCO with the 1x schedule fintuning, when using Mask R-CNN with R50-FPN backbone pre-trained with 100 epochs. In comparison to MoCo, our method surpasses their performance by 4.0 AP$^\mathrm{bb}$ and 3.1 AP$^\mathrm{mk}$. Furthermore, we explore the alignment between pretext task and downstream tasks. We extend our pretext task to supervised pre-training, which achieves a similar performance to self-supervised learning. This result demonstrates the importance of the alignment between pretext task and downstream tasks, indicating the potential for wider applicability of our method beyond self-supervised settings.

cs.CV↗