arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 415 records · Page 23Linked to original sources

arXiv2022

Dynamical formation of two-fold fragmented many-body state induced by an impurity in a double-well

We unravel the correlated quantum quench dynamics of a single impurity immersed in a bosonic environment confined in an one-dimensional double-well potential. A particular emphasis is placed on the structure of the time-evolved many-body wave function by relying on a Schmidt decomposition whose coefficients directly quantify the number of configurations that are macroscopically populated. For a non-interacting bosonic bath and weak postquench impurity-bath interactions, we observe the dynamical formation of a two-fold fragmented many-body state which is related to intra-band excitation processes of the impurity and manifests as a two-body phase separation (clustering) between the two species for repulsive (attractive) interactions. Increasing the postquench impurity-bath coupling strength leads to the destruction of the two-fold fragmentation since the impurity undergoes additional inter-band excitation dynamics. By contrast, a weakly interacting bath suppresses excitations of the bath particles and consequently the system attains a weakly fragmented many-body state. Our results explicate the interplay of intra- and inter-band impurity excitations for the dynamical generation of fragmented many-body states in multi-well traps and for designing specific entangled impurity states.

cond-mat.quant-gas↗

arXiv2022

Robust Manifold Nonnegative Tucker Factorization for Tensor Data Representation

Nonnegative Tucker Factorization (NTF) minimizes the euclidean distance or Kullback-Leibler divergence between the original data and its low-rank approximation which often suffers from grossly corruptions or outliers and the neglect of manifold structures of data. In particular, NTF suffers from rotational ambiguity, whose solutions with and without rotation transformations are equally in the sense of yielding the maximum likelihood. In this paper, we propose three Robust Manifold NTF algorithms to handle outliers by incorporating structural knowledge about the outliers. They first applies a half-quadratic optimization algorithm to transform the problem into a general weighted NTF where the weights are influenced by the outliers. Then, we introduce the correntropy induced metric, Huber function and Cauchy function for weights respectively, to handle the outliers. Finally, we introduce a manifold regularization to overcome the rotational ambiguity of NTF. We have compared the proposed method with a number of representative references covering major branches of NTF on a variety of real-world image databases. Experimental results illustrate the effectiveness of the proposed method under two evaluation metrics (accuracy and nmi).

cs.AI↗

arXiv2022

Enhanced Bi-directional Motion Estimation for Video Frame Interpolation

