Searcharxiv⌕ Search

arXiv subjects

Jiawei Wang

Publications and source records attributed to Jiawei Wang.

At least 145 records · Page 8Linked to original sources

Boximator: Generating Rich and Controllable Motions for Video Synthesis

Generating rich and controllable motion is a pivotal challenge in video synthesis. We propose Boximator, a new approach for fine-grained motion control. Boximator introduces two constraint types: hard box and soft box. Users select objects in the conditional frame using hard boxes and then use either type of boxes to roughly or rigorously define the object's position, shape, or motion path in future frames. Boximator functions as a plug-in for existing video diffusion models. Its training process preserves the base model's knowledge by freezing the original weights and training only the control module. To address training challenges, we introduce a novel self-tracking technique that greatly simplifies the learning of box-object correlations. Empirically, Boximator achieves state-of-the-art video quality (FVD) scores, improving on two base models, and further enhanced after incorporating box constraints. Its robust motion controllability is validated by drastic increases in the bounding box alignment metric. Human evaluation also shows that users favor Boximator generation results over the base model.

cs.CV↗

UniVIE: A Unified Label Space Approach to Visual Information Extraction from Form-like Documents

Existing methods for Visual Information Extraction (VIE) from form-like documents typically fragment the process into separate subtasks, such as key information extraction, key-value pair extraction, and choice group extraction. However, these approaches often overlook the hierarchical structure of form documents, including hierarchical key-value pairs and hierarchical choice groups. To address these limitations, we present a new perspective, reframing VIE as a relation prediction problem and unifying labels of different tasks into a single label space. This unified approach allows for the definition of various relation types and effectively tackles hierarchical relationships in form-like documents. In line with this perspective, we present UniVIE, a unified model that addresses the VIE problem comprehensively. UniVIE functions using a coarse-to-fine strategy. It initially generates tree proposals through a tree proposal network, which are subsequently refined into hierarchical trees by a relation decoder module. To enhance the relation prediction capabilities of UniVIE, we incorporate two novel tree constraints into the relation decoder: a tree attention mask and a tree level embedding. Extensive experimental evaluations on both our in-house dataset HierForms and a publicly available dataset SIBR, substantiate that our method achieves state-of-the-art results, underscoring the effectiveness and potential of our unified approach in advancing the field of VIE.

cs.CL↗

Dynamic Relation Transformer for Contextual Text Block Detection

Contextual Text Block Detection (CTBD) is the task of identifying coherent text blocks within the complexity of natural scenes. Previous methodologies have treated CTBD as either a visual relation extraction challenge within computer vision or as a sequence modeling problem from the perspective of natural language processing. We introduce a new framework that frames CTBD as a graph generation problem. This methodology consists of two essential procedures: identifying individual text units as graph nodes and discerning the sequential reading order relationships among these units as graph edges. Leveraging the cutting-edge capabilities of DQ-DETR for node detection, our framework innovates further by integrating a novel mechanism, a Dynamic Relation Transformer (DRFormer), dedicated to edge generation. DRFormer incorporates a dual interactive transformer decoder that deftly manages a dynamic graph structure refinement process. Through this iterative process, the model systematically enhances the graph's fidelity, ultimately resulting in improved precision in detecting contextual text blocks. Comprehensive experimental evaluations conducted on both SCUT-CTW-Context and ReCTS-Context datasets substantiate that our method achieves state-of-the-art results, underscoring the effectiveness and potential of our graph generation framework in advancing the field of CTBD.

cs.CV↗

TypeEvalPy: A Micro-benchmarking Framework for Python Type Inference Tools

In light of the growing interest in type inference research for Python, both researchers and practitioners require a standardized process to assess the performance of various type inference techniques. This paper introduces TypeEvalPy, a comprehensive micro-benchmarking framework for evaluating type inference tools. TypeEvalPy contains 154 code snippets with 845 type annotations across 18 categories that target various Python features. The framework manages the execution of containerized tools, transforms inferred types into a standardized format, and produces meaningful metrics for assessment. Through our analysis, we compare the performance of six type inference tools, highlighting their strengths and limitations. Our findings provide a foundation for further research and optimization in the domain of Python type inference.

