arXiv subjects

Jiachen Li

Publications and source records attributed to Jiachen Li.

At least 199 records · Page 11Linked to original sources

arXiv2022

High-Capacity Rechargeable $Li/Cl_2$ Batteries with Graphite Positive Electrodes

Developing new types of high-capacity and high-energy density rechargeable battery is important to future generations of consumer electronics, electric vehicles, and mass energy storage applications. Recently we reported ~ 3.5 V sodium/chlorine $(Na/Cl_2)$ and lithium/chlorine $(Li/Cl_2)$ batteries with up to 1200 mAh $g^{-1}$ reversible capacity, using either a Na or Li metal as the negative electrode, an amorphous carbon nanosphere (aCNS) as the positive electrode, and aluminum chloride $(AlCl_3)$ dissolved in thionyl chloride $(SOCl_2)$ with fluoride-based additives as the electrolyte. The high surface area and large pore volume of aCNS in the positive electrode facilitated NaCl or LiCl deposition and trapping of $Cl_2$ for reversible $NaCl/Cl_2$ or $LiCl/Cl_2$ redox reactions and battery discharge/charge cycling. Here we report an initially low surface area/porosity graphite (DGr) material as the positive electrode in a $Li/Cl_2$ battery, attaining high battery performance after activation in carbon dioxide $(CO_2)$ at 1000 °C (DGr_ac) with the first discharge capacity ~ 1910 mAh $g^{-1}$ and a cycling capacity up to 1200 mAh $g^{-1}$. Ex situ Raman spectroscopy and X-ray diffraction (XRD) revealed the evolution of graphite over battery cycling, including intercalation/de-intercalation and exfoliation that generated sufficient pores for hosting $LiCl/Cl_2$ redox. This work opens up widely available, low-cost graphitic materials for high-capacity alkali metal/$Cl_2$ batteries. Lastly, we employed mass spectrometry to probe the $Cl_2$ trapped in the graphitic positive electrode, shedding light into the $Li/Cl_2$ battery operation.

physics.app-ph↗

arXiv2022

Multireference Density Functional Theory for Describing Ground and Excited States with Renormalized Singles

We applied renormalized singles (RS) in the multireference density functional theory (DFT) to calculate accurate energies of ground and excited states. The multireference DFT approach determines the total energy of the $N$-electron system as the sum of the ($N-2$)-electron energy from a density functional approximation (DFA) and the two-electron addition energies from the particle-particle Tamm-Dancoff approximation (ppTDA), naturally including multireference description. The ppTDA@RS-DFA approach uses the RS Hamiltonian capturing all singles contributions in calculating two-electron addition energies, and its total energy is optimized with the optimized effective potential method. It significantly improves the original ppTDA@DFA. For ground states, ppTDA@RS-DFA properly describes dissociation curves tested and the double bond rotation of ethylene. For excited states, ppTDA@RS-DFA provides accurate excitation energies and largely eliminates the DFA dependence. ppTDA@RS-DFA thus provides an efficient multireference approach to systems with static correlation.

physics.chem-ph↗

arXiv2022

Combining Localized Orbital Scaling Correction and Bethe-Salpeter Equation for Accurate Excitation Energies

We applied localized orbital scaling correction (LOSC) in Bethe-Salpeter equation (BSE) to predict accurate excitation energies for molecules. LOSC systematically eliminates the delocalization error in the density functional approximation and is capable of approximating quasiparticle (QP) energies with accuracy similar or better than the $GW$ Green's function approach and with much less computational cost. The QP energies from LOSC instead of commonly used $G_{0}W_{0}$ and ev$GW$ are directly used in BSE. We show that the BSE/LOSC approach greatly outperforms the commonly used BSE/$G_{0}W_{0}$ approach for predicting excitations with different characters. For the calculations for Truhlar-Gagliardi test set containing valence, charge transfer (CT) and Rydberg excitations, BSE/LOSC with the Tamm-Dancoff approximation provides a comparable accuracy to time-dependent density functional theory (TDDFT) and BSE/ev$GW$. For the calculations of Stein CT test set and Rydberg excitations of atoms, BSE/LOSC considerably outperforms both BSE/$G_{0}W_{0}$ and TDDFT approaches with a reduced starting point dependence. BSE/LOSC is thus a promising and efficient approach to calculate excitation energies for molecular systems.

physics.chem-ph↗

arXiv2022