We present a novel simple yet effective algorithm for motion-based video frame interpolation. Existing motion-based interpolation methods typically rely on a pre-trained optical flow model or a U-Net based pyramid network for motion estimation, which either suffer from large model size or limited capacity in handling complex and large motion cases. In this work, by carefully integrating intermediateoriented forward-warping, lightweight feature encoder, and correlation volume into a pyramid recurrent framework, we derive a compact model to simultaneously estimate the bidirectional motion between input frames. It is 15 times smaller in size than PWC-Net, yet enables more reliable and flexible handling of challenging motion cases. Based on estimated bi-directional motion, we forward-warp input frames and their context features to intermediate frame, and employ a synthesis network to estimate the intermediate frame from warped representations. Our method achieves excellent performance on a broad range of video frame interpolation benchmarks. Code and trained models are available at \url{https://github.com/srcn-ivl/EBME}.

cs.CV↗

arXiv2022

Learning Representation for Clustering via Prototype Scattering and Positive Sampling

Existing deep clustering methods rely on either contrastive or non-contrastive representation learning for downstream clustering task. Contrastive-based methods thanks to negative pairs learn uniform representations for clustering, in which negative pairs, however, may inevitably lead to the class collision issue and consequently compromise the clustering performance. Non-contrastive-based methods, on the other hand, avoid class collision issue, but the resulting non-uniform representations may cause the collapse of clustering. To enjoy the strengths of both worlds, this paper presents a novel end-to-end deep clustering method with prototype scattering and positive sampling, termed ProPos. Specifically, we first maximize the distance between prototypical representations, named prototype scattering loss, which improves the uniformity of representations. Second, we align one augmented view of instance with the sampled neighbors of another view -- assumed to be truly positive pair in the embedding space -- to improve the within-cluster compactness, termed positive sampling alignment. The strengths of ProPos are avoidable class collision issue, uniform representations, well-separated clusters, and within-cluster compactness. By optimizing ProPos in an end-to-end expectation-maximization framework, extensive experimental results demonstrate that ProPos achieves competing performance on moderate-scale clustering benchmark datasets and establishes new state-of-the-art performance on large-scale datasets. Source code is available at \url{https://github.com/Hzzone/ProPos}.

cs.CV↗

arXiv2022

SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP

The message-passing mechanism helps Graph Neural Networks (GNNs) achieve remarkable results on various node classification tasks. Nevertheless, the recursive nodes fetching and aggregation in message-passing cause inference latency when deploying GNNs to large-scale graphs. One promising inference acceleration direction is to distill the GNNs into message-passing-free student multi-layer perceptrons (MLPs). However, the MLP student cannot fully learn the structure knowledge due to the lack of structure inputs, which causes inferior performance in the heterophily and inductive scenarios. To address this, we intend to inject structure information into MLP-like students in low-latency and interpretable ways. Specifically, we first design a Structure-Aware MLP (SA-MLP) student that encodes both features and structures without message-passing. Then, we introduce a novel structure-mixing knowledge distillation strategy to enhance the learning ability of MLPs for structure information. Furthermore, we design a latent structure embedding approximation technique with two-stage distillation for inductive scenarios. Extensive experiments on eight benchmark datasets under both transductive and inductive settings show that our SA-MLP can consistently outperform the teacher GNNs, while maintaining faster inference as MLPs. The source code of our work can be found in https://github.com/JC-202/SA-MLP.

cs.LG↗

arXiv2022

Distributed stochastic proximal algorithm with random reshuffling for non-smooth finite-sum optimization

The non-smooth finite-sum minimization is a fundamental problem in machine learning. This paper develops a distributed stochastic proximal-gradient algorithm with random reshuffling to solve the finite-sum minimization over time-varying multi-agent networks. The objective function is a sum of differentiable convex functions and non-smooth regularization. Each agent in the network updates local variables with a constant step-size by local information and cooperates to seek an optimal solution. We prove that local variable estimates generated by the proposed algorithm achieve consensus and are attracted to a neighborhood of the optimal solution in expectation with an $\mathcal{O}(\frac{1}{T}+\frac{1}{\sqrt{T}})$ convergence rate, where $T$ is the total number of iterations. Finally, some comparative simulations are provided to verify the convergence performance of the proposed algorithm.

math.OC↗

arXiv2022

Model-Based and Data-Driven Control of Event- and Self-Triggered Discrete-Time LTI Systems

The present paper considers the model-based and data-driven control of unknown linear time-invariant discrete-time systems under event-triggering and self-triggering transmission schemes. To this end, we begin by presenting a dynamic event-triggering scheme (ETS) based on periodic sampling, and a discrete-time looped-functional approach, through which a model-based stability condition is derived. Combining the model-based condition with a recent data-based system representation, a data-driven stability criterion in the form of linear matrix inequalities (LMIs) is established, which also offers a way of co-designing the ETS matrix and the controller. To further alleviate the sampling burden of ETS due to its continuous/periodic detection, a self-triggering scheme (STS) is developed. Leveraging pre-collected input-state data, an algorithm for predicting the next transmission instant is given, while achieving system stability. Finally, numerical simulations showcase the efficacy of ETS and STS in reducing data transmissions as well as of the proposed co-design methods.

eess.SY↗

arXiv2022

OpenMedIA: Open-Source Medical Image Analysis Toolbox and Benchmark under Heterogeneous AI Computing Platforms

In this paper, we present OpenMedIA, an open-source toolbox library containing a rich set of deep learning methods for medical image analysis under heterogeneous Artificial Intelligence (AI) computing platforms. Various medical image analysis methods, including 2D/3D medical image classification, segmentation, localisation, and detection, have been included in the toolbox with PyTorch and/or MindSpore implementations under heterogeneous NVIDIA and Huawei Ascend computing systems. To our best knowledge, OpenMedIA is the first open-source algorithm library providing compared PyTorch and MindSpore implementations and results on several benchmark datasets. The source codes and models are available at https://git.openi.org.cn/OpenMedIA.

eess.IV↗

arXiv2022

Integration of Physics-Based and Data-Driven Models for Hyperspectral Image Unmixing

Spectral unmixing is one of the most important quantitative analysis tasks in hyperspectral data processing. Conventional physics-based models are characterized by clear interpretation. However they may not be suitable for analyzing scenes with unknown complex physical characteristics. Data-driven methods have developed rapidly in recent years, in particular deep learning methods because they possess superior capability in modeling complex and nonlinear systems. Simply transferring these methods as black-boxes to conduct unmixing may lead to low physical interpretability and generalization ability. This article reviews hyperspectral unmixing works that integrate advantages of both physics-based models and data-driven methods by means of deep neural network structures design, prior design and loss design. Most of these methods derive from a common mathematical optimization framework, and combine good interpretability with high accuracy.

eess.SP↗

arXiv2022

Data-Driven Control of Distributed Event-Triggered Network Systems

The present paper deals with data-driven event-triggered control of a class of unknown discrete-time interconnected systems (a.k.a. network systems). To this end, we start by putting forth a novel distributed event-triggering transmission strategy based on periodic sampling, under which a model-based stability criterion for the closed-loop network system is derived, by leveraging a discrete-time looped-functional approach. Marrying the model-based criterion with a data-driven system representation recently developed in the literature, a purely data-driven stability criterion expressed in the form of linear matrix inequalities (LMIs) is established. Meanwhile, the data-driven stability criterion suggests a means for co-designing the event-triggering coefficient matrix and the feedback control gain matrix using only some offline collected state-input data. Finally, numerical results corroborate the efficacy of the proposed distributed data-driven ETS in cutting off data transmissions and the co-design procedure.

eess.SY↗

arXiv2022

Fluid laminarization in protein-based high internal phase emulsions process

Protein-based high internal phase emulsions (HIPEs) have gained tremendous attention in diverse fields, but their mechanism in the emulsification process remains elusive. In this article, HIPEs were stabilized directly by food-grade proteins, depending on a self-organized process featuring a fluid laminarization. We elucidated that the emulsification with the rotor-stator mixer is a typical non-equilibrium process. The crucial factor for the process is related to the irreversible energy dissipation, while the internal phase volume fraction is the threshold determining the laminarization. The feasible explanation speculated that the transition corresponds to the dissipative structure, i.e., compressive droplets, arising from the spatiotemporal self-organization, to dissipate the turbulent kinetic energy. We found a new paradigm of dissipative structure, comprehending such structure in the HIPEs emulsification process, which is expected to pave the way for its industrial-scale production with the virtue of low-cost proteins.

cond-mat.soft↗

arXiv2022

Neural Optimization Machine: A Neural Network Approach for Optimization

A novel neural network (NN) approach is proposed for constrained optimization. The proposed method uses a specially designed NN architecture and training/optimization procedure called Neural Optimization Machine (NOM). The objective functions for the NOM are approximated with NN models. The optimization process is conducted by the neural network's built-in backpropagation algorithm. The NOM solves optimization problems by extending the architecture of the NN objective function model. This is achieved by appropriately designing the NOM's structure, activation function, and loss function. The NN objective function can have arbitrary architectures and activation functions. The application of the NOM is not limited to specific optimization problems, e.g., linear and quadratic programming. It is shown that the increase of dimension of design variables does not increase the computational cost significantly. Then, the NOM is extended for multiobjective optimization. Finally, the NOM is tested using numerical optimization problems and applied for the optimal design of processing parameters in additive manufacturing.

stat.ML↗

arXiv2022

Distributed Momentum-based Frank-Wolfe Algorithm for Stochastic Optimization

This paper considers distributed stochastic optimization, in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network. Stochastic optimization problems are usually tackled by variants of projected stochastic gradient descent. However, projecting a point onto a feasible set is often expensive. The Frank-Wolfe (FW) method has well-documented merits in handling convex constraints, but existing stochastic FW algorithms are basically developed for centralized settings. In this context, the present work puts forth a distributed stochastic Frank-Wolfe solver, by judiciously combining Nesterov's momentum and gradient tracking techniques for stochastic convex and nonconvex optimization over networks. It is shown that the convergence rate of the proposed algorithm is $\mathcal{O}(k^{-\frac{1}{2}})$ for convex optimization, and $\mathcal{O}(1/\mathrm{log}_2(k))$ for nonconvex optimization. The efficacy of the algorithm is demonstrated by numerical simulations against a number of competing alternatives.

math.OC↗

arXiv2022

Temporal-MPI: Enabling Multi-Plane Images for Dynamic Scene Modelling via Temporal Basis Learning

Novel view synthesis of static scenes has achieved remarkable advancements in producing photo-realistic results. However, key challenges remain for immersive rendering of dynamic scenes. One of the seminal image-based rendering method, the multi-plane image (MPI), produces high novel-view synthesis quality for static scenes. But modelling dynamic contents by MPI is not studied. In this paper, we propose a novel Temporal-MPI representation which is able to encode the rich 3D and dynamic variation information throughout the entire video as compact temporal basis and coefficients jointly learned. Time-instance MPI for rendering can be generated efficiently using mini-seconds by linear combinations of temporal basis and coefficients from Temporal-MPI. Thus novel-views at arbitrary time-instance will be able to be rendered via Temporal-MPI in real-time with high visual quality. Our method is trained and evaluated on Nvidia Dynamic Scene Dataset. We show that our proposed Temporal- MPI is much faster and more compact compared with other state-of-the-art dynamic scene modelling methods.

cs.CV↗

arXiv2022

Event-triggered Consensus Control of Heterogeneous Multi-agent Systems: Model- and Data-based Analysis

This article deals with model- and data-based consensus control of heterogenous leader-following multi-agent systems (MASs) under an event-triggering transmission scheme. A dynamic periodic transmission protocol is developed to significantly alleviate the transmission frequency and computational burden, where the followers can interact locally with each other approaching the dynamics of the leader. Capitalizing on a discrete-time looped-functional, a model-based consensus condition for the closed-loop MASs is derived in form of linear matrix inequalities (LMIs), as well as a design method for obtaining the distributed controllers and event-triggering parameters. Upon collecting noise-corrupted state-input measurements during open-loop operation, a data-driven leader-following MAS representation is presented, and employed to solve the data-driven consensus control problem without requiring any knowledge of the agents' models. This result is then extended to the case of guaranteeing an $\mathcal{H}_{\infty}$ performance. A simulation example is finally given to corroborate the efficacy of the proposed distributed event-triggering scheme in cutting off data transmissions and the data-driven design method.

eess.SY↗

arXiv2022

Instantaneous indirect measurement principle in quantum mechanics

In quantum systems, the measurement of operators and the measurement of the quantum states of the system are very challenging tasks. In this Letter, we propose a method to obtain the average value of one operator in a certain state by measuring the instantaneous change of the average value of another operator with the assistance of a known reference state. We refer to this measurement method as the instantaneous indirect measurement method. By studying the application of this method to some typical models, we find that this measurement can be applied to the measurement of an arbitrary state of a quantum system. Furthermore, for the system to be measured, we find that such measurement neither significantly affects the wave function of the system nor causes wave function collapse of the system. Also, our study shows that when two independent systems are coupled, the information mapping between them is done instantaneously. Finally, we discuss applying this measurement method to the measurement of quantum Fisher information, which quantizes the limited accuracy of estimating a parameter from a quantum state.

quant-ph↗

arXiv2022

Locality Guidance for Improving Vision Transformers on Tiny Datasets

While the Vision Transformer (VT) architecture is becoming trendy in computer vision, pure VT models perform poorly on tiny datasets. To address this issue, this paper proposes the locality guidance for improving the performance of VTs on tiny datasets. We first analyze that the local information, which is of great importance for understanding images, is hard to be learned with limited data due to the high flexibility and intrinsic globality of the self-attention mechanism in VTs. To facilitate local information, we realize the locality guidance for VTs by imitating the features of an already trained convolutional neural network (CNN), inspired by the built-in local-to-global hierarchy of CNN. Under our dual-task learning paradigm, the locality guidance provided by a lightweight CNN trained on low-resolution images is adequate to accelerate the convergence and improve the performance of VTs to a large extent. Therefore, our locality guidance approach is very simple and efficient, and can serve as a basic performance enhancement method for VTs on tiny datasets. Extensive experiments demonstrate that our method can significantly improve VTs when training from scratch on tiny datasets and is compatible with different kinds of VTs and datasets. For example, our proposed method can boost the performance of various VTs on tiny datasets (e.g., 13.07% for DeiT, 8.98% for T2T and 7.85% for PVT), and enhance even stronger baseline PVTv2 by 1.86% to 79.30%, showing the potential of VTs on tiny datasets. The code is available at https://github.com/lkhl/tiny-transformers.

cs.CV↗

arXiv2022

NDF: Neural Deformable Fields for Dynamic Human Modelling

We propose Neural Deformable Fields (NDF), a new representation for dynamic human digitization from a multi-view video. Recent works proposed to represent a dynamic human body with shared canonical neural radiance fields which links to the observation space with deformation fields estimations. However, the learned canonical representation is static and the current design of the deformation fields is not able to represent large movements or detailed geometry changes. In this paper, we propose to learn a neural deformable field wrapped around a fitted parametric body model to represent the dynamic human. The NDF is spatially aligned by the underlying reference surface. A neural network is then learned to map pose to the dynamics of NDF. The proposed NDF representation can synthesize the digitized performer with novel views and novel poses with a detailed and reasonable dynamic appearance. Experiments show that our method significantly outperforms recent human synthesis methods.

cs.CV↗