cs.SE↗

Multi-Task Multi-Agent Shared Layers are Universal Cognition of Multi-Agent Coordination

Multi-agent reinforcement learning shines as the pinnacle of multi-agent systems, conquering intricate real-world challenges, fostering collaboration and coordination among agents, and unleashing the potential for intelligent decision-making across domains. However, training a multi-agent reinforcement learning network is a formidable endeavor, demanding substantial computational resources to interact with diverse environmental variables, extract state representations, and acquire decision-making knowledge. The recent breakthroughs in large-scale pre-trained models ignite our curiosity: Can we uncover shared knowledge in multi-agent reinforcement learning and leverage pre-trained models to expedite training for future tasks? Addressing this issue, we present an innovative multi-task learning approach that aims to extract and harness common decision-making knowledge, like cooperation and competition, across different tasks. Our approach involves concurrent training of multiple multi-agent tasks, with each task employing independent front-end perception layers while sharing back-end decision-making layers. This effective decoupling of state representation extraction from decision-making allows for more efficient training and better transferability. To evaluate the efficacy of our proposed approach, we conduct comprehensive experiments in two distinct environments: the StarCraft Multi-agent Challenge (SMAC) and the Google Research Football (GRF) environments. The experimental results unequivocally demonstrate the smooth transferability of the shared decision-making network to other tasks, thereby significantly reducing training costs and improving final performance. Furthermore, visualizations authenticate the presence of general multi-agent decision-making knowledge within the shared network layers, further validating the effectiveness of our approach.

cs.MA↗

XuanCe: A Comprehensive and Unified Deep Reinforcement Learning Library

In this paper, we present XuanCe, a comprehensive and unified deep reinforcement learning (DRL) library designed to be compatible with PyTorch, TensorFlow, and MindSpore. XuanCe offers a wide range of functionalities, including over 40 classical DRL and multi-agent DRL algorithms, with the flexibility to easily incorporate new algorithms and environments. It is a versatile DRL library that supports CPU, GPU, and Ascend, and can be executed on various operating systems such as Ubuntu, Windows, MacOS, and EulerOS. Extensive benchmarks conducted on popular environments including MuJoCo, Atari, and StarCraftII multi-agent challenge demonstrate the library's impressive performance. XuanCe is open-source and can be accessed at https://github.com/agi-brain/xuance.git.

cs.LG↗

Smoothing Mixed Traffic with Robust Data-driven Predictive Control for Connected and Autonomous Vehicles

The recently developed DeeP-LCC (Data-EnablEd Predictive Leading Cruise Control) method has shown promising performance for data-driven predictive control of Connected and Autonomous Vehicles (CAVs) in mixed traffic. However, its simplistic zero assumption of the future velocity errors for the head vehicle may pose safety concerns and limit its performance of smoothing traffic flow. In this paper, we propose a robust DeeP-LCC method to control CAVs in mixed traffic with enhanced safety performance. In particular, we first present a robust formulation that enforces a safety constraint for a range of potential velocity error trajectories, and then estimate all potential velocity errors based on the past data from the head vehicle. We also provide efficient computational approaches to solve the robust optimization for online predictive control. Nonlinear traffic simulations show that our robust DeeP-LCC can provide better traffic efficiency and stronger safety performance while requiring less offline data.

math.OC↗

Learning Optimal Robust Control of Connected Vehicles in Mixed Traffic Flow

