Qinsheng Zhang

Qinsheng Zhang

Auto-generated profile, based on publicly available information

Qinsheng Zhang

Georgia Institute of Technology Georgia Institute of Technology

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 May 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
RSRahul Singh
Rahul Singh
IHIsabel Haasler
Isabel Haasler
QZQinsheng Zhang
Qinsheng Zhang
JKJohan Karlsson
Johan Karlsson
YCYongxin Chen
Yongxin Chen
We consider inference (filtering) problems over probabilistic graphical models with aggregate data generated by a large population of individuals. We propose a new efficient belief propagation type algorithm over tree graphs with polynomial computational complexity as well as a global convergence guarantee. This is in contrast to previous methods that either exhibit prohibitive complexity as the population grows or do not guarantee convergence. Our method is based on optimal transport, or more specifically, multimarginal optimal transport theory. In particular, we consider an inference problem with aggregate observations, that can be seen as a structured multimarginal optimal transport problem where the cost function decomposes according to the underlying graph. Consequently, the celebrated Sinkhorn/iterative scaling algorithm for multi-marginal optimal transport can be leveraged together with the standard belief propagation algorithm to establish an efficient inference scheme which we call Sinkhorn belief propagation (SBP). We further specialize the SBP algorithm to cases associated with hidden Markov models due to their significance in control and estimation. We demonstrate the performance of our algorithm on applications such as inferring population flow from aggregate observations. We also show that in the special case where the aggregate observations are in Dirac form, our algorithm naturally reduces to the standard belief propagation algorithm.

1 March 2022 in Automatica
Verified
Journal Article
Closed access
RSRahul Singh
Rahul Singh
QZQinsheng Zhang
Qinsheng Zhang
YCYongxin Chen
Yongxin Chen

23 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
QZQinsheng Zhang
Qinsheng Zhang
MTMolei Tao
Molei Tao
YCYongxin Chen
Yongxin Chen
Our goal is to extend the denoising diffusion implicit model (DDIM) to general diffusion models~(DMs) besides isotropic diffusions. Instead of constructing a non-Markov noising process as in the original DDIM, we examine the mechanism of DDIM from a numerical perspective. We discover that the DDIM can be obtained by using some specific approximations of the score when solving the corresponding stochastic differential equation. We present an interpretation of the accelerating effects of DDIM that also explains the advantages of a deterministic sampling scheme over the stochastic one for fast sampling. Building on this insight, we extend DDIM to general DMs, coined generalized DDIM (gDDIM), with a small but delicate modification in parameterizing the score network. We validate gDDIM in two non-isotropic DMs: Blurring diffusion model (BDM) and Critically-damped Langevin diffusion model (CLD). We observe more than 20 times acceleration in BDM. In the CLD, a diffusion model by augmenting the diffusion process with velocity, our algorithm achieves an FID score of 2.26, on CIFAR10, with only 50 number of score function evaluations~(NFEs) and an FID score of 2.86 with only 27 NFEs. Code is available at https://github.com/qsh-zh/gDDIM

25 July 2024
Verified
Conference Paper
Open access
TLTsung-Yi Lin
Tsung-Yi Lin
CLChen-Hsuan Lin
Chen-Hsuan Lin
YCYin Cui
Yin Cui
YGYunhao Ge
Yunhao Ge
SNSeungjun Nah
Seungjun Nah
MLMing-Yu Liu
Ming-Yu Liu
We introduce GenUSD, an end-to-end text-to-scene generation framework that transforms natural language queries into realistic 3D scenes, including 3D objects and layouts. The process involves two main steps: 1) A Large Language Model (LLM) generates a scene layout hierarchically. It first proposes a high-level plan to decompose the scene into multiple functionally and spatially distinct subscenes. Then, for each subscene, the LLM proposes objects with detailed positions, poses, sizes, and descriptions. To manage complex object relationships and intricate scenes, we introduce object layout design meta functions as tools for the LLM. 2) A novel text-to-3D model generates each 3D object with surface meshes and high-resolution texture maps based on the LLM’s descriptions. The assembled 3D assets form the final 3D scene, represented as a Universal Scene Description (USD) format. GenUSD ensures physical plausibility by incorporating functions to prevent collisions.

27 December 2022 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
BYBo Yuan
Bo Yuan
QZQinsheng Zhang
Qinsheng Zhang
YCYongxin Chen
Yongxin Chen
We study the filtering problem over a Lie group that plays an important role in robotics and aerospace applications. We present a new particle filtering algorithm based on stochastic control. In particular, our algorithm is based on a duality between smoothing and optimal control. Leveraging this duality, we reformulate the smoothing problem into an optimal control problem, and by approximately solving it (using, e.g., iLQR) we establish a superior proposal for particle smoothing. Combining it with a suitably designed sliding window mechanism, we obtain a particle filtering algorithm that suffers less from sample degeneracy compared with existing methods. The efficacy of our algorithm is illustrated by a filtering problem over SO(3) for satellite attitude estimation.

9 March 2022 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
QZQinsheng Zhang
Qinsheng Zhang
RSRahul Singh
Rahul Singh
YCYongxin Chen
Yongxin Chen
We consider a class of inference problems for large populations where each individual is modeled by the same hidden Markov model (HMM). We focus on aggregate inference problems in HMMs with discrete state space and continuous observation space. The continuous observations are aggregated in a way such that the individuals are indistinguishable from measurements. We propose an aggregate inference algorithm called continuous observation collective forward-backward algorithm. It extends the recently proposed collective forward-backward algorithm for aggregate inference in HMMs with discrete observations to the case of continuous observations.