Symbolic Expression Transformer: A Computer Vision Approach for Symbolic Regression

Symbolic Regression (SR) is a type of regression analysis to automatically find the mathematical expression that best fits the data. Currently, SR still basically relies on various searching strategies so that a sample-specific model is required to be optimized for every expression, which significantly limits the model's generalization and efficiency. Inspired by the fact that human beings can infer a mathematical expression based on the curve of it, we propose Symbolic Expression Transformer (SET), a sample-agnostic model from the perspective of computer vision for SR. Specifically, the collected data is represented as images and an image caption model is employed for translating images to symbolic expressions. A large-scale dataset without overlap between training and testing sets in the image domain is released. Our results demonstrate the effectiveness of SET and suggest the promising direction of image-based model for solving the challenging SR problem.

cs.CV↗

arXiv2022

Benchmark of $\boldsymbol{GW}$ Methods for Core-Level Binding Energies

The $GW$ approximation has recently gained increasing attention as a viable method for the computation of deep core-level binding energies as measured by X-ray photoelectron spectroscopy (XPS). We present a comprehensive benchmark study of different $GW$ methodologies (starting-point optimized, partial and full eigenvalue-self-consistent, Hedin shift and renormalized singles) for molecular inner-shell excitations. We demonstrate that all methods yield a unique solution and apply them to the CORE65 benchmark set and ethyl trifluoroacetate. Three $GW$ schemes clearly outperform the other methods for absolute core-level energies with a mean absolute error of 0.3 eV with respect to experiment. These are partial eigenvalue self-consistency, in which the eigenvalues are only updated in the Green's function, single-shot $GW$ calculations based on an optimized hybrid functional starting point and a Hedin shift in the Green's function. While all methods reproduce the experimental relative binding energies well, the eigenvalue self-consistent schemes and the Hedin shift yield with mean errors $<0.2$ eV the best results.

physics.chem-ph↗

arXiv2022

Escaping the Big Data Paradigm with Compact Transformers

With the rise of Transformers as the standard for language processing, and their advancements in computer vision, there has been a corresponding growth in parameter size and amounts of training data. Many have come to believe that because of this, transformers are not suitable for small sets of data. This trend leads to concerns such as: limited availability of data in certain scientific domains and the exclusion of those with limited resource from research in the field. In this paper, we aim to present an approach for small-scale learning by introducing Compact Transformers. We show for the first time that with the right size, convolutional tokenization, transformers can avoid overfitting and outperform state-of-the-art CNNs on small datasets. Our models are flexible in terms of model size, and can have as little as 0.28M parameters while achieving competitive results. Our best model can reach 98% accuracy when training from scratch on CIFAR-10 with only 3.7M parameters, which is a significant improvement in data-efficiency over previous Transformer based models being over 10x smaller than other transformers and is 15% the size of ResNet50 while achieving similar performance. CCT also outperforms many modern CNN based approaches, and even some recent NAS-based approaches. Additionally, we obtain a new SOTA result on Flowers-102 with 99.76% top-1 accuracy, and improve upon the existing baseline on ImageNet (82.71% accuracy with 29% as many parameters as ViT), as well as NLP tasks. Our simple and compact design for transformers makes them more feasible to study for those with limited computing resources and/or dealing with small datasets, while extending existing research efforts in data efficient transformers. Our code and pre-trained models are publicly available at https://github.com/SHI-Labs/Compact-Transformers.

cs.CV↗

arXiv2022

SeMask: Semantically Masked Transformers for Semantic Segmentation

Finetuning a pretrained backbone in the encoder part of an image transformer network has been the traditional approach for the semantic segmentation task. However, such an approach leaves out the semantic context that an image provides during the encoding stage. This paper argues that incorporating semantic information of the image into pretrained hierarchical transformer-based backbones while finetuning improves the performance considerably. To achieve this, we propose SeMask, a simple and effective framework that incorporates semantic information into the encoder with the help of a semantic attention operation. In addition, we use a lightweight semantic decoder during training to provide supervision to the intermediate semantic prior maps at every stage. Our experiments demonstrate that incorporating semantic priors enhances the performance of the established hierarchical encoders with a slight increase in the number of FLOPs. We provide empirical proof by integrating SeMask into Swin Transformer and Mix Transformer backbones as our encoder paired with different decoders. Our framework achieves a new state-of-the-art of 58.25% mIoU on the ADE20K dataset and improvements of over 3% in the mIoU metric on the Cityscapes dataset. The code and checkpoints are publicly available at https://github.com/Picsart-AI-Research/SeMask-Segmentation .