Connected and automated vehicles (CAVs) technologies promise to attenuate undesired traffic disturbances. However, in mixed traffic where human-driven vehicles (HDVs) also exist, the nonlinear human-driving behavior has brought critical challenges for effective CAV control. This paper employs the policy iteration method to learn the optimal robust controller for nonlinear mixed traffic systems. Precisely, we consider the H_infty control framework and formulate it as a zero-sum game, the equivalent condition for whose solution is converted into a Hamilton-Jacobi inequality with a Hamiltonian constraint. Then, a policy iteration algorithm is designed to generate stabilizing controllers with desired attenuation performance. Based on the updated robust controller, the attenuation level is further optimized in sum of squares program by leveraging the gap of the Hamiltonian constraint. Simulation studies verify that the obtained controller enables the CAVs to dampen traffic perturbations and smooth traffic flow.

eess.SY↗

Feasibility of Local Trajectory Planning for Level-2+ Semi-autonomous Driving without Absolute Localization

Autonomous driving has long grappled with the need for precise absolute localization, making full autonomy elusive and raising the capital entry barriers for startups. This study delves into the feasibility of local trajectory planning for level-2+ (L2+) semi-autonomous vehicles without the dependence on accurate absolute localization. Instead, we emphasize the estimation of the pose change between consecutive planning frames from motion sensors and integration of relative locations of traffic objects to the local planning problem under the ego car's local coordinate system, therefore eliminating the need for an absolute localization. Without the availability of absolute localization for correction, the measurement errors of speed and yaw rate greatly affect the estimation accuracy of the relative pose change between frames. We proved that the feasibility/stability of the continuous planning problem under such motion sensor errors can be guaranteed at certain defined conditions. This was achieved by formulating it as a Lyapunov-stability analysis problem. Moreover, a simulation pipeline was developed to further validate the proposed local planning method. Simulations were conducted at two traffic scenes with different error settings for speed and yaw rate measurements. The results substantiate the proposed framework's functionality even under relatively inferior sensor errors. We also experiment the stability limits of the planned results under abnormally larger motion sensor errors. The results provide a good match to the previous theoretical analysis. Our findings suggested that precise absolute localization may not be the sole path to achieving reliable trajectory planning, eliminating the necessity for high-accuracy dual-antenna GPS as well as the high-fidelity maps for SLAM localization.

cs.RO↗

Information Flow Topology in Mixed Traffic: A Comparative Study between "Looking Ahead" and "Looking Behind"

The emergence of connected and automated vehicles (CAVs) promises smoother traffic flow. In mixed traffic where human-driven vehicles (HDVs) also exist, existing research mostly focuses on "looking ahead" (i.e., the CAVs receive information from preceding vehicles) strategies for CAVs, while recent work reveals that "looking behind" (i.e., the CAVs receive information from their rear vehicles) strategies might provide more possibilities for CAV longitudinal control. This paper presents a comparative study between these two types of information flow topology (IFT) from the string stability perspective, with the role of maximum platoon size (MPS) also under investigation. Precisely, we provide a dynamical modeling framework for the mixed platoon under the multi-predecessor-following (MPF) topology and the multi-successor-leading (MSL) topology. Then, a unified method for string stability analysis is presented, with explicit consideration of both IFT and MPS. Numerical results suggest that MSL ("looking behind") outperforms MPF ("looking ahead" ) in mitigating traffic perturbations. In addition, increasing MPS could further improve string stability of mixed traffic flow.

eess.SY↗

Symmetry induced selective excitation of topological states in SSH waveguide arrays

The investigation of topological state transition in carefully designed photonic lattices is of high interest for fundamental research, as well as for applied studies such as manipulating light flow in on-chip photonic systems. Here, we report on topological phase transition between symmetric topological zero modes (TZM) and antisymmetric TZMs in Su-Schrieffer-Heeger (SSH) mirror symmetric waveguides. The transition of TZMs is realized by adjusting the coupling ratio between neighboring waveguide pairs, which is enabled by selective modulation of the refractive index in the waveguide gaps. Bi-directional topological transitions between symmetric and antisymmetric TZMs can be achieved with our proposed switching strategy. Selective excitation of topological edge mode is demonstrated owing to the symmetry characteristics of the TZMs. The flexible manipulation of topological states is promising for on-chip light flow control and may spark further investigations on symmetric/antisymmetric TZM transitions in other photonic topological frameworks.