cs.CV↗

arXiv2022

ConvNeXt-backbone HoVerNet for nuclei segmentation and classification

This manuscript gives a brief description of the algorithm used to participate in CoNIC Challenge 2022. After the baseline was made available, we follow the method in it and replace the ResNet baseline with ConvNeXt one. Moreover, we propose to first convert RGB space to Haematoxylin-Eosin-DAB(HED) space, then use Haematoxylin composition of origin image to smooth semantic one hot label. Afterwards, nuclei distribution of train and valid set are explored to select the best fold split for training model for final test phase submission. Results on validation set shows that even with channel of each stage smaller in number, HoVerNet with ConvNeXt-tiny backbone still improves the mPQ+ by 0.04 and multi r2 by 0.0144

eess.IV↗

arXiv2022

BCOT: A Markerless High-Precision 3D Object Tracking Benchmark

Template-based 3D object tracking still lacks a high-precision benchmark of real scenes due to the difficulty of annotating the accurate 3D poses of real moving video objects without using markers. In this paper, we present a multi-view approach to estimate the accurate 3D poses of real moving objects, and then use binocular data to construct a new benchmark for monocular textureless 3D object tracking. The proposed method requires no markers, and the cameras only need to be synchronous, relatively fixed as cross-view and calibrated. Based on our object-centered model, we jointly optimize the object pose by minimizing shape re-projection constraints in all views, which greatly improves the accuracy compared with the single-view approach, and is even more accurate than the depth-based method. Our new benchmark dataset contains 20 textureless objects, 22 scenes, 404 video sequences and 126K images captured in real scenes. The annotation error is guaranteed to be less than 2mm, according to both theoretical analysis and validation experiments. We re-evaluate the state-of-the-art 3D object tracking methods with our dataset, reporting their performance ranking in real scenes. Our BCOT benchmark and code can be found at https://ar3dv.github.io/BCOT-Benchmark/.

cs.CV↗

arXiv2022

Important Object Identification with Semi-Supervised Learning for Autonomous Driving

Accurate identification of important objects in the scene is a prerequisite for safe and high-quality decision making and motion planning of intelligent agents (e.g., autonomous vehicles) that navigate in complex and dynamic environments. Most existing approaches attempt to employ attention mechanisms to learn importance weights associated with each object indirectly via various tasks (e.g., trajectory prediction), which do not enforce direct supervision on the importance estimation. In contrast, we tackle this task in an explicit way and formulate it as a binary classification ("important" or "unimportant") problem. We propose a novel approach for important object identification in egocentric driving scenarios with relational reasoning on the objects in the scene. Besides, since human annotations are limited and expensive to obtain, we present a semi-supervised learning pipeline to enable the model to learn from unlimited unlabeled data. Moreover, we propose to leverage the auxiliary tasks of ego vehicle behavior prediction to further improve the accuracy of importance estimation. The proposed approach is evaluated on a public egocentric driving dataset (H3D) collected in complex traffic scenarios. A detailed ablative study is conducted to demonstrate the effectiveness of each model component and the training strategy. Our approach also outperforms rule-based baselines by a large margin.

cs.CV↗

arXiv2022

Grouptron: Dynamic Multi-Scale Graph Convolutional Networks for Group-Aware Dense Crowd Trajectory Forecasting

Accurate, long-term forecasting of pedestrian trajectories in highly dynamic and interactive scenes is a long-standing challenge. Recent advances in using data-driven approaches have achieved significant improvements in terms of prediction accuracy. However, the lack of group-aware analysis has limited the performance of forecasting models. This is especially nonnegligible in highly crowded scenes, where pedestrians are moving in groups and the interactions between groups are extremely complex and dynamic. In this paper, we present Grouptron, a multi-scale dynamic forecasting framework that leverages pedestrian group detection and utilizes individual-level, group-level and scene-level information for better understanding and representation of the scenes. Our approach employs spatio-temporal clustering algorithms to identify pedestrian groups, creates spatio-temporal graphs at the individual, group, and scene levels. It then uses graph neural networks to encode dynamics at different scales and aggregate the embeddings for trajectory prediction. We conducted extensive comparisons and ablation experiments to demonstrate the effectiveness of our approach. Our method achieves 9.3% decrease in final displacement error (FDE) compared with state-of-the-art methods on ETH/UCY benchmark datasets, and 16.1% decrease in FDE in more crowded scenes where extensive human group interactions are more frequently present.