physics.optics↗

Triplet paring in neutron matter

The presence of superfluidity in neutron star interiors can affect the cooling of neutron stars in intricate ways, enhancing certain mechanisms and suppressing others. Model calculations employing realistic nuclear potentials in Bardeen-Cooper-Schrieffer theory generally suggest the development of a $^3$P$_2$-$^3$F$_2$ pairing gap, and therefore the presence of superfluidity in dense neutron-star matter.Improved models that go beyond conventional mean-field calculations by including polarization effects suggest a suppression of the triplet gap. We have evaluated the pairing interaction by summing the ``parquet'' Feynman diagrams which include both ladder and ring diagrams systematically, {\em plus\} a set of important non-parquet diagrams, making this the most comprehensive diagram-based approach presently available. Our results suggest a radical suppression of the $^3$P$_2$-$^3$F$_2$ triplet pairing gap and an enhancement of $^3$P$_0$ pairing.

nucl-th↗

X$^2$-VLM: All-In-One Pre-trained Model For Vision-Language Tasks

Vision language pre-training aims to learn alignments between vision and language from a large amount of data. Most existing methods only learn image-text alignments. Some others utilize pre-trained object detectors to leverage vision language alignments at the object level. In this paper, we propose to learn multi-grained vision language alignments by a unified pre-training framework that learns multi-grained aligning and multi-grained localization simultaneously. Based on it, we present X$^2$-VLM, an all-in-one model with a flexible modular architecture, in which we further unify image-text pre-training and video-text pre-training in one model. X$^2$-VLM is able to learn unlimited visual concepts associated with diverse text descriptions. Experiment results show that X$^2$-VLM performs the best on base and large scale for both image-text and video-text tasks, making a good trade-off between performance and model scale. Moreover, we show that the modular design of X$^2$-VLM results in high transferability for it to be utilized in any language or domain. For example, by simply replacing the text encoder with XLM-R, X$^2$-VLM outperforms state-of-the-art multilingual multi-modal pre-trained models without any multilingual pre-training. The code and pre-trained models are available at https://github.com/zengyan-97/X2-VLM.

cs.CV↗

Robust Table Structure Recognition with Dynamic Queries Enhanced Detection Transformer

We present a new table structure recognition (TSR) approach, called TSRFormer, to robustly recognizing the structures of complex tables with geometrical distortions from various table images. Unlike previous methods, we formulate table separation line prediction as a line regression problem instead of an image segmentation problem and propose a new two-stage dynamic queries enhanced DETR based separation line regression approach, named DQ-DETR, to predict separation lines from table images directly. Compared to Vallina DETR, we propose three improvements in DQ-DETR to make the two-stage DETR framework work efficiently and effectively for the separation line prediction task: 1) A new query design, named Dynamic Query, to decouple single line query into separable point queries which could intuitively improve the localization accuracy for regression tasks; 2) A dynamic queries based progressive line regression approach to progressively regressing points on the line which further enhances localization accuracy for distorted tables; 3) A prior-enhanced matching strategy to solve the slow convergence issue of DETR. After separation line prediction, a simple relation network based cell merging module is used to recover spanning cells. With these new techniques, our TSRFormer achieves state-of-the-art performance on several benchmark datasets, including SciTSR, PubTabNet, WTW and FinTabNet. Furthermore, we have validated the robustness and high localization accuracy of our approach to tables with complex structures, borderless cells, large blank spaces, empty or spanning cells as well as distorted or even curved shapes on a more challenging real-world in-house dataset.

cs.CV↗

High-speed 4 ${\times}$ 4 silicon photonic electro-optic switch, operating at the 2 μm waveband