cs.CV↗

arXiv2021

SS-MAIL: Self-Supervised Multi-Agent Imitation Learning

The current landscape of multi-agent expert imitation is broadly dominated by two families of algorithms - Behavioral Cloning (BC) and Adversarial Imitation Learning (AIL). BC approaches suffer from compounding errors, as they ignore the sequential decision-making nature of the trajectory generation problem. Furthermore, they cannot effectively model multi-modal behaviors. While AIL methods solve the issue of compounding errors and multi-modal policy training, they are plagued with instability in their training dynamics. In this work, we address this issue by introducing a novel self-supervised loss that encourages the discriminator to approximate a richer reward function. We employ our method to train a graph-based multi-agent actor-critic architecture that learns a centralized policy, conditioned on a learned latent interaction graph. We show that our method (SS-MAIL) outperforms prior state-of-the-art methods on real-world prediction tasks, as well as on custom-designed synthetic experiments. We prove that SS-MAIL is part of the family of AIL methods by providing a theoretical connection to cost-regularized apprenticeship learning. Moreover, we leverage the self-supervised formulation to introduce a novel teacher forcing-based curriculum (Trajectory Forcing) that improves sample efficiency by progressively increasing the length of the generated trajectory. The SS-MAIL framework improves multi-agent imitation capabilities by stabilizing the policy training, improving the reward shaping capabilities, as well as providing the ability for modeling multi-modal trajectories.

cs.AI↗

arXiv2021

Spectral Statistics of Non-Hermitian Matrices and Dissipative Quantum Chaos