The escalating need for expansive data bandwidth, and the resulting capacity constraints of the single mode fiber (SMF) have positioned the 2-$μ$m waveband as a prospective window for emerging applications in optical communication. This has initiated an ecosystem of silicon photonic components in the region driven by CMOS compatibility, low cost, high efficiency and potential for large-scale integration. In this study, we demonstrate a plasma dispersive, 4 ${\times}$ 4 electro-optic switch operating at the 2-$μ$m waveband with the shortest switching times. The demonstrated switch operates across a 45-nm bandwidth, with 10-90% rise and 90-10% fall time of 1.78 ns and 3.02 ns respectively. In a 4 ${\times}$ 4 implementation, crosstalk below -15 dB and power consumption below 19.15 mW across all 16 ports are indicated. The result brings high-speed optical switching to the portfolio of devices at the promising waveband.

physics.optics↗

Mixture-of-Domain-Adapters: Decoupling and Injecting Domain Knowledge to Pre-trained Language Models Memories

Pre-trained language models (PLMs) demonstrate excellent abilities to understand texts in the generic domain while struggling in a specific domain. Although continued pre-training on a large domain-specific corpus is effective, it is costly to tune all the parameters on the domain. In this paper, we investigate whether we can adapt PLMs both effectively and efficiently by only tuning a few parameters. Specifically, we decouple the feed-forward networks (FFNs) of the Transformer architecture into two parts: the original pre-trained FFNs to maintain the old-domain knowledge and our novel domain-specific adapters to inject domain-specific knowledge in parallel. Then we adopt a mixture-of-adapters gate to fuse the knowledge from different domain adapters dynamically. Our proposed Mixture-of-Domain-Adapters (MixDA) employs a two-stage adapter-tuning strategy that leverages both unlabeled data and labeled data to help the domain adaptation: i) domain-specific adapter on unlabeled data; followed by ii) the task-specific adapter on labeled data. MixDA can be seamlessly plugged into the pretraining-finetuning paradigm and our experiments demonstrate that MixDA achieves superior performance on in-domain tasks (GLUE), out-of-domain tasks (ChemProt, RCT, IMDB, Amazon), and knowledge-intensive tasks (KILT). Further analyses demonstrate the reliability, scalability, and efficiency of our method. The code is available at https://github.com/Amano-Aki/Mixture-of-Domain-Adapters.

cs.CL↗

Integrated optical frequency division for stable microwave and mmWave generation

The generation of ultra-low noise microwave and mmWave in miniaturized, chip-based platforms can transform communication, radar, and sensing systems. Optical frequency division that leverages optical references and optical frequency combs has emerged as a powerful technique to generate microwaves with superior spectral purity than any other approaches. We demonstrate a miniaturized optical frequency division system that can potentially transfer the approach to a CMOS-compatible integrated photonic platform. Phase stability is provided by a large-mode-volume, planar-waveguide-based optical reference coil cavity and is divided down from optical to mmWave frequency by using soliton microcombs generated in a waveguide-coupled microresonator. Besides achieving record-low phase noise for integrated photonic microwave/mmWave oscillators, these devices can be heterogeneously integrated with semiconductor lasers, amplifiers, and photodiodes, holding the potential of large-volume, low-cost manufacturing for fundamental and mass-market applications.

physics.optics↗

Photonic integrated beam delivery in a rubidium 3D magneto-optical trap

Cold atoms are important for precision atomic applications including timekeeping and sensing. The 3D magneto-optical trap (3D-MOT), used to produce cold atoms, will benefit from photonic integration to improve reliability and reduce size, weight, and cost. These traps require the delivery of multiple, large area, collimated laser beams to an atomic vacuum cell. Yet, to date, beam delivery using an integrated waveguide approach has remained elusive. We report the demonstration of a 87Rb 3D-MOT using a fiber-coupled photonic integrated circuit to deliver all beams to cool and trap > 1 x 10^6 atoms to near 200 μK. The silicon nitride photonic circuit transforms fiber-coupled 780 nm cooling and repump light via waveguides to three mm-width non-diverging free-space cooling and repump beams directly to the rubidium cell. This planar, CMOS foundry-compatible integrated beam delivery is compatible with other components, such as lasers and modulators, promising system-on-chip solutions for cold atom applications.

physics.optics↗