We propose a measure, which we call the dissipative spectral form factor (DSFF), to characterize the spectral statistics of non-Hermitian (and non-Unitary) matrices. We show that DSFF successfully diagnoses dissipative quantum chaos, and reveals correlations between real and imaginary parts of the complex eigenvalues up to arbitrary energy (and time) scale. Specifically, we provide the exact solution of DSFF for the GinUE and for a Poissonian random spectrum (Poisson) as minimal models of dissipative quantum chaotic and integrable systems respectively. For dissipative quantum chaotic systems, we show that DSFF exhibits an exact rotational symmetry in its complex time argument $τ$. Analogous to the spectral form factor (SFF) behaviour for GUE, DSFF for GinUE shows a ``dip-ramp-plateau'' behavior in $|τ|$: DSFF initially decreases, increases at intermediate time scales, and saturates after a generalized Heisenberg time which scales as the inverse mean level spacing. Remarkably, for large matrix size, the ``ramp'' of DSFF for GinUE increases quadratically in $|τ|$, in contrast to the linear ramp in SFF for Hermitian ensembles. For dissipative quantum integrable systems, we show that DSFF takes a constant value except for a region in complex time whose size and behavior depends on the eigenvalue density. Numerically, we verify the above claims and show that DSFF for real and quaternion real Ginibre ensembles coincides with the GinUE behaviour except for a region in complex time plane of measure zero in the limit of large matrix size. As a physical example, we consider the quantum kicked top model with dissipation, and show that it falls under the Ginibre universality class and Poisson as the `kick' is switched on or off. Lastly, we study spectral statistics of ensembles of random classical stochastic matrices, and show that these models fall under the Ginibre universality class.

cond-mat.stat-mech↗

arXiv2021

ConvMLP: Hierarchical Convolutional MLPs for Vision

MLP-based architectures, which consist of a sequence of consecutive multi-layer perceptron blocks, have recently been found to reach comparable results to convolutional and transformer-based methods. However, most adopt spatial MLPs which take fixed dimension inputs, therefore making it difficult to apply them to downstream tasks, such as object detection and semantic segmentation. Moreover, single-stage designs further limit performance in other computer vision tasks and fully connected layers bear heavy computation. To tackle these problems, we propose ConvMLP: a hierarchical Convolutional MLP for visual recognition, which is a light-weight, stage-wise, co-design of convolution layers, and MLPs. In particular, ConvMLP-S achieves 76.8% top-1 accuracy on ImageNet-1k with 9M parameters and 2.4G MACs (15% and 19% of MLP-Mixer-B/16, respectively). Experiments on object detection and semantic segmentation further show that visual representation learned by ConvMLP can be seamlessly transferred and achieve competitive results with fewer parameters. Our code and pre-trained models are publicly available at https://github.com/SHI-Labs/Convolutional-MLPs.

cs.CV↗

arXiv2021

LOKI: Long Term and Key Intentions for Trajectory Prediction

Recent advances in trajectory prediction have shown that explicit reasoning about agents' intent is important to accurately forecast their motion. However, the current research activities are not directly applicable to intelligent and safety critical systems. This is mainly because very few public datasets are available, and they only consider pedestrian-specific intents for a short temporal horizon from a restricted egocentric view. To this end, we propose LOKI (LOng term and Key Intentions), a novel large-scale dataset that is designed to tackle joint trajectory and intention prediction for heterogeneous traffic agents (pedestrians and vehicles) in an autonomous driving setting. The LOKI dataset is created to discover several factors that may affect intention, including i) agent's own will, ii) social interactions, iii) environmental constraints, and iv) contextual information. We also propose a model that jointly performs trajectory and intention prediction, showing that recurrently reasoning about intention can assist with trajectory prediction. We show our method outperforms state-of-the-art trajectory prediction methods by upto $27\%$ and also provide a baseline for frame-wise intention estimation.

cs.CV↗

arXiv2021

RAIN: Reinforced Hybrid Attention Inference Network for Motion Forecasting

Motion forecasting plays a significant role in various domains (e.g., autonomous driving, human-robot interaction), which aims to predict future motion sequences given a set of historical observations. However, the observed elements may be of different levels of importance. Some information may be irrelevant or even distracting to the forecasting in certain situations. To address this issue, we propose a generic motion forecasting framework (named RAIN) with dynamic key information selection and ranking based on a hybrid attention mechanism. The general framework is instantiated to handle multi-agent trajectory prediction and human motion forecasting tasks, respectively. In the former task, the model learns to recognize the relations between agents with a graph representation and to determine their relative significance. In the latter task, the model learns to capture the temporal proximity and dependency in long-term human motions. We also propose an effective double-stage training pipeline with an alternating training strategy to optimize the parameters in different modules of the framework. We validate the framework on both synthetic simulations and motion forecasting benchmarks in different domains, demonstrating that our method not only achieves state-of-the-art forecasting performance, but also provides interpretable and reasonable hybrid attention weights.

cs.CV↗

arXiv2021

Orientation-Aware Planning for Parallel Task Execution of Omni-Directional Mobile Robot

Omni-directional mobile robot (OMR) systems have been very popular in academia and industry for their superb maneuverability and flexibility. Yet their potential has not been fully exploited, where the extra degree of freedom in OMR can potentially enable the robot to carry out extra tasks. For instance, gimbals or sensors on robots may suffer from a limited field of view or be constrained by the inherent mechanical design, which will require the chassis to be orientation-aware and respond in time. To solve this problem and further develop the OMR systems, in this paper, we categorize the tasks related to OMR chassis into orientation transition tasks and position transition tasks, where the two tasks can be carried out at the same time. By integrating the parallel task goals in a single planning problem, we proposed an orientation-aware planning architecture for OMR systems to execute the orientation transition and position transition in a unified and efficient way. A modified trajectory optimization method called orientation-aware timed-elastic-band (OATEB) is introduced to generate the trajectory that satisfies the requirements of both tasks. Experiments in both 2D simulated environments and real scenes are carried out. A four-wheeled OMR is deployed to conduct the real scene experiment and the results demonstrate that the proposed method is capable of simultaneously executing parallel tasks and is applicable to real-life scenarios.

cs.RO↗

arXiv2021

Autonomous Driving Strategies at Intersections: Scenarios, State-of-the-Art, and Future Outlooks

Due to the complex and dynamic character of intersection scenarios, the autonomous driving strategy at intersections has been a difficult problem and a hot point in the research of intelligent transportation systems in recent years. This paper gives a brief summary of state-of-the-art autonomous driving strategies at intersections. Firstly, we enumerate and analyze common types of intersection scenarios, corresponding simulation platforms, as well as related datasets. Secondly, by reviewing previous studies, we have summarized characteristics of existing autonomous driving strategies and classified them into several categories. Finally, we point out problems of the existing autonomous driving strategies and put forward several valuable research outlooks.

cs.RO↗